tmp/tmptuiq5rgg/{from.md → to.md}
RENAMED
|
@@ -1,50 +0,0 @@
|
|
| 1 |
-
##### `basic_string::find_first_not_of` <a id="string.find.first.not.of">[[string.find.first.not.of]]</a>
|
| 2 |
-
|
| 3 |
-
``` cpp
|
| 4 |
-
size_type find_first_not_of(basic_string_view<charT, traits> sv,
|
| 5 |
-
size_type pos = 0) const noexcept;
|
| 6 |
-
```
|
| 7 |
-
|
| 8 |
-
*Effects:* Determines the lowest position `xpos`, if possible, such that
|
| 9 |
-
both of the following conditions hold:
|
| 10 |
-
|
| 11 |
-
- `pos <= xpos` and `xpos < size()`;
|
| 12 |
-
- `traits::eq(at(xpos), sv.at(I))` for no element `I` of the data
|
| 13 |
-
referenced by `sv`.
|
| 14 |
-
|
| 15 |
-
*Returns:* `xpos` if the function can determine such a value for `xpos`.
|
| 16 |
-
Otherwise, returns `npos`.
|
| 17 |
-
|
| 18 |
-
``` cpp
|
| 19 |
-
size_type find_first_not_of(const basic_string& str, size_type pos = 0) const noexcept;
|
| 20 |
-
```
|
| 21 |
-
|
| 22 |
-
*Effects:* Equivalent to:
|
| 23 |
-
|
| 24 |
-
``` cpp
|
| 25 |
-
return find_first_not_of(basic_string_view<charT, traits>(str), pos);
|
| 26 |
-
```
|
| 27 |
-
|
| 28 |
-
``` cpp
|
| 29 |
-
size_type find_first_not_of(const charT* s, size_type pos, size_type n) const;
|
| 30 |
-
```
|
| 31 |
-
|
| 32 |
-
*Returns:*
|
| 33 |
-
`find_first_not_of(basic_string_view<charT, traits>(s, n), pos)`.
|
| 34 |
-
|
| 35 |
-
``` cpp
|
| 36 |
-
size_type find_first_not_of(const charT* s, size_type pos = 0) const;
|
| 37 |
-
```
|
| 38 |
-
|
| 39 |
-
*Requires:* `s` points to an array of at least `traits::length(s) + 1`
|
| 40 |
-
elements of `charT`.
|
| 41 |
-
|
| 42 |
-
*Returns:*
|
| 43 |
-
`find_first_not_of(basic_string_view<charT, traits>(s), pos)`.
|
| 44 |
-
|
| 45 |
-
``` cpp
|
| 46 |
-
size_type find_first_not_of(charT c, size_type pos = 0) const;
|
| 47 |
-
```
|
| 48 |
-
|
| 49 |
-
*Returns:* `find_first_not_of(basic_string(1, c), pos)`.
|
| 50 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|