Difference between revisions of "cpp/container/set"
(+note) |
m (Shorten template names. Use {{lc}} where appropriate.) |
||
Line 14: | Line 14: | ||
===Member types=== | ===Member types=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc hitem | Member type | Definition}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list key_type | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list value_type | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list size_type | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list difference_type | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list key_compare | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list value_compare2 | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list allocator_type | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list reference | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list const_reference | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list pointer | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list const_pointer | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list iterator | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list const_iterator | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list reverse_iterator | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list const_reverse_iterator | set}} |
− | {{ | + | {{dsc end}} |
===Member functions=== | ===Member functions=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list constructor | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list destructor | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list operator{{=}} | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list get_allocator | set}} |
− | {{ | + | {{dsc h2 | Iterators}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list begin | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list end | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list rbegin | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list rend | set}} |
− | {{ | + | {{dsc h2 | Capacity}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list empty | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list size | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list max_size | set}} |
− | {{ | + | {{dsc h2 | Modifiers}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list clear | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list insert | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list emplace | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list emplace_hint | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list erase | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap | set}} |
− | {{ | + | {{dsc h2 | Lookup}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list count | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list find | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list equal_range | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list lower_bound | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list upper_bound | set}} |
− | {{ | + | {{dsc h2 | Observers}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list key_comp | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list value_comp | set}} |
− | {{ | + | {{dsc end}} |
===Non-member functions=== | ===Non-member functions=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list operator_cmp | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | set}} |
− | {{ | + | {{dsc end}} |
===Notes=== | ===Notes=== |
Revision as of 18:40, 31 May 2013
Defined in header <set>
|
||
template< class Key, |
||
std::set
is an associative container that contains a sorted set of unique objects of type Key. Sorting is done using the key comparison function Compare. Search, removal, and insertion operations have logarithmic complexity. Sets are usually implemented as red-black trees.
std::set
meets the requirements of Template:concept, Template:concept, Template:concept and Template:concept.
Contents |
Member types
Member functions
Non-member functions
Notes
The member types iterator
and const_iterator
may be aliases to the same type. This means defining a pair of function overloads using the two types as parameter types may violate the One Definition Rule. Since iterator
is convertible to const_iterator
, a single function with a const_iterator
as parameter type will work instead.