Definition at line 48 of file map.h.
|
Default constructor creates no elements.
Reimplemented from std::map< _Key, _Tp, _Compare, _Allocator >. |
|
Builds a map from a range.
Reimplemented from std::map< _Key, _Tp, _Compare, _Allocator >. |
|
Detach all iterators, leaving them singular. Referenced by __gnu_debug::_Safe_sequence_base::~_Safe_sequence_base(). |
|
Detach all singular iterators.
Referenced by std::__debug::deque< _Tp, _Allocator >::erase(), and std::__debug::list< _Tp, _Allocator >::resize(). |
|
For use in _Safe_sequence. |
|
|
Invalidates all iterators |
|
Revalidates all attached singular iterators. This method may be used to validate iterators that were invalidated before (but for some reasion, such as an exception, need to become valid again). Referenced by std::__debug::deque< _Tp, _Allocator >::erase(). |
|
Swap this sequence with the given sequence. This operation also swaps ownership of the iterators, so that when the operation is complete all iterators that originally referenced one container now reference the other container. Referenced by std::__debug::vector< _Tp, _Allocator >::swap(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::swap(), std::__debug::set< _Key, _Compare, _Allocator >::swap(), std::__debug::multiset< _Key, _Compare, _Allocator >::swap(), std::__debug::multimap< _Key, _Tp, _Compare, _Allocator >::swap(), std::__debug::map< _Key, _Tp, _Compare, _Allocator >::swap(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::swap(), __gnu_cxx::__debug::hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc >::swap(), __gnu_cxx::__debug::hash_multimap< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::swap(), and __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::swap(). |
|
Transfers all iterators that reference this memory location to this sequence from whatever sequence they are attached to. |
|
Access to map data.
Definition at line 364 of file stl_map.h. References __N, and std::lower_bound(). |
|
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 from std::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 116 of file map.h. References std::map< _Key, _Tp, _Compare, _Allocator >::begin(). |
|
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 from std::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 112 of file map.h. References std::map< _Key, _Tp, _Compare, _Allocator >::begin(). Referenced by std::__debug::map< _Key, _Tp, _Compare, _Allocator >::clear(), and std::__debug::map< _Key, _Tp, _Compare, _Allocator >::rend(). |
|
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 from std::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 220 of file map.h. References std::__debug::map< _Key, _Tp, _Compare, _Allocator >::begin(), std::__debug::map< _Key, _Tp, _Compare, _Allocator >::end(), and std::__debug::map< _Key, _Tp, _Compare, _Allocator >::erase(). |
|
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 from std::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 124 of file map.h. References std::map< _Key, _Tp, _Compare, _Allocator >::end(). |
|
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 from std::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 120 of file map.h. References std::map< _Key, _Tp, _Compare, _Allocator >::end(). Referenced by std::__debug::map< _Key, _Tp, _Compare, _Allocator >::clear(), std::__debug::map< _Key, _Tp, _Compare, _Allocator >::erase(), and std::__debug::map< _Key, _Tp, _Compare, _Allocator >::rbegin(). |
|
Finds a subsequence matching given key.
std::make_pair(c.lower_bound(val), c.upper_bound(val)) This function probably only makes sense for multimaps. |
|
Finds a subsequence matching given key.
std::make_pair(c.lower_bound(val), c.upper_bound(val)) This function probably only makes sense for multimaps. |
|
Erases a [first,last) range of elements from a map.
|
|
Erases elements according to the provided key.
|
|
Erases an element from a map.
Definition at line 453 of file stl_map.h. Referenced by std::__debug::map< _Key, _Tp, _Compare, _Allocator >::erase(). |
|
Tries to locate an element in a map.
end() ) iterator.
|
|
Tries to locate an element in a map.
end() ) iterator.
Definition at line 541 of file stl_map.h. Referenced by std::__debug::map< _Key, _Tp, _Compare, _Allocator >::find(). |
|
Get a copy of the memory allocation object.
Definition at line 234 of file stl_map.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::get_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). |
|
Template function that attemps to insert a range of elements.
Reimplemented from std::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 174 of file map.h. References __glibcxx_check_valid_range, and std::map< _Key, _Tp, _Compare, _Allocator >::insert(). |
|
Attempts to insert a std::pair into the map.
Insertion requires logarithmic time. Reimplemented from std::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 157 of file map.h. References std::pair< _T1, _T2 >::first, std::map< _Key, _Tp, _Compare, _Allocator >::insert(), and std::pair< _T1, _T2 >::second. |
|
Returns the key comparison object out of which the map was constructed. |
|
Finds the beginning of a subsequence matching given key.
|
|
Finds the beginning of a subsequence matching given key.
Definition at line 583 of file stl_map.h. Referenced by std::__debug::map< _Key, _Tp, _Compare, _Allocator >::lower_bound(). |
|
Returns the maximum size of the map. |
|
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. Definition at line 342 of file stl_map.h. References __glibcxx_function_requires, and std::lower_bound(). |
|
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 from std::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 132 of file map.h. References std::__debug::map< _Key, _Tp, _Compare, _Allocator >::end(). |
|
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 from std::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 128 of file map.h. References std::__debug::map< _Key, _Tp, _Compare, _Allocator >::end(). |
|
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 from std::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 140 of file map.h. References std::__debug::map< _Key, _Tp, _Compare, _Allocator >::begin(). |
|
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 from std::map< _Key, _Tp, _Compare, _Allocator >. Definition at line 136 of file map.h. References std::__debug::map< _Key, _Tp, _Compare, _Allocator >::begin(). |
|
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 498 of file stl_map.h. References std::map< _Key, _Tp, _Compare, _Alloc >::_M_t. |
|
Finds the end of a subsequence matching given key.
|
|
Finds the end of a subsequence matching given key.
Definition at line 608 of file stl_map.h. Referenced by std::__debug::map< _Key, _Tp, _Compare, _Allocator >::upper_bound(). |
|
Returns a value comparison object, built from the key comparison object out of which the map was constructed. |
|
The list of constant iterators that reference this container.
Definition at line 171 of file safe_base.h. Referenced by __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate_single(), and __gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_iter(). |
|
The list of mutable iterators that reference this container.
Definition at line 168 of file safe_base.h. Referenced by __gnu_debug::_Safe_sequence< _Sequence >::_M_invalidate_if(), __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate_single(), and __gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_iter(). |
|
The container version number. This number may never be 0.
Definition at line 174 of file safe_base.h. Referenced by __gnu_debug::_Safe_sequence_base::_M_invalidate_all(). |