Hash table implementation of a Set
Iterator iterator ()
int opApply (scope int delegate(ref V value) dg)
bool add (V element)
bool contains (V element)
bool take (ref V element)
bool remove (V element)
size_t remove (IContainer!(V) e)
bool replace (V oldElement, V newElement)
size_t size ()
bool isEmpty ()
V[] toArray (V[] dst)
HashSet dup ()
HashSet clear ()
HashSet reset ()
size_t buckets ()
void buckets (size_t cap)
float threshold ()
void threshold (float desired)
- this(float f = Container.defaultLoadFactor);
- Construct a HashSet instance
- Iterator iterator();
- Return a generic iterator for contained elements
- int opApply(scope int delegate(ref V value) dg);
- size_t size();
- Return the number of elements contained
- bool add(V element);
- Add a new element to the set. Does not add if there is an
equivalent already present. Returns true where an element
is added, false where it already exists
Time complexity: O(1) average; O(n) worst.
- bool contains(V element);
- Does this set contain the given element?
Time complexity: O(1) average; O(n) worst
- HashSet dup();
- Make an independent copy of the container. Does not clone
elements
Time complexity: O(n)
- size_t remove(V element, bool all);
- Remove the provided element. Returns true if found, false
otherwise
Time complexity: O(1) average; O(n) worst
- bool remove(V element);
- Remove the provided element. Returns true if found, false
otherwise
Time complexity: O(1) average; O(n) worst
- size_t replace(V oldElement, V newElement, bool all);
- Replace the first instance of oldElement with newElement.
Returns true if oldElement was found and replaced, false
otherwise.
- bool replace(V oldElement, V newElement);
- Replace the first instance of oldElement with newElement.
Returns true if oldElement was found and replaced, false
otherwise.
- bool take(ref V element);
- Remove and expose the first element. Returns false when no
more elements are contained
Time complexity: O(n)
- void add(IContainer!V e);
- size_t remove(IContainer!V e);
- HashSet clear();
- Clears the HashMap contents. Various attributes are
retained, such as the internal table itself. Invoke
reset() to drop everything.
Time complexity: O(n)
- HashSet reset();
- Reset the HashSet contents and optionally configure a new
heap manager. This releases more memory than clear() does
Time complexity: O(1)
- size_t buckets();
- Return the number of buckets
Time complexity: O(1)
- HashSet buckets(size_t cap);
- Set the number of buckets and resize as required
Time complexity: O(n)
- float threshold();
- Return the resize threshold
Time complexity: O(1)
- void threshold(float desired);
- Set the resize threshold, and resize as required
Time complexity: O(n)
- HashSet cache(size_t chunk, size_t count = 0);
- Configure the assigned allocator with the size of each
allocation block (number of nodes allocated at one time)
and the number of nodes to pre-populate the cache with.
Time complexity: O(n)
- V[] toArray(V[] dst = null);
- Copy and return the contained set of values in an array,
using the optional dst as a recipient (which is resized
as necessary).
Returns a slice of dst representing the container values.
Time complexity: O(n)
- bool isEmpty();
- Is this container empty?
Time complexity: O(1)
- HashSet check();
- Sanity check
- Ref allocate();
- Allocate a node instance. This is used as the default allocator
- void checkLoad();
- Check to see if we are past load factor threshold. If so,
resize so that we are at half of the desired threshold.
- void resize(size_t newCap);
- resize table to new capacity, rehashing all elements
- bool remove(Ref node, size_t row);
- Remove the indicated node. We need to traverse buckets
for this, since we're singly-linked only. Better to save
the per-node memory than to gain a little on each remove
Used by iterators only
- HashSet clear(bool all);
- Clears the HashSet contents. Various attributes are
retained, such as the internal table itself. Invoke
reset() to drop everything.
Time complexity: O(n)
- void increment();
- new element was added
- void decrement(Ref p);
- element was removed
- void mutate();
- set was changed
- struct Iterator;
- Iterator with no filtering
- bool valid();
- Did the container change underneath us?
- bool next(ref V v);
- Accesses the next value, and returns false when
there are no further values to traverse
- V* next();
- Return a pointer to the next value, or null when
there are no further values to traverse
- int opApply(scope int delegate(ref V value) dg);
- Foreach support
- bool remove();
- Remove value at the current iterator location