Sorry for the slow reply,<br><br><div><span class="gmail_quote">On 3/8/06, <b class="gmail_sendername">Einar Karttunen</b> &lt;<a href="mailto:ekarttun@cs.helsinki.fi">ekarttun@cs.helsinki.fi</a>&gt; wrote:</span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Does anyone have an efficient tree implemented in STM that<br>supports concurrent updates in an efficient fashion? This<br>seems suprisingly hard to implement - a normal binary<br>tree with links as TVar is very slow and does not scale
<br>very well.</blockquote><div><br>I'm just wondering whether it is important for you that all the internal links are TVars. That of course depends on what kind of API you're imagining for your data structure. I would imagine though that a single TVar pointing to the root of your favourite functional tree implementation will be quite sufficient. My guess is it would also be the fastest way of implementing it.
<br><br>Cheers,<br><br>/Josef</div></div>