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.

Source

Summary

delete(set, term)

Callback implementation of Set.delete/2

difference(set1, set2)

Callback implementation of Set.difference/2

disjoint?(set1, set2)

Callback implementation of Set.disjoint?/2

empty(arg1)

Callback implementation of Set.empty/1

equal?(set1, set2)

Callback implementation of Set.equal?/2

intersection(set1, set2)

Callback implementation of Set.intersection/2

member?(arg1, term)

Callback implementation of Set.member?/2

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 Set.put/2

reduce(arg1, acc, fun)

Callback implementation of Set.reduce/3

size(arg1)

Callback implementation of Set.size/1

subset?(set1, set2)

Callback implementation of Set.subset?/2

to_list(set)

Callback implementation of Set.to_list/1

union(set1, set2)

Callback implementation of Set.union/2

Functions

delete(set, term)

Callback implementation of Set.delete/2.

Source
difference(set1, set2)

Callback implementation of Set.difference/2.

Source
disjoint?(set1, set2)

Callback implementation of Set.disjoint?/2.

Source
empty(arg1)

Callback implementation of Set.empty/1.

Source
equal?(set1, set2)

Callback implementation of Set.equal?/2.

Source
intersection(set1, set2)

Callback implementation of Set.intersection/2.

Source
member?(arg1, term)

Callback implementation of Set.member?/2.

Source
new()

Specs:

Creates a new empty set.

Source
new(enum)

Specs:

Creates a new set from the given enumerable.

Examples

HashSet.new [1, 2]
#=> #HashSet<[1, 2]>
Source
new(enum, transform)

Specs:

Creates a new set from the enumerable with the help of the transformation function.

Examples

HashSet.new [1, 2], &integer_to_binary/1
#=> #HashSet<[1, 2]>
Source
put(arg1, term)

Callback implementation of Set.put/2.

Source
reduce(arg1, acc, fun)

Callback implementation of Set.reduce/3.

Source
size(arg1)

Callback implementation of Set.size/1.

Source
subset?(set1, set2)

Callback implementation of Set.subset?/2.

Source
to_list(set)

Callback implementation of Set.to_list/1.

Source
union(set1, set2)

Callback implementation of Set.union/2.

Source