Range Assigner.
Input iteartor of the first position.
Input iterator of the last position.
Compute bucket index for the key.
Target key.
Index number.
Get number of buckets.
Get size of a specific bucket.
Specific position.
Size of the specific bucket.
Count elements with a specified key.
Key to search for.
Number of elements with the specified key.
Erase elements with a specified key.
Key to search for.
Number of erased elements.
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.
Get hash function.
The hash function.
Get key equality predicator.
The key equality predicator.
Compute load factor.
this.size() / this.bucket_count()
Get maximum load factor that allowable.
The maximum load factor.
Set maximum load factor.
The new value to change.
Insert items at the end.
Items to insert.
Number of elements in the container after insertion.
Change of bucktes.
The number to change.
Reserve buckets enable to store n elements.
The capacity to reserve.
Swap elements.
Target container to swap.
Native function for JSON.stringify()
.
An array containing children elements.
Generated using TypeDoc
Common interface for hash containers
Jeongho Nam - https://github.com/samchon