#include <stl_map.h>
Public Types | |
typedef _Key | key_type |
typedef _Tp | mapped_type |
typedef pair< const _Key, _Tp > | value_type |
typedef _Compare | key_compare |
typedef _Alloc::pointer | pointer |
typedef _Alloc::const_pointer | const_pointer |
typedef _Alloc::reference | reference |
typedef _Alloc::const_reference | const_reference |
typedef _Rep_type::allocator_type | allocator_type |
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. | |
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. | |
pair< iterator, iterator > | equal_range (const key_type &__x) |
Finds a subsequence matching given key. | |
pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
Finds a subsequence matching given key. | |
Private Types | |
typedef _Rb_tree< key_type, value_type, _Select1st< value_type >, key_compare, _Alloc > | _Rep_type |
Private Member Functions | |
__glibcxx_class_requires (_Tp, _SGIAssignableConcept) __glibcxx_class_requires4(_Compare | |
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 91 of file stl_map.h.
|
|
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 100 of file stl_map.h. Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator[](). |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 101 of file stl_map.h. Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator[](). |
|
Default constructor creates no elements.
|
|
Default constructor creates no elements.
|
|
Map copy constructor.
|
|
Builds a map from a range.
|
|
Builds a map from a range.
|
|
|
|
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 >. |
|
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 >. |
|
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 >. |
|
Finds the number of elements with given key.
|
|
Returns true if the map is empty. (Thus begin() would equal end().) |
|
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 >. |
|
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 251 of file stl_map.h. Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator[](). |
|
Finds a subsequence matching given key.
(but is faster than making the calls separately). This function probably only makes sense for multimaps. Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Finds a subsequence matching given key.
(but is faster than making the calls separately). This function probably only makes sense for multimaps. Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Erases a [first,last) range of elements from a map.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Erases elements according to the provided key.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Erases an element from a map.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Tries to locate an element in a map.
end() ) iterator.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Tries to locate an element in a map.
end() ) iterator.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Get a copy of the memory allocation object.
|
|
A template function that attemps to insert a range of elements.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Attempts to insert a std::pair into the map.
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). Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Attempts to insert a std::pair into the map.
Insertion requires logarithmic time. Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 359 of file stl_map.h. Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator[](). |
|
Returns the key comparison object out of which the map was constructed. Definition at line 473 of file stl_map.h. Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator[](). |
|
Finds the beginning of a subsequence matching given key.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Finds the beginning of a subsequence matching given key.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 539 of file stl_map.h. Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator[](). |
|
Returns the maximum size of the map. |
|
Map assignment operator.
|
|
Subscript (
[] ) 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. |
|
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 >. |
|
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 >. |
|
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 >. |
|
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 >. |
|
Returns the size of the map. |
|
Swaps data with another map.
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 454 of file stl_map.h. Referenced by _GLIBCXX_STD::swap(). |
|
Finds the end of a subsequence matching given key.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Finds the end of a subsequence matching given key.
Reimplemented in __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >. |
|
Returns a value comparison object, built from the key comparison object out of which the map was constructed. |
|
|
|
|
|
|
|
Definition at line 124 of file stl_map.h. Referenced by _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::operator=(), _GLIBCXX_STD::operator==(), and _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >::swap(). |
|
|