HashSet
A set store.
The HashSet is implemented using tries, which grows in
space as the number of keys grows, working well with both
small and large set of keys. For more information about the
functions and their APIs, please consult the Set module.
Summary
| delete(set, term) | Callback implementation of |
| difference(set1, set2) | Callback implementation of |
| disjoint?(set1, set2) | Callback implementation of |
| empty(arg1) | Callback implementation of |
| equal?(set1, set2) | Callback implementation of |
| intersection(set1, set2) | Callback implementation of |
| member?(arg1, term) | Callback implementation of |
| new() | Creates a new empty set |
| new(enum) | Creates a new set from the given enumerable |
| new(enum, transform) | Creates a new set from the enumerable with the help of the transformation function |
| put(arg1, term) | Callback implementation of |
| reduce(arg1, acc, fun) | Callback implementation of |
| size(arg1) | Callback implementation of |
| subset?(set1, set2) | Callback implementation of |
| to_list(set) | Callback implementation of |
| union(set1, set2) | Callback implementation of |