@@ -2117,7 +2117,7 @@ impl str {
2117
2117
/// This length is in bytes, not [`char`]s or graphemes. In other words,
2118
2118
/// it may not be what a human considers the length of the string.
2119
2119
///
2120
- /// [`char`]: primitive.char.html
2120
+ /// [`char`]: ../../std/ primitive.char.html
2121
2121
///
2122
2122
/// # Examples
2123
2123
///
@@ -2590,7 +2590,7 @@ impl str {
2590
2590
/// Value, and may not match your idea of what a 'character' is. Iteration
2591
2591
/// over grapheme clusters may be what you actually want.
2592
2592
///
2593
- /// [`char`]: primitive.char.html
2593
+ /// [`char`]: ../../std/ primitive.char.html
2594
2594
///
2595
2595
/// # Examples
2596
2596
///
@@ -2643,7 +2643,7 @@ impl str {
2643
2643
/// The iterator yields tuples. The position is first, the [`char`] is
2644
2644
/// second.
2645
2645
///
2646
- /// [`char`]: primitive.char.html
2646
+ /// [`char`]: ../../std/ primitive.char.html
2647
2647
///
2648
2648
/// # Examples
2649
2649
///
@@ -2946,7 +2946,7 @@ impl str {
2946
2946
/// The pattern can be a `&str`, [`char`], or a closure that determines if
2947
2947
/// a character matches.
2948
2948
///
2949
- /// [`char`]: primitive.char.html
2949
+ /// [`char`]: ../../std/ primitive.char.html
2950
2950
/// [`None`]: option/enum.Option.html#variant.None
2951
2951
///
2952
2952
/// # Examples
@@ -2994,7 +2994,7 @@ impl str {
2994
2994
/// The pattern can be a `&str`, [`char`], or a closure that determines if
2995
2995
/// a character matches.
2996
2996
///
2997
- /// [`char`]: primitive.char.html
2997
+ /// [`char`]: ../../std/ primitive.char.html
2998
2998
/// [`None`]: option/enum.Option.html#variant.None
2999
2999
///
3000
3000
/// # Examples
@@ -3050,7 +3050,7 @@ impl str {
3050
3050
/// If the pattern allows a reverse search but its results might differ
3051
3051
/// from a forward search, the [`rsplit`] method can be used.
3052
3052
///
3053
- /// [`char`]: primitive.char.html
3053
+ /// [`char`]: ../../std/ primitive.char.html
3054
3054
/// [`rsplit`]: #method.rsplit
3055
3055
///
3056
3056
/// # Examples
@@ -3157,7 +3157,7 @@ impl str {
3157
3157
/// The pattern can be a `&str`, [`char`], or a closure that determines the
3158
3158
/// split.
3159
3159
///
3160
- /// [`char`]: primitive.char.html
3160
+ /// [`char`]: ../../std/ primitive.char.html
3161
3161
///
3162
3162
/// # Iterator behavior
3163
3163
///
@@ -3224,7 +3224,7 @@ impl str {
3224
3224
/// elements. This is true for, eg, [`char`] but not for `&str`.
3225
3225
///
3226
3226
/// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
3227
- /// [`char`]: primitive.char.html
3227
+ /// [`char`]: ../../std/ primitive.char.html
3228
3228
///
3229
3229
/// If the pattern allows a reverse search but its results might differ
3230
3230
/// from a forward search, the [`rsplit_terminator`] method can be used.
@@ -3259,7 +3259,7 @@ impl str {
3259
3259
/// Additional libraries might provide more complex patterns like
3260
3260
/// regular expressions.
3261
3261
///
3262
- /// [`char`]: primitive.char.html
3262
+ /// [`char`]: ../../std/ primitive.char.html
3263
3263
///
3264
3264
/// Equivalent to [`split`], except that the trailing substring is
3265
3265
/// skipped if empty.
@@ -3306,7 +3306,7 @@ impl str {
3306
3306
/// The pattern can be a `&str`, [`char`], or a closure that determines the
3307
3307
/// split.
3308
3308
///
3309
- /// [`char`]: primitive.char.html
3309
+ /// [`char`]: ../../std/ primitive.char.html
3310
3310
///
3311
3311
/// # Iterator behavior
3312
3312
///
@@ -3361,7 +3361,7 @@ impl str {
3361
3361
/// The pattern can be a `&str`, [`char`], or a closure that
3362
3362
/// determines the split.
3363
3363
///
3364
- /// [`char`]: primitive.char.html
3364
+ /// [`char`]: ../../std/ primitive.char.html
3365
3365
///
3366
3366
/// # Iterator behavior
3367
3367
///
@@ -3407,7 +3407,7 @@ impl str {
3407
3407
/// The pattern can be a `&str`, [`char`], or a closure that
3408
3408
/// determines if a character matches.
3409
3409
///
3410
- /// [`char`]: primitive.char.html
3410
+ /// [`char`]: ../../std/ primitive.char.html
3411
3411
///
3412
3412
/// # Iterator behavior
3413
3413
///
@@ -3416,7 +3416,7 @@ impl str {
3416
3416
/// elements. This is true for, eg, [`char`] but not for `&str`.
3417
3417
///
3418
3418
/// [`DoubleEndedIterator`]: iter/trait.DoubleEndedIterator.html
3419
- /// [`char`]: primitive.char.html
3419
+ /// [`char`]: ../../std/ primitive.char.html
3420
3420
///
3421
3421
/// If the pattern allows a reverse search but its results might differ
3422
3422
/// from a forward search, the [`rmatches`] method can be used.
@@ -3446,7 +3446,7 @@ impl str {
3446
3446
/// The pattern can be a `&str`, [`char`], or a closure that determines if
3447
3447
/// a character matches.
3448
3448
///
3449
- /// [`char`]: primitive.char.html
3449
+ /// [`char`]: ../../std/ primitive.char.html
3450
3450
///
3451
3451
/// # Iterator behavior
3452
3452
///
@@ -3488,7 +3488,7 @@ impl str {
3488
3488
/// The pattern can be a `&str`, [`char`], or a closure that determines
3489
3489
/// if a character matches.
3490
3490
///
3491
- /// [`char`]: primitive.char.html
3491
+ /// [`char`]: ../../std/ primitive.char.html
3492
3492
///
3493
3493
/// # Iterator behavior
3494
3494
///
@@ -3532,7 +3532,7 @@ impl str {
3532
3532
/// The pattern can be a `&str`, [`char`], or a closure that determines if a
3533
3533
/// character matches.
3534
3534
///
3535
- /// [`char`]: primitive.char.html
3535
+ /// [`char`]: ../../std/ primitive.char.html
3536
3536
///
3537
3537
/// # Iterator behavior
3538
3538
///
@@ -3665,7 +3665,7 @@ impl str {
3665
3665
/// The pattern can be a [`char`] or a closure that determines if a
3666
3666
/// character matches.
3667
3667
///
3668
- /// [`char`]: primitive.char.html
3668
+ /// [`char`]: ../../std/ primitive.char.html
3669
3669
///
3670
3670
/// # Examples
3671
3671
///
@@ -3711,7 +3711,7 @@ impl str {
3711
3711
/// The pattern can be a `&str`, [`char`], or a closure that determines if
3712
3712
/// a character matches.
3713
3713
///
3714
- /// [`char`]: primitive.char.html
3714
+ /// [`char`]: ../../std/ primitive.char.html
3715
3715
///
3716
3716
/// # Text directionality
3717
3717
///
@@ -3750,7 +3750,7 @@ impl str {
3750
3750
/// The pattern can be a `&str`, [`char`], or a closure that
3751
3751
/// determines if a character matches.
3752
3752
///
3753
- /// [`char`]: primitive.char.html
3753
+ /// [`char`]: ../../std/ primitive.char.html
3754
3754
///
3755
3755
/// # Text directionality
3756
3756
///
0 commit comments