Iterator of UniqueSet
Reverse iterator of UniqueSet
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.
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.
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 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.
Native function for JSON.stringify()
.
An array containing children elements.
Generated using TypeDoc
Unique-key Set based on Hash buckets.
Jeongho Nam - https://github.com/samchon