Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/algorithm/search"

From cppreference.com
< cpp‎ | algorithm
m (Example: std → str)
m (Added the BinaryPredicate requirement.)
 
(12 intermediate revisions by 4 users not shown)
Line 2: Line 2:
 
{{cpp/algorithm/navbar}}
 
{{cpp/algorithm/navbar}}
 
{{dcl begin}}
 
{{dcl begin}}
{{dcl header | algorithm}}
+
{{dcl header|algorithm}}
{{dcl rev multi | num=1 | until1=c++20 |dcl1=
+
{{dcla|num=1|notes={{mark constexpr since c++20}}|
 
template< class ForwardIt1, class ForwardIt2 >
 
template< class ForwardIt1, class ForwardIt2 >
 
ForwardIt1 search( ForwardIt1 first, ForwardIt1 last,
 
ForwardIt1 search( ForwardIt1 first, ForwardIt1 last,
 
                   ForwardIt2 s_first, ForwardIt2 s_last );
 
                   ForwardIt2 s_first, ForwardIt2 s_last );
|dcl2=
 
template< class ForwardIt1, class ForwardIt2 >
 
constexpr ForwardIt1 search( ForwardIt1 first, ForwardIt1 last,
 
                            ForwardIt2 s_first, ForwardIt2 s_last );
 
 
}}
 
}}
{{dcl | num=2 | since=c++17 |1=
+
{{dcl|num=2|since=c++17|
 
template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2 >
 
template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2 >
 
ForwardIt1 search( ExecutionPolicy&& policy,
 
ForwardIt1 search( ExecutionPolicy&& policy,
Line 18: Line 14:
 
                   ForwardIt2 s_first, ForwardIt2 s_last );
 
                   ForwardIt2 s_first, ForwardIt2 s_last );
 
}}
 
}}
{{dcl rev multi | num=3 | until1=c++20 |dcl1=
+
{{dcla|num=3|notes={{mark constexpr since c++20}}|
template< class ForwardIt1, class ForwardIt2, class BinaryPredicate >
+
template< class ForwardIt1, class ForwardIt2, class BinaryPred >
 
ForwardIt1 search( ForwardIt1 first, ForwardIt1 last,
 
ForwardIt1 search( ForwardIt1 first, ForwardIt1 last,
 
                   ForwardIt2 s_first, ForwardIt2 s_last,
 
                   ForwardIt2 s_first, ForwardIt2 s_last,
                   BinaryPredicate p );
+
                   BinaryPred p );
|dcl2=
+
template< class ForwardIt1, class ForwardIt2, class BinaryPredicate >
+
constexpr ForwardIt1 search( ForwardIt1 first, ForwardIt1 last,
+
                            ForwardIt2 s_first, ForwardIt2 s_last,
+
                            BinaryPredicate p );
+
 
}}
 
}}
{{dcl | num=4 | since=c++17 |1=
+
{{dcl|num=4|since=c++17|
 
template< class ExecutionPolicy,
 
template< class ExecutionPolicy,
           class ForwardIt1, class ForwardIt2, class BinaryPredicate >
+
           class ForwardIt1, class ForwardIt2, class BinaryPred >
 
ForwardIt1 search( ExecutionPolicy&& policy,
 
ForwardIt1 search( ExecutionPolicy&& policy,
 
                   ForwardIt1 first, ForwardIt1 last,
 
                   ForwardIt1 first, ForwardIt1 last,
 
                   ForwardIt2 s_first, ForwardIt2 s_last,
 
                   ForwardIt2 s_first, ForwardIt2 s_last,
                   BinaryPredicate p );
+
                   BinaryPred p );
 
}}
 
}}
{{dcl rev multi | num=5 | since1=c++17 | until1=c++20 |dcl1=
+
{{dcl|num=5|since=c++17|notes={{mark constexpr since c++20}}|
 
template< class ForwardIt, class Searcher >
 
template< class ForwardIt, class Searcher >
 
ForwardIt search( ForwardIt first, ForwardIt last,
 
ForwardIt search( ForwardIt first, ForwardIt last,
 
                   const Searcher& searcher );
 
                   const Searcher& searcher );
 
|dcl2=
 
template< class ForwardIt, class Searcher >
 
constexpr ForwardIt search( ForwardIt first, ForwardIt last,
 
                            const Searcher& searcher );
 
 
}}
 
}}
 
