Creates a HashSet from a compatible range.
Returns true if the element exists within the set, false otherwise.
Returns the amount of elements found in the set.
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.
Set operators.
Set operators.
Puts an item into the hash set, then returns the generated hashcode.
Removes an element by match. Returns the hashcode if found, or uint.init if not.
Removes an element by hashcode.
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.