Welcome to liblfds, a portable, license-free, lock-free data structure library written in C.

There is no license. You are free to use this software in any way, for any purpose. Go forth and create wealth!

This TreeMap stores a sorted bunch of internal Node objects. Each Node object encapsules a Hashtable & Vector pair which maintain an "insert-ordered" mapping of various values with the same "priority".

New (late July 08) benchmarks show Scala's HashMap is a lot slower than Java Collections Library. The immutable HashMap being slower seems understandable, but a 3-5x slowdown for using mutable HashMap instead of JCL? Ouch!

A well commented implementation of treaps in Scheme

A data structure combining properties of binary trees and heaps.

Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in se