typedef Key key_type

typedef Type mapped_type

typedef pair< const Key, Type > 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

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.

typedef Rb_tree< key_type, value_type, Select1st< value_type >, key_compare, Alloc > Rep_type

Rep_type M_t

class value_compare

A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time.

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 map.

Default constructor creates no elements.

Definition at line 147 of file map.

Default constructor creates no elements.

Definition at line 155 of file map.

Map copy constructor.

Parameters: x A map of identical element and allocator types.

The newly-created map uses a copy of the allocation object used by x.

Definition at line 165 of file map.

Builds a map from a range.

Parameters: first An input iterator.

last An input iterator.

Create a map consisting of copies of the elements from [first,last). This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(first,last)).

Definition at line 178 of file map.

Builds a map from a range.

Parameters: first An input iterator.

last An input iterator.

comp A comparison functor.

a An allocator object.

Create a map consisting of copies of the elements from [first,last). This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(first,last)).

Definition at line 194 of file map.

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, Type, Compare, Allocator >.

Definition at line 243 of file map.

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, Type, Compare, Allocator >.

Definition at line 234 of file map.

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, Type, Compare, Allocator >.

Definition at line 464 of file map.

Finds the number of elements with given key.

Parameters: x Key of (key, value) pairs to be located.

Returns: Number of elements with specified key.

This function only makes sense for multimaps; for map the result will either be 0 (not present) or 1 (present).

Definition at line 524 of file map.

Returns true if the map is empty. (Thus begin() would equal end().)

Definition at line 304 of file map.

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, Type, Compare, Allocator >.

Definition at line 260 of file map.

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, Type, Compare, Allocator >.

Definition at line 251 of file map.

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 in __gnu_debug_def::map< Key, Type, Compare, Allocator >.

Definition at line 612 of file map.

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 in __gnu_debug_def::map< Key, Type, Compare, Allocator >.

Definition at line 593 of file map.

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.

Definition at line 439 of file map.

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 in __gnu_debug_def::map< Key, Type, Compare, Allocator >.

Definition at line 424 of file map.

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.

Definition at line 409 of file map.

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 in __gnu_debug_def::map< Key, Type, Compare, Allocator >.

Definition at line 512 of file map.

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 in __gnu_debug_def::map< Key, Type, Compare, Allocator >.

Definition at line 497 of file map.

Get a copy of the memory allocation object.

Definition at line 224 of file map.

Referenced by std::map< Key, Type, Compare, Allocator >::get_allocator().

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 in __gnu_debug_def::map< Key, Type, Compare, Allocator >.

Definition at line 396 of file map.

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).

Definition at line 383 of file map.

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 in __gnu_debug_def::map< Key, Type, Compare, Allocator >.

Definition at line 359 of file map.

Returns the key comparison object out of which the map was constructed.

Definition at line 473 of file map.

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 in __gnu_debug_def::map< Key, Type, Compare, Allocator >.

Definition at line 554 of file map.

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 in __gnu_debug_def::map< Key, Type, Compare, Allocator >.

Definition at line 539 of file map.

Returns the maximum size of the map.

Definition at line 314 of file map.

Map assignment operator.

Parameters: x A map of identical element and allocator types.

All the elements of x are copied, but unlike the copy constructor, the allocator object is not copied.

Definition at line 216 of file map.

Subscript ( [] ) access to map data.

Parameters: k The key for which data should be retrieved.

Returns: A reference to the data of the (key,data) pair.

Allows for easy lookup with the 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 map.

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, Type, Compare, Allocator >.

Definition at line 278 of file map.

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, Type, Compare, Allocator >.

Definition at line 269 of file map.

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, Type, Compare, Allocator >.

Definition at line 296 of file map.

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, Type, Compare, Allocator >.

Definition at line 287 of file map.

Returns the size of the map.

Definition at line 309 of file map.

Swaps data with another map.

Parameters: x A map of the same element and allocator types.

This exchanges the elements between two maps in constant time. (It is only swapping a pointer, an integer, and an instance of the 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 map.

Referenced by std::swap().

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 in __gnu_debug_def::map< Key, Type, Compare, Allocator >.

Definition at line 574 of file map.

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 in __gnu_debug_def::map< Key, Type, Compare, Allocator >.

Definition at line 564 of file map.

Returns a value comparison object, built from the key comparison object out of which the map was constructed.

Definition at line 481 of file map.