Abstract
Protected
constructorWhether to enable iterator indexing function.
Abstract
[iterator]Abstract
backAbstract
beginIterator pointing to the beginning element.
Abstract
endIterator pointing to the super end like c++.
Removes element by iterator and move iter
to next.
container.eraseElementByIterator(container.begin());
The iterator you want to erase.
Abstract
findAn iterator pointing to the element if found, or super end if not found.
The element you want to find.
Abstract
forIterate over all elements in the container.
Callback function like Array.forEach.
Abstract
frontAbstract
getAbstract
lowerAn iterator to the first element not less than the given _key.
The given _key you want to compare.
Abstract
rIterator pointing to the end element.
Abstract
rIterator pointing to the super begin like c++.
Abstract
reverseAn iterator to the first element not greater than the given _key.
The given _key you want to compare.
Abstract
reverseAn iterator to the first element less than the given _key.
The given _key you want to compare.
Abstract
unionUnion the other tree to self.
The other tree container you want to merge.
Update node's _key by iterator.
Boolean about if the modification is successful.
The iterator you want to change.
The _key you want to update.
Abstract
upperAn iterator to the first element greater than the given _key.
The given _key you want to compare.
Generated using TypeDoc
The compare function.