Structs§
- Represents the outcome of an operation applied in the
TreapMap::update
function. - Represents a dummy version of
ConsolidatableWeight
. - A node in a treap-map data structure.
- A treap map data structure.
Enums§
- Represents the possible directions in a binary tree search based on key comparisons.
- Represents the directions for the search in
accumulate_weight_search
. - Represents the possible outcomes of the
accumulate_weight_search
.
Traits§
- The weight type in a Treap. It is used to perform operations like calculating sums or maximum values of an interval in logrithmic time over treap.
- Searching in
Treap
requires sort key. This trait manages the relationship among sort keys, search keys and values in a Treap. This is necessary when the sort key is not directly derivable from the search key or is not a null element. - If
TreapMap
is indexed in the same key as the inside treap, it can be configed in a simple way. TreapMap
is a struct which implements a treap which can be indexed by a different key (typeSearchKey
). The associate typeSortKey
andSearchKey
defines how to order node in treap collaborately.
Functions§
- Performs a binary search in a treap-map.