Public Types | |
typedef Key | key_type |
typedef Type | mapped_type |
typedef std::pair< const Key, Type > | value_type |
typedef Compare | key_compare |
typedef Allocator | allocator_type |
typedef Allocator::reference | reference |
typedef Allocator::const_reference | const_reference |
typedef __gnu_debug::Safe_iterator< typename Base::iterator, map > | iterator |
typedef __gnu_debug::Safe_iterator< typename Base::const_iterator, map > | const_iterator |
typedef Base::size_type | size_type |
typedef Base::difference_type | difference_type |
typedef Allocator::pointer | pointer |
typedef Allocator::const_pointer | const_pointer |
typedef std::reverse_iterator< iterator > | reverse_iterator |
typedef std::reverse_iterator< const_iterator > | const_reverse_iterator |
Public Member Functions | |
map (const Compare &comp=Compare(), const Allocator &a=Allocator()) | |
template<typename InputIterator> | |
map (InputIterator first, InputIterator last, const Compare &comp=Compare(), const Allocator &a=Allocator()) | |
map (const map< Key, Type, Compare, Allocator > &x) | |
map (const Base &x) | |
~map () | |
map< Key, Type, Compare, Allocator > & | operator= (const map< Key, Type, Compare, Allocator > &x) |
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 |
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) |
template<typename InputIterator> | |
void | insert (InputIterator first, InputIterator last) |
A template function that attemps to insert a range of elements. | |
void | erase (iterator position) |
size_type | erase (const key_type &x) |
Erases elements according to the provided key. | |
void | erase (iterator first, iterator last) |
void | swap (map< Key, Type, Compare, Allocator > &x) |
void | clear () |
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. | |
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. | |
Base & | M_base () |
const Base & | M_base () const |
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. | |
map (InputIterator first, InputIterator last) | |
Builds a map from a range. | |
map (InputIterator first, InputIterator last, const Compare &comp, const allocator_type &a=allocator_type()) | |
Builds a map from a range. | |
allocator_type | get_allocator () const |
Get a copy of the memory allocation object. | |
bool | empty () const |
size_type | size () const |
size_type | max_size () const |
mapped_type & | operator[] (const key_type &__k) |
Subscript ( [] ) access to map data. | |
iterator | insert (iterator position, const value_type &x) |
Attempts to insert a std::pair into the map. | |
void | erase (iterator position) |
Erases an element from a map. | |
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. | |
key_compare | key_comp () const |
value_compare | value_comp () const |
size_type | count (const key_type &x) const |
Finds the number of elements with given key. | |
void | M_invalidate_if (Predicate pred) |
void | M_transfer_iter (const Safe_iterator< Iterator, map< Key, Type, Compare, Allocator > > &x) |
void | M_invalidate_all () const |
Public Attributes | |
Safe_iterator_base * | M_iterators |
The list of mutable iterators that reference this container. | |
Safe_iterator_base * | M_const_iterators |
The list of constant iterators that reference this container. | |
unsigned int | M_version |
The container version number. This number may never be 0. | |
Protected Member Functions | |
void | M_detach_all () |
void | M_detach_singular () |
void | M_revalidate_singular () |
void | M_swap (Safe_sequence_base &x) |
Private Types | |
typedef std::map< Key, Type, Compare, Allocator > | Base |
typedef __gnu_debug::Safe_sequence< map > | Safe_base |
Private Member Functions | |
void | M_invalidate_all () |
Definition at line 42 of file debug/map.h.
|
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, Type, Compare, Allocator >. Definition at line 110 of file debug/map.h. |
|
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, Type, Compare, Allocator >. Definition at line 106 of file debug/map.h. Referenced by __gnu_debug_def::map< Key, Type, Compare, Allocator >::clear(), and __gnu_debug_def::map< Key, Type, 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, Type, Compare, Allocator >. Definition at line 210 of file debug/map.h. References __gnu_debug_def::map< Key, Type, Compare, Allocator >::begin(), __gnu_debug_def::map< Key, Type, Compare, Allocator >::end(), and __gnu_debug_def::map< Key, Type, 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, Type, Compare, Allocator >. Definition at line 118 of file debug/map.h. |
|
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, Type, Compare, Allocator >. Definition at line 114 of file debug/map.h. Referenced by __gnu_debug_def::map< Key, Type, Compare, Allocator >::clear(), __gnu_debug_def::map< Key, Type, Compare, Allocator >::erase(), __gnu_debug_def::map< Key, Type, Compare, Allocator >::M_invalidate_all(), and __gnu_debug_def::map< Key, Type, 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. Reimplemented from std::map< Key, Type, Compare, Allocator >. Definition at line 255 of file debug/map.h. References std::equal_range(), std::pair< T1, T2 >::first, std::make_pair(), and std::pair< T1, T2 >::second. |
|
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. Reimplemented from std::map< Key, Type, Compare, Allocator >. Definition at line 245 of file debug/map.h. References std::equal_range(), std::pair< T1, T2 >::first, std::make_pair(), and std::pair< T1, T2 >::second. |
|
Erases a [first,last) range of elements from a map.
|
|
Erases an element from a map.
|
|
Erases elements according to the provided key.
Reimplemented from std::map< Key, Type, Compare, Allocator >. Definition at line 179 of file debug/map.h. References __gnu_debug::Safe_iterator< Iterator, Sequence >::base(), __gnu_debug_def::map< Key, Type, Compare, Allocator >::end(), and __gnu_debug_def::map< Key, Type, Compare, Allocator >::find(). |
|
Tries to locate an element in a map.
end() ) iterator.
Reimplemented from std::map< Key, Type, Compare, Allocator >. Definition at line 223 of file debug/map.h. References std::find(). |
|
Tries to locate an element in a map.
end() ) iterator.
Reimplemented from std::map< Key, Type, Compare, Allocator >. Definition at line 219 of file debug/map.h. References std::find(). Referenced by __gnu_debug_def::map< Key, Type, Compare, Allocator >::erase(). |
|
Get a copy of the memory allocation object.
Definition at line 224 of file stl_map.h. References std::map< Key, Type, 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). |
|
A template function that attemps to insert a range of elements.
Reimplemented from std::map< Key, Type, Compare, Allocator >. Definition at line 164 of file debug/map.h. |
|
Attempts to insert a std::pair into the map.
Insertion requires logarithmic time. Reimplemented from std::map< Key, Type, Compare, Allocator >. Definition at line 147 of file debug/map.h. References std::pair< T1, T2 >::first, 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.
Reimplemented from std::map< Key, Type, Compare, Allocator >. Definition at line 233 of file debug/map.h. References std::lower_bound(). |
|
Finds the beginning of a subsequence matching given key.
Reimplemented from std::map< Key, Type, Compare, Allocator >. Definition at line 229 of file debug/map.h. References std::lower_bound(). |
|
Detach all iterators, leaving them singular. |
|
Detach all singular iterators.
|
|
Invalidates all iterators. Definition at line 202 of file safe_base.h. |
|
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). |
|
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. Definition at line 172 of file debug.cc. References __gnu_debug::swap(). |
|
Transfers all iterators that reference this memory location to this sequence from whatever sequence they are attached to. |
|
Builds a map from a range.
|
|
Builds a map from a range.
|
|
Map copy constructor.
|
|
Default constructor creates no elements.
|
|
Default constructor creates no elements.
|
|
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 331 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, Type, Compare, Allocator >. Definition at line 126 of file debug/map.h. References __gnu_debug_def::map< Key, Type, 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, Type, Compare, Allocator >. Definition at line 122 of file debug/map.h. References __gnu_debug_def::map< Key, Type, 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, Type, Compare, Allocator >. Definition at line 134 of file debug/map.h. References __gnu_debug_def::map< Key, Type, 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, Type, Compare, Allocator >. Definition at line 130 of file debug/map.h. References __gnu_debug_def::map< Key, Type, 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.
|
|
Finds the end of a subsequence matching given key.
Reimplemented from std::map< Key, Type, Compare, Allocator >. Definition at line 241 of file debug/map.h. References std::upper_bound(). |
|
Finds the end of a subsequence matching given key.
Reimplemented from std::map< Key, Type, Compare, Allocator >. Definition at line 237 of file debug/map.h. References std::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 156 of file safe_base.h. |
|
The list of mutable iterators that reference this container.
Definition at line 153 of file safe_base.h. |
|
The container version number. This number may never be 0.
Definition at line 159 of file safe_base.h. |