tmp/tmp06qf_91m/{from.md → to.md}
RENAMED
|
@@ -0,0 +1,32 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#### General <a id="func.search.general">[[func.search.general]]</a>
|
| 2 |
+
|
| 3 |
+
Subclause [[func.search]] provides function object types
|
| 4 |
+
[[function.objects]] for operations that search for a sequence
|
| 5 |
+
\[`pat``first`, `pat_last`) in another sequence \[`first`, `last`) that
|
| 6 |
+
is provided to the object’s function call operator. The first sequence
|
| 7 |
+
(the pattern to be searched for) is provided to the object’s
|
| 8 |
+
constructor, and the second (the sequence to be searched) is provided to
|
| 9 |
+
the function call operator.
|
| 10 |
+
|
| 11 |
+
Each specialization of a class template specified in [[func.search]]
|
| 12 |
+
shall meet the *Cpp17CopyConstructible* and *Cpp17CopyAssignable*
|
| 13 |
+
requirements. Template parameters named
|
| 14 |
+
|
| 15 |
+
- `ForwardIterator`,
|
| 16 |
+
- `ForwardIterator1`,
|
| 17 |
+
- `ForwardIterator2`,
|
| 18 |
+
- `RandomAccessIterator`,
|
| 19 |
+
- `RandomAccessIterator1`,
|
| 20 |
+
- `RandomAccessIterator2`, and
|
| 21 |
+
- `BinaryPredicate`
|
| 22 |
+
|
| 23 |
+
of templates specified in [[func.search]] shall meet the same
|
| 24 |
+
requirements and semantics as specified in [[algorithms.general]].
|
| 25 |
+
Template parameters named `Hash` shall meet the *Cpp17Hash* requirements
|
| 26 |
+
([[cpp17.hash]]).
|
| 27 |
+
|
| 28 |
+
The Boyer-Moore searcher implements the Boyer-Moore search algorithm.
|
| 29 |
+
The Boyer-Moore-Horspool searcher implements the Boyer-Moore-Horspool
|
| 30 |
+
search algorithm. In general, the Boyer-Moore searcher will use more
|
| 31 |
+
memory and give better runtime performance than Boyer-Moore-Horspool.
|
| 32 |
+
|