-
key_compare key_comp() const;
Effects: Returns the comparison object out of which a was constructed.
Complexity: Constant.
-
value_compare value_comp() const;
Effects: Returns an object of value_compare constructed out of the comparison object.
Complexity: Constant.
-
allocator_type get_allocator() const;
Effects: Returns a copy of the Allocator that was passed to the object's constructor.
Complexity: Constant.
const stored_allocator_type & get_stored_allocator() const;
stored_allocator_type & get_stored_allocator() ;
-
iterator begin() ;
Effects: Returns an iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant
-
const_iterator begin() const;
Effects: Returns a const_iterator to the first element contained in the container.
Throws: Nothing.
Complexity: Constant.
-
iterator end() ;
Effects: Returns an iterator to the end of the container.
Throws: Nothing.
Complexity: Constant.
-
const_iterator end() const;
Effects: Returns a const_iterator to the end of the container.
Throws: Nothing.
Complexity: Constant.
-
reverse_iterator rbegin() ;
Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant.
-
const_reverse_iterator rbegin() const;
Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.
Throws: Nothing.
Complexity: Constant.
-
reverse_iterator rend() ;
Effects: Returns a reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant.
-
const_reverse_iterator rend() const;
Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.
Throws: Nothing.
Complexity: Constant.
-
bool empty() const;
Effects: Returns true if the container contains no elements.
Throws: Nothing.
Complexity: Constant.
-
size_type size() const;
Effects: Returns the number of the elements contained in the container.
Throws: Nothing.
Complexity: Constant.
-
size_type max_size() const;
Effects: Returns the largest possible size of the container.
Throws: Nothing.
Complexity: Constant.
-
void swap(set< T, Pred, Alloc > & x) ;
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant.
-
void swap(unspecified x) ;
Effects: Swaps the contents of *this and x. If this->allocator_type() != x.allocator_type() allocators are also swapped.
Throws: Nothing.
Complexity: Constant.
-
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.
-
std::pair< iterator, bool > insert(unspecified 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.
-
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.
-
iterator insert(const_iterator p, unspecified 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.
-
template<typename InputIterator>
void insert(InputIterator first, InputIterator last) ;
Requires: i, j are not iterators into *this.
Effects: inserts each element from the range [i,j) if and only if there is no element with key equivalent to the key of that element.
Complexity: N log(size()+N) (N is the distance from i to j)
-
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
-
size_type erase(const key_type & x) ;
Effects: Erases all elements in the container with key equivalent to x.
Returns: Returns the number of erased elements.
Complexity: log(size()) + count(k)
-
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.
-
void clear() ;
Effects: erase(a.begin(),a.end()).
Postcondition: size() == 0.
Complexity: linear in size().
-
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.
-
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.
-
size_type count(const key_type & x) const;
Returns: The number of elements with key equivalent to x.
Complexity: log(size())+count(k)
-
iterator lower_bound(const key_type & x) ;
Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic
-
const_iterator lower_bound(const key_type & x) const;
Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.
Complexity: Logarithmic
-
iterator upper_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
-
const_iterator upper_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
-
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
-
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