|
| map_index (segment_manager_base *segment_mngr) |
| Constructor. More...
|
|
void | reserve (typename segment_manager_base::size_type) |
| This reserves memory to optimize the insertion of n elements in the index. More...
|
|
void | shrink_to_fit () |
| This tries to free previously allocate unused memory. More...
|
|
typedef | BOOST_CONTAINER_IMPDEF (base_t::stored_allocator_type) stored_allocator_type |
|
typedef | BOOST_CONTAINER_IMPDEF (value_compare_impl) value_compare |
|
typedef | BOOST_CONTAINER_IMPDEF (base_t::iterator) iterator |
|
typedef | BOOST_CONTAINER_IMPDEF (base_t::const_iterator) const _iterator |
|
typedef | BOOST_CONTAINER_IMPDEF (base_t::reverse_iterator) reverse_iterator |
|
typedef | BOOST_CONTAINER_IMPDEF (base_t::const_reverse_iterator) const _reverse_iterator |
|
typedef | BOOST_CONTAINER_IMPDEF (movable_value_type_impl) movable_value_type |
|
T & | at (const key_type &k) |
| Returns: Allocator reference to the element whose key is equivalent to x. More...
|
|
const T & | at (const key_type &k) const |
| Returns: Allocator reference to the element whose key is equivalent to x. More...
|
|
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. More...
|
|
std::pair< iterator, bool > | insert (const nonconst_value_type &x) |
| Effects: Inserts a new value_type created from the pair if and only if there is no element in the container with key equivalent to the key of x. More...
|
|
std::pair< iterator, bool > | insert (BOOST_RV_REF(nonconst_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. More...
|
|
std::pair< iterator, bool > | insert (BOOST_RV_REF(movable_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. More...
|
|
std::pair< iterator, bool > | insert (BOOST_RV_REF(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. More...
|
|
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. More...
|
|
iterator | insert (const_iterator p, BOOST_RV_REF(nonconst_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. More...
|
|
iterator | insert (const_iterator p, BOOST_RV_REF(movable_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. More...
|
|
iterator | insert (const_iterator p, const nonconst_value_type &x) |
| Effects: Inserts a copy of x in the container. More...
|
|
iterator | insert (const_iterator p, BOOST_RV_REF(value_type) x) |
| Effects: Inserts an element move constructed from x in the container. More...
|
|
template<class InputIterator > |
void | insert (InputIterator first, InputIterator last) |
| Requires: first, last are not iterators into *this. More...
|
|
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. More...
|
|
size_type | count (const key_type &x) const |
| Returns: The number of elements with key equivalent to x. More...
|
|
template<class MapConfig>
singleton boost::interprocess::map_index< MapConfig >
Index type based in boost::interprocess::map.
Just derives from boost::interprocess::map and defines the interface needed by managed memory segments
template<class Key, class T, class Compare, class Allocator , class MapOptions >
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.
template<class Key, class T, class Compare, class Allocator , class MapOptions >
Effects: Inserts a new value_type created 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.
template<class Key, class T, class Compare, class Allocator , class MapOptions >
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.
template<class Key, class T, class Compare, class Allocator , class MapOptions >
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.
template<class Key, class T, class Compare, class Allocator , class MapOptions >
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.
template<class Key, class T, class Compare, class Allocator , class MapOptions >
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.
template<class Key, class T, class Compare, class Allocator , class MapOptions >
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.
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.
template<class Key, class T, class Compare, class Allocator , class MapOptions >
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.
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.
template<class Key, class T, class Compare, class Allocator , class MapOptions >
Effects: Inserts a copy of 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<class Key, class T, class Compare, class Allocator , class MapOptions >
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<class Key, class T, class Compare, class Allocator , class MapOptions >
template<class InputIterator >
void boost::container::map< Key, T, Compare, Allocator, MapOptions >::insert |
( |
InputIterator |
first, |
|
|
InputIterator |
last |
|
) |
| |
|
inlineinherited |
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)