HashSet

Implements a hashset, either using collections.treemap or collections.linkedlist as a set for backend. Cannot be accessed directly, instead it can check whether an element is within it or not. Backend's foreach capability is exposed to iterate over hashcodes.

struct HashSet (

alias hashFunc = defaultHash!K

alias less = "a < b"

) {

alias HashType = ReturnType!hashFunc;

alias Backend = TreeMap!(HashType, void, true, less);

this(R range);

HashType put(K key);

bool has(K key);

size_t hasRange(R range);

HashType removeByElem(K key);

HashType removeByElem(HashType key);

alias remove = removeByElem;

HashSet!(K, hashFunc, less) opBinary(R rhs);

HashSet!(K, hashFunc, less) opOpAssign(E value);

HashSet!(K, hashFunc, less) opOpAssign(R range);

}

Constructors

this this(R range): Creates a HashSet from a compatible range.

Members

Aliases

Backend alias Backend = TreeMap!(HashType, void, true, less): Undocumented in source.
HashType alias HashType = ReturnType!hashFunc: Undocumented in source.
remove alias remove = removeByElem: Undocumented in source.

Functions

has bool has(K key): Returns true if the element exists within the set, false otherwise.
hasRange size_t hasRange(R range): Returns the amount of elements found in the set.
opBinary HashSet!(K, hashFunc, less) opBinary(R rhs): Set operators. Enables math operations on sets, like unions and intersections. Could work on ranges in general as long as they implement some basic functions, like iteration.
opOpAssign HashSet!(K, hashFunc, less) opOpAssign(E value): Set operators.
opOpAssign HashSet!(K, hashFunc, less) opOpAssign(R range): Set operators.
put HashType put(K key): Puts an item into the hash set, then returns the generated hashcode.
removeByElem HashType removeByElem(K key): Removes an element by match. Returns the hashcode if found, or uint.init if not.
removeByElem HashType removeByElem(HashType key): Removes an element by hashcode.

HashSet

Constructors

Members

Aliases

Functions

Meta

Source