A SortedMap 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.
SortedMap
V
Creates a new SortedMap object.
Optional
Initialize the map with entries.
The compare function to sort keys.
compare
Returns the total key/value pairs in the tree.
Adds a new key with a null value, if the key doesn't exist.
key
null
Returns the Map object.
Removes all key/value pairs in the tree.
Returns true if the key exists in the map.
true
true if key is found, otherwise false.
false
Returns true if the key existed in the map and was removed.
true if key was removed, otherwise false.
Check if there are no key/value pairs in the tree.
true if is empty.
Returns a new iterator of all key value pairs ordered by their keys.
Returns the value associated with the key or undefined.
undefined
The key value or undefined.
Returns a new iterator of all ordered keys in the map.
Returns the largest key in the tree.
Returns the smallest key in the tree.
Sets the value for the given key.
Returns a new iterator of all values ordered by their keys.
Generated using TypeDoc
A
SortedMapis 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