Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members | Related Pages | Search for 

__gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator > Class Template Reference

#include <map.h>

Inheritance diagram for __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >:

_GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator > __gnu_debug::_Safe_sequence< map< _Key, _Tp, _Compare, _Allocator > > __gnu_debug::_Safe_sequence_base List of all members.

Public Types

typedef _Key key_type
typedef _Tp mapped_type
typedef std::pair< const _Key,
_Tp > 		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, _Tp, _Compare, _Allocator > &__x)
 map (const _Base &__x)
 ~map ()
map< _Key, _Tp, _Compare,
_Allocator > & 		operator= (const map< _Key, _Tp, _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)
 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< _Key, _Tp, _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

Private Types

typedef _GLIBCXX_STD::map<
_Key, _Tp, _Compare, _Allocator > 		_Base
typedef __gnu_debug::_Safe_sequence<
map > 		_Safe_base

Private Member Functions

void _M_invalidate_all ()

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
class __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >

Member Typedef Documentation

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _GLIBCXX_STD::map<_Key, _Tp, _Compare, _Allocator> __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::_Base [private]
 

Definition at line 46 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef __gnu_debug::_Safe_sequence<map> __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::_Safe_base [private]
 

Definition at line 47 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _Allocator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::allocator_type
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 55 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator, map> __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_iterator
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 62 of file debug/map.h.

