---
name: "__gnu_debug::def_multimap"
section: "3"
platform: "linux"
package: "libstdc++6-doc"
version: "3.4.6-5"
release: "Debian 4.0 (Etch)"
platforms: ["linux"]
url: "https://new.carta.tech/__gnu_debug::def_multimap"
---

# \_\_gnu\_debug::def\_multimap(3)

## NAME

\_\_gnu\_debug\_def::multimap -

## SYNOPSIS

Inherits **std::multimap\< Key, Type, Compare, Allocator \>**, and **\_\_gnu\_debug::Safe\_sequence\< Sequence \>\< \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \> \>**.

### 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**, **multimap** \> **iterator**\
 typedef **\_\_gnu\_debug::Safe\_iterator**\< typename **Base::const\_iterator**, **multimap** \> **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

**multimap** (const Compare &comp=Compare(), const Allocator &a=Allocator())\
 template\<typename InputIterator\> **multimap** (InputIterator first, InputIterator last, const Compare &comp=Compare(), const Allocator &a=Allocator())\
 **multimap** (const **multimap**\< Key, Type, Compare, Allocator \> &x)\
 **multimap** (const **Base** &x)\
 **~multimap** ()\
 **multimap**\< Key, Type, Compare, Allocator \> & **operator=** (const **multimap**\< 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\
 **iterator** **insert** (const **value\_type** &x)\
 **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** (**multimap**\< Key, Type, Compare, Allocator \> &x)\
 void **clear** ()\
 **iterator** **find** (const **key\_type** &x)\
 *Tries to locate an element in a multimap.*  **const\_iterator** **find** (const **key\_type** &x) const\
 *Tries to locate an element in a multimap.*  **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\
 **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\
 **iterator** **insert** (const **value\_type** &x)\
 *Inserts a* **std::pair** *into the multimap.*  **iterator** **insert** (**iterator** position, const **value\_type** &x)\
 *Inserts a* **std::pair** *into the multimap.*  void **erase** (**iterator** position)\
 *Erases an element from a multimap.*  void **erase** (**iterator** first, **iterator** last)\
 *Erases a \[first,last) range of elements from a multimap.*  void **swap** (**multimap** &x)\
 *Swaps data with another multimap.*  **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.*  template\<typename Predicate\> void **M\_invalidate\_if** (Predicate pred)\
 template\<typename Iterator\> void **M\_transfer\_iter** (const Safe\_iterator\< Iterator, Sequence \> &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::multimap**\< Key, Type, Compare, Allocator \> **Base**\
 typedef **\_\_gnu\_debug::Safe\_sequence**\< **multimap** \> **Safe\_base**\

### Private Member Functions

void **M\_invalidate\_all** ()\

## Detailed Description

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> class \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>

Definition at line 42 of file debug/multimap.h.

## Member Function Documentation

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> iterator \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::begin ()` [inline]`

Returns a read/write iterator that points to the first pair in the multimap. Iteration is done in ascending order according to the keys.

Reimplemented from **std::multimap\< Key, Type, Compare, Allocator \>**.

Definition at line 104 of file debug/multimap.h.

Referenced by \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::clear(), and \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::rend().

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> const\_iterator \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::begin () const` [inline]`

Returns a read-only (constant) iterator that points to the first pair in the multimap. Iteration is done in ascending order according to the keys.

Reimplemented from **std::multimap\< Key, Type, Compare, Allocator \>**.

Definition at line 108 of file debug/multimap.h.

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> iterator \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::end ()` [inline]`

Returns a read/write iterator that points one past the last pair in the multimap. Iteration is done in ascending order according to the keys.

Reimplemented from **std::multimap\< Key, Type, Compare, Allocator \>**.

Definition at line 112 of file debug/multimap.h.

Referenced by \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::clear(), \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::M\_invalidate\_all(), and \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::rbegin().

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> const\_iterator \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::end () const` [inline]`

Returns a read-only (constant) iterator that points one past the last pair in the multimap. Iteration is done in ascending order according to the keys.

Reimplemented from **std::multimap\< Key, Type, Compare, Allocator \>**.

Definition at line 116 of file debug/multimap.h.

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> reverse\_iterator \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::rbegin ()` [inline]`

Returns a read/write reverse iterator that points to the last pair in the multimap. Iteration is done in descending order according to the keys.

Reimplemented from **std::multimap\< Key, Type, Compare, Allocator \>**.

Definition at line 120 of file debug/multimap.h.

References \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::end().

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> const\_reverse\_iterator \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::rbegin () const` [inline]`

Returns a read-only (constant) reverse iterator that points to the last pair in the multimap. Iteration is done in descending order according to the keys.

Reimplemented from **std::multimap\< Key, Type, Compare, Allocator \>**.

Definition at line 124 of file debug/multimap.h.

References \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::end().

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> reverse\_iterator \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::rend ()` [inline]`

Returns a read/write reverse iterator that points to one before the first pair in the multimap. Iteration is done in descending order according to the keys.

Reimplemented from **std::multimap\< Key, Type, Compare, Allocator \>**.

Definition at line 128 of file debug/multimap.h.

References \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::begin().

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> const\_reverse\_iterator \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::rend () const` [inline]`

Returns a read-only (constant) reverse iterator that points to one before the first pair in the multimap. Iteration is done in descending order according to the keys.

Reimplemented from **std::multimap\< Key, Type, Compare, Allocator \>**.

Definition at line 132 of file debug/multimap.h.

References \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::begin().

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> template\<typename InputIterator\> void \_\_gnu\_debug\_def::multimap\< Key, Type, 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 **std::multimap\< Key, Type, Compare, Allocator \>**.

Definition at line 154 of file debug/multimap.h.

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> size\_type \_\_gnu\_debug\_def::multimap\< Key, Type, 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 elements located by the given key from a multimap. 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 **std::multimap\< Key, Type, Compare, Allocator \>**.

Definition at line 169 of file debug/multimap.h.

References \_\_gnu\_debug::Safe\_iterator\< Iterator, Sequence \>::base(), \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::equal\_range(), std::pair\< T1, T2 \>::first, and std::pair\< T1, T2 \>::second.

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> void \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::clear ()` [inline]`

Erases all elements in a multimap. 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::multimap\< Key, Type, Compare, Allocator \>**.

Definition at line 201 of file debug/multimap.h.

References \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::begin(), \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::end(), and \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::erase().

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> iterator \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::find (const key\_type & x)` [inline]`

Tries to locate an element in a multimap.

**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 std::multimap\< Key, Type, Compare, Allocator \>.**

**Definition at line 210 of file debug/multimap.h.**

**References std::find().**

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> const\_iterator \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::find (const key\_type & x) const` [inline]`

**Tries to locate an element in a multimap.**

**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 std::multimap\< Key, Type, Compare, Allocator \>.**

**Definition at line 214 of file debug/multimap.h.**

**References std::find().**

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> iterator \_\_gnu\_debug\_def::multimap\< Key, Type, 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 std::multimap\< Key, Type, Compare, Allocator \>.**

**Definition at line 220 of file debug/multimap.h.**

**References std::lower\_bound().**

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> const\_iterator \_\_gnu\_debug\_def::multimap\< Key, Type, 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 the iterator will point to the next greatest element or, if no such greater element exists, to end().**

**Reimplemented from std::multimap\< Key, Type, Compare, Allocator \>.**

**Definition at line 224 of file debug/multimap.h.**

**References std::lower\_bound().**

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> iterator \_\_gnu\_debug\_def::multimap\< Key, Type, 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 std::multimap\< Key, Type, Compare, Allocator \>.**

**Definition at line 228 of file debug/multimap.h.**

**References std::upper\_bound().**

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> const\_iterator \_\_gnu\_debug\_def::multimap\< Key, Type, 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 std::multimap\< Key, Type, Compare, Allocator \>.**

**Definition at line 232 of file debug/multimap.h.**

**References std::upper\_bound().**

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> std::pair\<iterator,iterator\> \_\_gnu\_debug\_def::multimap\< Key, Type, 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).**

**Reimplemented from std::multimap\< Key, Type, Compare, Allocator \>.**

**Definition at line 236 of file debug/multimap.h.**

**References std::equal\_range(), std::pair\< T1, T2 \>::first, std::make\_pair(), and std::pair\< T1, T2 \>::second.**

**Referenced by \_\_gnu\_debug\_def::multimap\< Key, Type, Compare, Allocator \>::erase().**

### template\<typename Key, typename Type, typename Compare = std::less\<Key\>, typename Allocator = std::allocator\<std::pair\<const Key, Type\> \>\> std::pair\<const\_iterator,const\_iterator\> \_\_gnu\_debug\_def::multimap\< Key, Type, 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).**

**Reimplemented from std::multimap\< Key, Type, Compare, Allocator \>.**

**Definition at line 246 of file debug/multimap.h.**

**References std::equal\_range(), std::pair\< T1, T2 \>::first, std::make\_pair(), and std::pair\< T1, T2 \>::second.**

### allocator\_type std::multimap\< Key , Type , Compare , Allocator \>::get\_allocator () const` [inline, inherited]`

**Get a copy of the memory allocation object.**

**Definition at line 241 of file stl\_multimap.h.**

**References std::multimap\< Key, Type, Compare, Alloc \>::get\_allocator().**

### bool std::multimap\< Key , Type , Compare , Allocator \>::empty () const` [inline, inherited]`

**Returns true if the multimap is empty.**

**Definition at line 320 of file stl\_multimap.h.**

### size\_type std::multimap\< Key , Type , Compare , Allocator \>::size () const` [inline, inherited]`

**Returns the size of the multimap.**

**Definition at line 325 of file stl\_multimap.h.**

### size\_type std::multimap\< Key , Type , Compare , Allocator \>::max\_size (void) const` [inline, inherited]`

**Returns the maximum size of the multimap.**

**Definition at line 330 of file stl\_multimap.h.**

### iterator std::multimap\< Key , Type , Compare , Allocator \>::insert (const value\_type & x)` [inline, inherited]`

**Inserts a std::pair into the multimap.**

**Parameters:**

*x* **Pair to be inserted (see std::make\_pair for easy creation of pairs).**

**Returns:**

**An iterator that points to the inserted (key,value) pair.**

**This function inserts a (key, value) pair into the multimap. Contrary to a std::map the multimap does not rely on unique keys and thus multiple pairs with the same key can be inserted.**

**Insertion requires logarithmic time.**

**Definition at line 347 of file stl\_multimap.h.**

### iterator std::multimap\< Key , Type , Compare , Allocator \>::insert (iterator position, const value\_type & x)` [inline, inherited]`

**Inserts a std::pair into the multimap.**

**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 inserted (key,value) pair.**

**This function inserts a (key, value) pair into the multimap. Contrary to a std::map the multimap does not rely on unique keys and thus multiple pairs with the same key can be inserted. 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 371 of file stl\_multimap.h.**

### void std::multimap\< Key , Type , Compare , Allocator \>::erase (iterator position)` [inline, inherited]`

**Erases an element from a multimap.**

**Parameters:**

*position* **An iterator pointing to the element to be erased.**

**This function erases an element, pointed to by the given iterator, from a multimap. 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 398 of file stl\_multimap.h.**

### void std::multimap\< Key , Type , Compare , Allocator \>::erase (iterator first, iterator last)` [inline, inherited]`

**Erases a \[first,last) range of elements from a multimap.**

**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 multimap. 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.**

**Definition at line 428 of file stl\_multimap.h.**

### void std::multimap\< Key , Type , Compare , Allocator \>::swap (multimap\< Key, Type, Compare, Allocator \> & x)` [inline, inherited]`

**Swaps data with another multimap.**

**Parameters:**

*x* **A multimap of the same element and allocator types.**

**This exchanges the elements between two multimaps 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 443 of file stl\_multimap.h.**

### key\_compare std::multimap\< Key , Type , Compare , Allocator \>::key\_comp () const` [inline, inherited]`

**Returns the key comparison object out of which the multimap was constructed.**

**Definition at line 462 of file stl\_multimap.h.**

### value\_compare std::multimap\< Key , Type , Compare , Allocator \>::value\_comp () const` [inline, inherited]`

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

**Definition at line 470 of file stl\_multimap.h.**

### size\_type std::multimap\< Key , Type , Compare , Allocator \>::count (const key\_type & x) const` [inline, inherited]`

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

**Definition at line 510 of file stl\_multimap.h.**

### template\<typename Sequence\> template\<typename Predicate\> void \_\_gnu\_debug::Safe\_sequence\< Sequence \>::M\_invalidate\_if (Predicate pred)` [inherited]`

**Invalidates all iterators** `x` **that reference this sequence, are not singular, and for which** `pred(x)` **returns** `true`**. The user of this routine should be careful not to make copies of the iterators passed to** `pred`**, as the copies may interfere with the invalidation.**

**Definition at line 120 of file safe\_sequence.h.**

### template\<typename Sequence\> template\<typename Iterator\> void \_\_gnu\_debug::Safe\_sequence\< Sequence \>::M\_transfer\_iter (const Safe\_iterator\< Iterator, Sequence \> & x)` [inherited]`

**Transfers all iterators that reference this memory location to this sequence from whatever sequence they are attached to.**

**Definition at line 152 of file safe\_sequence.h.**

### void \_\_gnu\_debug::Safe\_sequence\_base::M\_detach\_all ()` [protected, inherited]`

**Detach all iterators, leaving them singular.**

**Definition at line 114 of file debug.cc.**

### void \_\_gnu\_debug::Safe\_sequence\_base::M\_detach\_singular ()` [protected, inherited]`

**Detach all singular iterators.**

**Postcondition:**

**for all iterators i attached to this sequence, i-\>M\_version == M\_version.**

**Definition at line 133 of file debug.cc.**

### void \_\_gnu\_debug::Safe\_sequence\_base::M\_revalidate\_singular ()` [protected, inherited]`

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

**Definition at line 154 of file debug.cc.**

### void \_\_gnu\_debug::Safe\_sequence\_base::M\_swap (Safe\_sequence\_base & x)` [protected, inherited]`

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

### void \_\_gnu\_debug::Safe\_sequence\_base::M\_invalidate\_all () const` [inline, inherited]`

**Invalidates all iterators.**

**Definition at line 202 of file safe\_base.h.**

## Member Data Documentation

### Safe\_iterator\_base\* \_\_gnu\_debug::Safe\_sequence\_base::M\_iterators` [inherited]`

**The list of mutable iterators that reference this container.**

**Definition at line 153 of file safe\_base.h.**

### Safe\_iterator\_base\* \_\_gnu\_debug::Safe\_sequence\_base::M\_const\_iterators` [inherited]`

**The list of constant iterators that reference this container.**

**Definition at line 156 of file safe\_base.h.**

### unsigned int \_\_gnu\_debug::Safe\_sequence\_base::M\_version` [mutable, inherited]`

**The container version number. This number may never be 0.**

**Definition at line 159 of file safe\_base.h.**

## Author

**Generated automatically by Doxygen for libstdc++-v3 Source from the source code.**