bsl::set

Synopsis

Declared in <bslstl_set.h>

template<
    class KEY,
    class COMPARATOR = std::less<KEY>,
    class ALLOCATOR = allocator<KEY>>
class set;

Description

This class: * supports a complete set of value-semantic operations except for BDEX serialization * is exception-neutral (agnostic except for the at method) * is alias-safe * is const thread-safe For terminology see {bsldoc_glossary}.

Type Aliases

Name	Description
`allocator_type`	This `typedef` is an alias to the (template parameter) `ALLOCATOR`.
`const_iterator`	This `typedef` is an alias to `iterator`.
`const_pointer`	This `typedef` is an alias to the allocator const-pointer type.
`const_reference`	This `typedef` is an alias for `const_reference`.
`const_reverse_iterator`	This `typedef` is an alias to the const reverse iterator type.
`difference_type`	This `typedef` is an alias to the allocator difference type.
`iterator`	This `typedef` is an alias to the red-black tree iterator type.
`key_compare`	This `typedef` is an alias to the (template parameter) `COMPARATOR`.
`key_type`	This `typedef` is an alias to the (template parameter) `KEY` type.
`pointer`	This `typedef` is an alias to the allocator pointer type.
`reference`	This `typedef` is an alias to `value_type&`.
`reverse_iterator`	This `typedef` is an alias to the reverse iterator type.
`size_type`	This `typedef` is an alias to the allocator size type.
`value_compare`	This `typedef` is an alias to `key_compare`.
`value_type`	This `typedef` is an alias to `key_type`.

Member Functions

