Structs§
- A hashmap that also maintains a BTreeMap of keys ordered by a given value This is useful for structures that need fast O(1) lookups, but also need to evict the oldest or least recently used entries The Ordered Store must contain both the keys and values for persistence