If you want code, go out to the DDJ archive on UUNET; it has all the source code from the DDJ article from 1996 or so...
-- Terry Mike Silbersack wrote: > > On Thu, 7 Mar 2002, Alfred Perlstein wrote: > > > Do a web search. It's basically a way to have a linked list that > > you can do nearly a binary search on, however it costs several > > additional linkages. It was also the "pool on the roof" trick > > we'd do to the new guy at clickarray. > > Hm, did you guys then invent the "cache-optimized concurrent skip list" > after people got wise? :) > > http://sourceforge.net/projects/skiplist > > I found the original paper on skiplists, I guess I'll give it a read so > that if anyone tries that trick on me I'll know better. :) > > "Have you tried a skiplist?" > "Regular, or cache-optimized concurrent?" > > Mike "Silby" Silbersack > > To Unsubscribe: send mail to [EMAIL PROTECTED] > with "unsubscribe freebsd-hackers" in the body of the message To Unsubscribe: send mail to [EMAIL PROTECTED] with "unsubscribe freebsd-hackers" in the body of the message