tmp/tmpj6kp1r3k/{from.md → to.md}
RENAMED
|
@@ -1,42 +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
|
| 5 |
-
find_first_not_of(const basic_string& str,
|
| 6 |
-
size_type pos = 0) const noexcept;
|
| 7 |
-
```
|
| 8 |
-
|
| 9 |
-
*Effects:* Determines the lowest position `xpos`, if possible, such that
|
| 10 |
-
both of the following conditions obtain:
|
| 11 |
-
|
| 12 |
-
- `pos <= xpos` and `xpos < size()`;
|
| 13 |
-
- `traits::eq(at(xpos), str.at(I))` for no element `I` of the string
|
| 14 |
-
controlled by `str`.
|
| 15 |
-
|
| 16 |
-
*Returns:* `xpos` if the function can determine such a value for `xpos`.
|
| 17 |
-
Otherwise, returns `npos`.
|
| 18 |
-
|
| 19 |
-
*Remarks:* Uses `traits::eq()`.
|
| 20 |
-
|
| 21 |
-
``` cpp
|
| 22 |
-
size_type
|
| 23 |
-
find_first_not_of(const charT* s, size_type pos, size_type n) const;
|
| 24 |
-
```
|
| 25 |
-
|
| 26 |
-
*Returns:* `find_first_not_of(basic_string(s, n), pos)`.
|
| 27 |
-
|
| 28 |
-
``` cpp
|
| 29 |
-
size_type find_first_not_of(const charT* s, size_type pos = 0) const;
|
| 30 |
-
```
|
| 31 |
-
|
| 32 |
-
*Requires:* `s` points to an array of at least `traits::length(s) + 1`
|
| 33 |
-
elements of `charT`.
|
| 34 |
-
|
| 35 |
-
*Returns:* `find_first_not_of(basic_string(s), pos)`.
|
| 36 |
-
|
| 37 |
-
``` cpp
|
| 38 |
-
size_type find_first_not_of(charT c, size_type pos = 0) const;
|
| 39 |
-
```
|
| 40 |
-
|
| 41 |
-
*Returns:* `find_first_not_of(basic_string(1, c), pos)`.
|
| 42 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|