| Home | Libraries | People | FAQ | More

## Class template set

boost::container::set

## Synopsis

    // In header: <boost/container/set.hpp>

    template<typename Key, typename Compare = std::less<Key>,
             typename Allocator = new_allocator<Key>, typename Options = void>
    class set {
    public:
      // types
      typedef Key                                                                   key_type;
      typedef Key                                                                   value_type;
      typedef Compare                                                               key_compare;
      typedef key_compare                                                           value_compare;
      typedef base_t::allocator_type                                                allocator_type;
      typedef boost::container::allocator_traits< allocator_type >                  allocator_traits_type;
      typedef boost::container::allocator_traits< allocator_type >::pointer         pointer;
      typedef boost::container::allocator_traits< allocator_type >::const_pointer   const_pointer;
      typedef boost::container::allocator_traits< allocator_type >::reference       reference;
      typedef boost::container::allocator_traits< allocator_type >::const_reference const_reference;
      typedef boost::container::allocator_traits< allocator_type >::size_type       size_type;
      typedef boost::container::allocator_traits< allocator_type >::difference_type difference_type;
      typedef implementation_defined                                                stored_allocator_type;
      typedef implementation_defined                                                iterator;
      typedef implementation_defined                                                const_iterator;
      typedef implementation_defined                                                reverse_iterator;
      typedef implementation_defined                                                const_reverse_iterator;
      typedef implementation_defined                                                node_type;
      typedef implementation_defined                                                insert_return_type;

      // public member functions
      set();
      explicit set(const allocator_type &);
      explicit set(const Compare &);
      set(const Compare &, const allocator_type &);
      template<typename InputIterator> set(InputIterator, InputIterator);
      template<typename InputIterator>
        set(InputIterator, InputIterator, const allocator_type &);
      template<typename InputIterator>
        set(InputIterator, InputIterator, const Compare &);
      template<typename InputIterator>
        set(InputIterator, InputIterator, const Compare &, const allocator_type &);
      template<typename InputIterator>
        set(ordered_unique_range_t, InputIterator, InputIterator);
      template<typename InputIterator>
        set(ordered_unique_range_t, InputIterator, InputIterator, const Compare &);
      template<typename InputIterator>
        set(ordered_unique_range_t, InputIterator, InputIterator, const Compare &,
            const allocator_type &);
      template<typename InputIterator>
        set(ordered_unique_range_t, InputIterator, InputIterator,
            const allocator_type &);
      set(std::initializer_list< value_type >);
      set(std::initializer_list< value_type >, const allocator_type &);
      set(std::initializer_list< value_type >, const Compare &);
      set(std::initializer_list< value_type >, const Compare &,
          const allocator_type &);
      set(ordered_unique_range_t, std::initializer_list< value_type >);
      set(ordered_unique_range_t, std::initializer_list< value_type >,
          const Compare &);
      set(ordered_unique_range_t, std::initializer_list< value_type >,
          const Compare &, const allocator_type &);
      set(const set &);
      set(set &&);
      set(const set &, const allocator_type &);
      set(set &&, const allocator_type &);
      set & operator=(const set &);
      set & operator=(set &&);
      set & operator=(std::initializer_list< value_type >);
      allocator_type get_allocator() const;
      stored_allocator_type & get_stored_allocator();
      const stored_allocator_type & get_stored_allocator() const;
      iterator begin();
      const_iterator begin() const;
      const_iterator cbegin() const;
      iterator end();
      const_iterator end() const;
      const_iterator cend() const;
      reverse_iterator rbegin();
      const_reverse_iterator rbegin() const;
      const_reverse_iterator crbegin() const;
      reverse_iterator rend();
      const_reverse_iterator rend() const;
      const_reverse_iterator crend() const;
      bool empty() const;
      size_type size() const;
      size_type max_size() const;
      template<class... Args> std::pair< iterator, bool > emplace(Args &&...);
      template<class... Args> iterator emplace_hint(const_iterator, Args &&...);
      std::pair< iterator, bool > insert(const value_type &);
      std::pair< iterator, bool > insert(value_type &&);
      template<typename K> std::pair< iterator BOOST_MOVE_I bool > insert(K &&);
      iterator insert(const_iterator, const value_type &);
      iterator insert(const_iterator, value_type &&);
      template<typename K> iterator insert(const_iterator, K &&);
      template<typename InputIterator> void insert(InputIterator, InputIterator);
      void insert(std::initializer_list< value_type >);
      insert_return_type insert(node_type &&);
      insert_return_type insert(const_iterator, node_type &&);
      template<typename C2> void merge(set< Key, C2, Allocator, Options > &);
      template<typename C2> void merge(set< Key, C2, Allocator, Options > &&);
      template<typename C2> void merge(multiset< Key, C2, Allocator, Options > &);
      template<typename C2> void merge(multiset< Key, C2, Allocator, Options > &&);
      size_type erase(const key_type &);
      iterator erase(const_iterator);
      iterator erase(const_iterator, const_iterator);
      template<typename K> size_type erase(K &&);
      node_type extract(const_iterator);
      node_type extract(const key_type &);
      template<typename K> node_type extract(K &&);
      void swap(set &);
      void clear();
      key_compare key_comp() const;
      value_compare value_comp() const;
      iterator find(const key_type &);
      const_iterator find(const key_type &) const;
      template<typename K> iterator find(const K &);
      template<typename K> const_iterator find(const K &) const;
      size_type count(const key_type &) const;
      template<typename K> size_type count(const K &) const;
      bool contains(const key_type &) const;
      template<typename K> bool contains(const K &) const;
      iterator lower_bound(const key_type &);
      const_iterator lower_bound(const key_type &) const;
      template<typename K> iterator lower_bound(const K &);
      template<typename K> const_iterator lower_bound(const K &) const;
      iterator upper_bound(const key_type &);
      const_iterator upper_bound(const key_type &) const;
      template<typename K> iterator upper_bound(const K &);
      template<typename K> const_iterator upper_bound(const K &) const;
      std::pair< iterator, iterator > equal_range(const key_type &);
      std::pair< const_iterator, const_iterator >
      equal_range(const key_type &) const;
      template<typename K> std::pair< iterator, iterator > equal_range(const K &);
      template<typename K>
        std::pair< const_iterator, const_iterator > equal_range(const K &) const;
      void rebalance();

      // friend functions
      bool operator==(const set &, const set &);
      bool operator!=(const set &, const set &);
      bool operator<(const set &, const set &);
      bool operator>(const set &, const set &);
      bool operator<=(const set &, const set &);
      bool operator>=(const set &, const set &);
      void swap(set &, set &);
    };

