Iterator of TreeMap
Reverse iterator of TreeMap
Default Constructor.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Note that, because equality is predicated by !comp(x, y) && !comp(y, x), the function must not cover the equality like <= or >=. It must exclude the equality like < or >. Default is less.
Initializer Constructor.
Items to assign.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Note that, because equality is predicated by !comp(x, y) && !comp(y, x), the function must not cover the equality like <= or >=. It must exclude the equality like < or >. Default is less.
Copy Constructor.
Object to copy.
Range Constructor.
Input iterator of the first position.
Input iterator of the last position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Note that, because equality is predicated by !comp(x, y) && !comp(y, x), the function must not cover the equality like <= or >=. It must exclude the equality like < or >. Default is less.
Range Assigner.
Input iteartor of the first position.
Input iterator of the last position.
Count elements with a specified key.
Key to search for.
Number of elements with the specified key.
Get range of equal elements.
Key to search for.
Pair of lower_bound and upper_bound.
Extract an element by key.
Key to search for.
The extracted element.
Extract an element by iterator.
The iterator to the element for extraction.
Iterator following the pos, strained by the extraction.
Get iterator to element.
Key to search for.
An iterator to the element, if the specified key is found, otherwise this.end().
Get a value.
Key to search for.
The value mapped by the key.
Test whether a key exists.
Key to search for.
Whether the specified key exists.
Insert an element.
A tuple to be referenced for the insert.
Pair of an iterator to the newly inserted element and true, if the specified key doesn't exist, otherwise Pair of iterator to the ordinary element and false.
Insert an element with hint.
Hint for the position where the element can be inserted.
A tuple to be referenced for the insert.
An iterator to the newly inserted element, if the specified key doesn't exist, otherwise an iterator to the ordinary element.
Insert range elements.
Input iterator of the first position.
Input iteartor of the last position.
Insert or assign an element.
Key to be mapped or search for.
Value to insert or assign.
Pair of an iterator to the newly inserted element and true, if the specified key doesn't exist, otherwise Pair of iterator to the ordinary element and false.
Insert or assign an element with hint.
Hint for the position where the element can be inserted.
Key to be mapped or search for.
Value to insert or assign.
An iterator to the newly inserted element, if the specified key doesn't exist, otherwise an iterator to the ordinary element.
Get key comparison function.
The key comparison function.
Get iterator to lower bound.
Key to search for.
Iterator to the first element equal or after to the key.
Set a value with key.
Key to be mapped or search for.
Value to insert or assign.
Native function for JSON.stringify().
An array containing children elements.
Get iterator to upper bound.
Key to search for.
Iterator to the first element after the key.
Get value comparison function.
The value comparison function.
Generated using TypeDoc
Unique-key Map based on Tree.
Jeongho Nam - https://github.com/samchon