Boost C++ Libraries

typename Key

is the key_type of the map

typename T

typename Compare = std::less<Key>

is the ordering function for Keys (e.g. std::less<Key>).

typename AllocatorOrContainer = new_allocator< std::pair< Key, T> >

is either:

flat_map() noexcept(dtl::is_nothrow_default_constructible< AllocatorOrContainer >::value &&dtl::is_nothrow_default_constructible< Compare >::value);

Effects: Default constructs an empty flat_map.

Complexity: Constant.

explicit flat_map(const allocator_type & a);

Effects: Constructs an empty flat_map using the specified allocator.

Complexity: Constant.

explicit flat_map(const Compare & comp);

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

Complexity: Constant.

flat_map(const Compare & comp, const allocator_type & a);

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

Complexity: Constant.

template<typename InputIterator> 
  flat_map(InputIterator first, InputIterator last);

Effects: Constructs an empty flat_map and 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.

template<typename InputIterator> 
  flat_map(InputIterator first, InputIterator last, const allocator_type & a);

Effects: Constructs an empty flat_map 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.

template<typename InputIterator> 
  flat_map(InputIterator first, InputIterator last, const Compare & comp);

Effects: Constructs an empty flat_map using the specified comparison object and 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.

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

Effects: Constructs an empty flat_map 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.

template<typename InputIterator> 
  flat_map(ordered_unique_range_t, InputIterator first, InputIterator last);

Effects: Constructs an empty flat_map and inserts elements from the ordered 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.

Complexity: Linear in N.

Note: Non-standard extension.

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

Effects: Constructs an empty flat_map using the specified comparison object and inserts elements from the ordered 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.

Complexity: Linear in N.

Note: Non-standard extension.

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

Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the ordered 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.

Complexity: Linear in N.

Note: Non-standard extension.

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

Effects: Constructs an empty flat_map using the specified allocator and inserts elements from the ordered 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.

Complexity: Linear in N.

Note: Non-standard extension.

flat_map(std::initializer_list< value_type > il);

Effects: Constructs an empty flat_map 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 last - first.

flat_map(std::initializer_list< value_type > il, const allocator_type & a);

Effects: Constructs an empty flat_map 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 last - first.

flat_map(std::initializer_list< value_type > il, const Compare & comp);

Effects: Constructs an empty flat_map 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 last - first.

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

Effects: Constructs an empty flat_map 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 last - first.

flat_map(ordered_unique_range_t, std::initializer_list< value_type > il);

Effects: Constructs an empty flat_map using 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.

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

Effects: Constructs an empty flat_map 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.

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

Effects: Constructs an empty flat_map 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.

flat_map(const flat_map & x);

Effects: Copy constructs a flat_map.

Complexity: Linear in x.size().

flat_map(flat_map && x) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value);

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

Complexity: Constant.

Postcondition: x is emptied.

flat_map(const flat_map & x, const allocator_type & a);

Effects: Copy constructs a flat_map using the specified allocator.

Complexity: Linear in x.size().

flat_map(flat_map && x, const allocator_type & a);

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

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

flat_map & operator=(const flat_map & x);

Effects: Makes *this a copy of x.

Complexity: Linear in x.size().

flat_map & operator=(flat_map && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value) &&boost::container::dtl::is_nothrow_move_assignable< Compare >::value);

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

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.

flat_map & operator=(std::initializer_list< value_type > il);

 BOOST_STATIC_ASSERT((dtl::is_same< std::pair< Key, T >, value_type >::value));

allocator_type get_allocator() const noexcept;

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

Complexity: Constant.

get_stored_allocator_noconst_return_t get_stored_allocator() noexcept;

Effects: Returns a reference to the internal allocator.

Throws: Nothing

Complexity: Constant.

Note: Non-standard extension.

get_stored_allocator_const_return_t get_stored_allocator() const noexcept;

Effects: Returns a reference to the internal allocator.

Throws: Nothing

Complexity: Constant.

Note: Non-standard extension.

iterator begin() noexcept;

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

Throws: Nothing.

Complexity: Constant.

const_iterator begin() const noexcept;

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

Throws: Nothing.

Complexity: Constant.

iterator end() noexcept;

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

Throws: Nothing.

Complexity: Constant.

const_iterator end() const noexcept;

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

Throws: Nothing.

Complexity: Constant.

reverse_iterator rbegin() noexcept;

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

Throws: Nothing.

Complexity: Constant.

const_reverse_iterator rbegin() const noexcept;

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

Throws: Nothing.

Complexity: Constant.

reverse_iterator rend() noexcept;

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

Throws: Nothing.

Complexity: Constant.

const_reverse_iterator rend() const noexcept;

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

Throws: Nothing.

Complexity: Constant.

const_iterator cbegin() const noexcept;

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

Throws: Nothing.

Complexity: Constant.

const_iterator cend() const noexcept;

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

Throws: Nothing.

