tmp/tmpxxxbfixe/{from.md → to.md}
RENAMED
|
@@ -111,11 +111,11 @@ boyer_moore_searcher(RandomAccessIterator1 pat_first,
|
|
| 111 |
Hash hf = Hash(),
|
| 112 |
BinaryPredicate pred = BinaryPredicate());
|
| 113 |
```
|
| 114 |
|
| 115 |
*Preconditions:* The value type of `RandomAccessIterator1` meets the
|
| 116 |
-
*Cpp17DefaultConstructible*,
|
| 117 |
*Cpp17CopyAssignable* requirements.
|
| 118 |
|
| 119 |
Let `V` be `iterator_traits<RandomAccessIterator1>::value_type`. For any
|
| 120 |
two values `A` and `B` of type `V`, if `pred(A, B) == true`, then
|
| 121 |
`hf(A) == hf(B)` is `true`.
|
|
|
|
| 111 |
Hash hf = Hash(),
|
| 112 |
BinaryPredicate pred = BinaryPredicate());
|
| 113 |
```
|
| 114 |
|
| 115 |
*Preconditions:* The value type of `RandomAccessIterator1` meets the
|
| 116 |
+
*Cpp17DefaultConstructible*, *Cpp17CopyConstructible*, and
|
| 117 |
*Cpp17CopyAssignable* requirements.
|
| 118 |
|
| 119 |
Let `V` be `iterator_traits<RandomAccessIterator1>::value_type`. For any
|
| 120 |
two values `A` and `B` of type `V`, if `pred(A, B) == true`, then
|
| 121 |
`hf(A) == hf(B)` is `true`.
|