std::equal

 

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)

 

Algorithm Bibliothek

Funktionen Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Nicht-modifizierende Sequenz Operationen Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
Modifizierende Sequenz Operationen Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
Partitionierungsoperationen Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
Sortierung Operationen (auf sortierten Bereiche) Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
Binary Suchaktionen (auf sortierten Bereiche) Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
Set-Operationen (auf sortierten Bereiche) Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Heap-Operationen Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
Minimum / Maximum Operationen Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
Numerische Operationen Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
C-Bibliothek Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

definiert in Header <algorithm>
template<class InputIt1, class InputIt2 > bool equal( InputIt1 first1, InputIt1 last1,             InputIt2 first2 );	(1)
template<class InputIt1, class InputIt2, class BinaryPredicate > bool equal( InputIt1 first1, InputIt1 last1,             InputIt2 first2, BinaryPredicate p );	(2)

Versandkosten true wenn die Elemente gleich sind in zwei Bereiche: ein durch [first1, last1) und anderen ab first2 definiert. Die erste Version der Funktion verwendet operator==, um die Elemente zu vergleichen, verwendet die zweite die gegebenen binären Prädikats p .

Original:

Returns true if the elements are the same in two ranges: one defined by [first1, last1) and another starting at first2. The first version of the function uses operator== to compare the elements, the second uses the given binary predicate p.

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

Parameter

first1, last1	-	der erste Bereich von den Elementen zu vergleichen Original: the first range of the elements to compare The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
first2	-	beginnend von dem zweiten Bereich von den Elementen zu vergleichen Original: beginning of the second range of the elements to compare The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
p	-	binary predicate which returns ​true if the elements should be treated as equal. The signature of the predicate function should be equivalent to the following:  bool pred(const Type1 &a, const Type2 &b); The signature does not need to have const&, but the function must not modify the objects passed to it. The types  Type1 and  Type2 must be such that objects of types InputIt1 and InputIt2 can be dereferenced and then implicitly converted to  Type1 and  Type2 respectively. ​
Type requirements
- InputIt1, InputIt2 must meet the requirements of InputIterator.

Rückgabewert

true wenn die Elemente in den beiden Bereichen gleich sind

Original:

true if the elements in the two ranges are equal

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

Notes

std::equal nicht verwendet, um die Bereiche von den Iteratoren aus std::unordered_set, std::unordered_multiset, std::unordered_map oder std::unordered_multimap gebildet vergleichen werden, da die Reihenfolge, in welcher die Elemente in diesen Behältern gelagert werden können unterschiedlich sein, selbst wenn die beiden Behälter die gleichen Elemente zu speichern .

Original:

std::equal may not be used to compare the ranges formed by the iterators from std::unordered_set, std::unordered_multiset, std::unordered_map, or std::unordered_multimap because the order in which the elements are stored in those containers may be different even if the two containers store the same elements.

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

{{{1}}}

Original:

{{{2}}}

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

Komplexität

An den meisten last1 - first1 Anwendungen des Prädikats

Original:

At most last1 - first1 applications of the predicate

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

Mögliche Implementierung

First version
template<class InputIt1, class InputIt2>bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2){for(; first1 != last1;++first1, ++first2){if(!(*first1 ==*first2)){returnfalse;}}returntrue;}
Second version
template<class InputIt1, class InputIt2, class BinaryPredicate>bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p){for(; first1 != last1;++first1, ++first2){if(!p(*first1, *first2)){returnfalse;}}returntrue;}

Beispiel

Der folgende Code verwendet equal() zu testen, ob ein String ein Palindrom

Original:

The following code uses equal() to test if a string is a palindrome

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

#include <iostream>#include <algorithm>#include <string>   void test(conststd::string& s){if(std::equal(s.begin(), s.begin()+ s.size()/2, s.rbegin())){std::cout<<"\""<< s <<"\" is a palindrome\n";}else{std::cout<<"\""<< s <<"\" is not palindrome\n";}}int main(){ test("radar"); test("hello");}

Output:

"radar" is a palindrome "hello" is not palindrome

find find_if find_if_not (C++11)	Findet das erste Elemente, welches bestimmte Kriterien erfüllt (Funktions-Template)
lexicographical_compare	wahr, wenn ein Bereich ist lexikographisch kleiner als der andere Original: returns true if one range is lexicographically less than another The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (Funktions-Template)
mismatch	Findet die erste Position, an der sich zwei Bereiche unterscheiden (Funktions-Template)
search	searches for a range of elements (Funktions-Template)