名前空間
変種
操作

std::unordered_map::operator[]

提供: cppreference.com

 
 
 
std::unordered_map
メンバ関数
Original:
Member functions
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_map::unordered_map
unordered_map::~unordered_map
unordered_map::operator=
unordered_map::get_allocator
イテレータ
Original:
Iterators
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_map::begin
unordered_map::cbegin
unordered_map::end
unordered_map::cend
容量
Original:
Capacity
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_map::erase
unordered_map::size
unordered_map::max_size
修飾子
Original:
Modifiers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_map::clear
unordered_map::insert
unordered_map::emplace
unordered_map::emplace_hint
unordered_map::erase
unordered_map::swap
ルック
Original:
Lookup
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_map::count
unordered_map::find
unordered_map::equal_range
バケットインターフェイス
Original:
Bucket interface
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_map::begin2
unordered_map::end2
unordered_map::bucket_count
unordered_map::max_bucket_count
unordered_map::bucket_size
unordered_map::bucket
ハッシュポリシー
Original:
Hash policy
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_map::load_factor
unordered_map::max_load_factor
unordered_map::rehash
unordered_map::reserve
オブザーバー
Original:
Observers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
unordered_map::hash_function
unordered_map::key_eq
 
T& operator[]( const Key& key );
(1) (C++11およびそれ以降)
T& operator[]( Key&& key );
(2) (C++11およびそれ以降)
挿入したキーおよびデフォルトを構築マップされた値としてkeyを使用してコンテナに新しい要素を、新しく構築されたマップされた値への参照を返します。キーkey持つ要素が既に存在する場合、挿入は行われませんし、そのマッピングされた値への参照が返されます.
Original:
Inserts a new element to the container using key as the key and default constructed mapped value and returns a reference to the newly constructed mapped value. If an element with key key already exists, no insertion is performed and a reference to its mapped value is returned.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
1)
本質的に(insert(std::make_pair(key, T())).first)->secondを行い.
Original:
Essentially performs (insert(std::make_pair(key, T())).first)->second.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
2)
本質的に(insert(std::make_pair(std::move(key), T())).first)->secondを行い.
Original:
Essentially performs (insert(std::make_pair(std::move(key), T())).first)->second.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

If an insertion occurs and results in a rehashing of the container, all iterators are invalidated. Otherwise iterators are not affected. References are not invalidated. Rehashing occurs only if the new number of elements is higher than max_load_factor()*bucket_count().

目次

[編集] パラメータ

key -
検索する要素のキー
Original:
the key of the element to find
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[編集] 値を返します

新しい要素のマッピングされた値への参照キーkey持つ要素が存在しなかった場合そうしないと、既存の要素のマッピングされた値への参照が返されます.
Original:
Reference to the mapped value of the new element if no element with key key existed. Otherwise a reference to the mapped value of the existing element is returned.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[編集] 複雑

Average case: constant, worst case: linear in size.

[編集]

[編集] も参照してください

指定された要素にアクセスします。境界チェックを行います。
(パブリックメンバ関数) [edit]

[編集]

文字列のベクトル内の各単語の出現回数をカウント.

Original:

Counts the occurrences of each word in a vector of strings.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

#include <string>
#include <iostream>
#include <vector>
#include <unordered_map>
 
int main()
{
    std::vector<std::string> words = { 
        "this", "sentence", "is", "not", "a", "sentence",
	"this", "sentence", "is", "a", "hoax" 
    };
 
    std::unordered_map<std::string,size_t>  word_map;
    for (auto w : words) {
        ++word_map[w];
    }
 
    for (auto elem : word_map) {
        std::cout << elem.second
	          << " occurrences of word '"
	          << elem.first << "'\n";
    }
}

Output:

1 occurrences of word 'hoax'
2 occurrences of word 'this'
2 occurrences of word 'a'
2 occurrences of word 'is'
1 occurrences of word 'not'
3 occurrences of word 'sentence'