array.rs.html -- source
Description: Source to the Rust file `libcore/array.rs`.
Keywords: rust, rustlang, rust-lang

      1
      2
      3
      4
      5
      6
      7
      8
      9
     10
     11
     12
     13
     14
     15
     16
     17
     18
     19
     20
     21
     22
     23
     24
     25
     26
     27
     28
     29
     30
     31
     32
     33
     34
     35
     36
     37
     38
     39
     40
     41
     42
     43
     44
     45
     46
     47
     48
     49
     50
     51
     52
     53
     54
     55
     56
     57
     58
     59
     60
     61
     62
     63
     64
     65
     66
     67
     68
     69
     70
     71
     72
     73
     74
     75
     76
     77
     78
     79
     80
     81
     82
     83
     84
     85
     86
     87
     88
     89
     90
     91
     92
     93
     94
     95
     96
     97
     98
     99
    100
    101
    102
    103
    104
    105
    106
    107
    108
    109
    110
    111
    112
    113
    114
    115
    116
    117
    118
    119
    120
    121
    122
    123
    124
    125
    126
    127
    128
    129
    130
    131
    132
    133
    134
    135
    136
    137
    138
    139
    140
    141
    142
    143
    144
    145
    146
    147
    148
    149
    150
    151
    152
    153
    154
    155
    156
    157
    158
    159
    160
    161
    162
    163
    164
    165
    166
    167
    168
    169
    170
    171
    172
    173
    174
    175
    176
    177
    178
    179
    180
    181
    182
    183
    184
    185
    186
    187
    188
    189
    190
    191
    192
    193
    194
    195
    196
    197
    198
    199
    200
    201
    202
    203
    204
    205
    206
    207
    208
    209
    210
    211
    212
    213
    214
    215
    216
    217
    218
    219
    220
    221
    222
    223
    224
    225
    226
    227
    228
    229
    230
    231
    232
    233
    234
    235
    236
    237
    238
    239
    240
    241
    242
    243
    244
    245
    246
    247
    248
    249
    250
    251
    252
    253
    254
    255
    256
    257
    258
    259
    260
    261
    262
    263
    264
    265
    266
    267
    268
    269
    270
    271
    272
    273
    274
    275
    276
    277
    278
    279
    280
    281
    282
    283
    284
    285
    286
    287

    // Copyright 2014 The Rust Project Developers. See the COPYRIGHT
    // file at the top-level directory of this distribution and at
    // http://rust-lang.org/COPYRIGHT.
    //
    // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
    // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
    // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
    // option. This file may not be copied, modified, or distributed
    // except according to those terms.

    //! Implementations of things like `Eq` for fixed-length arrays
    //! up to a certain length. Eventually we should able to generalize
    //! to all lengths.
    //!
    //! *[See also the array primitive type](../../std/primitive.array.html).*

    #![unstable(feature = "fixed_size_array",
                reason = "traits and impls are better expressed through generic \
                          integer constants",
                issue = "27778")]

    use borrow::{Borrow, BorrowMut};
    use cmp::Ordering;
    use convert::TryFrom;
    use fmt;
    use hash::{Hash, self};
    use marker::Unsize;
    use slice::{Iter, IterMut};

    /// Utility trait implemented only on arrays of fixed size
    ///
    /// This trait can be used to implement other traits on fixed-size arrays
    /// without causing much metadata bloat.
    ///
    /// The trait is marked unsafe in order to restrict implementors to fixed-size
    /// arrays. User of this trait can assume that implementors have the exact
    /// layout in memory of a fixed size array (for example, for unsafe
    /// initialization).
    ///
    /// Note that the traits AsRef and AsMut provide similar methods for types that
    /// may not be fixed-size arrays. Implementors should prefer those traits
    /// instead.
    pub unsafe trait FixedSizeArray<T> {
        /// Converts the array to immutable slice
        fn as_slice(&self) -> &[T];
        /// Converts the array to mutable slice
        fn as_mut_slice(&mut self) -> &mut [T];
    }

    unsafe impl<T, A: Unsize<[T]>> FixedSizeArray<T> for A {
        #[inline]
        fn as_slice(&self) -> &[T] {
            self
        }
        #[inline]
        fn as_mut_slice(&mut self) -> &mut [T] {
            self
        }
    }

    /// The error type returned when a conversion from a slice to an array fails.
    #[unstable(feature = "try_from", issue = "33417")]
    #[derive(Debug, Copy, Clone)]
    pub struct TryFromSliceError(());

    impl fmt::Display for TryFromSliceError {
        #[inline]
        fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
            fmt::Display::fmt(self.__description(), f)
        }
    }

    impl TryFromSliceError {
        #[unstable(feature = "array_error_internals",
               reason = "available through Error trait and this method should not \
                         be exposed publicly",
               issue = "0")]
        #[inline]
        #[doc(hidden)]
        pub fn __description(&self) -> &str {
            "could not convert slice to array"
        }
    }

    macro_rules! __impl_slice_eq1 {
        ($Lhs: ty, $Rhs: ty) => {
            __impl_slice_eq1! { $Lhs, $Rhs, Sized }
        };
        ($Lhs: ty, $Rhs: ty, $Bound: ident) => {
            #[stable(feature = "rust1", since = "1.0.0")]
            impl<'a, 'b, A: $Bound, B> PartialEq<$Rhs> for $Lhs where A: PartialEq<B> {
                #[inline]
                fn eq(&self, other: &$Rhs) -> bool { self[..] == other[..] }
                #[inline]
                fn ne(&self, other: &$Rhs) -> bool { self[..] != other[..] }
            }
        }
    }

    macro_rules! __impl_slice_eq2 {
        ($Lhs: ty, $Rhs: ty) => {
            __impl_slice_eq2! { $Lhs, $Rhs, Sized }
        };
        ($Lhs: ty, $Rhs: ty, $Bound: ident) => {
            __impl_slice_eq1!($Lhs, $Rhs, $Bound);

            #[stable(feature = "rust1", since = "1.0.0")]
            impl<'a, 'b, A: $Bound, B> PartialEq<$Lhs> for $Rhs where B: PartialEq<A> {
                #[inline]
                fn eq(&self, other: &$Lhs) -> bool { self[..] == other[..] }
                #[inline]
                fn ne(&self, other: &$Lhs) -> bool { self[..] != other[..] }
            }
        }
    }

    // macro for implementing n-element array functions and operations
    macro_rules! array_impls {
        ($($N:expr)+) => {
            $(
                #[stable(feature = "rust1", since = "1.0.0")]
                impl<T> AsRef<[T]> for [T; $N] {
                    #[inline]
                    fn as_ref(&self) -> &[T] {
                        &self[..]
                    }
                }

                #[stable(feature = "rust1", since = "1.0.0")]
                impl<T> AsMut<[T]> for [T; $N] {
                    #[inline]
                    fn as_mut(&mut self) -> &mut [T] {
                        &mut self[..]
                    }
                }

                #[stable(feature = "array_borrow", since = "1.4.0")]
                impl<T> Borrow<[T]> for [T; $N] {
                    fn borrow(&self) -> &[T] {
                        self
                    }
                }

                #[stable(feature = "array_borrow", since = "1.4.0")]
                impl<T> BorrowMut<[T]> for [T; $N] {
                    fn borrow_mut(&mut self) -> &mut [T] {
                        self
                    }
                }

                #[unstable(feature = "try_from", issue = "33417")]
                impl<'a, T> TryFrom<&'a [T]> for &'a [T; $N] {
                    type Error = TryFromSliceError;

                    fn try_from(slice: &[T]) -> Result<&[T; $N], TryFromSliceError> {
                        if slice.len() == $N {
                            let ptr = slice.as_ptr() as *const [T; $N];
                            unsafe { Ok(&*ptr) }
                        } else {
                            Err(TryFromSliceError(()))
                        }
                    }
                }

                #[unstable(feature = "try_from", issue = "33417")]
                impl<'a, T> TryFrom<&'a mut [T]> for &'a mut [T; $N] {
                    type Error = TryFromSliceError;

                    fn try_from(slice: &mut [T]) -> Result<&mut [T; $N], TryFromSliceError> {
                        if slice.len() == $N {
                            let ptr = slice.as_mut_ptr() as *mut [T; $N];
                            unsafe { Ok(&mut *ptr) }
                        } else {
                            Err(TryFromSliceError(()))
                        }
                    }
                }

                #[stable(feature = "rust1", since = "1.0.0")]
                impl<T: Hash> Hash for [T; $N] {
                    fn hash<H: hash::Hasher>(&self, state: &mut H) {
                        Hash::hash(&self[..], state)
                    }
                }

                #[stable(feature = "rust1", since = "1.0.0")]
                impl<T: fmt::Debug> fmt::Debug for [T; $N] {
                    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
                        fmt::Debug::fmt(&&self[..], f)
                    }
                }

                #[stable(feature = "rust1", since = "1.0.0")]
                impl<'a, T> IntoIterator for &'a [T; $N] {
                    type Item = &'a T;
                    type IntoIter = Iter<'a, T>;

                    fn into_iter(self) -> Iter<'a, T> {
                        self.iter()
                    }
                }

                #[stable(feature = "rust1", since = "1.0.0")]
                impl<'a, T> IntoIterator for &'a mut [T; $N] {
                    type Item = &'a mut T;
                    type IntoIter = IterMut<'a, T>;

                    fn into_iter(self) -> IterMut<'a, T> {
                        self.iter_mut()
                    }
                }

                // NOTE: some less important impls are omitted to reduce code bloat
                __impl_slice_eq1! { [A; $N], [B; $N] }
                __impl_slice_eq2! { [A; $N], [B] }
                __impl_slice_eq2! { [A; $N], &'b [B] }
                __impl_slice_eq2! { [A; $N], &'b mut [B] }
                // __impl_slice_eq2! { [A; $N], &'b [B; $N] }
                // __impl_slice_eq2! { [A; $N], &'b mut [B; $N] }

                #[stable(feature = "rust1", since = "1.0.0")]
                impl<T:Eq> Eq for [T; $N] { }

                #[stable(feature = "rust1", since = "1.0.0")]
                impl<T:PartialOrd> PartialOrd for [T; $N] {
                    #[inline]
                    fn partial_cmp(&self, other: &[T; $N]) -> Option<Ordering> {
                        PartialOrd::partial_cmp(&&self[..], &&other[..])
                    }
                    #[inline]
                    fn lt(&self, other: &[T; $N]) -> bool {
                        PartialOrd::lt(&&self[..], &&other[..])
                    }
                    #[inline]
                    fn le(&self, other: &[T; $N]) -> bool {
                        PartialOrd::le(&&self[..], &&other[..])
                    }
                    #[inline]
                    fn ge(&self, other: &[T; $N]) -> bool {
                        PartialOrd::ge(&&self[..], &&other[..])
                    }
                    #[inline]
                    fn gt(&self, other: &[T; $N]) -> bool {
                        PartialOrd::gt(&&self[..], &&other[..])
                    }
                }

                #[stable(feature = "rust1", since = "1.0.0")]
                impl<T:Ord> Ord for [T; $N] {
                    #[inline]
                    fn cmp(&self, other: &[T; $N]) -> Ordering {
                        Ord::cmp(&&self[..], &&other[..])
                    }
                }
            )+
        }
    }

    array_impls! {
         0  1  2  3  4  5  6  7  8  9
        10 11 12 13 14 15 16 17 18 19
        20 21 22 23 24 25 26 27 28 29
        30 31 32
    }

    // The Default impls cannot be generated using the array_impls! macro because
    // they require array literals.

    macro_rules! array_impl_default {
        {$n:expr, $t:ident $($ts:ident)*} => {
            #[stable(since = "1.4.0", feature = "array_default")]
            impl<T> Default for [T; $n] where T: Default {
                fn default() -> [T; $n] {
                    [$t::default(), $($ts::default()),*]
                }
            }
            array_impl_default!{($n - 1), $($ts)*}
        };
        {$n:expr,} => {
            #[stable(since = "1.4.0", feature = "array_default")]
            impl<T> Default for [T; $n] {
                fn default() -> [T; $n] { [] }
            }
        };
    }

    array_impl_default!{32, T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T}

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
↑
  Move up in search results
↓
  Move down in search results
↹
  Switch tab
⏎
  Go to active search result
+ / -
  Collapse/expand all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)