Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/container/set"

From cppreference.com
< cpp‎ | container
(Undo revision 45697 by 79.205.247.201 (talk) See the table 101 (associative container requirements) in p. 741-742 of the C++11 standard.)
(+ ref to set_intersection)
Line 77: Line 77:
 
{{dcl list template | cpp/container/dcl list operator_cmp | set}}
 
{{dcl list template | cpp/container/dcl list operator_cmp | set}}
 
{{dcl list template | cpp/container/dcl list swap2 | set}}
 
{{dcl list template | cpp/container/dcl list swap2 | set}}
 +
{{dcl list template | cpp/algorithm/dcl list set_intersection}}
 
{{dcl list end}}
 
{{dcl list end}}
  

Revision as of 03:01, 26 April 2013

 
C++
 
Containers library
 
std::set
Member functions
Non-member functions
(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)
Deduction guides(C++17)
 
Defined in header <set>
template<

    class Key,
    class Compare = std::less<Key>,
    class Allocator = std::allocator<Key>

> class set;

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

Template:cpp/container/dcl list key typeTemplate:cpp/container/dcl list value typeTemplate:cpp/container/dcl list size typeTemplate:cpp/container/dcl list difference typeTemplate:cpp/container/dcl list key compareTemplate:cpp/container/dcl list value compare2Template:cpp/container/dcl list allocator typeTemplate:cpp/container/dcl list referenceTemplate:cpp/container/dcl list const referenceTemplate:cpp/container/dcl list pointerTemplate:cpp/container/dcl list const pointerTemplate:cpp/container/dcl list iteratorTemplate:cpp/container/dcl list const iteratorTemplate:cpp/container/dcl list reverse iteratorTemplate:cpp/container/dcl list const reverse iterator
Member type Definition


Member functions

Template:cpp/container/dcl list constructorTemplate:cpp/container/dcl list destructorTemplate:cpp/container/dcl list operator=Template:cpp/container/dcl list get allocatorTemplate:cpp/container/dcl list beginTemplate:cpp/container/dcl list endTemplate:cpp/container/dcl list rbeginTemplate:cpp/container/dcl list rendTemplate:cpp/container/dcl list emptyTemplate:cpp/container/dcl list sizeTemplate:cpp/container/dcl list max sizeTemplate:cpp/container/dcl list clearTemplate:cpp/container/dcl list insertTemplate:cpp/container/dcl list emplaceTemplate:cpp/container/dcl list emplace hintTemplate:cpp/container/dcl list eraseTemplate:cpp/container/dcl list swapTemplate:cpp/container/dcl list countTemplate:cpp/container/dcl list findTemplate:cpp/container/dcl list equal rangeTemplate:cpp/container/dcl list lower boundTemplate:cpp/container/dcl list upper boundTemplate:cpp/container/dcl list key compTemplate:cpp/container/dcl list value comp
Iterators
Capacity
Modifiers
Lookup
Observers

Non-member functions

Template:cpp/container/dcl list operator cmpTemplate:cpp/container/dcl list swap2Template:cpp/algorithm/dcl list set intersection
Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/set&oldid=47156"