ocean ~master (2021-10-22T21:44:26.740458)
Dub
Repo
SortedMap.this
ocean
util
container
SortedMap
SortedMap
Make an empty tree, using given Comparator for ordering
class
SortedMap
(K, V, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
this
(
Comparator
c
= null
)
Meta
Source
See Implementation
ocean
util
container
SortedMap
SortedMap
aliases
Type
constructors
this
destructors
~this
functions
add
cache
check
clear
comparator
contains
containsKey
containsPair
dup
firstKey
get
isEmpty
iterator
keyOf
lastKey
nearbyKey
opApply
opBinaryRight
opIndex
opIndexAssign
remove
removeKey
replace
replacePair
reset
size
take
toArray
variables
tree
Make an empty tree, using given Comparator for ordering