The Wayback Machine - https://web.archive.org/web/20180207113634/http://ja.cppreference.com:80/w/cpp/algorithm/copy_backward
名前空間
変種
    操作

      std::copy_backward

      提供: cppreference.com
      < cpp‎ | algorithm

      このページは、Google 翻訳を使って英語版から機械翻訳されました。

      翻訳には誤りや奇妙な言い回しがあるかもしれません。文章の上にポインタをおくと、元の文章が見れます。誤りを修正して翻訳を改善する手助けをしてください。翻訳についての説明は、ここをクリックしてください。

      このページの英語版を見るにはここをクリックしてください

       
      C++
       
      アルゴリズムライブラリ
      機能します
      Original:
      Functions
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      シーケンス動作を非改変
      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.
      シーケンス動作を変更する
      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.
      操作を仕切る
      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.
      （ソートされた範囲で）ソート操作
      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.
      バイナリ検索操作（ソート範囲で）
      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.
      （ソートされた範囲で）操作を設定します
      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.
      ヒープ操作
      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.
      最小値/最大値操作
      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.
      数値演算
      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.
      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.
       
      Defined in header <algorithm>
      template<class BidirIt1, class BidirIt2 >
      BidirIt2 copy_backward( BidirIt1 first, BidirIt1 last, BidirIt2 d_last );
      [first, last)で終わる別の範囲に、d_lastによって定義され、範囲から要素をコピーします。要素は、（最後の要素が最初にコピーされます）逆の順序でコピーされますが、それらの相対的な順序は保持されます.
      Original:
      Copies the elements from the range, defined by [first, last), to another range ending at d_last. The elements are copied in reverse order (the last element is copied first), but their relative order is preserved.
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      目次

      [編集]パラメータ

      first, last -
      コピーする要素の範囲
      Original:
      the range of the elements to copy
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      d_last -
      目的の範囲の終わり。 d_lastが[first, last)内であれば、std::copyはstd::copy_backwardの代わりに使用する必要があります.
      Original:
      end of the destination range. If d_last is within [first, last), std::copy must be used instead of std::copy_backward.
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      型の要件
      -
      BidirIt は BidirectionalIterator

      の要求を満足しなければなりません。

      [編集]値を返します

      コピーされた最後の要素を指すイテレータ.
      Original:
      iterator to the last element copied.
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      [編集]複雑性

      まさにlast - first割り当て.
      Original:
      Exactly last - first assignments.
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      [編集]可能な実装

      template<class BidirIt1, class BidirIt2 > BidirIt2 copy_backward(BidirIt1 first, BidirIt1 last, BidirIt2 d_last){while(first != last){*(--d_last)=*(--last);}return d_last;}

      [編集]例

      このコードを実行します
      #include <algorithm>#include <iostream>   int main(){std::vector<int> from_vector;for(int i =0; i <10; i++){ from_vector.push_back(i);}   std::vector<int> to_vector(15);   std::copy_backward(from_vector.begin(), from_vector.end(), to_vector.end());   std::cout<<"to_vector contains: ";for(unsignedint i =0; i < to_vector.size(); i++){std::cout<< to_vector[i]<<" ";}}

      出力: 

      to_vector contains: 0 0 0 0 0 0 1 2 3 4 5 6 7 8 9

      [編集]参照


      (C++11)
      新しい場所に要素の範囲をコピーします
      Original:
      copies a range of elements to a new location
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      (関数テンプレート)[edit]
      「http://ja.cppreference.com/mwiki/index.php?title=cpp/algorithm/copy_backward&oldid=28758」から取得
      close