<tbody>
</tbody>
| <unordered_map> 에 정의되어 있음.
|
||
template< class Key, class T, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator< std::pair<const Key, T> > > class unordered_map; |
(since C++11) | |
Unordered map 은 유일한 Key를 가지는 Key 와 Value 쌍으로 값으로 가지는 연관 컨테이너 이다. 검색, 삽입, 삭제에 일반적으로 상수 시간 복잡도를 가진다.
std::unordered_map meets the requirements of Container, AllocatorAwareContainer, UnorderedAssociativeContainer.
Member types
| Member type | Definition |
key_type
|
키
|
mapped_type
|
T
|
value_type
|
std::pair<const Key, T>
|
size_type
|
부호 없는 정수(unsigned int) 타입 (일반적으로 std::size_t) |
difference_type
|
부호 있는 정수(signed int) 타입 (보통 std::ptrdiff_t) |
hasher
|
Hash
|
key_equal
|
KeyEqual
|
allocator_type
|
할당자
|
reference
|
value_type&
|
const_reference
|
const value_type&
|
pointer
|
std::allocator_traits<Allocator>::pointer
|
const_pointer
|
std::allocator_traits<Allocator>::const_pointer
|
iterator
|
ForwardIterator
|
const_iterator
|
상수(constant) 양방향 반복자(iterator) |
local_iterator
|
An iterator type whose category, value, difference, pointer and reference types are the same as iterator. This iteratorcan be used to iterate through a single bucket but not across buckets |
const_local_iterator
|
An iterator type whose category, value, difference, pointer and reference types are the same as const_iterator. This iteratorcan be used to iterate through a single bucket but not across buckets |
Member functions
틀:cpp/container/dsc begin(int)틀:cpp/container/dsc end(int)unordered_map의 생성자이다. (public member function) | |
unordered_map의 소멸자이다. (public member function) | |
| 컨테이너에 값을 할당한다. (public member function) | |
| 연관된 할당자를 반환한다. (public member function) | |
Iterators | |
| 첫번째 원소로의 반복자(iterator)를 반환한다. (public member function) | |
| 마지막 원소로의 반복자(iterator)를 반환한다. (public member function) | |
Capacity | |
| 현재 컨테이너가 비어있는지 확인한다. (public member function) | |
| 원소의 개수를 반환한다. (public member function) | |
| 원소의 최대 개수를 반환한다. (public member function) | |
Modifiers | |
| 내용물을 모두 지운다. (public member function) | |
| 원소를 삽입한다. (public member function) | |
| 원소를 바로 만들어 삽입한다. (public member function) | |
| constructs elements in-place using a hint (public member function) | |
| 원소를 삭제한다 (public member function) | |
| 원소들을 서로 바꾼다 (public member function) | |
Lookup | |
| access specified element with bounds checking (public member function) | |
| 특정 원소에 접근한다 (public member function) | |
| 특정한 키와 동일한 요소의 수를 반환합니다. (public member function) | |
| 특정 키를 가진 요소를 찾는다. (public member function) | |
| returns range of elements matching a specific key (public member function) | |
Bucket interface | |
| returns the number of buckets (public member function) | |
| returns the maximum number of buckets (public member function) | |
| returns the number of elements in specific bucket (public member function) | |
| returns the bucket for specific key (public member function) | |
Hash policy | |
| returns average number of elements per bucket (public member function) | |
| manages maximum average number of elements per bucket (public member function) | |
| reserves at least the specified number of buckets. This regenerates the hash table. (public member function) | |
| reserves space for at least the specified number of elements. This regenerates the hash table. (public member function) | |
Observers | |
| returns function used to hash the keys (public member function) | |
| returns the function used to compare keys for equality (public member function) | |
Non-member functions
| compares the values in the unordered_map (function template) | |
| specializes the std::swap algorithm (function template) |