|
3096 | 3096 |
|
3097 | 3097 | \indexlibrarymember{find}{basic_string}%
|
3098 | 3098 | \begin{itemdecl}
|
3099 |
| -size_type find(basic_string_view<charT, traits> sv, |
3100 |
| - size_type pos = 0) const noexcept; |
| 3099 | +size_type find(basic_string_view<charT, traits> sv, size_type pos = 0) const noexcept; |
3101 | 3100 | \end{itemdecl}
|
3102 | 3101 |
|
3103 | 3102 | \begin{itemdescr}
|
3104 | 3103 | \pnum
|
3105 | 3104 | \effects
|
3106 | 3105 | Determines the lowest position \tcode{xpos}, if possible, such that both of
|
3107 | 3106 | the following conditions hold:
|
3108 |
| - |
3109 | 3107 | \begin{itemize}
|
3110 | 3108 | \item
|
3111 | 3109 | \tcode{pos <= xpos} and
|
|
3130 | 3128 |
|
3131 | 3129 | \indexlibrarymember{find}{basic_string}%
|
3132 | 3130 | \begin{itemdecl}
|
3133 |
| -size_type find(const basic_string& str, |
3134 |
| - size_type pos = 0) const noexcept; |
| 3131 | +size_type find(const basic_string& str, size_type pos = 0) const noexcept; |
3135 | 3132 | \end{itemdecl}
|
3136 | 3133 |
|
3137 | 3134 | \begin{itemdescr}
|
|
3181 | 3178 |
|
3182 | 3179 | \indexlibrarymember{rfind}{basic_string}%
|
3183 | 3180 | \begin{itemdecl}
|
3184 |
| -size_type rfind(basic_string_view<charT, traits> sv, |
3185 |
| - size_type pos = npos) const noexcept; |
| 3181 | +size_type rfind(basic_string_view<charT, traits> sv, size_type pos = npos) const noexcept; |
3186 | 3182 | \end{itemdecl}
|
3187 | 3183 |
|
3188 | 3184 | \begin{itemdescr}
|
3189 | 3185 | \pnum
|
3190 | 3186 | \effects
|
3191 | 3187 | Determines the highest position \tcode{xpos}, if possible, such that both of
|
3192 | 3188 | the following conditions hold:
|
3193 |
| - |
3194 | 3189 | \begin{itemize}
|
3195 | 3190 | \item
|
3196 | 3191 | \tcode{xpos <= pos}
|
|
3216 | 3211 |
|
3217 | 3212 | \indexlibrarymember{rfind}{basic_string}%
|
3218 | 3213 | \begin{itemdecl}
|
3219 |
| -size_type rfind(const basic_string& str, |
3220 |
| - size_type pos = npos) const noexcept; |
| 3214 | +size_type rfind(const basic_string& str, size_type pos = npos) const noexcept; |
3221 | 3215 | \end{itemdecl}
|
3222 | 3216 |
|
3223 | 3217 | \begin{itemdescr}
|
|
3267 | 3261 |
|
3268 | 3262 | \indexlibrarymember{find_first_of}{basic_string}%
|
3269 | 3263 | \begin{itemdecl}
|
3270 |
| -size_type find_first_of(basic_string_view<charT, traits> sv, |
3271 |
| - size_type pos = 0) const noexcept; |
| 3264 | +size_type find_first_of(basic_string_view<charT, traits> sv, size_type pos = 0) const noexcept; |
3272 | 3265 | \end{itemdecl}
|
3273 | 3266 |
|
3274 | 3267 | \begin{itemdescr}
|
|
3302 | 3295 |
|
3303 | 3296 | \indexlibrarymember{find_first_of}{basic_string}%
|
3304 | 3297 | \begin{itemdecl}
|
3305 |
| -size_type find_first_of(const basic_string& str, |
3306 |
| - size_type pos = 0) const noexcept; |
| 3298 | +size_type find_first_of(const basic_string& str, size_type pos = 0) const noexcept; |
3307 | 3299 | \end{itemdecl}
|
3308 | 3300 |
|
3309 | 3301 | \begin{itemdescr}
|
|
3314 | 3306 |
|
3315 | 3307 | \indexlibrarymember{find_first_of}{basic_string}%
|
3316 | 3308 | \begin{itemdecl}
|
3317 |
| -size_type |
3318 |
| - find_first_of(const charT* s, size_type pos, size_type n) const; |
| 3309 | +size_type find_first_of(const charT* s, size_type pos, size_type n) const; |
3319 | 3310 | \end{itemdecl}
|
3320 | 3311 |
|
3321 | 3312 | \begin{itemdescr}
|
|
3354 | 3345 |
|
3355 | 3346 | \indexlibrarymember{find_last_of}{basic_string}%
|
3356 | 3347 | \begin{itemdecl}
|
3357 |
| -size_type find_last_of (basic_string_view<charT, traits> sv, |
3358 |
| - size_type pos = npos) const noexcept; |
| 3348 | +size_type find_last_of(basic_string_view<charT, traits> sv, size_type pos = npos) const noexcept; |
3359 | 3349 | \end{itemdecl}
|
3360 | 3350 |
|
3361 | 3351 | \begin{itemdescr}
|
3362 | 3352 | \pnum
|
3363 | 3353 | \effects
|
3364 | 3354 | Determines the highest position \tcode{xpos}, if possible, such that both of
|
3365 | 3355 | the following conditions hold:
|
3366 |
| - |
3367 | 3356 | \begin{itemize}
|
3368 | 3357 | \item
|
3369 | 3358 | \tcode{xpos <= pos}
|
|
3389 | 3378 |
|
3390 | 3379 | \indexlibrarymember{find_last_of}{basic_string}%
|
3391 | 3380 | \begin{itemdecl}
|
3392 |
| -size_type find_last_of(const basic_string& str, |
3393 |
| - size_type pos = npos) const noexcept; |
| 3381 | +size_type find_last_of(const basic_string& str, size_type pos = npos) const noexcept; |
3394 | 3382 | \end{itemdecl}
|
3395 | 3383 |
|
3396 | 3384 | \begin{itemdescr}
|
|
3449 | 3437 | \effects
|
3450 | 3438 | Determines the lowest position \tcode{xpos}, if possible, such that both of
|
3451 | 3439 | the following conditions hold:
|
3452 |
| - |
3453 | 3440 | \begin{itemize}
|
3454 | 3441 | \item
|
3455 | 3442 | \tcode{pos <= xpos}
|
|
3475 | 3462 |
|
3476 | 3463 | \indexlibrarymember{find_first_not_of}{basic_string}%
|
3477 | 3464 | \begin{itemdecl}
|
3478 |
| -size_type find_first_not_of(const basic_string& str, |
3479 |
| - size_type pos = 0) const noexcept; |
| 3465 | +size_type find_first_not_of(const basic_string& str, size_type pos = 0) const noexcept; |
3480 | 3466 | \end{itemdecl}
|
3481 | 3467 |
|
3482 | 3468 | \begin{itemdescr}
|
3483 | 3469 | \pnum
|
3484 | 3470 | \effects
|
3485 | 3471 | Equivalent to:
|
3486 |
| -\tcode{return find_first_not_of(basic_string_view<charT, traits>(str), pos);} |
| 3472 | +\begin{codeblock} |
| 3473 | +return find_first_not_of(basic_string_view<charT, traits>(str), pos); |
| 3474 | +\end{codeblock} |
3487 | 3475 | \end{itemdescr}
|
3488 | 3476 |
|
3489 | 3477 | \indexlibrarymember{find_first_not_of}{basic_string}%
|
3490 | 3478 | \begin{itemdecl}
|
3491 |
| -size_type |
3492 |
| - find_first_not_of(const charT* s, size_type pos, size_type n) const; |
| 3479 | +size_type find_first_not_of(const charT* s, size_type pos, size_type n) const; |
3493 | 3480 | \end{itemdecl}
|
3494 | 3481 |
|
3495 | 3482 | \begin{itemdescr}
|
|
3528 | 3515 |
|
3529 | 3516 | \indexlibrarymember{find_last_not_of}{basic_string}%
|
3530 | 3517 | \begin{itemdecl}
|
3531 |
| -size_type find_last_not_of (basic_string_view<charT, traits> sv, |
3532 |
| - size_type pos = npos) const noexcept; |
| 3518 | +size_type find_last_not_of(basic_string_view<charT, traits> sv, |
| 3519 | + size_type pos = npos) const noexcept; |
3533 | 3520 | \end{itemdecl}
|
3534 | 3521 |
|
3535 | 3522 | \begin{itemdescr}
|
3536 | 3523 | \pnum
|
3537 | 3524 | \effects
|
3538 | 3525 | Determines the highest position \tcode{xpos}, if possible, such that both of
|
3539 | 3526 | the following conditions hold:
|
3540 |
| - |
3541 | 3527 | \begin{itemize}
|
3542 | 3528 | \item
|
3543 | 3529 | \tcode{xpos <= pos}
|
|
3563 | 3549 |
|
3564 | 3550 | \indexlibrarymember{find_last_not_of}{basic_string}%
|
3565 | 3551 | \begin{itemdecl}
|
3566 |
| -size_type find_last_not_of(const basic_string& str, |
3567 |
| - size_type pos = npos) const noexcept; |
| 3552 | +size_type find_last_not_of(const basic_string& str, size_type pos = npos) const noexcept; |
3568 | 3553 | \end{itemdecl}
|
3569 | 3554 |
|
3570 | 3555 | \begin{itemdescr}
|
3571 | 3556 | \pnum
|
3572 | 3557 | \effects
|
3573 | 3558 | Equivalent to:
|
3574 |
| -\tcode{return find_last_not_of(basic_string_view<charT, traits>(str), pos);} |
| 3559 | +\begin{codeblock} |
| 3560 | +return find_last_not_of(basic_string_view<charT, traits>(str), pos); |
| 3561 | +\end{codeblock} |
3575 | 3562 | \end{itemdescr}
|
3576 | 3563 |
|
3577 | 3564 | \indexlibrarymember{find_last_not_of}{basic_string}%
|
3578 | 3565 | \begin{itemdecl}
|
3579 |
| -size_type find_last_not_of(const charT* s, size_type pos, |
3580 |
| - size_type n) const; |
| 3566 | +size_type find_last_not_of(const charT* s, size_type pos, size_type n) const; |
3581 | 3567 | \end{itemdecl}
|
3582 | 3568 |
|
3583 | 3569 | \begin{itemdescr}
|
|
3672 | 3658 |
|
3673 | 3659 | \indexlibrarymember{compare}{basic_string}%
|
3674 | 3660 | \begin{itemdecl}
|
3675 |
| -int compare(size_type pos1, size_type n1, |
3676 |
| - basic_string_view<charT, traits> sv) const; |
| 3661 | +int compare(size_type pos1, size_type n1, basic_string_view<charT, traits> sv) const; |
3677 | 3662 | \end{itemdecl}
|
3678 | 3663 |
|
3679 | 3664 | \begin{itemdescr}
|
|
3698 | 3683 | Equivalent to:
|
3699 | 3684 | \begin{codeblock}
|
3700 | 3685 | basic_string_view<charT, traits> sv = t;
|
3701 |
| -return basic_string_view<charT, traits>(data(), size()).substr(pos1, n1).compare(sv.substr(pos2, n2)); |
| 3686 | +return basic_string_view<charT, traits>( |
| 3687 | + data(), size()).substr(pos1, n1).compare(sv.substr(pos2, n2)); |
3702 | 3688 | \end{codeblock}
|
3703 | 3689 |
|
3704 | 3690 | \pnum
|
|
3722 | 3708 |
|
3723 | 3709 | \indexlibrarymember{compare}{basic_string}%
|
3724 | 3710 | \begin{itemdecl}
|
3725 |
| -int compare(size_type pos1, size_type n1, |
3726 |
| - const basic_string& str) const; |
| 3711 | +int compare(size_type pos1, size_type n1, const basic_string& str) const; |
3727 | 3712 | \end{itemdecl}
|
3728 | 3713 |
|
3729 | 3714 | \begin{itemdescr}
|
|
3761 | 3746 |
|
3762 | 3747 | \indexlibrarymember{compare}{basic_string}%
|
3763 | 3748 | \begin{itemdecl}
|
3764 |
| -int compare(size_type pos, size_type n1, |
3765 |
| - const charT* s) const; |
| 3749 | +int compare(size_type pos, size_type n1, const charT* s) const; |
3766 | 3750 | \end{itemdecl}
|
3767 | 3751 |
|
3768 | 3752 | \begin{itemdescr}
|
|
3772 | 3756 |
|
3773 | 3757 | \indexlibrarymember{compare}{basic_string}%
|
3774 | 3758 | \begin{itemdecl}
|
3775 |
| -int compare(size_type pos, size_type n1, |
3776 |
| - const charT* s, size_type n2) const; |
| 3759 | +int compare(size_type pos, size_type n1, const charT* s, size_type n2) const; |
3777 | 3760 | \end{itemdecl}
|
3778 | 3761 |
|
3779 | 3762 | \begin{itemdescr}
|
|
0 commit comments