std::equal

 

C++

Langage

Concepts

Bibliothèque d'utilitaires

Bibliothèque pour les chaînes de caractères

Bibliothèque de conteneurs

Bibliothèque d'algorithmes

Bibliothèque d'itérateurs

Bibliothèque pour le calcul numérique

Bibliothèque pour les entrées/sorties

Bibliothèque pour la régionalisation

Bibliothèque pour les expressions régulières (C++11)

Bibliothèque pour les opérations atomiques (C++11)

Bibliothèque pour les processus légers (threads) (C++11)

 

Bibliothèque d'algorithmes

Fonctions Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Non-modification de la séquence des opérations 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
Modification de la séquence des opérations 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
Des opérations de partitionnement 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)
Opérations de tri (sur les gammes triés) 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
Opérations binaires de recherche (sur les gammes triés) 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
Définir les opérations (sur les gammes triés) 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
Opérations Heap 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 de fonctionnement 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
Opérations numériques 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
Bibliothèque C 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

 

Déclaré dans l'en-tête <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)

Retours true si les éléments sont les mêmes dans les deux gammes: l'une définie par [first1, last1) et un autre à partir de first2. La première version de la fonction utilise operator== de comparer les éléments, la seconde utilise le prédicat binaire donné 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.

Paramètres

first1, last1	-	la première plage des éléments de comparaison 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	-	au début de la seconde plage des éléments de comparaison 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.

Retourne la valeur

true si les éléments dans les deux gammes sont égaux

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 peut pas être utilisé pour comparer les intervalles formés par les itérateurs de std::unordered_set, std::unordered_multiset, std::unordered_map, ou std::unordered_multimap parce que l'ordre dans lequel les éléments sont stockés dans les récipients peuvent être différents, même si les deux récipients stocker les mêmes éléments .

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.

Complexité

Tout au plus last1 - first1 applications du prédicat

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.

Mise en œuvre possible

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;}

Exemple

Le code suivant utilise equal() pour tester si une chaîne est un palindrome

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");}

Résultat :

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

find find_if find_if_not (C++11)	trouve le premier élément répondant à des critères spécifiques Original: finds the first element satisfying specific criteria The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction générique)
lexicographical_compare	renvoie vrai si une plage est lexicographiquement inférieur à un autre 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. (fonction générique)
mismatch	trouve la première position dans laquelle deux plages différentes Original: finds the first position where two ranges differ The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction générique)
search	recherches pour une série d'éléments Original: searches for a range of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction générique)