concurrent-map 5.0.1

a lock-free linearizable B+ tree
Documentation

concurrent-map

Lock-free linearizable map.

  • get, insert, cas, remove, iter, range
  • fully lock-free node splits and merges based on the sled battle-tested implementation. concurrent-map can be though of in some ways as a simplified, in-memory sled that supports high-level types.
  • initially designed for use in sled's next generation object store, marble.