## Description

A set is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of the keys themselves. Class set supports bidirectional iterators.

A set satisfies all of the requirements of a container and of a reversible container , and of an associative container. A set also provides most operations described in for unique keys.

### Template Parameters

1.     typename Key

   is the type to be inserted in the set, which is also the key_type

2.     typename Compare = std::less<Key>

   is the comparison functor used to order keys

3.     typename Allocator = new_allocator<Key>

   is the allocator to be used to allocate memory for this container

4.     typename Options = void

   is an packed option type generated using using boost::container::tree_assoc_options.

### `set` public member functions

1.     set();

   Effects: Default constructs an empty set.

   Complexity: Constant.

2.     explicit set(const allocator_type & a);

   Effects: Constructs an empty set using the specified allocator object.

   Complexity: Constant.

3.     explicit set(const Compare & comp);

   Effects: Constructs an empty set using the specified comparison object.

   Complexity: Constant.

4.     set(const Compare & comp, const allocator_type & a);

   Effects: Constructs an empty set using the specified comparison object and allocator.

   Complexity: Constant.

5.     template<typename InputIterator> set(InputIterator first, InputIterator last);

   Effects: Constructs an empty set using and inserts elements from the range [first ,last ).

   Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first.

6.     template<typename InputIterator>
         set(InputIterator first, InputIterator last, const allocator_type & a);

   Effects: Constructs an empty set using the specified allocator, and inserts elements from the range [first ,last ).

   Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first.

7.     template<typename InputIterator>
         set(InputIterator first, InputIterator last, const Compare & comp);

   Effects: Constructs an empty set using the specified comparison object and inserts elements from the range [first ,last ).

   Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first.

