An index backed by a BTree (from the sorted-btree package).
BTree
sorted-btree
Stores the elements in a sorted order, and allows efficient queries for equality, range and max/min.
Memory footprint: O(n * log(n))
O(n * log(n))
Protected
Private
Readonly
Complexity: O(1)
O(1)
Complexity: O(log(n))
O(log(n))
Returns all items that has the maximum value.
Complexity: O(log(n) + m) where m is the number of items fetched
O(log(n) + m)
m
Returns all items that has the minimum value.
Returns at most limit items that is between minValue and maxValue (inclusive).
limit
minValue
maxValue
Complexity: O(log(n) + limit)
O(log(n) + limit)
Optional
Static
Generated using TypeDoc
An index backed by a
BTree(from thesorted-btreepackage).Stores the elements in a sorted order, and allows efficient queries for equality, range and max/min.
Memory footprint:
O(n * log(n))