Re: [infinispan-dev] What's behind the data containers: implementing a performant, thread-safe ordered data container

Interesting read. It's a concurrent hash-map of sorts, but one that can be efficiently traversed by insertion order? One thing that was a bit confusing, is when you seemingly mention segment locking in the context of a lock-free data structure. Perhaps reads are lock-free but writes are protected by a striped locking scheme? Anyways, it's nice to witness this attension to concurrent performance and to read about an interesting datastructure :) On Tue, May 12, 2009 at 5:15 PM, Manik Surtani <manik(a)jboss.org&gt; wrote: -- Venlig hilsen / Kind regards, Christian Vest Hansen.