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

      std::stable_sort

      提供: 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 RandomIt >
      void stable_sort( RandomIt first, RandomIt last );
      		 (1)
      template<class RandomIt, class Compare >
      void stable_sort( RandomIt first, RandomIt last, Compare comp );
      		 (2)
      昇順で範囲[first, last)内の要素を並べ替えます。等しい要素の順序は保持されることが保証されている。最初のバージョンは、要素を比較するoperator<使用して、2番目のバージョンは、指定された比較関数compを使用しています.
      Original:
      Sorts the elements in the range [first, last) in ascending order. The order of equal elements is guaranteed to be preserved. The first version uses operator< to compare the elements, the second version uses the given comparison function comp.
      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 elements to sort
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      comp - 比較関数. 最初の値が二つ目の値より小さい 場合、 ​trueを返します.

      比較関数のシグネチャは以下と同等でなければなりません.

       bool cmp(const Type1 &a, const Type2 &b);

      シグネチャはconstを含まなくても構いませんが, 比較関数は渡されたオブジェクトを変更してはなりません.
      The types Type1 and Type2 must be such that an object of type RandomIt can be dereferenced and then implicitly converted to both of them. ​

      型の要件
      -
      RandomIt は ValueSwappable and RandomAccessIterator。
      -
      The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.

      [編集]値を返します

      (なし)

      [編集]複雑性

      O(N·log2(N))、N =std::distance(first, last)のcmpアプリケーション。追加のメモリが利用可能であれば、複雑さがO(N·log(N)です.
      Original:
      O(N·log2(N)), where N =std::distance(first, last) applications of cmp. If additional memory is available, then the complexity is O(N·log(N).
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      [編集]ノート

      この関数は、一般的にstd::get_temporary_bufferを呼び出すことによって、ソートする配列と同じサイズの一時バッファを割り当てようとします。割り当てが失敗した場合は、あまり効率的なアルゴリズムが選ばれ.
      Original:
      This function attempts to allocate a temporary buffer equal in size to the sequence to be sorted, typically by calling std::get_temporary_buffer. If the allocation fails, the less efficient algorithm is chosen.
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      [編集]例

      This section is incomplete
      Reason: no example

      [編集]参照

      ソート範囲の最初のN要素
      Original:
      sorts the first N elements of a range
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      (関数テンプレート)[edit]
      昇順にソートする範囲
      Original:
      sorts a range into ascending order
      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/stable_sort&oldid=29169」から取得
      close