std::equal
提供: cppreference.com
 | このページは、Google 翻訳を使って英語版から機械翻訳されました。 翻訳には誤りや奇妙な言い回しがあるかもしれません。文章の上にポインタをおくと、元の文章が見れます。誤りを修正して翻訳を改善する手助けをしてください。翻訳についての説明は、ここをクリックしてください。 |
Defined in header <algorithm> | ||
template<class InputIt1, class InputIt2 > bool equal( InputIt1 first1, InputIt1 last1, | (1) | |
template<class InputIt1, class InputIt2, class BinaryPredicate > bool equal( InputIt1 first1, InputIt1 last1, | (2) | |
戻りtrue要素は、2つの範囲で同じである場合は、次のいずれかを
[first1, last1)によって定義され、別のfirst2始まる。関数の最初のバージョンは要素を比較するoperator==使用し、2番目は、指定されたバイナリ述語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.
You can help to correct and verify the translation. Click here for instructions.
目次 |
[編集]パラメータ
| first1, last1 | - | 比較する最初の要素の範囲 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 | - | 比較する要素の第2の範囲の始まり 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. |
| 型の要件 | ||
-InputIt1, InputIt2 は InputIteratorの要求を満足しなければなりません。 | ||
[編集]値を返します
true2つの範囲の要素が等しいかどうか
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.
You can help to correct and verify the translation. Click here for instructions.
[編集]ノート
要素はこれらのコンテナに格納される順序は、2つのコンテナーは、同じ要素を格納する場合であっても異なることがあるので
std::equalはstd::unordered_set、std::unordered_multiset、std::unordered_map、またはstd::unordered_multimapからイテレータによって形成された範囲を比較するために使用することはできません. 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.
You can help to correct and verify the translation. Click here for instructions.
平等のために全体のコンテナを比較した場合、演算子==が通常は好ましい.
Original:
When comparing entire containers for equality, operator== is usually preferred.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[編集]複雑性
せいぜい
last1 - 述語のfirst1アプリケーションOriginal:
At most
last1 - first1 applications of the predicateThe text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
[編集]可能な実装
| 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;} |
[編集]例
次のコードは、文字列が回文かどうかをテストするためにequal()を使用しています
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.
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");}
出力:
"radar" is a palindrome "hello" is not palindrome
(C++11) | 特定の条件を満たす最初の要素を検索します 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. (関数テンプレート) |
1範囲が別のより辞書式に小さい場合はtrueを返します 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. (関数テンプレート) | |
2の範囲が異なる最初の位置を見つけます 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. (関数テンプレート) | |
| ある範囲の要素を検索します (関数テンプレート) | |
