#include <stl_map.h>
Public Types | |
typedef _Key | key_type |
typedef _Tp | mapped_type |
typedef std::pair< const _Key, _Tp > | value_type |
typedef _Compare | key_compare |
typedef _Alloc | allocator_type |
typedef _Pair_alloc_type::pointer | pointer |
typedef _Pair_alloc_type::const_pointer | const_pointer |
typedef _Pair_alloc_type::reference | reference |
typedef _Pair_alloc_type::const_reference | const_reference |
typedef _Rep_type::iterator | iterator |
typedef _Rep_type::const_iterator | const_iterator |
typedef _Rep_type::size_type | size_type |
typedef _Rep_type::difference_type | difference_type |
typedef _Rep_type::reverse_iterator | reverse_iterator |
typedef _Rep_type::const_reverse_iterator | const_reverse_iterator |
Public Member Functions | |
map () | |
Default constructor creates no elements. | |
map (const _Compare &__comp, const allocator_type &__a=allocator_type()) | |
Default constructor creates no elements. | |
map (const map &__x) | |
Map copy constructor. | |
template<typename _InputIterator> | |
map (_InputIterator __first, _InputIterator __last) | |
Builds a map from a range. | |
template<typename _InputIterator> | |
map (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type()) | |
Builds a map from a range. | |
map & | operator= (const map &__x) |
Map assignment operator. | |
allocator_type | get_allocator () const |
Get a copy of the memory allocation object. | |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
const_reverse_iterator | rend () const |
bool | empty () const |
size_type | size () const |
size_type | max_size () const |
mapped_type & | operator[] (const key_type &__k) |
Subscript ( [] ) access to map data. | |
mapped_type & | at (const key_type &__k) |
Access to map data. | |
const mapped_type & | at (const key_type &__k) const |
std::pair< iterator, bool > | insert (const value_type &__x) |
Attempts to insert a std::pair into the map. | |
iterator | insert (iterator position, const value_type &__x) |
Attempts to insert a std::pair into the map. | |
template<typename _InputIterator> | |
void | insert (_InputIterator __first, _InputIterator __last) |
A template function that attemps to insert a range of elements. | |
void | erase (iterator __position) |
Erases an element from a map. | |
size_type | erase (const key_type &__x) |
Erases elements according to the provided key. | |
void | erase (iterator __first, iterator __last) |
Erases a [first,last) range of elements from a map. | |
void | swap (map &__x) |
Swaps data with another map. | |
void | clear () |
key_compare | key_comp () const |
value_compare | value_comp () const |
iterator | find (const key_type &__x) |
Tries to locate an element in a map. | |
const_iterator | find (const key_type &__x) const |
Tries to locate an element in a map. | |
size_type | count (const key_type &__x) const |
Finds the number of elements with given key. | |
iterator | lower_bound (const key_type &__x) |
Finds the beginning of a subsequence matching given key. | |
const_iterator | lower_bound (const key_type &__x) const |
Finds the beginning of a subsequence matching given key. | |
iterator | upper_bound (const key_type &__x) |
Finds the end of a subsequence matching given key. | |
const_iterator | upper_bound (const key_type &__x) const |
Finds the end of a subsequence matching given key. | |
std::pair< iterator, iterator > | equal_range (const key_type &__x) |
Finds a subsequence matching given key. | |
std::pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
Finds a subsequence matching given key. | |
Private Types | |
typedef _Alloc::value_type | _Alloc_value_type |
typedef _Alloc::template rebind< value_type >::other | _Pair_alloc_type |
typedef _Rb_tree< key_type, value_type, _Select1st< value_type >, key_compare, _Pair_alloc_type > | _Rep_type |
Private Member Functions | |
__glibcxx_class_requires (_Tp, _SGIAssignableConcept) __glibcxx_class_requires4(_Compare | |
_BinaryFunctionConcept | __glibcxx_class_requires2 (value_type, _Alloc_value_type, _SameTypeConcept) public |
Private Attributes | |
bool | |
_Key | |
_Rep_type | _M_t |
Friends | |
template<typename _K1, typename _T1, typename _C1, typename _A1> | |
bool | operator== (const map< _K1, _T1, _C1, _A1 > &, const map< _K1, _T1, _C1, _A1 > &) |
template<typename _K1, typename _T1, typename _C1, typename _A1> | |
bool | operator< (const map< _K1, _T1, _C1, _A1 > &, const map< _K1, _T1, _C1, _A1 > &) |
Meets the requirements of a container, a reversible container, and an associative container (using unique keys). For a map<Key,T>
the key_type is Key, the mapped_type is T, and the value_type is std::pair<const Key,T>.
Maps support bidirectional iterators.
Definition at line 92 of file stl_map.h.
typedef _Alloc::value_type _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::_Alloc_value_type [private] |
typedef _Alloc::template rebind<value_type>::other _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::_Pair_alloc_type [private] |
typedef _Rb_tree<key_type, value_type, _Select1st<value_type>, key_compare, _Pair_alloc_type> _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::_Rep_type [private] |
typedef _Alloc _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::allocator_type |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Rep_type::const_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::const_iterator |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Pair_alloc_type::const_pointer _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::const_pointer |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Pair_alloc_type::const_reference _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::const_reference |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Rep_type::const_reverse_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::const_reverse_iterator |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Rep_type::difference_type _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::difference_type |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Rep_type::iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::iterator |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Compare _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::key_compare |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Key _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::key_type |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Tp _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::mapped_type |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Pair_alloc_type::pointer _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::pointer |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Pair_alloc_type::reference _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::reference |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Rep_type::reverse_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::reverse_iterator |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef _Rep_type::size_type _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::size_type |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
typedef std::pair<const _Key, _Tp> _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::value_type |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
_GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::map | ( | ) | [inline] |
_GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::map | ( | const _Compare & | __comp, | |
const allocator_type & | __a = allocator_type() | |||
) | [inline, explicit] |
Default constructor creates no elements.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
_GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::map | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x | ) | [inline] |
_GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::map | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
Builds a map from a range.
first | An input iterator. | |
last | An input iterator. |
_GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::map | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const _Compare & | __comp, | |||
const allocator_type & | __a = allocator_type() | |||
) | [inline] |
Builds a map from a range.
first | An input iterator. | |
last | An input iterator. | |
comp | A comparison functor. | |
a | An allocator object. |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
_GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::__glibcxx_class_requires | ( | _Tp | , | |
_SGIAssignableConcept | ||||
) | [private] |
_BinaryFunctionConcept _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::__glibcxx_class_requires2 | ( | value_type | , | |
_Alloc_value_type | , | |||
_SameTypeConcept | ||||
) | [inline, private] |
const mapped_type& _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::at | ( | const key_type & | __k | ) | const [inline] |
mapped_type& _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::at | ( | const key_type & | __k | ) | [inline] |
Access to map data.
k | The key for which data should be retrieved. |
std::out_of_range | If no such data is present. |
const_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::begin | ( | ) | const [inline] |
Returns a read-only (constant) iterator that points to the first pair in the map. Iteration is done in ascending order according to the keys.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::begin | ( | ) | [inline] |
Returns a read/write iterator that points to the first pair in the map. Iteration is done in ascending order according to the keys.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
void _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::clear | ( | ) | [inline] |
Erases all elements in a map. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
size_type _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::count | ( | const key_type & | __x | ) | const [inline] |
Finds the number of elements with given key.
x | Key of (key, value) pairs to be located. |
bool _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::empty | ( | ) | const [inline] |
const_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::end | ( | ) | const [inline] |
Returns a read-only (constant) iterator that points one past the last pair in the map. Iteration is done in ascending order according to the keys.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::end | ( | ) | [inline] |
Returns a read/write iterator that points one past the last pair in the map. Iteration is done in ascending order according to the keys.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
Definition at line 260 of file stl_map.h.
Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::at(), and _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator[]().
std::pair<const_iterator, const_iterator> _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::equal_range | ( | const key_type & | __x | ) | const [inline] |
Finds a subsequence matching given key.
x | Key of (key, value) pairs to be located. |
std::make_pair(c.lower_bound(val), c.upper_bound(val))
This function probably only makes sense for multimaps.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
std::pair<iterator, iterator> _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::equal_range | ( | const key_type & | __x | ) | [inline] |
Finds a subsequence matching given key.
x | Key of (key, value) pairs to be located. |
std::make_pair(c.lower_bound(val), c.upper_bound(val))
This function probably only makes sense for multimaps.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
void _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::erase | ( | iterator | __first, | |
iterator | __last | |||
) | [inline] |
Erases a [first,last) range of elements from a map.
first | Iterator pointing to the start of the range to be erased. | |
last | Iterator pointing to the end of the range to be erased. |
size_type _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::erase | ( | const key_type & | __x | ) | [inline] |
Erases elements according to the provided key.
x | Key of element to be erased. |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
void _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::erase | ( | iterator | __position | ) | [inline] |
Erases an element from a map.
position | An iterator pointing to the element to be erased. |
const_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::find | ( | const key_type & | __x | ) | const [inline] |
Tries to locate an element in a map.
x | Key of (key, value) pair to be located. |
end()
) iterator.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::find | ( | const key_type & | __x | ) | [inline] |
Tries to locate an element in a map.
x | Key of (key, value) pair to be located. |
end()
) iterator.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
allocator_type _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::get_allocator | ( | ) | const [inline] |
void _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::insert | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
A template function that attemps to insert a range of elements.
first | Iterator pointing to the start of the range to be inserted. | |
last | Iterator pointing to the end of the range. |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::insert | ( | iterator | position, | |
const value_type & | __x | |||
) | [inline] |
Attempts to insert a std::pair into the map.
position | An iterator that serves as a hint as to where the pair should be inserted. | |
x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 for more on "hinting".
Insertion requires logarithmic time (if the hint is not taken).
std::pair<iterator,bool> _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::insert | ( | const value_type & | __x | ) | [inline] |
Attempts to insert a std::pair into the map.
x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
Insertion requires logarithmic time.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
Definition at line 395 of file stl_map.h.
Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator[]().
key_compare _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::key_comp | ( | ) | const [inline] |
Returns the key comparison object out of which the map was constructed.
Definition at line 509 of file stl_map.h.
Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::at(), and _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator[]().
const_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::lower_bound | ( | const key_type & | __x | ) | const [inline] |
Finds the beginning of a subsequence matching given key.
x | Key of (key, value) pair to be located. |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::lower_bound | ( | const key_type & | __x | ) | [inline] |
Finds the beginning of a subsequence matching given key.
x | Key of (key, value) pair to be located. |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
Definition at line 575 of file stl_map.h.
Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::at(), and _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator[]().
size_type _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::max_size | ( | ) | const [inline] |
map& _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::operator= | ( | const map< _Key, _Tp, _Compare, _Alloc > & | __x | ) | [inline] |
mapped_type& _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::operator[] | ( | const key_type & | __k | ) | [inline] |
Subscript ( [] ) access to map data.
k | The key for which data should be retrieved. |
[] ) operator. Returns data associated with the key specified in subscript. If the key does not exist, a pair with that key is created using default values, which is then returned.Lookup requires logarithmic time.
const_reverse_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::rbegin | ( | ) | const [inline] |
Returns a read-only (constant) reverse iterator that points to the last pair in the map. Iteration is done in descending order according to the keys.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
reverse_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::rbegin | ( | ) | [inline] |
Returns a read/write reverse iterator that points to the last pair in the map. Iteration is done in descending order according to the keys.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
const_reverse_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::rend | ( | ) | const [inline] |
Returns a read-only (constant) reverse iterator that points to one before the first pair in the map. Iteration is done in descending order according to the keys.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
reverse_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::rend | ( | ) | [inline] |
Returns a read/write reverse iterator that points to one before the first pair in the map. Iteration is done in descending order according to the keys.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
size_type _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::size | ( | ) | const [inline] |
void _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::swap | ( | map< _Key, _Tp, _Compare, _Alloc > & | __x | ) | [inline] |
Swaps data with another map.
x | A map of the same element and allocator types. |
Compare
type (which itself is often stateless and empty), so it should be quite fast.) Note that the global std::swap() function is specialized such that std::swap(m1,m2) will feed to this function.
Definition at line 490 of file stl_map.h.
Referenced by _GLIBCXX_STD::swap().
const_iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::upper_bound | ( | const key_type & | __x | ) | const [inline] |
Finds the end of a subsequence matching given key.
x | Key of (key, value) pair to be located. |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
iterator _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::upper_bound | ( | const key_type & | __x | ) | [inline] |
Finds the end of a subsequence matching given key.
x | Key of (key, value) pair to be located. |
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >.
value_compare _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::value_comp | ( | ) | const [inline] |
bool operator< | ( | const map< _K1, _T1, _C1, _A1 > & | , | |
const map< _K1, _T1, _C1, _A1 > & | ||||
) | [friend] |
bool operator== | ( | const map< _K1, _T1, _C1, _A1 > & | , | |
const map< _K1, _T1, _C1, _A1 > & | ||||
) | [friend] |
_GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::_Key [private] |
Definition at line 105 of file stl_map.h.
Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::__glibcxx_class_requires2().
_Rep_type _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::_M_t [private] |
Definition at line 134 of file stl_map.h.
Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::begin(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::clear(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::count(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::empty(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::end(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::equal_range(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::erase(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::find(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::get_allocator(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::insert(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::key_comp(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::lower_bound(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::map(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::max_size(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator=(), _GLIBCXX_STD::operator==(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::rbegin(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::rend(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::size(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::swap(), _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::upper_bound(), and _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::value_comp().
_GLIBCXX_STD::map< _Key, _Tp, _Compare, _Alloc >::bool [private] |