std.d.lexer requirements
Walter Bright
newshound2 at digitalmars.com
Tue Aug 7 02:46:04 PDT 2012
On 8/6/2012 5:14 PM, Jason House wrote:
> The following is an incredibly fast multithreaded hash table. It is both
> lock-free and fence-free. Would something like that solve your problem?
>
> http://www.azulsystems.com/events/javaone_2007/2007_LockFreeHash.pdf
>
It might if I understood it! There do seem to be some cases where fences are
required. This would take considerable study.
More information about the Digitalmars-d
mailing list