tmp/tmp2opmtwa5/{from.md → to.md}
RENAMED
|
@@ -31,11 +31,11 @@ boyer_moore_searcher(RandomAccessIterator1 pat_first,
|
|
| 31 |
Hash hf = Hash(),
|
| 32 |
BinaryPredicate pred = BinaryPredicate());
|
| 33 |
```
|
| 34 |
|
| 35 |
*Preconditions:* The value type of `RandomAccessIterator1` meets the
|
| 36 |
-
*Cpp17DefaultConstructible*,
|
| 37 |
*Cpp17CopyAssignable* requirements.
|
| 38 |
|
| 39 |
Let `V` be `iterator_traits<RandomAccessIterator1>::value_type`. For any
|
| 40 |
two values `A` and `B` of type `V`, if `pred(A, B) == true`, then
|
| 41 |
`hf(A) == hf(B)` is `true`.
|
|
|
|
| 31 |
Hash hf = Hash(),
|
| 32 |
BinaryPredicate pred = BinaryPredicate());
|
| 33 |
```
|
| 34 |
|
| 35 |
*Preconditions:* The value type of `RandomAccessIterator1` meets the
|
| 36 |
+
*Cpp17DefaultConstructible*, *Cpp17CopyConstructible*, and
|
| 37 |
*Cpp17CopyAssignable* requirements.
|
| 38 |
|
| 39 |
Let `V` be `iterator_traits<RandomAccessIterator1>::value_type`. For any
|
| 40 |
two values `A` and `B` of type `V`, if `pred(A, B) == true`, then
|
| 41 |
`hf(A) == hf(B)` is `true`.
|