{{dcl end}}
 
{{dcl end}}
  
@1-4@ Searches for the first occurrence of the sequence of elements {{tt|[s_first, s_last)}} in the range {{tt|[first, last)}}.
+
@1-4@ Searches for the first occurrence of the sequence of elements {{range|s_first|s_last}} in the range {{range|first|last}}.
:@1@ Elements are compared using {{tt|operator{{==}}}}.
+
:@1@ Elements are compared using {{c/core|1=operator==}}.
:@3@ Elements are compared using the given binary predicate {{tt|p}}.
+
:@3@ Elements are compared using the given binary predicate {{c|p}}.
:@2,4@ Same as {{v|1,3}}, but executed according to {{tt|policy}}. {{cpp/algorithm/parallel overload precondition|plural=true}}
+
:@2,4@ Same as {{v|1,3}}, but executed according to {{c|policy}}.
@5@ Searches the sequence {{math|[first, last)}} for the pattern specified in the constructor of {{tt|searcher}}. Effectively executes {{c|return searcher(first, last).first;}}.  {{tt|Searcher}} need not be {{named req|CopyConstructible}}.  
+
:@@ {{cpp/algorithm/parallel overload precondition|plural=yes}}
 +
 
 +
@5@ Searches the range {{range|first|last}} for the pattern specified in the constructor of {{c|searcher}}.
  
 
{{rrev|since=c++17|
 
{{rrev|since=c++17|
 
The standard library provides the following searchers:
 
The standard library provides the following searchers:
 
{{dsc begin}}
 
{{dsc begin}}
{{dsc inc | cpp/utility/functional/dsc default_searcher }}
+
{{dsc inc|cpp/utility/functional/dsc default_searcher}}
{{dsc inc | cpp/utility/functional/dsc boyer_moore_searcher }}
+
{{dsc inc|cpp/utility/functional/dsc boyer_moore_searcher}}
{{dsc inc | cpp/utility/functional/dsc boyer_moore_horspool_searcher }}
+
{{dsc inc|cpp/utility/functional/dsc boyer_moore_horspool_searcher}}
 
{{dsc end}}
 
{{dsc end}}
 
}}
 
}}
Line 66: Line 54:
 
===Parameters===
 
===Parameters===
 
{{par begin}}
 
{{par begin}}
{{par | first, last | the range of elements to examine}}
+
{{par|first, last|the range of elements to examine}}
{{par | s_first, s_last | the range of elements to search for}}
+
{{par|s_first, s_last|the range of elements to search for}}
 
{{par exec pol}}
 
{{par exec pol}}
{{par | searcher | the searcher encapsulating the search algorithm and the pattern to look for}}
+
{{par|searcher|the searcher encapsulating the search algorithm and the pattern to look for}}
{{par pred2 eq | p | p1=ForwardIt1 | p2=ForwardIt2}}
+
{{par pred2 eq|p|p1=ForwardIt1|p2=ForwardIt2}}
 
{{par hreq}}
 
{{par hreq}}
{{par req named | ForwardIt1, ForwardIt2 | ForwardIterator}}
+
{{par req named|ForwardIt1, ForwardIt2|ForwardIterator}}
{{par req named | Searcher | Searcher}}
+
{{par req named|BinaryPred|BinaryPredicate}}
 
{{par end}}
 
{{par end}}
  
 
===Return value===
 
===Return value===
@1-4@ Iterator to the beginning of first occurrence of the sequence {{tt|[s_first, s_last)}} in the range {{tt|[first, last)}}. If no such occurrence is found, {{tt|last}} is returned.<br>
+
@1-4@ Iterator to the beginning of first occurrence of the sequence {{range|s_first|s_last}} in the range {{range|first|last}}. If no such occurrence is found, {{c|last}} is returned.
{{rev inl|since=c++11|If {{tt|[s_first, s_last)}} is empty, {{tt|first}} is returned.}}
+
@@ If {{range|s_first|s_last}} is empty, {{c|first}} is returned.
  
@5@ Returns the result of {{tt|searcher.operator()}}, that is, an iterator to the location at which the substring is found or a copy of {{tt|last}} if it was not found.
+
@5@ {{c|searcher(first, last).first}}.
  
 
===Complexity===
 
