std::unique_copy
提供: cppreference.com
 | このページは、Google 翻訳を使って英語版から機械翻訳されました。 翻訳には誤りや奇妙な言い回しがあるかもしれません。文章の上にポインタをおくと、元の文章が見れます。誤りを修正して翻訳を改善する手助けをしてください。翻訳についての説明は、ここをクリックしてください。 |
ヘッダ <algorithm> で定義 | ||
template<class InputIt, class OutputIt > ForwardIt unique_copy( InputIt first, InputIt last, | (1) | |
template<class InputIt, class OutputIt, class BinaryPredicate > ForwardIt unique_copy( InputIt first, InputIt last, | (2) | |
全く連続した等しい要素が存在しないような方法で
[first, last)から始まる別の範囲に、範囲d_firstから要素をコピーします。のみ等しい要素の各グループの最初の要素がコピーされます。最初のバージョンは、要素を比較するoperator==使用して、2番目のバージョンは、指定されたバイナリ述語pを使用しています.Original:
Copies the elements from the range
[first, last), to another range beginning at d_first in such a way that there are no consecutive equal elements. Only the first element of each group of equal elements is copied. The first version uses operator== to compare the elements, the second version 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.
目次 |
[編集]パラメータ
| first, last | - | プロセスへの要素の範囲 Original: the range of elements to process The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| d_first | - | 目的の範囲の始まり Original: the beginning of the destination range 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. |
| 型の要件 | ||
-InputIt は InputIteratorの要求を満足しなければなりません。 | ||
-OutputIt は OutputIteratorの要求を満足しなければなりません。 | ||
-The type of dereferenced InputIt must meet the requirements of CopyAssignable. | ||
-The type of dereferenced InputIt must meet the requirements of CopyConstructible. if neither InputIt nor OutputIt satisfies ForwardIterator | ||
[編集]値を返します
最後に書き込まれた要素過去の要素への出力イテレータ
Original:
Output iterator to the element past the last written element
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.
[編集]可能な実装
| First version |
|---|
template<class ForwardIt, class OutputIt> ForwardIt unique_copy(ForwardIt first, ForwardIt last, OutputIt d_first){ if(first == last)return d_first; *d_first =*first;while(++first != last){if(!(*d_first ==*first)){*(++d_first)=*first;}}return++d_first;} |
| Second version |
template<class ForwardIt, class OutputIt, class BinaryPredicate> ForwardIt unique_copy(ForwardIt first, ForwardIt last, OutputIt d_first, BinaryPredicate p){ if(first == last)return d_first; *d_first =*first;while(++first != last){if(!p(*result, *first)){*(++d_first)=*first;}}return++d_first;} |
[編集]例
次のプログラムのトリムconst文字列内のすべての連続する複数のスペースを、その結果を出力します
Original:
The following program trims all multiple consecutive spaces in a const string and prints the result
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 <string>#include <iostream>#include <algorithm>#include <iterator> int main(){std::string s1 ="The string with many spaces!";std::cout<<"before: "<< s1 <<'\n'; std::string s2; std::unique_copy(s1.begin(), s1.end(), std::back_inserter(s2), [](char c1, char c2){return c1 ==' '&& c2 ==' ';}); std::cout<<"after: "<< s2 <<'\n';}
出力:
before: The string with many spaces! after: The string with many spaces!
[編集]複雑性
firstlastとの間の距離の線形Original:
linear in the distance between
first and lastThe 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つの同一の（またはいくつかの他の関係）のアイテムを見つけることができます Original: finds two identical (or some other relationship) items adjacent to each other The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (関数テンプレート) | |
| ある範囲内で連続して重複している要素を取り除きます (関数テンプレート) | |
