lp-hash-table
lp-hash-table aims to provide fastest hash tables for large data set and object keys or values. It is reported faster than SBCL builtin hash-table (as of SBCL 2.6.3).

lp-hash-table is designed to minimize cache miss in both mutator (by using linear probing without tombstone) and GC (by preserving insertion order in the boxed key-value vector). It supports inline hash table accessor, inline hash and test functions, and provides some performance tuning parameters.


data structure