Set

A set of unique values.

Set()

Initializes an empty set

Set<Key> take()

Moves the set out, leaving an empty set in its place.

void insert(Key key)

Inserts an element into the set. If the element exists already, nothing is done.

bool remove(Key& key)

Removes an element from the set, returning true if it was there.

void clear()

Removes all elements from the set.

void reserve(int minimumCapacity)

Ensures that the bucket count is at least the given number.

Key sum()

Returns the sum of the elements, or zero if there are none.

bool all<Pred: bool(Key&)>(Pred predicate)

Returns true if all elements satisfy the predicate.

bool all<T: Copyable, Pred: bool(T)>(Pred predicate)

Returns true if all elements satisfy the predicate.

bool any<Pred: bool(Key&)>(Pred predicate)

Returns true if any element satisfies the predicate.

bool any<T: Copyable, Pred: bool(T)>(Pred predicate)

Returns true if any element satisfies the predicate.

bool none<Pred: bool(Key&)>(Pred predicate)

Returns true if no element satisfies the predicate.

bool none<T: Copyable, Pred: bool(T)>(Pred predicate)

Returns true if no element satisfies the predicate.

bool contains(Key& key)

Checks if e is part of the set.

int size()

Returns the number of elements.

bool empty()

Returns true if the set has no elements.

SetIterator<Key> iterator()

Returns an iterator over the elements.

Iterates over the elements of a set.

SetIterator(Set<Element>& set)

Initializes an iterator over the given set.

bool hasValue()

Returns true if there are more elements.

Element& value()

Returns the current element.

void increment()

Advances to the next element.

Element sum()

Returns the sum of the remaining elements, or zero if there are none.