Complexity: Constant.

const_reverse_iterator crbegin() const noexcept;

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

Throws: Nothing.

Complexity: Constant.

const_reverse_iterator crend() const noexcept;

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

Throws: Nothing.

Complexity: Constant.

bool empty() const noexcept;

Effects: Returns true if the container contains no elements.

Throws: Nothing.

Complexity: Constant.

size_type size() const noexcept;

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

Throws: Nothing.

Complexity: Constant.

size_type max_size() const noexcept;

Effects: Returns the largest possible size of the container.

Throws: Nothing.

Complexity: Constant.

size_type capacity() const noexcept;

Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

Throws: Nothing.

Complexity: Constant.

void reserve(size_type cnt);

Effects: If n is less than or equal to capacity(), or the underlying container has no reserve member, this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

Throws: If memory allocation allocation throws or T's copy constructor throws.

Note: If capacity() is less than "cnt", iterators and references to to values might be invalidated.

void shrink_to_fit();

Throws: If memory allocation throws, or T's copy constructor throws.

Complexity: Linear to size().

mapped_type & operator[](const key_type & k);

Effects: If there is no key equivalent to x in the flat_map, inserts value_type(x, T()) into the flat_map.

Returns: A reference to the mapped_type corresponding to x in *this.

Complexity: Logarithmic search time plus linear insertion time in case no equivalent key is present.

mapped_type & operator[](key_type && k);

Effects: If there is no key equivalent to x in the flat_map, inserts value_type(move(x), T()) into the flat_map (the key is move-constructed)

Returns: A reference to the mapped_type corresponding to x in *this.

Complexity: Logarithmic search time plus linear insertion time in case no equivalent key is present.

template<typename M> 
  std::pair< iterator, bool > insert_or_assign(const key_type & k, M && obj);

Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, forward<M>(obj)).

No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

Complexity: Logarithmic search time plus linear insertion time in case no equivalent key is present.

template<typename M> 
  std::pair< iterator, bool > insert_or_assign(key_type && k, M && obj);

Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, move(obj)).

No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

Complexity: Logarithmic in the size of the container.

template<typename M> 
  iterator insert_or_assign(const_iterator hint, const key_type & k, M && obj);

Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, forward<M>(obj)) and the new element to the container as close as possible to the position just before hint.

No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

Complexity: Logarithmic in the size of the container in general, but amortized constant if the new element is inserted just before hint.

template<typename M> 
  iterator insert_or_assign(const_iterator hint, key_type && k, M && obj);

Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, move(obj)) and the new element to the container as close as possible to the position just before hint.

No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

Complexity: Logarithmic in the size of the container in general, but amortized constant if the new element is inserted just before hint.

iterator nth(size_type n) noexcept;

Requires: size() >= n.

Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

Throws: Nothing.

Complexity: Constant.

Note: Non-standard extension

const_iterator nth(size_type n) const noexcept;

Requires: size() >= n.

Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

Throws: Nothing.

Complexity: Constant.

Note: Non-standard extension

size_type index_of(iterator p) noexcept;

Requires: begin() <= p <= end().

Effects: Returns the index of the element pointed by p and size() if p == end().

Throws: Nothing.

Complexity: Constant.

Note: Non-standard extension

size_type index_of(const_iterator p) const noexcept;

Requires: begin() <= p <= end().

Effects: Returns the index of the element pointed by p and size() if p == end().

Throws: Nothing.

Complexity: Constant.

Note: Non-standard extension

T & at(const key_type & k);

Returns: A reference to the element whose key is equivalent to x.

Throws: An exception object of type out_of_range if no such element is present.

Complexity: logarithmic.

const T & at(const key_type & k) const;

Returns: A reference to the element whose key is equivalent to x.

Throws: An exception object of type out_of_range if no such element is present.

Complexity: logarithmic.

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

Effects: Inserts an object x of type T constructed with std::forward<Args>(args)... 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 search time plus linear insertion to the elements with bigger keys than x.

Note: If an element is inserted it might invalidate elements.

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

Effects: Inserts an object of type T constructed with std::forward<Args>(args)... 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 search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

Note: If an element is inserted it might invalidate elements.

template<class... Args> 
  std::pair< iterator, bool > try_emplace(const key_type & k, Args &&... args);

Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

Returns: The bool component of the returned pair is true if and only if the insertion took place. The returned iterator points to the map element whose key is equivalent to k.

Complexity: Logarithmic.

template<class... Args> 
  iterator try_emplace(const_iterator hint, const key_type & k, 
                       Args &&... args);

Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

Returns: The returned iterator points to the map element whose key is equivalent to k.

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

template<class... Args> 
  std::pair< iterator, bool > try_emplace(key_type && k, Args &&... args);

Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

Returns: The bool component of the returned pair is true if and only if the insertion took place. The returned iterator points to the map element whose key is equivalent to k.

Complexity: Logarithmic search time plus linear insertion time in case the key is not present.

