Creates a new SortedTree
object.
Optional
iterable: Iterable<[K, V]>Initialize the tree with entries.
Optional
compareFn: Comparer<any>The compare
function to sort keys.
Returns the total key/value pairs in the tree.
Adds a new key
with a null
value.
Returns the Tree object.
Freezes the tree which prevents adding, updating or removing any keys.
Sets the value for the given key
.
Returns the Tree object.
Generated using TypeDoc
A
SortedTree
is a map that holds key value pairs ordered by keys. Any primitive value (and objects that implement Comparable or Ordered interfaces) can be used as keys or values.See
Template
V