Expand description
Implementation of a “bags list”: a semi-sorted list where ordering granularity is dictated by
configurable thresholds that delineate the boundaries of bags. It uses a pattern of composite
data structures, where multiple storage items are masked by one outer API. See
crate::ListNodes
, crate::ListBags
for more information.
The outer API of this module is the List
struct. It wraps all acceptable operations on top
of the aggregate linked list. All operations with the bags list should happen through this
interface.
Structs§
- Bag
- A Bag is a doubly-linked list of ids, where each id is mapped to a
Node
. - List
- The ONLY entry point of this module. All operations to the bags-list should happen through this interface. It is forbidden to access other module members directly.
- Node
- A Node is the fundamental element comprising the doubly-linked list described by
Bag
.
Enums§
Functions§
- notional_
bag_ for - Given a certain score, to which bag does it belong to?