A simple hash set implementation using the build-in AA.
Creates a new hash set.
Creates a new hash set from a sequence of elements.
Adds a value to the hash set.
Checks whether the hash set contains the given value.
Operator overload for accessing the set like an array. This calls "bool has(T value);"
See Implementation
A simple hash set implementation using the build-in AA.