operator=,!=(std::unordered_map)

 

C++

Язык

Понятия (концепции)

Утилиты

Строки

Контейнеры

Алгоритмы

Итераторы

Работа с числами

Ввод / вывод

Локализация

Регулярные выражения (C++11)

Атомарные примитивы (C++11)

Потоки (C++11)

 

Контейнеры

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

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

Hash политики 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

 

template< class Key, class T, class Hash, class KeyEqual, class Allocator > void operator=( unordered_map<Key,T,Hash,KeyEqual,Allocator> &lhs,                 unordered_map<Key,T,Hash,KeyEqual,Allocator> &rhs);	(1)
template< class Key, class T, class Hash, class KeyEqual, class Allocator > void operator!=( unordered_map<Key,T,Hash,KeyEqual,Allocator> &lhs,                  unordered_map<Key,T,Hash,KeyEqual,Allocator> &rhs);	(2)

Сравнивает содержимое двух неупорядоченных контейнеров.

Original:

Compares the contents of two unordered containers.

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

Содержимое двух контейнеров неупорядоченный lhs и rhs эквивалентны, если выполняются следующие условия:

Original:

The contents of two unordered containers lhs and rhs are equivalent if the following conditions hold:

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

• lhs.size() == rhs.size()
• каждая группа эквивалентных ключей [lhs_eq1, lhs_eq2) имеет соответствующую группу эквивалентных ключей в других [rhs_eq1, rhs_eq2) контейнер, который имеет следующие свойства:

  Original:

  each group of equivalent keys [lhs_eq1, lhs_eq2) has a corresponding group of equivalent keys in the other container [rhs_eq1, rhs_eq2), that has the following properties:

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

• std::distance(lhs_eq1, lhs_eq2) == std::distance(rhs_eq1, rhs_eq2).
• std::is_permutation(lhs_eq1, lhs_eq2, rhs_eq1) == true.

Параметры

lhs, rhs

-

неупорядоченных контейнеров для сравнения Original: unordered containers to compare The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.

Возвращаемое значение

1)

true если содержимое контейнера эквивалентны, false иначе

Original:

true if the contents of the containers are equivalent, false otherwise

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

2)

true если содержимое контейнера не эквивалентны, false иначе

Original:

true if the contents of the containers are not equivalent, false otherwise

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

Сложность

N comparisons of the keys in the average case, N² in the worst case, where N is the size of the container.