Name	Description
`set` [constructor]	Constructors
`~set` [destructor]	Destroy this object.
`operator=`	Assignment operators
`begin`	`begin` overloads
`cbegin`	Return an iterator providing non-modifiable access to the first `value_type` object in the ordered sequence of `value_type` objects maintained by this set, or the `cend` iterator if this set is empty.
`cend`	Return an iterator providing non-modifiable access to the past-the-end element in the ordered sequence of `value_type` objects maintained by this set.
`clear`	Remove all entries from this set. Note that the set is empty after this call, but allocated memory may be retained for future use.
`contains`	Return `true` if this map contains an element whose key is equivalent to the specified `key`.
`count`	`count` overloads
`crbegin`	Return a reverse iterator providing non-modifiable access to the last `value_type` object in the ordered sequence of `value_type` objects maintained by this set, or `crend` if this set is empty.
`crend`	Return a reverse iterator providing non-modifiable access to the prior-to-the-beginning element in the ordered sequence of `value_type` objects maintained by this set.
`emplace`	Insert into this set a newly created `value_type` object, constructed by forwarding `get_allocator()` (if required) and the specified (variable number of) `arguments` to the corresponding constructor of `value_type`, if a key equivalent to such a value does not already exist in this set; otherwise, this method has no effect (other than possibly creating a temporary `value_type` object). Return a pair whose `first` member is an iterator referring to the (possibly newly created and inserted) object in this set whose value is equivalent to that of an object constructed from `arguments`, and whose `second` member is `true` if a new value was inserted, and `false` if an equivalent key was already present. This method requires that the (template parameter) type `KEY` be `emplace-constructible` from `arguments` (see {Requirements on `KEY`}).
`emplace_hint`	Insert into this set a newly created `value_type` object, constructed by forwarding `get_allocator()` (if required) and the specified (variable number of) `arguments` to the corresponding constructor of `value_type`, (in amortized constant time if the specified `hint` is a valid immediate successor to the `value_type` object constructed from `arguments`), if a key equivalent to such a value does not already exist in this set; otherwise, this method has no effect (other than possibly creating a temporary `value_type` object). Return an iterator referring to the (possibly newly created and inserted) object in this set whose value is equivalent to that of an object constructed from `arguments`. If `hint` is not a valid immediate successor to the `value_type` object implied by `arguments`, this operation has `O[log(N)]` complexity where `N` is the size of this set. This method requires that the (template parameter) type `KEY` be `emplace-constructible` from `arguments` (see {Requirements on `KEY`}). The behavior is undefined unless `hint` is an iterator in the range `[begin() .. end()]` (both endpoints included).
`empty`	Return `true` if this set contains no elements, and `false` otherwise.
`end`	`end` overloads
`equal_range`	`equal_range` overloads
`erase`	`erase` overloads
`find`	`find` overloads
`get_allocator`	Return (a copy of) the allocator used for memory allocation by this set.
`insert`	`insert` overloads
`insert_range`	Insert into this set the value of each `value_type` object in the specified `range` if the key equivalent of that object is not already contained in this map. The (template parameter) type `RANGE` must meet the requirements the C++20 standard [ranges]providing access to values of a type convertible to `value_type`, and `value_type` must be `emplace-constructible` from `*i` into this map, where `i` is a dereferenceable iterator obtained from `range` (see {Requirements on `KEY`}). The behavior is undefined if `range` overlaps this set.
`key_comp`	Return the key-comparison functor (or function pointer) used by this set; if a comparator was supplied at construction, return its value, otherwise return a default constructed `key_compare` object. Note that this comparator compares objects of type `KEY`, which is the type of the `value_type` objects contained in this set.
`lower_bound`	`lower_bound` overloads
`max_size`	Return a theoretical upper bound on the largest number of elements that this set could possibly hold. Note that there is no guarantee that the set can successfully grow to the returned size, or even close to that size without running out of resources.
`rbegin`	`rbegin` overloads
`rend`	`rend` overloads
`size`	Return the number of elements in this set.
`swap`	Exchange the value and comparator of this object with those of the specified `other` object; also exchange the allocator of this object with that of `other` if the (template parameter) type `ALLOCATOR` has the `propagate_on_container_swap` trait, and do not modify either allocator otherwise. This method provides the no-throw exception-safety guarantee if and only if the (template parameter) type `COMPARATOR` provides a no-throw swap operation, and provides the basic exception-safety guarantee otherwise; if an exception is thrown, both objects are left in valid but unspecified states. This operation has `O[1]` complexity if either this object was created with the same allocator as `other` or `ALLOCATOR` has the `propagate_on_container_swap` trait; otherwise, it has `O[n + m]` complexity, where `n` and `m` are the number of elements in this object and `other`, respectively. Note that this method`s support for swapping objects created with different allocators when `ALLOCATOR` does not have the `propagate_on_container_swap` trait is a departure from the C++ Standard.
`upper_bound`	`upper_bound` overloads
`value_comp`	Return a functor for comparing two `value_type` objects using `key_comp()`. Note that since `value_type` is an alias to `KEY` for `set`, this method returns the same functor as `key_comp()`.

Deduction Guides

Name	Description
`set<KEY>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `set`. This deduction guide does not participate unless the specified `ALLOC` is convertible to `bsl::allocator<KEY>`.
`set<KEY>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `set`. This deduction guide does not participate unless the specified `ALLOC` is convertible to `bsl::allocator<KEY>`.
`set<KEY, COMPARATOR>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `set`. Deduce the template parameter `COMPARATOR` from the other parameter passed to the constructor. This deduction guide does not participate unless the specified `ALLOC` is convertible to `bsl::allocator<KEY>`.
`set<KEY, COMPARATOR>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `set`. Deduce the template parameter `COMPARATOR` from the other parameter passed to the constructor. This deduction guide does not participate unless the specified `ALLOC` is convertible to `bsl::allocator<KEY>`.
`set<KEY, COMPARATOR, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `set`. Deduce the template parameters `COMPARATOR` and `ALLOCATOR` from the other parameters passed to the constructor.
`set<KEY, COMPARATOR, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `set`. Deduce the template parameters `COMPARATOR` and `ALLOCATOR` from the other parameters passed to the constructor. This guide does not participate unless the supplied (or defaulted) `ALLOCATOR` meets the requirements of a standard allocator.
`set<KEY, std::less<KEY>, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `set`. Deduce the template parameter `ALLOCATOR` from the other parameter passed to the constructor.
`set<KEY, std::less<KEY>, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `set`. Deduce the template parameter `ALLOCATOR` from the other parameter passed to the constructor. This deduction guide does not participate unless the supplied allocator meets the requirements of a standard allocator.

Non-Member Functions

Name	Description
`erase_if`	Erase all the elements in the specified set `s` that satisfy the specified predicate `predicate`. Return the number of elements erased.
`operator<=>`	Perform a lexicographic three-way comparison of the specified `lhs` and the specified `rhs` sets by using the comparison operators of `KEY` on each element; return the result of that comparison.
`operator==`	Return `true` if the specified `lhs` and `rhs` objects have the same value, and `false` otherwise. Two `set` objects `lhs` and `rhs` have the same value if they have the same number of keys, and each element in the ordered sequence of keys of `lhs` has the same value as the corresponding element in the ordered sequence of keys of `rhs`. This method requires that the (template parameter) type `KEY` be `equality-comparable` (see {Requirements on `KEY`}).
`swap`	Exchange the value and comparator of the specified `a` object with those of the specified `b` object; also exchange the allocator of `a` with that of `b` if the (template parameter) type `ALLOCATOR` has the `propagate_on_container_swap` trait, and do not modify either allocator otherwise. This function provides the no-throw exception-safety guarantee if and only if the (template parameter) type `COMPARATOR` provides a no-throw swap operation, and provides the basic exception-safety guarantee otherwise; if an exception is thrown, both objects are left in valid but unspecified states. This operation has `O[1]` complexity if either `a` was created with the same allocator as `b` or `ALLOCATOR` has the `propagate_on_container_swap` trait; otherwise, it has `O[n + m]` complexity, where `n` and `m` are the number of elements in `a` and `b`, respectively. Note that this function`s support for swapping objects created with different allocators when `ALLOCATOR` does not have the `propagate_on_container_swap` trait is a departure from the C++ Standard.