Class DenseHashSet

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

class DenseHashSet(Value, HashFcn, EqualKey) ;

Constructors

NameDescription
this (expected_max_items_in_table, hashFcn, equalKey) Basic constructor.
this (f, l, empty_key_val, expected_max_items_in_table, hashFcn, 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.

Methods

NameDescription
identity (v) Apparently identity is not stl-standard, so we define our own
loadFactor () These are tr1 methods. bucket() is the bucket the key is or would be in.
minLoadFactor () These aren't tr1 methods but perhaps ought to be.
opEquals (o) Comparison functions.
setKey (value, key) Key and Value are the same type in a DenseHashSet.

Aliases

NameDescription
HashTable The actual data.