Iterator of TreeSet
Reverse iterator of TreeSet
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.
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.
Get iterator to element.
Key to search for.
An iterator to the element, if the specified key is found, otherwise this.end().
Test whether a key exists.
Key to search for.
Whether the specified key exists.
Insert an element.
Key to insert.
Pair of an iterator to the newly inserted element and true, if the specified key doesn't exist, otherwise Pair of iterator to ordinary element and false.
Insert an element with hint.
Hint for the position where the element can be inserted.
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.
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.
Insert items at the end.
Items to insert.
Number of elements in the container after insertion.
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 Set based on Tree.
Jeongho Nam - https://github.com/samchon