This module provides an implementation of B-tree with the parameter B to 6.
B
Methods here can be categorized to map methods and set methods.
newMap
fromIterable
isEmpty
get
containsKey
len
toIterator
toRevIterator
toKeys
toValues
firstKeyValue
lastKeyValue
range
insert
remove
popFirstKeyValue
popLastKeyValue
reduceR
reduceL
newSet
setFromIterable
setToIterator
setToRevIterator
has
first
last
isDisjoint
isSuperset
push
pop
popFirst
popLast
union
difference
intersection
setReduceR
setReduceL
Also most of map methods can be applied to Set<T>.
Set<T>
This module provides an implementation of B-tree with the parameter
Bto 6.Methods
Methods here can be categorized to map methods and set methods.
Map methods
newMapfromIterableisEmptygetcontainsKeylentoIteratortoRevIteratortoKeystoValuesfirstKeyValuelastKeyValuerangeinsertremovepopFirstKeyValuepopLastKeyValuereduceRreduceLSet methods
newSetsetFromIterablesetToIteratorsetToRevIteratorhasfirstlastisDisjointisSupersetpushpoppopFirstpopLastuniondifferenceintersectionsetReduceRsetReduceLAlso most of map methods can be applied to
Set<T>.