# 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

## Functions

Callback implementation for `Set.delete/2`

Callback implementation for `Set.difference/2`

Callback implementation for `Set.disjoint?/2`

Callback implementation for `Set.equal?/2`

Callback implementation for `Set.intersection/2`

Callback implementation for `Set.member?/2`

Creates a new empty set

Callback implementation for `Set.put/2`

Callback implementation for `Set.size/1`

Callback implementation for `Set.subset?/2`

Callback implementation for `Set.to_list/1`

Callback implementation for `Set.union/2`

# Types

# Functions

Callback implementation for `Set.delete/2`

.

Callback implementation for `Set.difference/2`

.

Callback implementation for `Set.disjoint?/2`

.

Callback implementation for `Set.equal?/2`

.

Callback implementation for `Set.intersection/2`

.

Callback implementation for `Set.member?/2`

.

Callback implementation for `Set.put/2`

.

Callback implementation for `Set.size/1`

.

Callback implementation for `Set.subset?/2`

.

Callback implementation for `Set.to_list/1`

.

Callback implementation for `Set.union/2`

.