8.     template<typename InputIterator>
         set(InputIterator first, InputIterator last, const Compare & comp,
             const allocator_type & a);

   Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

   Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first.

9.     template<typename InputIterator>
         set(ordered_unique_range_t, InputIterator first, InputIterator last);

   Effects: Constructs an empty set and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

   Requires: [first ,last) must be ordered according to the predicate and must be unique values.

   Complexity: Linear in N.

   Note: Non-standard extension.

10.     template<typename InputIterator>
          set(ordered_unique_range_t, InputIterator first, InputIterator last,
              const Compare & comp);

    Effects: Constructs an empty set using the specified comparison object and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

    Requires: [first ,last) must be ordered according to the predicate and must be unique values.

    Complexity: Linear in N.

    Note: Non-standard extension.

11.     template<typename InputIterator>
          set(ordered_unique_range_t, InputIterator first, InputIterator last,
              const Compare & comp, const allocator_type & a);

    Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

    Requires: [first ,last) must be ordered according to the predicate and must be unique values.

    Complexity: Linear in N.

    Note: Non-standard extension.

12.     template<typename InputIterator>
          set(ordered_unique_range_t, InputIterator first, InputIterator last,
              const allocator_type & a);

    Effects: Constructs an empty set using the specified allocator and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

    Requires: [first ,last) must be ordered according to the predicate and must be unique values.

    Complexity: Linear in N.

    Note: Non-standard extension.

13.     set(std::initializer_list< value_type > il);

    Effects: Constructs an empty set and inserts elements from the range [il.begin(), il.end()).

    Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().

14.     set(std::initializer_list< value_type > il, const allocator_type & a);

    Effects: Constructs an empty set using the specified allocator, and inserts elements from the range [il.begin(), il.end()).

    Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().

15.     set(std::initializer_list< value_type > il, const Compare & comp);

    Effects: Constructs an empty set using the specified comparison object and inserts elements from the range [il.begin(), il.end()).

    Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().

16.     set(std::initializer_list< value_type > il, const Compare & comp,
            const allocator_type & a);

    Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).

    Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().

17.     set(ordered_unique_range_t, std::initializer_list< value_type > il);

    Effects: Constructs an empty set and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

    Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

    Complexity: Linear in N.

    Note: Non-standard extension.

18.     set(ordered_unique_range_t, std::initializer_list< value_type > il,
            const Compare & comp);

    Effects: Constructs an empty set using the specified comparison object and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

    Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

    Complexity: Linear in N.

    Note: Non-standard extension.

19.     set(ordered_unique_range_t, std::initializer_list< value_type > il,
            const Compare & comp, const allocator_type & a);

    Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

    Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

    Complexity: Linear in N.

    Note: Non-standard extension.

20.     set(const set & x);

    Effects: Copy constructs a set.

    Complexity: Linear in x.size().

21.     set(set && x);

    Effects: Move constructs a set. Constructs *this using x's resources.

    Complexity: Constant.

    Postcondition: x is emptied.

22.     set(const set & x, const allocator_type & a);

    Effects: Copy constructs a set using the specified allocator.

    Complexity: Linear in x.size().

23.     set(set && x, const allocator_type & a);

    Effects: Move constructs a set using the specified allocator. Constructs *this using x's resources.

    Complexity: Constant if a == x.get_allocator(), linear otherwise.

24.     set & operator=(const set & x);

    Effects: Makes *this a copy of x.

    Complexity: Linear in x.size().

25.     set & operator=(set && x);

    Effects: this->swap(x.get()).

    Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

    Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

26.     set & operator=(std::initializer_list< value_type > il);

    Effects: Copy all elements from il to *this.

    Complexity: Linear in il.size().

27.     allocator_type get_allocator() const;

    Effects: Returns a copy of the allocator that was passed to the object's constructor.

    Complexity: Constant.

28.     stored_allocator_type & get_stored_allocator();

    Effects: Returns a reference to the internal allocator.

    Throws: Nothing

    Complexity: Constant.

    Note: Non-standard extension.

29.     const stored_allocator_type & get_stored_allocator() const;

    Effects: Returns a reference to the internal allocator.

    Throws: Nothing

    Complexity: Constant.

    Note: Non-standard extension.

