std::set::value_compare value_comp() const; Returns the function object that compares the values. It is the same as key_comp. Parameters (none). Return value The value comparison function object. Complexity Constant. See also key_comp returns the function that compares keys (public member function)

iterator upper_bound( const Key& key ); (1) const_iterator upper_bound( const Key& key ) const; (1) template< class K > iterator upper_bound( const K& x ); (2) (since C++14) template< class K > const_iterator upper_bound( const K& x ) const; (2) (since C++14) 1) Returns an iterator pointing to the first element that is greater than key. 2) Returns an iterator pointing to the first element that compares greater to the value x. This overlo

void swap( set& other ); Exchanges the contents of the container with those of other. Does not invoke any move, copy, or swap operations on individual elements. All iterators and references remain valid. The past-the-end iterator is invalidated. The Pred objects must be Swappable, and they are exchanged using unqualified call to non-member swap. If std::allocator_traits<allocator_type>::propagate_on_container_swap::value is true, then the allocators are exchanged using an unq

size_type size() const; Returns the number of elements in the container, i.e. std::distance(begin(), end()). Parameters (none). Return value The number of elements in the container. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. Example The following code uses size to display the number of elements in a std::set<int>: #include <set> #include <iostream> int main() { std::set<int> nums

(1) explicit set( const Compare& comp = Compare(), const Allocator& alloc = Allocator() ); (until C++14) set() : set( Compare() ) {} explicit set( const Compare& comp, const Allocator& alloc = Allocator() ); (since C++14) explicit set( const Allocator& alloc ); (1) (since C++11) (2) template< class InputIt > set( InputIt first, InputIt last, const Compare& comp = Compare(), const Allocator& alloc = Al

reverse_iterator rend(); const_reverse_iterator rend() const; const_reverse_iterator crend() const; (since C++11) Returns a reverse iterator to the element following the last element of the reversed container. It corresponds to the element preceding the first element of the non-reversed container. This element acts as a placeholder, attempting to access it results in undefined behavior. Parameters (none). Return value Reverse iterator to the element following the last

reverse_iterator rbegin(); const_reverse_iterator rbegin() const; const_reverse_iterator crbegin() const; (since C++11) Returns a reverse iterator to the first element of the reversed container. It corresponds to the last element of the non-reversed container. Parameters (none). Return value Reverse iterator to the first element. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. See also rend crend r

size_type max_size() const; Returns the maximum number of elements the container is able to hold due to system or library implementation limitations, i.e. std::distance(begin(), end()) for the largest container. Parameters (none). Return value Maximum number of elements. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. Notes This value is typically equal to std::numeric_limits<size_type>::max(), and reflects the

iterator lower_bound( const Key& key ); (1) const_iterator lower_bound( const Key& key ) const; (1) template< class K > iterator lower_bound(const K& x); (2) (since C++14) template< class K > const_iterator lower_bound(const K& x) const; (2) (since C++14) 1) Returns an iterator pointing to the first element that is not less than key. 2) Returns an iterator pointing to the first element that compares not less to the value x. This overload

key_compare key_comp() const; Returns the function object that compares the keys, which is a copy of this container's constructor argument comp. It is the same as value_comp. Parameters (none). Return value The key comparison function object. Complexity Constant. See also value_comp returns the function that compares keys in objects of type value_type (public member function)