std::set

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

(1)

​

namespace pmr { template <class Key, class Compare = std::less<Key>> using set = std::set<Key, Compare, std::pmr::polymorphic_allocator<Key>>; }

(2)

(since C++17)

key_type

Key

value_type

Key

size_type

Unsigned integer type (usually std::size_t)

difference_type

Signed integer type (usually std::ptrdiff_t)

key_compare

Compare

value_compare

Compare

allocator_type

Allocator

reference

Allocator::reference (until C++11) value_type& (since C++11)

Allocator::reference

(until C++11)

value_type&

(since C++11)

Allocator::reference

(until C++11)

value_type&

(since C++11)

const_reference

Allocator::const_reference (until C++11) const value_type& (since C++11)

Allocator::const_reference

(until C++11)

const value_type&

(since C++11)

Allocator::const_reference

(until C++11)

const value_type&

(since C++11)

pointer

Allocator::pointer (until C++11) std::allocator_traits<Allocator>::pointer (since C++11)

Allocator::pointer

(until C++11)

std::allocator_traits<Allocator>::pointer

(since C++11)

Allocator::pointer

(until C++11)

std::allocator_traits<Allocator>::pointer

(since C++11)

const_pointer

Allocator::const_pointer (until C++11) std::allocator_traits<Allocator>::const_pointer (since C++11)

Allocator::const_pointer

(until C++11)

std::allocator_traits<Allocator>::const_pointer

(since C++11)

Allocator::const_pointer

(until C++11)

std::allocator_traits<Allocator>::const_pointer

(since C++11)

iterator

BidirectionalIterator (until C++11) Constant BidirectionalIterator (since C++11)

BidirectionalIterator

(until C++11)

Constant BidirectionalIterator

(since C++11)

BidirectionalIterator

(until C++11)

Constant BidirectionalIterator

(since C++11)

const_iterator

Constant bidirectional iterator

reverse_iterator

std::reverse_iterator<iterator>

const_reverse_iterator

std::reverse_iterator<const_iterator>

node_type

a specialization of node handle representing a container node (since C++17)

insert_return_type

type describing the result of inserting a node_type, a specialization of template <class Iterator, class NodeType> struct /*unspecified*/ { Iterator position; bool inserted; NodeType node; }; instantiated with template arguments iterator and node_type. (since C++17)

(destructor)

destructs the set (public member function)

operator=

assigns values to the container (public member function)

get_allocator

returns the associated allocator (public member function)

std::swap(std::set)

specializes the std::swap algorithm (function template)