[Haskell-cafe] Looking for an efficient tree in STM

[Tomasz Zielonka]

On Wed, Mar 08, 2006 at 01:50:06PM +0200, Einar Karttunen wrote:
> Does anyone have an efficient tree implemented in STM that
> supports concurrent updates in an efficient fashion?

Interesting idea!

> This seems suprisingly hard to implement - a normal binary tree with
> links as TVar is very slow and does not scale very well.

By "normal" you mean unbalanced? Do you think it's slow because it's not
balanced, or because of STM?

Best regards
Tomasz

-- 
I am searching for programmers who are good at least in
(Haskell || ML) && (Linux || FreeBSD || math)
for work in Warsaw, Poland