Module differential_dataflow::trace::implementations::rhh
source · Expand description
Batch implementation based on Robin Hood Hashing.
Items are ordered by (hash(Key), Key)
rather than Key
, which means
that these implementations should only be used with each other, under
the same hash
function, or for types that also order by (hash(X), X)
,
for example wrapped types that implement Ord
that way.
Structs§
- A hash-ordered wrapper that modifies
Ord
andPartialOrd
.
Traits§
- A carrier trait indicating that the type’s
Ord
andPartialOrd
implementations are byHashable::hashed()
.
Type Aliases§
- A trace implementation backed by columnar storage.
- A trace implementation using a spine of ordered lists.