mirror of
https://github.com/rust-lang/rust
synced 2024-10-17 22:13:59 +00:00
improve array_from_fn documenation
This commit is contained in:
parent
3f2b2eee8f
commit
480f850868
|
@ -23,7 +23,8 @@
|
||||||
#[stable(feature = "array_value_iter", since = "1.51.0")]
|
#[stable(feature = "array_value_iter", since = "1.51.0")]
|
||||||
pub use iter::IntoIter;
|
pub use iter::IntoIter;
|
||||||
|
|
||||||
/// Creates an array `[T; N]` where each array element `T` is returned by the `cb` call.
|
/// Creates an array of type [T; N], where each element `T` is the returned value from `cb`
|
||||||
|
/// using that element's index.
|
||||||
///
|
///
|
||||||
/// # Arguments
|
/// # Arguments
|
||||||
///
|
///
|
||||||
|
@ -36,8 +37,18 @@
|
||||||
/// // elements to produce is the length of array down there: only arrays of
|
/// // elements to produce is the length of array down there: only arrays of
|
||||||
/// // equal lengths can be compared, so the const generic parameter `N` is
|
/// // equal lengths can be compared, so the const generic parameter `N` is
|
||||||
/// // inferred to be 5, thus creating array of 5 elements.
|
/// // inferred to be 5, thus creating array of 5 elements.
|
||||||
/// let array = core::array::from_fn(|i| i);
|
///
|
||||||
|
/// let array: [_; 5] = core::array::from_fn(|i| i);
|
||||||
|
/// // indexes are: 0 1 2 3 4
|
||||||
/// assert_eq!(array, [0, 1, 2, 3, 4]);
|
/// assert_eq!(array, [0, 1, 2, 3, 4]);
|
||||||
|
///
|
||||||
|
/// let array2: [_; 8] = core::array::from_fn(|i| i * 2);
|
||||||
|
/// // indexes are: 0 1 2 3 4 5 6 7
|
||||||
|
/// assert_eq!(array2, [0, 2, 4, 6, 8, 10, 12, 14]);
|
||||||
|
///
|
||||||
|
/// let bool_arr: [bool; 5] = core::array::from_fn(|i| i % 2 == 0);
|
||||||
|
/// // indexes are: 0 1 2 3 4
|
||||||
|
/// assert_eq!(bool_arr, [true, false, true, false, true]);
|
||||||
/// ```
|
/// ```
|
||||||
#[inline]
|
#[inline]
|
||||||
#[stable(feature = "array_from_fn", since = "1.63.0")]
|
#[stable(feature = "array_from_fn", since = "1.63.0")]
|
||||||
|
|
Loading…
Reference in a new issue