operator=,!=(std::unordered_set)

 

C++

Language

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

 

Containers library

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_set

Member functions

unordered_set::unordered_set

unordered_set::~unordered_set

unordered_set::operator=

unordered_set::get_allocator

Iterators

unordered_set::begin unordered_set::cbegin

unordered_set::end unordered_set::cend

Capacity

unordered_set::erase

unordered_set::size

unordered_set::max_size

Modifiers

unordered_set::clear

unordered_set::insert

unordered_set::emplace

unordered_set::emplace_hint

unordered_set::erase

unordered_set::swap

Lookup

unordered_set::count

unordered_set::find

unordered_set::equal_range

Bucket interface

unordered_set::begin(int)

unordered_set::end(int)

unordered_set::bucket_count

unordered_set::max_bucket_count

unordered_set::bucket_size

unordered_set::bucket

Hash policy

unordered_set::load_factor

unordered_set::max_load_factor

unordered_set::rehash

unordered_set::reserve

Observers

unordered_set::hash_function

unordered_set::key_eq

 

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

Compares the contents of two unordered containers.

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

• lhs.size() == rhs.size()
• 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:

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

Parameters

lhs, rhs

-

unordered containers to compare

Return value

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

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

Complexity

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