Module musli_zerocopy::swiss

A ZeroCopy Map and Set based on Google’s SwissTable algorithm.

While this results in slower map representation than phf, it is more suitable for large data sets.

This implementation is derived from the hashbrown crate, but has been modified to:

• Write directly into a pre-allocated buffer rather that allocate internally.
• Tolerate unexpected representations. Since a loaded variant of this table can tolerate most byte representations we need to ensure that the table at most errors and don’t end up exhibiting some under-specified behavior like looping forever on lookups.

Modules

• map
  A map which implements a hash-map like interface, where values can be looked up by keys.
• set
  A set which implements a hash-set like interface, where values can be looked up by keys.

Structs

• Map
  A map bound to a Buf through Buf::bind for convenience.
• MapRef
  A stored reference to a map.
• Set
  A set bound to a Buf through Buf::bind for convenience.
• SetRef
  A stored reference to a set.

Functions

• store_map
  Store a SwissTable map into an OwnedBuf.
• store_set
  Store a SwissTable set into an OwnedBuf.