===Complexity===
@1-4@ At most {{tt|S*N}} comparisons where {{c|S {{=}} std::distance(s_first, s_last)}} and {{c|N {{=}} std::distance(first, last)}}.
+
@1-4@ Given {{mathjax-or|\(\scriptsize N\)|N}} as {{c|std::distance(first, last)}} and {{mathjax-or|\(\scriptsize S\)|S}} as {{c|std::distance(s_first, s_last)}}:
@5@ Depends on the searcher
+
:@1,2@ At most {{mathjax-or|\(\scriptsize N\cdot S\)|N&middot;S}} comparisons using {{c/core|1=operator==}}.
 +
:@3,4@ At most {{mathjax-or|\(\scriptsize N\cdot S\)|N&middot;S}} applications of the predicate {{c|p}}.
 +
@5@ Depends on {{c|searcher}}.
  
 
===Exceptions===
 
===Exceptions===
{{cpp/algorithm/parallel_exceptions_reporting_behavior|singular=no}}
+
{{cpp/algorithm/parallel exceptions reporting behavior|singular=no}}
  
 
===Possible implementation===
 
===Possible implementation===
 
+
{{eq impl
{{eq fun | 1=
+
|title1=search (1)|ver1=1|1=
 
template<class ForwardIt1, class ForwardIt2>
 
template<class ForwardIt1, class ForwardIt2>
constexpr ForwardIt1 search(ForwardIt1 first, ForwardIt1 last,
+
constexpr //< since C++20
                            ForwardIt2 s_first, ForwardIt2 s_last)
+
ForwardIt1 search(ForwardIt1 first, ForwardIt1 last,
 +
                  ForwardIt2 s_first, ForwardIt2 s_last)
 
{
 
{
     while (1) {
+
     while (true)
 +
    {
 
         ForwardIt1 it = first;
 
         ForwardIt1 it = first;
         for (ForwardIt2 s_it = s_first; ; ++it, ++s_it) {
+
         for (ForwardIt2 s_it = s_first; ; ++it, ++s_it)
             if (s_it == s_last) return first;
+
        {
             if (it == last) return last;
+
             if (s_it == s_last)
             if (!(*it == *s_it)) break;
+
                return first;
 +
             if (it == last)
 +
                return last;
 +
             if (!(*it == *s_it))
 +
                break;
 
         }
 
         }
 
         ++first;
 
         ++first;
 
     }
 
     }
 
}
 
}
| 2=
+
|title2=search (3)|ver2=3|2=
template<class ForwardIt1, class ForwardIt2, class BinaryPredicate>
+
template<class ForwardIt1, class ForwardIt2, class BinaryPred>
constexpr ForwardIt1 search(ForwardIt1 first, ForwardIt1 last,
+
constexpr //< since C++20
                            ForwardIt2 s_first, ForwardIt2 s_last,  
+
ForwardIt1 search(ForwardIt1 first, ForwardIt1 last,
                            BinaryPredicate p)
+
                  ForwardIt2 s_first, ForwardIt2 s_last, BinaryPred p)
 
{
 
{
     while (1) {
+
     while (true)
 +
    {
 
         ForwardIt1 it = first;
 
         ForwardIt1 it = first;
         for (ForwardIt2 s_it = s_first; ; ++it, ++s_it) {
+
         for (ForwardIt2 s_it = s_first; ; ++it, ++s_it)
             if (s_it == s_last) return first;
+
        {
             if (it == last) return last;
+
             if (s_it == s_last)
             if (!p(*it, *s_it)) break;
+
                return first;
 +
             if (it == last)
 +
                return last;
 +
             if (!p(*it, *s_it))
 +
                break;
 
         }
 
         }
 
         ++first;
 
         ++first;
Line 125: Line 126:
  
 
===Example===
 
===Example===
{{example|
+
{{example
 
|code=
 
|code=
#include <string_view>
 
#include <functional>
 
 
#include <algorithm>
 
#include <algorithm>
#include <iostream>
+
#include <cassert>
 +
#include <functional>
 
#include <iomanip>
 
#include <iomanip>
 +
#include <iostream>
 +
#include <iterator>
 +
#include <string_view>
 
#include <vector>
 
#include <vector>
#include <string>
+
 
 
using namespace std::literals;
 
using namespace std::literals;
  
template <typename Container>
+
bool contains(const auto& cont, std::string_view s)
bool contains(const Container& cont, const std::string_view s)
+
 
{
 
{
 +
    // str.find() (or str.contains(), since C++23) can be used as well
 
     return std::search(cont.begin(), cont.end(), s.begin(), s.end()) != cont.end();
 
     return std::search(cont.begin(), cont.end(), s.begin(), s.end()) != cont.end();
 
}
 
}
Line 144: Line 147:
 
int main()
 
int main()
 
{
 
{
     const auto str {"why waste time learning, when ignorance is instantaneous?"s};
+
     const auto str{"why waste time learning, when ignorance is instantaneous?"sv};
 
+
     assert(contains(str, "learning"));
     // str.find() (or str.contains(), since C++23) can be used as well
+
    assert(not contains(str, "lemming"));
    std::cout << std::boolalpha << contains(str, "learning") << '\n'  // true
+
   
                                << contains(str, "lemming") << '\n'; // false
+
     const std::vector vec(str.begin(), str.end());
 
+
     assert(contains(vec, "learning"));
     const std::vector<char> vec(str.begin(), str.end());
+
    assert(not contains(vec, "leaning"));
     std::cout << contains(vec, "learning") << '\n'  // true
+
   
              << contains(vec, "leaning") << '\n'; // false
+
 
+
 
     // The C++17 overload with searchers demo:
 
     // The C++17 overload with searchers demo:
     constexpr auto haystack {
+
     constexpr auto quote
 +
    {
 
         "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed "
 
         "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed "
 
         "do eiusmod tempor incididunt ut labore et dolore magna aliqua"sv
 
         "do eiusmod tempor incididunt ut labore et dolore magna aliqua"sv
 
     };
 
     };
 
+
   
     for (auto const& needle: {"pisci"s, "Pisci"s})
+
     for (const auto word : {"pisci"sv, "Pisci"sv})
 
     {
 
     {
         const auto it = std::search(haystack.begin(), haystack.end(),
+
        std::cout << "The string " << std::quoted(word) << ' ';
                                    std::boyer_moore_searcher(needle.begin(),
+
         const std::boyer_moore_searcher searcher(word.begin(), word.end());
                                                              needle.end()));
+
        const auto it = std::search(quote.begin(), quote.end(), searcher);
         std::cout << "The string " << std::quoted(needle) << ' ';
+
         if (it == quote.end())
        it == haystack.end()
+
             std::cout << "not found\n";
             ? std::cout << "not found\n"
+
        else
             : std::cout << "found at offset " << it - haystack.begin() << '\n';
+
             std::cout << "found at offset " << std::distance(quote.begin(), it) << '\n';
 
     }
 
     }
 
}
 
}
 
|output=
 
|output=
true
 
false
 
true
 
false
 
 
The string "pisci" found at offset 43
 
The string "pisci" found at offset 43
 
The string "Pisci" not found
 
The string "Pisci" not found
 
}}
 
}}
 +
 +
===Defect reports===
 +
{{dr list begin}}
 +
{{dr list item|wg=lwg|dr=1205|std=C++98|before=the return value was unclear if {{range|s_first|s_last}} is empty|after=returns {{c|first}} in this case}}
 +
{{dr list item|wg=lwg|dr=1338|std=C++98|before=the resolution of {{lwg|1205}} was incorrectly applied,<br>making {{c|first}} to be returned if no occurence is found|after=returns {{c|last}} in this case}}
 +
{{dr list item|wg=lwg|dr=2150|std=C++98|before=the condition of “sequence occurence” was incorrect|after=corrected}}
 +
{{dr list end}}
  
 
===See also===
 
===See also===
 
{{dsc begin}}
 
{{dsc begin}}
{{dsc inc | cpp/algorithm/dsc find_end}}
+
{{dsc inc|cpp/algorithm/dsc find_end}}
{{dsc inc | cpp/algorithm/dsc includes}}
+
{{dsc inc|cpp/algorithm/dsc includes}}
{{dsc inc | cpp/algorithm/dsc equal}}
+
{{dsc inc|cpp/algorithm/dsc equal}}
{{dsc inc | cpp/algorithm/dsc find}}
+
{{dsc inc|cpp/algorithm/dsc find}}
{{dsc inc | cpp/algorithm/dsc lexicographical_compare}}
+
{{dsc inc|cpp/algorithm/dsc lexicographical_compare}}
{{dsc inc | cpp/algorithm/dsc mismatch}}
+
{{dsc inc|cpp/algorithm/dsc mismatch}}
{{dsc inc | cpp/algorithm/dsc search_n}}
+
{{dsc inc|cpp/algorithm/dsc search_n}}
{{dsc inc | cpp/utility/functional/dsc default_searcher }}
+
{{dsc inc|cpp/utility/functional/dsc default_searcher}}
{{dsc inc | cpp/utility/functional/dsc boyer_moore_searcher }}
+
{{dsc inc|cpp/utility/functional/dsc boyer_moore_searcher}}
{{dsc inc | cpp/utility/functional/dsc boyer_moore_horspool_searcher }}
+
{{dsc inc|cpp/utility/functional/dsc boyer_moore_horspool_searcher}}
{{dsc inc | cpp/algorithm/ranges/dsc search}}
+
{{dsc inc|cpp/algorithm/ranges/dsc search}}
 
{{dsc end}}
 
{{dsc end}}
  
 
{{langlinks|de|es|fr|it|ja|pt|ru|zh}}
 
{{langlinks|de|es|fr|it|ja|pt|ru|zh}}

Latest revision as of 21:46, 25 March 2024

 
 
Algorithm library
Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy, ranges::sort, ...
Execution policies (C++17)
Non-modifying sequence operations
Batch operations
(C++17)
Search operations
(C++11)                (C++11)(C++11)

Modifying sequence operations
Copy operations
(C++11)
(C++11)
Swap operations
Transformation operations
Generation operations
Removing operations
Order-changing operations
(until C++17)(C++11)
(C++20)(C++20)
Sampling operations
(C++17)

Sorting and related operations
Partitioning operations
Sorting operations
Binary search operations
(on partitioned ranges)
Set operations (on sorted ranges)
Merge operations (on sorted ranges)
Heap operations
Minimum/maximum operations
(C++11)
(C++17)
Lexicographical comparison operations
Permutation operations
C library
Numeric operations
Operations on uninitialized memory
 
Defined in header <algorithm>
template< class ForwardIt1, class ForwardIt2 >

ForwardIt1 search( ForwardIt1 first, ForwardIt1 last,

                   ForwardIt2 s_first, ForwardIt2 s_last );
(1) (constexpr since C++20)
template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2 >

ForwardIt1 search( ExecutionPolicy&& policy,
                   ForwardIt1 first, ForwardIt1 last,

                   ForwardIt2 s_first, ForwardIt2 s_last );
(2) (since C++17)
template< class ForwardIt1, class ForwardIt2, class BinaryPred >

ForwardIt1 search( ForwardIt1 first, ForwardIt1 last,
                   ForwardIt2 s_first, ForwardIt2 s_last,

                   BinaryPred p );
(3) (constexpr since C++20)
template< class ExecutionPolicy,

          class ForwardIt1, class ForwardIt2, class BinaryPred >
ForwardIt1 search( ExecutionPolicy&& policy,
                   ForwardIt1 first, ForwardIt1 last,
                   ForwardIt2 s_first, ForwardIt2 s_last,

                   BinaryPred p );
(4) (since C++17)
template< class ForwardIt, class Searcher >

ForwardIt search( ForwardIt first, ForwardIt last,

                  const Searcher& searcher );
(5) (since C++17)
(constexpr since C++20)
1-4) Searches for the first occurrence of the sequence of elements [s_firsts_last) in the range [firstlast).
1) Elements are compared using operator==.
3) Elements are compared using the given binary predicate p.
2,4) Same as (1,3), but executed according to policy.
These overloads participate in overload resolution only if

std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is true.

(until C++20)

std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> is true.

(since C++20)
5) Searches the range [firstlast) for the pattern specified in the constructor of searcher.

The standard library provides the following searchers:

standard C++ library search algorithm implementation
(class template) [edit]
Boyer-Moore search algorithm implementation
(class template) [edit]
Boyer-Moore-Horspool search algorithm implementation
(class template) [edit]
(since C++17)

Contents

[edit] Parameters

first, last - the range of elements to examine
s_first, s_last - the range of elements to search for
policy - the execution policy to use. See execution policy for details.
searcher - the searcher encapsulating the search algorithm and the pattern to look for
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);

While the signature does not need to have const &, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) Type1 and Type2 regardless of value category (thus, Type1 & is not allowed, nor is Type1 unless for Type1 a move is equivalent to a copy(since C++11)).
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. ​

Type requirements
-
ForwardIt1, ForwardIt2 must meet the requirements of LegacyForwardIterator.
-
BinaryPred must meet the requirements of BinaryPredicate.

[edit] Return value

1-4) Iterator to the beginning of first occurrence of the sequence [s_firsts_last) in the range [firstlast). If no such occurrence is found, last is returned.
If [s_firsts_last) is empty, first is returned.
5) searcher(first, last).first.

