Module im::hashset[][src]

An unordered set.

An immutable hash set using hash array mapped tries.

Most operations on this set are O(logx n) for a suitably high x that it should be nearly O(1) for most sets. Because of this, it's a great choice for a generic set as long as you don't mind that values will need to implement Hash and Eq.

Values will have a predictable order based on the hasher being used. Unless otherwise specified, all sets will use the default RandomState hasher, which will produce consistent hashes for the duration of its lifetime, but not between restarts of your program.



An unordered set.