Default Constructor.
An unary function returns hash code. Default is {hash}.
A binary function predicates two arguments are equal. Default is equal_to.
Initializer Constructor.
Items to assign.
An unary function returns hash code. Default is {hash}.
A binary function predicates two arguments are equal. Default is equal_to.
Copy Constructor.
Object to copy.
Range Constructor.
Input iterator of the first position.
Input iterator of the last position.
An unary function returns hash code. Default is {hash}.
A binary function predicates two arguments are equal. Default is equal_to.
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.
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.
Get hash function.
The hash function.
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 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.
Change of bucktes.
The number to change.
Reserve buckets enable to store n elements.
The capacity to reserve.
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.
Generated using TypeDoc
Unique-key Map based on Hash buckets.
Jeongho Nam - https://github.com/samchon