[edit] Complexity

1-4) Given N as std::distance(first, last) and S as std::distance(s_first, s_last):
1,2) At most N·S comparisons using operator==.
3,4) At most N·S applications of the predicate p.
5) Depends on searcher.

[edit] Exceptions

The overloads with a template parameter named ExecutionPolicy report errors as follows:

  • If execution of a function invoked as part of the algorithm throws an exception and ExecutionPolicy is one of the standard policies, std::terminate is called. For any other ExecutionPolicy, the behavior is implementation-defined.
  • If the algorithm fails to allocate memory, std::bad_alloc is thrown.

[edit] Possible implementation

search (1)
template<class ForwardIt1, class ForwardIt2>
constexpr //< since C++20
ForwardIt1 search(ForwardIt1 first, ForwardIt1 last,
                  ForwardIt2 s_first, ForwardIt2 s_last)
{
    while (true)
    {
        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;
        }
        ++first;
    }
}
search (3)
template<class ForwardIt1, class ForwardIt2, class BinaryPred>
constexpr //< since C++20
ForwardIt1 search(ForwardIt1 first, ForwardIt1 last,
                  ForwardIt2 s_first, ForwardIt2 s_last, BinaryPred p)
{
    while (true)
    {
        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;
        }
        ++first;
    }
}