30.     iterator begin();

    Effects: Returns an iterator to the first element contained in the container.

    Throws: Nothing.

    Complexity: Constant

31.     const_iterator begin() const;

    Effects: Returns a const_iterator to the first element contained in the container.

    Throws: Nothing.

    Complexity: Constant.

32.     const_iterator cbegin() const;

    Effects: Returns a const_iterator to the first element contained in the container.

    Throws: Nothing.

    Complexity: Constant.

33.     iterator end();

    Effects: Returns an iterator to the end of the container.

    Throws: Nothing.

    Complexity: Constant.

34.     const_iterator end() const;

    Effects: Returns a const_iterator to the end of the container.

    Throws: Nothing.

    Complexity: Constant.

35.     const_iterator cend() const;

    Effects: Returns a const_iterator to the end of the container.

    Throws: Nothing.

    Complexity: Constant.

36.     reverse_iterator rbegin();

    Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

37.     const_reverse_iterator rbegin() const;

    Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

38.     const_reverse_iterator crbegin() const;

    Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

39.     reverse_iterator rend();

    Effects: Returns a reverse_iterator pointing to the end of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

40.     const_reverse_iterator rend() const;

    Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

41.     const_reverse_iterator crend() const;

    Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

    Throws: Nothing.

    Complexity: Constant.

42.     bool empty() const;

    Effects: Returns true if the container contains no elements.

    Throws: Nothing.

    Complexity: Constant.

43.     size_type size() const;

    Effects: Returns the number of the elements contained in the container.

    Throws: Nothing.

    Complexity: Constant.

44.     size_type max_size() const;

    Effects: Returns the largest possible size of the container.

    Throws: Nothing.

    Complexity: Constant.

45.     template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);

    Effects: Inserts an object x of type Key constructed with std::forward<Args>(args)... if and only if there is no element in the container with equivalent value. and returns the iterator pointing to the newly inserted element.

    Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

    Throws: If memory allocation throws or Key's in-place constructor throws.

    Complexity: Logarithmic.

46.     template<class... Args>
          iterator emplace_hint(const_iterator p, Args &&... args);

    Effects: Inserts an object of type Key constructed with std::forward<Args>(args)... if and only if there is no element in the container with equivalent value. p is a hint pointing to where the insert should start to search.

    Returns: An iterator pointing to the element with key equivalent to the key of x.

    Complexity: Logarithmic.

47.     std::pair< iterator, bool > insert(const value_type & x);

    Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.

    Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

    Complexity: Logarithmic.

48.     std::pair< iterator, bool > insert(value_type && x);

    Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x.

    Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

    Complexity: Logarithmic.

49.     template<typename K> std::pair< iterator BOOST_MOVE_I bool > insert(K && x);

    Requires: This overload is available only if key_compare::is_transparent exists.

    Effects: Forward constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x.

    Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

    Complexity: Logarithmic.

50.     iterator insert(const_iterator p, const value_type & x);

    Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

    Returns: An iterator pointing to the element with key equivalent to the key of x.

    Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

51.     iterator insert(const_iterator p, value_type && x);

    Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.

    Returns: An iterator pointing to the element with key equivalent to the key of x.

    Complexity: Logarithmic.

52.     template<typename K> iterator insert(const_iterator p, K && x);

    Requires: This overload is available only if key_compare::is_transparent exists.

    Requires: This overload is available only if key_compare::is_transparent exists.

    Effects: Inserts an element forward constructed from x in the container. p is a hint pointing to where the insert should start to search.

    Returns: An iterator pointing to the element with key equivalent to the key of x.

    Complexity: Logarithmic.

53.     template<typename InputIterator>
          void insert(InputIterator first, InputIterator last);

    Requires: first, last are not iterators into *this.

    Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element.

    Complexity: At most N log(size()+N) (N is the distance from first to last)

54.     void insert(std::initializer_list< value_type > il);

    Effects: inserts each element from the range [il.begin(),il.end()) if and only if there is no element with key equivalent to the key of that element.

    Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end())