Referenced by __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::begin(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::end(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::equal_range(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::find(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::lower_bound(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::upper_bound().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _Allocator::const_pointer __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_pointer
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 67 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _Allocator::const_reference __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_reference
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 57 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef std::reverse_iterator<const_iterator> __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_reverse_iterator
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 69 of file debug/map.h.

Referenced by __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::rbegin(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::rend().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _Base::difference_type __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::difference_type
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 65 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef __gnu_debug::_Safe_iterator<typename _Base::iterator, map> __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::iterator
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 60 of file debug/map.h.

Referenced by __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::begin(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::end(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::equal_range(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::find(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::insert(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::lower_bound(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::upper_bound().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _Compare __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::key_compare
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 54 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _Key __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::key_type
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 51 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _Tp __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::mapped_type
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 52 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _Allocator::pointer __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::pointer
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 66 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _Allocator::reference __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::reference
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 56 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef std::reverse_iterator<iterator> __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::reverse_iterator
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 68 of file debug/map.h.

Referenced by __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::rbegin(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::rend().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef _Base::size_type __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::size_type
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 64 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
typedef std::pair<const _Key, _Tp> __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::value_type
 

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 53 of file debug/map.h.

Constructor & Destructor Documentation

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
__gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::map (  const _Compare &  __comp = _Compare(),
const _Allocator &  __a = _Allocator()
)  [inline, explicit]
 

Definition at line 74 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
template<typename _InputIterator>
__gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::map (  _InputIterator  __first,
_InputIterator  __last,
const _Compare &  __comp = _Compare(),
const _Allocator &  __a = _Allocator()
)  [inline]
 

Definition at line 79 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
__gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::map (  const map< _Key, _Tp, _Compare, _Allocator > &  __x  )  [inline]
 

Definition at line 85 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
__gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::map (  const _Base &  __x  )  [inline]
 

Definition at line 88 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
__gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::~map (   )  [inline]
 

Definition at line 90 of file debug/map.h.

Member Function Documentation

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
const _Base& __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::_M_base (   )  const [inline]
 

Definition at line 268 of file debug/map.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
_Base& __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::_M_base (   )  [inline]
 

Definition at line 265 of file debug/map.h.

Referenced by __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::_M_invalidate_all(), __gnu_debug_def::operator!=(), __gnu_debug_def::operator==(), __gnu_debug_def::operator>(), and __gnu_debug_def::operator>=().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
void __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::_M_invalidate_all (   )  [inline, private]
 

Definition at line 272 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::_M_base(), __gnu_debug::_Safe_sequence< map< _Key, _Tp, _Compare, _Allocator > >::_M_invalidate_if(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::end().

Referenced by __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::operator=().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
const_iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::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 from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 110 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_iterator.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::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 from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 106 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::iterator.

Referenced by __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::clear(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::rend().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
void __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::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 from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 210 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::begin(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::end(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::erase().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
const_iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::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 from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 118 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_iterator.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::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 from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 114 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::iterator.

Referenced by __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::_M_invalidate_all(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::clear(), __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::erase(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::rbegin().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
std::pair<const_iterator,const_iterator> __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::equal_range (  const key_type &  __x  )  const [inline]
 

Finds a subsequence matching given key.

Parameters:
x Key of (key, value) pairs to be located.
Returns:
Pair of read-only (constant) iterators that possibly points to the subsequence matching given key.
This function is equivalent to 
    std::make_pair(c.lower_bound(val),
                   c.upper_bound(val))
(but is faster than making the calls separately).

This function probably only makes sense for multimaps.

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 255 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_iterator, std::pair< _T1, _T2 >::first, std::make_pair(), and std::pair< _T1, _T2 >::second.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
std::pair<iterator,iterator> __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::equal_range (  const key_type &  __x  )  [inline]
 

Finds a subsequence matching given key.

Parameters:
x Key of (key, value) pairs to be located.
Returns:
Pair of iterators that possibly points to the subsequence matching given key.
This function is equivalent to 
    std::make_pair(c.lower_bound(val),
                   c.upper_bound(val))
(but is faster than making the calls separately).

This function probably only makes sense for multimaps.

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 245 of file debug/map.h.

References std::pair< _T1, _T2 >::first, __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::iterator, std::make_pair(), and std::pair< _T1, _T2 >::second.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
void __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::erase (  iterator  __first,
iterator  __last
)  [inline]
 

Erases a [first,last) range of elements from a map.

Parameters:
first Iterator pointing to the start of the range to be erased.
last Iterator pointing to the end of the range to be erased.
This function erases a sequence of elements from a map. Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 193 of file debug/map.h.

References __glibcxx_check_erase_range, and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::erase().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
size_type __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::erase (  const key_type &  __x  )  [inline]
 

Erases elements according to the provided key.

Parameters:
x Key of element to be erased.
Returns:
The number of elements erased.
This function erases all the elements located by the given key from a map. Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 179 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::end(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::find().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
void __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::erase (  iterator  __position  )  [inline]
 

Erases an element from a map.

Parameters:
position An iterator pointing to the element to be erased.
This function erases an element, pointed to by the given iterator, from a map. Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty.

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 171 of file debug/map.h.

References __glibcxx_check_erase.

Referenced by __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::clear(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::erase().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
const_iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::find (  const key_type &  __x  )  const [inline]
 

Tries to locate an element in a map.

Parameters:
x Key of (key, value) pair to be located.
Returns:
Read-only (constant) iterator pointing to sought-after element, or end() if not found.
This function takes a key and tries to locate the element with which the key matches. If successful the function returns a constant iterator pointing to the sought after pair. If unsuccessful it returns the past-the-end ( end() ) iterator.

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 223 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_iterator.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::find (  const key_type &  __x  )  [inline]
 

Tries to locate an element in a map.

Parameters:
x Key of (key, value) pair to be located.
Returns:
Iterator pointing to sought-after element, or end() if not found.
This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after pair. If unsuccessful it returns the past-the-end ( end() ) iterator.

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 219 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::iterator.

Referenced by __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::erase().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
template<typename _InputIterator>
void __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::insert (  _InputIterator  __first,
_InputIterator  __last
)  [inline]
 

A template function that attemps to insert a range of elements.

Parameters:
first Iterator pointing to the start of the range to be inserted.
last Iterator pointing to the end of the range.
Complexity similar to that of the range constructor.

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 164 of file debug/map.h.

References __glibcxx_check_valid_range.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::insert (  iterator  __position,
const value_type &  __x
)  [inline]
 

Attempts to insert a std::pair into the map.

Parameters:
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).
Returns:
An iterator that points to the element with key of x (may or may not be the pair passed in).
This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does. Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.

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 from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 156 of file debug/map.h.

References __glibcxx_check_insert, and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::iterator.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
std::pair<iterator, bool> __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::insert (  const value_type &  __x  )  [inline]
 

Attempts to insert a std::pair into the map.

Parameters:
x Pair to be inserted (see std::make_pair for easy creation of pairs).
Returns:
A pair, of which the first element is an iterator that points to the possibly inserted pair, and the second is a bool that is true if the pair was actually inserted.
This function attempts to insert a (key, value) pair into the map. A map relies on unique keys and thus a pair is only inserted if its first element (the key) is not already present in the map.

Insertion requires logarithmic time.

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 147 of file debug/map.h.

References std::pair< _T1, _T2 >::first, __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::iterator, and std::pair< _T1, _T2 >::second.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
const_iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::lower_bound (  const key_type &  __x  )  const [inline]
 

Finds the beginning of a subsequence matching given key.

Parameters:
x Key of (key, value) pair to be located.
Returns:
Read-only (constant) iterator pointing to first element equal to or greater than key, or end().
This function returns the first element of a subsequence of elements that matches the given key. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists.

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 233 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_iterator.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::lower_bound (  const key_type &  __x  )  [inline]
 

Finds the beginning of a subsequence matching given key.

Parameters:
x Key of (key, value) pair to be located.
Returns:
Iterator pointing to first element equal to or greater than key, or end().
This function returns the first element of a subsequence of elements that matches the given key. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists.

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 229 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::iterator.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
map<_Key,_Tp,_Compare,_Allocator>& __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::operator= (  const map< _Key, _Tp, _Compare, _Allocator > &  __x  )  [inline]
 

Definition at line 93 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::_M_invalidate_all().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
const_reverse_iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::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 from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 126 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_reverse_iterator, and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::end().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
reverse_iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::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 from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 122 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::end(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::reverse_iterator.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
const_reverse_iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::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 from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 134 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::begin(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_reverse_iterator.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
reverse_iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::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 from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 130 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::begin(), and __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::reverse_iterator.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
void __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::swap (  map< _Key, _Tp, _Compare, _Allocator > &  __x  )  [inline]
 

Definition at line 203 of file debug/map.h.

References __gnu_debug::_Safe_sequence_base::_M_swap().

Referenced by __gnu_debug_def::swap().

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
const_iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::upper_bound (  const key_type &  __x  )  const [inline]
 

Finds the end of a subsequence matching given key.

Parameters:
x Key of (key, value) pair to be located.
Returns:
Read-only (constant) iterator pointing to first iterator greater than key, or end().

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 241 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::const_iterator.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
iterator __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::upper_bound (  const key_type &  __x  )  [inline]
 

Finds the end of a subsequence matching given key.

Parameters:
x Key of (key, value) pair to be located.
Returns:
Iterator pointing to the first element greater than key, or end().

Reimplemented from _GLIBCXX_STD::map< _Key, _Tp, _Compare, _Allocator >.

Definition at line 237 of file debug/map.h.

References __gnu_debug_def::map< _Key, _Tp, _Compare, _Allocator >::iterator.

The documentation for this class was generated from the following file:
Generated on Tue Jan 30 17:32:06 2007 for GNU C++ STL by doxygen 1.3.6