[edit] Example

#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <string_view>
#include <vector>
 
using namespace std::literals;
 
bool contains(const auto& cont, std::string_view s)
{
    // str.find() (or str.contains(), since C++23) can be used as well
    return std::search(cont.begin(), cont.end(), s.begin(), s.end()) != cont.end();
}
 
int main()
{
    const auto str{"why waste time learning, when ignorance is instantaneous?"sv};
    assert(contains(str, "learning"));
    assert(not contains(str, "lemming"));
 
    const std::vector vec(str.begin(), str.end());
    assert(contains(vec, "learning"));
    assert(not contains(vec, "leaning"));
 
    // The C++17 overload with searchers demo:
    constexpr auto quote
    {
        "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed "
        "do eiusmod tempor incididunt ut labore et dolore magna aliqua"sv
    };
 
    for (const auto word : {"pisci"sv, "Pisci"sv})
    {
        std::cout << "The string " << std::quoted(word) << ' ';
        const std::boyer_moore_searcher searcher(word.begin(), word.end());
        const auto it = std::search(quote.begin(), quote.end(), searcher);
        if (it == quote.end())
            std::cout << "not found\n";
        else
            std::cout << "found at offset " << std::distance(quote.begin(), it) << '\n';
    }
}

Output:

The string "pisci" found at offset 43
The string "Pisci" not found

[edit] Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

DR Applied to Behavior as published Correct behavior
LWG 1205 C++98 the return value was unclear if [s_firsts_last) is empty returns first in this case
LWG 1338 C++98 the resolution of LWG issue 1205 was incorrectly applied,
making first to be returned if no occurence is found
returns last in this case
LWG 2150 C++98 the condition of “sequence occurence” was incorrect corrected

[edit] See also

finds the last sequence of elements in a certain range
(function template) [edit]
returns true if one sequence is a subsequence of another
(function template) [edit]
determines if two sets of elements are the same
(function template) [edit]
finds the first element satisfying specific criteria
(function template) [edit]
returns true if one range is lexicographically less than another
(function template) [edit]
finds the first position where two ranges differ
(function template) [edit]
searches for the first occurrence of a number consecutive copies of an element in a range
(function template) [edit]
standard C++ library search algorithm implementation
(class template) [edit]
Boyer-Moore search algorithm implementation
(class template) [edit]
Boyer-Moore-Horspool search algorithm implementation
(class template) [edit]
searches for the first occurrence of a range of elements
(niebloid)[edit]