Fix up various links
The unstable book, libstd, libcore, and liballoc all needed some adjustment.
This commit is contained in:
parent
c0e7b16f61
commit
d1d9626e75
@ -137,7 +137,7 @@ of extensions. See `Registry::register_syntax_extension` and the
|
||||
|
||||
## Tips and tricks
|
||||
|
||||
Some of the [macro debugging tips](../book/macros.html#debugging-macro-code) are applicable.
|
||||
Some of the [macro debugging tips](../book/first-edition/macros.html#debugging-macro-code) are applicable.
|
||||
|
||||
You can use `syntax::parse` to turn token trees into
|
||||
higher-level syntax elements like expressions:
|
||||
|
@ -102,7 +102,7 @@ const MAX_REFCOUNT: usize = (isize::MAX) as usize;
|
||||
/// [downgrade]: struct.Arc.html#method.downgrade
|
||||
/// [upgrade]: struct.Weak.html#method.upgrade
|
||||
/// [`None`]: ../../std/option/enum.Option.html#variant.None
|
||||
/// [assoc]: ../../book/method-syntax.html#associated-functions
|
||||
/// [assoc]: ../../book/first-edition/method-syntax.html#associated-functions
|
||||
///
|
||||
/// # Examples
|
||||
///
|
||||
|
@ -215,7 +215,7 @@
|
||||
//! [downgrade]: struct.Rc.html#method.downgrade
|
||||
//! [upgrade]: struct.Weak.html#method.upgrade
|
||||
//! [`None`]: ../../std/option/enum.Option.html#variant.None
|
||||
//! [assoc]: ../../book/method-syntax.html#associated-functions
|
||||
//! [assoc]: ../../book/first-edition/method-syntax.html#associated-functions
|
||||
//! [mutability]: ../../std/cell/index.html#introducing-mutability-inside-of-something-immutable
|
||||
|
||||
#![stable(feature = "rust1", since = "1.0.0")]
|
||||
|
@ -94,7 +94,7 @@ pub const MAX: char = '\u{10ffff}';
|
||||
///
|
||||
/// [`char`]: ../../std/primitive.char.html
|
||||
/// [`u32`]: ../../std/primitive.u32.html
|
||||
/// [`as`]: ../../book/casting-between-types.html#as
|
||||
/// [`as`]: ../../book/first-edition/casting-between-types.html#as
|
||||
///
|
||||
/// For an unsafe version of this function which ignores these checks, see
|
||||
/// [`from_u32_unchecked`].
|
||||
@ -146,7 +146,7 @@ pub fn from_u32(i: u32) -> Option<char> {
|
||||
///
|
||||
/// [`char`]: ../../std/primitive.char.html
|
||||
/// [`u32`]: ../../std/primitive.u32.html
|
||||
/// [`as`]: ../../book/casting-between-types.html#as
|
||||
/// [`as`]: ../../book/first-edition/casting-between-types.html#as
|
||||
///
|
||||
/// # Safety
|
||||
///
|
||||
|
@ -409,7 +409,7 @@ pub trait Iterator {
|
||||
/// If you're doing some sort of looping for a side effect, it's considered
|
||||
/// more idiomatic to use [`for`] than `map()`.
|
||||
///
|
||||
/// [`for`]: ../../book/loops.html#for
|
||||
/// [`for`]: ../../book/first-edition/loops.html#for
|
||||
///
|
||||
/// # Examples
|
||||
///
|
||||
@ -1306,7 +1306,7 @@ pub trait Iterator {
|
||||
/// use a `for` loop with a list of things to build up a result. Those
|
||||
/// can be turned into `fold()`s:
|
||||
///
|
||||
/// [`for`]: ../../book/loops.html#for
|
||||
/// [`for`]: ../../book/first-edition/loops.html#for
|
||||
///
|
||||
/// ```
|
||||
/// let numbers = [1, 2, 3, 4, 5];
|
||||
|
@ -164,7 +164,7 @@ pub use intrinsics::transmute;
|
||||
/// [uninit]: fn.uninitialized.html
|
||||
/// [clone]: ../clone/trait.Clone.html
|
||||
/// [swap]: fn.swap.html
|
||||
/// [FFI]: ../../book/ffi.html
|
||||
/// [FFI]: ../../book/first-edition/ffi.html
|
||||
/// [box]: ../../std/boxed/struct.Box.html
|
||||
/// [into_raw]: ../../std/boxed/struct.Box.html#method.into_raw
|
||||
/// [ub]: ../../reference/behavior-considered-undefined.html
|
||||
@ -199,7 +199,7 @@ pub fn size_of<T>() -> usize {
|
||||
/// then `size_of_val` can be used to get the dynamically-known size.
|
||||
///
|
||||
/// [slice]: ../../std/primitive.slice.html
|
||||
/// [trait object]: ../../book/trait-objects.html
|
||||
/// [trait object]: ../../book/first-edition/trait-objects.html
|
||||
///
|
||||
/// # Examples
|
||||
///
|
||||
@ -317,7 +317,7 @@ pub fn align_of_val<T: ?Sized>(val: &T) -> usize {
|
||||
/// many of the same caveats.
|
||||
///
|
||||
/// [uninit]: fn.uninitialized.html
|
||||
/// [FFI]: ../../book/ffi.html
|
||||
/// [FFI]: ../../book/first-edition/ffi.html
|
||||
/// [ub]: ../../reference/behavior-considered-undefined.html
|
||||
///
|
||||
/// # Examples
|
||||
@ -343,7 +343,7 @@ pub unsafe fn zeroed<T>() -> T {
|
||||
/// This is useful for [FFI] functions and initializing arrays sometimes,
|
||||
/// but should generally be avoided.
|
||||
///
|
||||
/// [FFI]: ../../book/ffi.html
|
||||
/// [FFI]: ../../book/first-edition/ffi.html
|
||||
///
|
||||
/// # Undefined behavior
|
||||
///
|
||||
@ -525,7 +525,7 @@ pub fn replace<T>(dest: &mut T, mut src: T) -> T {
|
||||
/// it will not release any borrows, as borrows are based on lexical scope.
|
||||
///
|
||||
/// This effectively does nothing for
|
||||
/// [types which implement `Copy`](../../book/ownership.html#copy-types),
|
||||
/// [types which implement `Copy`](../../book/first-edition/ownership.html#copy-types),
|
||||
/// e.g. integers. Such values are copied and _then_ moved into the function,
|
||||
/// so the value persists after this function call.
|
||||
///
|
||||
|
@ -25,7 +25,7 @@
|
||||
/// Book][moreinfo] contains more details about the precise nature of
|
||||
/// these internals.
|
||||
///
|
||||
/// [moreinfo]: ../../book/trait-objects.html#representation
|
||||
/// [moreinfo]: ../../book/first-edition/trait-objects.html#representation
|
||||
///
|
||||
/// `TraitObject` is guaranteed to match layouts, but it is not the
|
||||
/// type of trait objects (e.g. the fields are not directly accessible
|
||||
|
@ -174,7 +174,7 @@
|
||||
//! [slice]: primitive.slice.html
|
||||
//! [`atomic`]: sync/atomic/index.html
|
||||
//! [`collections`]: collections/index.html
|
||||
//! [`for`]: ../book/loops.html#for
|
||||
//! [`for`]: ../book/first-edition/loops.html#for
|
||||
//! [`format!`]: macro.format.html
|
||||
//! [`fs`]: fs/index.html
|
||||
//! [`io`]: io/index.html
|
||||
@ -189,14 +189,14 @@
|
||||
//! [`sync`]: sync/index.html
|
||||
//! [`thread`]: thread/index.html
|
||||
//! [`use std::env`]: env/index.html
|
||||
//! [`use`]: ../book/crates-and-modules.html#importing-modules-with-use
|
||||
//! [crate root]: ../book/crates-and-modules.html#basic-terminology-crates-and-modules
|
||||
//! [`use`]: ../book/first-edition/crates-and-modules.html#importing-modules-with-use
|
||||
//! [crate root]: ../book/first-edition/crates-and-modules.html#basic-terminology-crates-and-modules
|
||||
//! [crates.io]: https://crates.io
|
||||
//! [deref coercions]: ../book/deref-coercions.html
|
||||
//! [deref coercions]: ../book/first-edition/deref-coercions.html
|
||||
//! [files]: fs/struct.File.html
|
||||
//! [multithreading]: thread/index.html
|
||||
//! [other]: #what-is-in-the-standard-library-documentation
|
||||
//! [primitive types]: ../book/primitive-types.html
|
||||
//! [primitive types]: ../book/first-edition/primitive-types.html
|
||||
|
||||
#![crate_name = "std"]
|
||||
#![stable(feature = "rust1", since = "1.0.0")]
|
||||
|
@ -29,7 +29,7 @@
|
||||
/// ```
|
||||
///
|
||||
/// [`assert!`]: macro.assert.html
|
||||
/// [`if`]: ../book/if.html
|
||||
/// [`if`]: ../book/first-edition/if.html
|
||||
/// [`BitAnd`]: ops/trait.BitAnd.html
|
||||
/// [`BitOr`]: ops/trait.BitOr.html
|
||||
/// [`Not`]: ops/trait.Not.html
|
||||
@ -490,7 +490,7 @@ mod prim_str { }
|
||||
/// assert_eq!(tuple.2, 'c');
|
||||
/// ```
|
||||
///
|
||||
/// For more about tuples, see [the book](../book/primitive-types.html#tuples).
|
||||
/// For more about tuples, see [the book](../book/first-edition/primitive-types.html#tuples).
|
||||
///
|
||||
/// # Trait implementations
|
||||
///
|
||||
|
Loading…
x
Reference in New Issue
Block a user