operator=,!=(std::unordered_set)

 

C++

Linguaggio

Concetti

Libreria di Utilità

Stringhe

Contenitori

Algoritmi

Iteratori

Libreria matematca

Input/output

Localizzazione

Espressioni regolari(C++11)

Operazioni atomicche(C++11)

Multithreading(C++11)

 

Contenitori libreria

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

Membri funzioni 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_set::unordered_set

unordered_set::~unordered_set

unordered_set::operator=

unordered_set::get_allocator

Iteratori 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_set::begin unordered_set::cbegin

unordered_set::end unordered_set::cend

Capacità 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_set::erase

unordered_set::size

unordered_set::max_size

Modificatori 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_set::clear

unordered_set::insert

unordered_set::emplace

unordered_set::emplace_hint

unordered_set::erase

unordered_set::swap

Lookup 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_set::count

unordered_set::find

unordered_set::equal_range

Benna interfaccia 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_set::begin2

unordered_set::end2

unordered_set::bucket_count

unordered_set::max_bucket_count

unordered_set::bucket_size

unordered_set::bucket

Politica di 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_set::load_factor

unordered_set::max_load_factor

unordered_set::rehash

unordered_set::reserve

Osservatori 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_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)

Confronta il contenuto di due contenitori non ordinata.

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.

Il contenuto di due contenitori non ordinata lhs e rhs sono equivalenti se le seguenti condizioni contenere:

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()
• ogni gruppo di tasti equivalenti [lhs_eq1, lhs_eq2) ha un corrispondente gruppo di tasti equivalenti della [rhs_eq1, rhs_eq2) altro contenitore, che ha le seguenti proprietà:

  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.

Parametri

lhs, rhs

-

non ordinato contenitori da confrontare 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.

Valore di ritorno

1)

true se il contenuto dei contenitori sono equivalenti, false altrimenti

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 se il contenuto dei contenitori non sono equivalenti, false altrimenti

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.

Complessità

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