pub fn split_last(self) -> (T, Array<Pred<L>, T>)
        where Self: ArraySplit<L, T>,
              L: NatPred,
              Pred<L>: Arrayify<T>
    {
        <Self as ArraySplit<L, T>>::split_last(self)
    }
/// Split the `Array` apart into its last element and an `Array` consisting of preceding elements.
/// This splitting is quite efficient and consists internally of only pointer casts and dereferences.
///
/// ```
/// # #[macro_use] extern crate tll_array; fn main() {
/// let array = array![42i32, 84, 126, 168, 210, 252, 294, 336];
/// assert_eq!(array.len(), 8);
/// let (last, init) = array.split_last();
/// assert_eq!(last, 336);
/// assert_eq!(init.len(), 7);
/// # }
/// ```
Split the `Array` apart into its last element and an `Array` consisting of preceding elements.
This splitting is quite efficient and consists internally of only pointer casts and dereferences.


Split the ` Array ` apart into its last element and an ` Array ` consisting of preceding elements . This splitting is quite efficient and consists internally of only pointer casts and dereferences .
pub fn split_last(self) -> (T, Array<Pred<L>, T>)
        where Self: ArraySplit<L, T>,
              L: NatPred,
              Pred<L>: Arrayify<T>
    {
        <Self as ArraySplit<L, T>>::split_last(self)
    }
pub fn split_last ( self ) -> ( T , Array < Pred < L > , T > ) where Self : ArraySplit < L , T > , L : NatPred , Pred < L > : Arrayify < T > { < Self as ArraySplit < L , T > > :: split_last ( self ) }
Split the `Array` apart into its last element and an `Array` consisting of preceding elements.
Split the ` Array ` apart into its last element and an ` Array ` consisting of preceding elements .
self
self
#[macro_use] extern crate tll_array; fn main() {
None
}
None