==========C++ Sets==========

set<Key, Compare, Alloc>

The C++ Set is an associative STL container that contains a sorted set of unique
objects of type Key. Sorting is done using the key comparison function Compare (default is set to std::less<Key>).

|[[set_constructors|Constructors]]|default methods to allocate, copy, and deallocate sets|
|[[set_operators|Operators]]|assign and compare sets|
|[[begin]]|returns an iterator to the beginning of the set|
|[[clear]]|removes all elements from the set|
|[[count]]|returns the number of elements matching a certain key|
|[[empty]]|true if the set has no elements|
|[[end]]|returns an iterator just past the last element of a set|
|[[equal_range]]|returns iterators to the first and just past the last elements matching a specific key|
|[[erase]]|removes elements from a set|
|[[find]]|returns an iterator to specific element|
|[[insert]]|insert items into a set|
|[[key_comp]]|returns the function that compares keys|
|[[lower_bound]]|returns an iterator to the first element greater than or equal to a certain value|
|[[max_size]]|returns the maximum number of elements that the set can hold|
|[[rbegin]]|returns a reverse_iterator to the end of the set|
|[[rend]]|returns a reverse_iterator to the beginning of the set|
|[[size]]|returns the number of items in the set|
|[[swap]]|swap the contents of this set with another|
|[[upper_bound]]|returns an iterator to the first element greater than a certain value|
|[[value_comp]]|returns the function that compares values|