Elixir v1.0.5 HashSet

A set store.

The HashSet is represented internally as a struct, therefore %HashSet{} can be used whenever there is a need to match on any HashSet. Note though the struct fields are private and must not be accessed directly. Instead, use the functions on this or in the Set module.

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

Types

t()

Functions

delete(set, term)

Callback implementation for Set.delete/2

difference(set1, set2)

Callback implementation for Set.difference/2

disjoint?(set1, set2)

Callback implementation for Set.disjoint?/2

equal?(set1, set2)

Callback implementation for Set.equal?/2

intersection(set1, set2)

Callback implementation for Set.intersection/2

member?(hashset, term)

Callback implementation for Set.member?/2

new()

Creates a new empty set

put(hashset, term)

Callback implementation for Set.put/2

Callback implementation for Set.size/1

subset?(set1, set2)

Callback implementation for Set.subset?/2

Callback implementation for Set.to_list/1

union(set1, set2)

Callback implementation for Set.union/2

Types

Functions

delete(set, term)

Callback implementation for Set.delete/2.

difference(set1, set2)

Callback implementation for Set.difference/2.

disjoint?(set1, set2)

Callback implementation for Set.disjoint?/2.

equal?(set1, set2)

Callback implementation for Set.equal?/2.

intersection(set1, set2)

Callback implementation for Set.intersection/2.

member?(hashset, term)

Callback implementation for Set.member?/2.

new()

Specs

new :: Set.t

Creates a new empty set.

put(hashset, term)

Callback implementation for Set.put/2.

size(hashset)

Callback implementation for Set.size/1.

subset?(set1, set2)

Callback implementation for Set.subset?/2.

to_list(set)

Callback implementation for Set.to_list/1.

union(set1, set2)

Callback implementation for Set.union/2.