template<class... Args> 
  iterator try_emplace(const_iterator hint, key_type && k, Args &&... args);

Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

Returns: The returned iterator points to the map element whose key is equivalent to k.

Complexity: Logarithmic in general, but amortized constant if value is inserted right before p. Linear insertion time in case no equivalent key is present.

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 search time plus linear insertion to the elements with bigger keys than x.

Note: If an element is inserted it might invalidate elements.

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

Effects: Inserts a new value_type move constructed from the pair 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 search time plus linear insertion to the elements with bigger keys than x.

Note: If an element is inserted it might invalidate elements.

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

Effects: Inserts a new value_type constructed from the pair 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 search time plus linear insertion to the elements with bigger keys than x.

Note: If an element is inserted it might invalidate elements.

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 search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

Note: If an element is inserted it might invalidate elements.

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 search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

Note: If an element is inserted it might invalidate elements.

template<typename Pair> iterator insert(const_iterator p, Pair && x);

Effects: Inserts an element 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 search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

Note: If an element is inserted it might invalidate elements.

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: N log(size()+N).

Note: If an element is inserted it might invalidate elements.

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

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

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

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. This function is more efficient than the normal range creation for ordered ranges.

Complexity: Linear.

Note: If an element is inserted it might invalidate elements.

Note: Non-standard extension.

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: N log(N).

Note: If an element is inserted it might invalidate elements.

void insert(ordered_unique_range_t, std::initializer_list< value_type > il);

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

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. This function is more efficient than the normal range creation for ordered ranges.

Complexity: Linear.

Note: If an element is inserted it might invalidate elements.

Note: Non-standard extension.

template<typename C2> 
  void merge(flat_map< Key, T, C2, AllocatorOrContainer > & source);

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

Effects: Move-inserts each element from source into *this 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 moved from source.

Complexity: Linear in this->size() + source.size().

Note: Invalidates all iterators and references.

template<typename C2> 
  void merge(flat_map< Key, T, C2, AllocatorOrContainer > && source);

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

Effects: Move-inserts each element from source into *this 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 moved from source.

Complexity: Linear in this->size() + source.size().

Note: Invalidates all iterators and references.

template<typename C2> 
  void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > & source);

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

Effects: Move-inserts each element from source into *this 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 moved from source.

Complexity: Linear in this->size() + source.size().

Note: Invalidates all iterators and references.

template<typename C2> 
  void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > && source);

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

Effects: Move-inserts each element from source into *this 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 moved from source.

Complexity: Linear in this->size() + source.size().

Note: Invalidates all iterators and references.

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: Linear to the elements with keys bigger than p

Note: Invalidates elements with keys not less than the erased element.

size_type erase(const key_type & x);

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

Returns: Returns the number of erased elements (0/1).

Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

iterator erase(const_iterator first, const_iterator last);

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

Returns: Returns last.

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

Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

void swap(flat_map & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value);

Effects: Swaps the contents of *this and x.

Throws: Nothing.

Complexity: Constant.

void clear() noexcept;

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

Postcondition: size() == 0.

Complexity: linear in size().

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.

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.

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.

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.

size_type count(const key_type & x) const;

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

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

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)

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()).

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()).

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

sequence_type extract_sequence();

Effects: Extracts the internal sequence container.

Complexity: Same as the move constructor of sequence_type, usually constant.

Postcondition: this->empty()

Throws: If secuence_type's move constructor throws

void adopt_sequence(sequence_type && seq);

Effects: Discards the internally hold sequence container and adopts the one passed externally using the move assignment. Erases non-unique elements.

Complexity: Assuming O(1) move assignment, O(NlogN) with N = seq.size()

Throws: If the comparison or the move constructor throws

void adopt_sequence(ordered_unique_range_t, sequence_type && seq);

Requires: seq shall be ordered according to this->compare() and shall contain unique elements.

Effects: Discards the internally hold sequence container and adopts the one passed externally using the move assignment.

Complexity: Assuming O(1) move assignment, O(1)

Throws: If the move assignment throws

const sequence_type & sequence() const noexcept;

Effects: Returns a const view of the underlying sequence.

Complexity: Constant

Throws: Nothing

bool operator==(const flat_map & x, const flat_map & y);

Effects: Returns true if x and y are equal

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

bool operator!=(const flat_map & x, const flat_map & y);

Effects: Returns true if x and y are unequal

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

bool operator<(const flat_map & x, const flat_map & y);

Effects: Returns true if x is less than y

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

bool operator>(const flat_map & x, const flat_map & y);

Effects: Returns true if x is greater than y

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

bool operator<=(const flat_map & x, const flat_map & y);

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

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

bool operator>=(const flat_map & x, const flat_map & y);

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

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

void swap(flat_map & x, flat_map & y) noexcept(noexcept(x.swap(y)));

Effects: x.swap(y)

Complexity: Constant.