Set

Set: Set, insert, remove, contains, size, empty, iterator

SetIterator: SetIterator, hasValue, value, increment

struct Set<Key: Hashable>

A set of unique values.

Set

Set()

Initializes an empty set

insert

void insert(Key key)

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

remove

void remove(Key& key)

Removes an element from the set, if it exists there.

contains

bool contains(Key& key)

Checks if e is part of the set.

size

int size()

Returns the number of elements.

empty

bool empty()

Returns true if the set has no elements.

iterator

SetIterator<Key> iterator()

Returns an iterator over the elements.

struct SetIterator<Element>: Copyable, Iterator<Element&>

Iterates over the elements of a set.

SetIterator

SetIterator(Set<Element>& set)

Initializes an iterator over the given set.

hasValue

bool hasValue()

Returns true if there are more elements.

value

Element& value()

Returns the current element.

increment

void increment()

Advances to the next element.