55.     insert_return_type insert(node_type && nh);

    Requires: nh is empty or this->get_allocator() == nh.get_allocator().

    Effects: If nh is empty, has no effect. Otherwise, inserts the element owned by nh if and only if there is no element in the container with a key equivalent to nh.key().

    Returns: If nh is empty, insert_return_type.inserted is false, insert_return_type.position is end(), and insert_return_type.node is empty. Otherwise if the insertion took place, insert_return_type.inserted is true, insert_return_type.position points to the inserted element, and insert_return_type.node is empty; if the insertion failed, insert_return_type.inserted is false, insert_return_type.node has the previous value of nh, and insert_return_type.position points to an element with a key equivalent to nh.key().

    Complexity: Logarithmic

56.     insert_return_type insert(const_iterator hint, node_type && nh);

    Effects: Same as `insert(node_type && nh)` but the element is inserted as close as possible to the position just prior to "hint".

    Complexity: logarithmic in general, but amortized constant if the element is inserted right before "hint".

57.     template<typename C2> void merge(set< Key, C2, Allocator, Options > & source);

    Requires: this->get_allocator() == source.get_allocator().

    Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

    Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

    Throws: Nothing unless the comparison object throws.

    Complexity: N log(size() + N) (N has the value source.size())

58.     template<typename C2> void merge(set< Key, C2, Allocator, Options > && source);

    Requires: this->get_allocator() == source.get_allocator().

    Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

    Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

    Throws: Nothing unless the comparison object throws.

    Complexity: N log(size() + N) (N has the value source.size())

59.     template<typename C2>
          void merge(multiset< Key, C2, Allocator, Options > & source);

    Requires: this->get_allocator() == source.get_allocator().

    Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

    Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

    Throws: Nothing unless the comparison object throws.

    Complexity: N log(size() + N) (N has the value source.size())

60.     template<typename C2>
          void merge(multiset< Key, C2, Allocator, Options > && source);

    Requires: this->get_allocator() == source.get_allocator().

    Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

    Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

    Throws: Nothing unless the comparison object throws.

    Complexity: N log(size() + N) (N has the value source.size())

61.     size_type erase(const key_type & x);

    Effects: If present, erases the elements in the container with key equivalent to x.

    Returns: Returns the number of erased elements.

    Complexity: log(size()) + count(k)

62.     iterator erase(const_iterator p);

    Effects: Erases the element pointed to by p.

    Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

    Complexity: Amortized constant time

63.     iterator erase(const_iterator first, const_iterator last);

    Effects: Erases all the elements in the range [first, last).

    Returns: Returns last.

    Complexity: log(size())+N where N is the distance from first to last.

64.     template<typename K> size_type erase(K && k);

    Requires: This overload is available only if key_compare::is_transparent exists.

    Effects: If present, erases the element in the container with key equivalent to x.

    Returns: Returns the number of erased elements.

65.     node_type extract(const_iterator p);

    Effects: Removes the element pointed to by "position".

    Returns: A node_type owning the element, otherwise an empty node_type.

    Complexity: Amortized constant.

66.     node_type extract(const key_type & x);

    Effects: Removes the first element in the container with key equivalent to k.

    Returns: A node_type owning the element if found, otherwise an empty node_type.

    Complexity: log(size()).

67.     template<typename K> node_type extract(K && x);

    Requires: This overload is available only if key_compare::is_transparent exists.

    Effects: Removes the first element in the container with key equivalent to k.

    Returns: A node_type owning the element if found, otherwise an empty node_type.

    Complexity: log(size()).

68.     void swap(set & x);

    Effects: Swaps the contents of *this and x.

    Throws: Nothing.

    Complexity: Constant.

69.     void clear();

    Effects: erase(begin(),end()).

    Postcondition: size() == 0.

    Complexity: linear in size().

70.     key_compare key_comp() const;

    Effects: Returns the comparison object out of which a was constructed.

    Complexity: Constant.

71.     value_compare value_comp() const;

    Effects: Returns an object of value_compare constructed out of the comparison object.

    Complexity: Constant.

72.     iterator find(const key_type & x);

    Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

    Complexity: Logarithmic.

73.     const_iterator find(const key_type & x) const;

    Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

    Complexity: Logarithmic.

