A Lock-Free Hash Table (google video)

[David B. Held]

Sean Kelly wrote:
> David B. Held wrote:
>> Craig Black wrote:
>>> Good stuff.  BTW, does anyone know when is D going to start using 
>>> lock free
>>> algorithms with their built-in/templated containers?
>>
>> When STM is implemented. ;)  And I hope I'm not giving away too much 
>> by saying that some reasonably smart folks are working on it even as 
>> we speak...
> 
> Will this require the user to expose a .clone() method for classes 
> involved in transactions?

I don't want to overpromise and underdeliver, so I will start out with 
the disclaimer that nothing I say about D features is guaranteed to be 
implemented. ;)  That being said, word-based STM is the most generic 
form, and requires no special work on the part of any user whatsoever. 
The first form of STM provided may or may not be word-based. ;) 
However, Walter and his "STM advisors" are aware of the other forms of 
STM, including object-based, and there is a possibility of having 
user-specifiable STM implementations.  I think everyone realizes that 
concurrency is the hot new buzzword, and you can rest assured that D 
will take it very, very seriously.

Dave