operator=,!=(std::unordered_set)

 

C++

Sprache

Concepts

Utilities-Bibliothek

Strings Bibliothek

Container-Bibliothek

Algorithmen-Bibliothek

Iteratoren Bibliothek

Numerik-Bibliothek

Input / Output-Bibliothek

Lokalisierungen Bibliothek

Reguläre Ausdrücke Bibliothek(C++11)

Atomare Operationen Bibliothek(C++11)

Thread Support-Bibliothek(C++11)

 

Container-Bibliothek

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-Funktionen 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

Iteratoren 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

Kapazität 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

Modifiers 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

Eimer Schnittstelle 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

Hash Politik 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

Beobachter 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)

Vergleicht den Inhalt von zwei ungeordnete Behälter .

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.

Der Inhalt von zwei ungeordnete Behälter lhs und rhs sind gleichwertig, wenn folgende Bedingungen erfüllt sind:

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()
• jede Gruppe von entsprechenden Tasten [lhs_eq1, lhs_eq2) hat eine entsprechende Gruppe von äquivalenten Schlüssel in den anderen Behälter [rhs_eq1, rhs_eq2), die die folgenden Eigenschaften hat:

  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.

Parameter

lhs, rhs

-

ungeordnete Behälter zu vergleichen 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.

Rückgabewert

1)

true wenn die Inhalte der Behälter äquivalent sind, false anders angegeben

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 wenn die Inhalte der Behälter nicht äquivalent sind, false anders angegeben

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.

Komplexität

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