---
name: "std::tr1::unordered_map"
section: "3"
platform: "linux"
package: "libstdc++6-4.1-doc"
version: "4.1.1-21"
release: "Debian 4.0 (Etch)"
platforms: ["linux"]
url: "https://new.carta.tech/std::tr1::unordered_map"
---

# std::tr1::unordered\_map(3)

## NAME

std::tr1::unordered\_map -

## SYNOPSIS

Inherits **hashtable\< Key, std::pair\< Key, T \>, Alloc, Internal::extract1st\< std::pair\< Key, T \> \>, Pred, Hash, Internal::mod\_range\_hashing, Internal::default\_ranged\_hash, Internal::prime\_rehash\_policy, cache\_hash\_code, false, true \>**.

## Detailed Description

### template\<class Key, class T, class Hash = hash\<Key\>, class Pred = std::equal\_to\<Key\>, class Alloc = std::allocator\<std::pair\<const Key, T\> \>, bool cache\_hash\_code = false\> class std::tr1::unordered\_map\< Key, T, Hash, Pred, Alloc, cache\_hash\_code \>

Definition at line 55 of file unordered\_map.

### Public Types

typedef **Base::allocator\_type** **allocator\_type**\
 typedef **Internal::hashtable\_const\_iterator**\< **value\_type**, constant\_iterators, cache\_hash\_code \> **const\_iterator**\
 typedef **Internal::node\_const\_iterator**\< **value\_type**, constant\_iterators, cache\_hash\_code \> **const\_local\_iterator**\
 typedef Allocator::const\_reference **const\_reference**\
 typedef Allocator::difference\_type **difference\_type**\
 typedef Base::hasher **hasher**\
 typedef **Internal::hashtable\_iterator**\< **value\_type**, constant\_iterators, cache\_hash\_code \> **iterator**\
 typedef **Base::key\_equal** **key\_equal**\
 typedef Key **key\_type**\
 typedef **Internal::node\_iterator**\< **value\_type**, constant\_iterators, cache\_hash\_code \> **local\_iterator**\
 typedef Allocator::reference **reference**\
 typedef **Base::size\_type** **size\_type**\
 typedef Value **value\_type**\

### Public Member Functions

**const\_local\_iterator** **begin** (**size\_type** n) const\
 **local\_iterator** **begin** (**size\_type** n)\
 **const\_iterator** **begin** () const\
 **iterator** **begin** ()\
 **size\_type** **bucket** (const **key\_type** &k) const\
 **size\_type** **bucket\_count** () const\
 **size\_type** **bucket\_size** (**size\_type** n) const\
 void **clear** ()\
 **size\_type** **count** (const **key\_type** &k) const\
 bool **empty** () const\
 **const\_local\_iterator** **end** (**size\_type**) const\
 **local\_iterator** **end** (**size\_type**)\
 **const\_iterator** **end** () const\
 **iterator** **end** ()\
 **std::pair**\< **const\_iterator**, **const\_iterator** \> **equal\_range** (const **key\_type** &k) const\
 **std::pair**\< **iterator**, **iterator** \> **equal\_range** (const **key\_type** &k)\
 **const\_iterator** **erase** (**const\_iterator**, **const\_iterator**)\
 **iterator** **erase** (**iterator**, **iterator**)\
 **size\_type** **erase** (const **key\_type** &)\
 **const\_iterator** **erase** (**const\_iterator**)\
 **iterator** **erase** (**iterator**)\
 **const\_iterator** **find** (const **key\_type** &k) const\
 **iterator** **find** (const **key\_type** &k)\
 **allocator\_type** **get\_allocator** () const\
 template\<typename InIter\> void **insert** (InIter first, InIter last)\
 **const\_iterator** **insert** (**const\_iterator**, const **value\_type** &v)\
 **iterator** **insert** (**iterator**, const **value\_type** &v)\
 Insert\_Return\_Type **insert** (const **value\_type** &v)\
 **key\_equal** **key\_eq** () const\
 float **load\_factor** () const\
 **size\_type** **max\_bucket\_count** () const\
 **size\_type** **max\_size** () const\
 void **rehash** (**size\_type** n)\
 void **rehash\_policy** (const RehashPolicy &)\
 const RehashPolicy & **rehash\_policy** () const\
 **size\_type** **size** () const\
 void **swap** (**hashtable** &)\
 template\<typename InputIterator\> **unordered\_map** (InputIterator f, InputIterator l, **size\_type** n=10, const **hasher** &hf=**hasher**(), const **key\_equal** &eql=**key\_equal**(), const **allocator\_type** &a=**allocator\_type**())\
 **unordered\_map** (**size\_type** n=10, const **hasher** &hf=**hasher**(), const **key\_equal** &eql=**key\_equal**(), const **allocator\_type** &a=**allocator\_type**())\

### Friends

struct **Internal::map\_base**\

## Author

Generated automatically by Doxygen for libstdc++ from the source code.