std::collections::set {Value}

Public

Types

NameDescription
LinkedHashSet
HashSet
Entry
LinkedEntry
HashSetIterator
LinkedHashSetIterator

Functions

NameDescription
set::init_from_values
set::init_with_values
set::tvalues
set::len
set::differenceReturn this set - other, so (A & ~B)
set::has_next
set::next
set::add_allAdd all elements in the slice to the set.
set::remove_all_from
set::tdifference
set::@eachIterate over all the values in the set
set::clearClear all elements from the set while keeping the underlying storage
set::containsCheck if the set contains the given value.
set::removeRemove a single value from the set.
set::reserve
set::remove_all
set::tinit_from_set
set::tsymmetric_difference
set::add_all_from
set::tinit_with_values
set::is_initializedHas this linked hash set been initialized yet?
set::init_from_set
set::iter
set::tinit
set::tinit_from_values
set::freeFree all memory allocated by the hash set.
set::values
set::symmetric_differenceReturn (A ^ B)
set::to_format
set::init
set::tset_union
set::set_unionReturns the union of two sets (A | B)
set::is_subsetCheck if this hash set is a subset of another set.
set::intersectionReturns the intersection of the two sets (A & B)
set::get
set::add
set::tintersection
set::is_emptyCheck if the set is empty

Globals

NameDescription
LINKEDONHEAP
DEFAULT_INITIAL_CAPACITY
SET_HEAP_ALLOCATOR
MAXIMUM_CAPACITY
ONHEAPCopy the ONHEAP allocator to initialize to a set that is heap allocated
DEFAULT_LOAD_FACTOR

Private

Functions

NameDescription
set::put_all_for_create
set::put_for_create
set::rehash
set::free_internal
set::create_entry
set::resize
set::index_for
set::transfer
set::add_entry
set::remove_entry_for_value
set::free_entry