DenseHashSet

A set implemented via a hash that very few empty slots.

Constructors

this
this(size_t expected_max_items_in_table, HashFcn hashFcn, EqualKey equalKey)

Basic constructor.

this
this(InputIterator f, InputIterator l, Value empty_key_val, size_t expected_max_items_in_table, HashFcn hashFcn, EqualKey equalKey)

A constructor based on interators which provide the values to add to the set. With a DenseHashSet, the key and value types used for the DenseHashTable are the same.

Alias This

rep

Members

Aliases

HashTable
alias HashTable = DenseHashTable!(Value, Value, HashFcn, Value function(in Value), void function(ref Value, Value), EqualKey)

The actual data.

Iterator
alias Iterator = HashTable.Iterator
Undocumented in source.
KeyType
alias KeyType = HashTable.KeyType
Undocumented in source.
ValueType
alias ValueType = HashTable.ValueType
Undocumented in source.

Functions

loadFactor
float loadFactor()

These are tr1 methods. bucket() is the bucket the key is or would be in.

maxLoadFactor
float maxLoadFactor()
Undocumented in source. Be warned that the author may not have intended to support it.
maxLoadFactor
void maxLoadFactor(float new_grow)
Undocumented in source. Be warned that the author may not have intended to support it.
minLoadFactor
float minLoadFactor()

These aren't tr1 methods but perhaps ought to be.

minLoadFactor
void minLoadFactor(float new_shrink)
Undocumented in source. Be warned that the author may not have intended to support it.
opEquals
bool opEquals(Object o)

Comparison functions.

Static functions

identity
Value identity(Value v)

Apparently identity is not stl-standard, so we define our own

setKey
void setKey(Value value, Value key)

Key and Value are the same type in a DenseHashSet.

Variables

rep
HashTable rep;
Undocumented in source.

Meta