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

      std::search

      提供: 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 ForwardIt1, class ForwardIt2 >

      ForwardIt1 search( ForwardIt1 first, ForwardIt1 last,

                         ForwardIt2 s_first, ForwardIt2 s_last );
      		 (1)
      template<class ForwardIt1, class ForwardIt2, class BinaryPredicate >

      ForwardIt1 search( ForwardIt1 first, ForwardIt1 last,

                         ForwardIt2 s_first, ForwardIt2 s_last, BinaryPredicate p );
      		 (2)
      要素の最初の部分[s_first, s_last)範囲[first, last - (s_last - s_first))内を検索します。最初のバージョンは、要素を比較するoperator==使用して、2番目のバージョンは、指定されたバイナリ述語pを使用しています.
      Original:
      Searches for the first subsequence of elements [s_first, s_last) in the range [first, last - (s_last - s_first)). 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.

      目次

      [編集]パラメータ

      first, last -
      検討する要素の範囲
      Original:
      the range of elements to examine
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      s_first, s_last -
      検索する要素の範囲
      Original:
      the range of elements to search for
      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 ForwardIt1 and ForwardIt2 can be dereferenced and then implicitly converted to  Type1 and  Type2 respectively.

      ​

      型の要件
      -
      ForwardIt1, ForwardIt2 は ForwardIterator

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

      [編集]値を返します

      範囲内の最初の[s_first, s_last)サブシーケンス[first, last - (s_last - s_first))の先頭を指すイテレータ。そのような部分列が見つからない場合は、lastですreturned.
      Original:
      Iterator to the beginning of first subsequence [s_first, s_last) in the range [first, last - (s_last - s_first)). If no such subsequence is found, last is returned.
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.
      [s_first, s_last)が空の場合は、firstが返されます。 (C++11およびそれ以降)
      Original:
      If [s_first, s_last) is empty, first is returned. (C++11およびそれ以降)
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      [編集]複雑性

      最もS*N比較S =std::distance(s_first, s_last)とN =std::distance(first, last)..で
      Original:
      At most S*N comparisons where S =std::distance(s_first, s_last) and N =std::distance(first, last).
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      [編集]可能な実装

      First version 
      template<class ForwardIt1, class ForwardIt2> ForwardIt1 search(ForwardIt1 first, ForwardIt1 last, ForwardIt2 s_first, ForwardIt2 s_last){for(;;++first){ ForwardIt1 it = first;for(ForwardIt2 s_it = s_first;;++it, ++s_it){if(s_it == s_last){return first;}if(it == last){return last;}if(!(*it ==*s_it)){break;}}}}
      Second version 
      template<class ForwardIt1, class ForwardIt2, class BinaryPredicate> ForwardIt1 search(ForwardIt1 first, ForwardIt1 last, ForwardIt2 s_first, ForwardIt2 s_last, BinaryPredicate p){for(;;++first){ ForwardIt1 it = first;for(ForwardIt2 s_it = s_first;;++it, ++s_it){if(s_it == s_last){return first;}if(it == last){return last;}if(!p(*it, *s_it)){break;}}}}

      [編集]例

      This section is incomplete

      [編集]参照

      一定の範囲内にある要素の最後のシーケンスを見つけることができます
      Original:
      finds the last sequence of elements in a certain range
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      (関数テンプレート)[edit]
      要素の2セットが同じかどうかを判断します
      Original:
      determines if two sets of elements are the same
      The text has been machine-translated via Google Translate.
      You can help to correct and verify the translation. Click here for instructions.

      (関数テンプレート)[edit]


      (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.

      (関数テンプレート)[edit]
      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.

      (関数テンプレート)[edit]
      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.

      (関数テンプレート)[edit]
      範囲内の要素の数は連続したコピーを検索します
      Original:
      searches for a number consecutive copies of an element in 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]
      「http://ja.cppreference.com/mwiki/index.php?title=cpp/algorithm/search&oldid=29147」から取得
      close