74.     template<typename K> iterator find(const K & x);

    Requires: This overload is available only if key_compare::is_transparent exists.

    Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

    Complexity: Logarithmic.

75.     template<typename K> const_iterator find(const K & x) const;

    Requires: This overload is available only if key_compare::is_transparent exists.

    Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

    Complexity: Logarithmic.

76.     size_type count(const key_type & x) const;

    Returns: The number of elements with key equivalent to x.

    Complexity: log(size())+count(k)

77.     template<typename K> size_type count(const K & x) const;

    Requires: This overload is available only if key_compare::is_transparent exists.

    Returns: The number of elements with key equivalent to x.

    Complexity: log(size())+count(k)

78.     bool contains(const key_type & x) const;

    Returns: Returns true if there is an element with key equivalent to key in the container, otherwise false.

    Complexity: log(size()).

79.     template<typename K> bool contains(const K & x) const;

    Requires: This overload is available only if key_compare::is_transparent exists.

    Returns: Returns true if there is an element with key equivalent to key in the container, otherwise false.

    Complexity: log(size()).

80.     iterator lower_bound(const key_type & x);

    Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

    Complexity: Logarithmic

81.     const_iterator lower_bound(const key_type & x) const;

    Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

    Complexity: Logarithmic

82.     template<typename K> iterator lower_bound(const K & x);

    Requires: This overload is available only if key_compare::is_transparent exists.

    Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

    Complexity: Logarithmic

83.     template<typename K> const_iterator lower_bound(const K & x) const;

    Requires: This overload is available only if key_compare::is_transparent exists.

    Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

    Complexity: Logarithmic

84.     iterator upper_bound(const key_type & x);

    Returns: An iterator pointing to the first element with key greater than x, or end() if such an element is not found.

    Complexity: Logarithmic

85.     const_iterator upper_bound(const key_type & x) const;

    Returns: A const iterator pointing to the first element with key greater than x, or end() if such an element is not found.

    Complexity: Logarithmic

86.     template<typename K> iterator upper_bound(const K & x);

    Requires: This overload is available only if key_compare::is_transparent exists.

    Returns: An iterator pointing to the first element with key greater than x, or end() if such an element is not found.

    Complexity: Logarithmic

87.     template<typename K> const_iterator upper_bound(const K & x) const;

    Requires: This overload is available only if key_compare::is_transparent exists.

    Returns: A const iterator pointing to the first element with key greater than x, or end() if such an element is not found.

    Complexity: Logarithmic

88.     std::pair< iterator, iterator > equal_range(const key_type & x);

    Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

    Complexity: Logarithmic

89.     std::pair< const_iterator, const_iterator >
        equal_range(const key_type & x) const;

    Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

    Complexity: Logarithmic

90.     template<typename K> std::pair< iterator, iterator > equal_range(const K & x);

    Requires: This overload is available only if key_compare::is_transparent exists.

    Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

    Complexity: Logarithmic

91.     template<typename K>
          std::pair< const_iterator, const_iterator > equal_range(const K & x) const;

    Requires: This overload is available only if key_compare::is_transparent exists.

    Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

    Complexity: Logarithmic

92.     void rebalance();

    Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.

    Complexity: Linear

### `set` friend functions

1.     bool operator==(const set & x, const set & y);

   Effects: Returns true if x and y are equal

   Complexity: Linear to the number of elements in the container.

2.     bool operator!=(const set & x, const set & y);

   Effects: Returns true if x and y are unequal

   Complexity: Linear to the number of elements in the container.

3.     bool operator<(const set & x, const set & y);

   Effects: Returns true if x is less than y

   Complexity: Linear to the number of elements in the container.

4.     bool operator>(const set & x, const set & y);

   Effects: Returns true if x is greater than y

   Complexity: Linear to the number of elements in the container.

5.     bool operator<=(const set & x, const set & y);

   Effects: Returns true if x is equal or less than y

   Complexity: Linear to the number of elements in the container.

6.     bool operator>=(const set & x, const set & y);

   Effects: Returns true if x is equal or greater than y

   Complexity: Linear to the number of elements in the container.

7.     void swap(set & x, set & y);

   Effects: x.swap(y)

   Complexity: Constant.