Lines Matching full:slices

7 //! Slices are a view into a block of memory represented as a pointer and a
18 //! Slices are either mutable or shared. The shared slice type is `&[T]`,
33 //! There are several structs that are useful for slices, such as [`Iter`], which
38 //! There are several implementations of common traits for slices. Some examples
42 //! * [`Eq`], [`Ord`] - for slices whose element type are [`Eq`] or [`Ord`].
43 //! * [`Hash`] - for slices whose element type is [`Hash`].
47 //! The slices implement `IntoIterator`. The iterator yields references to the
259     /// Also, it allocates temporary storage half the size of `self`, but for short slices a
312     /// Also, it allocates temporary storage half the size of `self`, but for short slices a
357     /// Also, it allocates temporary storage half the size of `self`, but for short slices a
398     /// heapsort, while achieving linear time on slices with certain patterns. It uses some
717 // Extension traits for slices over specific kinds of data
835 // Standard trait implementations for slices
871         // slices here are always in-bounds.  in clone_into()
957 /// The two slices must be non-empty and `mid` must be in bounds. Buffer `buf` must be long enough
1085     // Slices of up to this length get sorted using insertion sort.  in merge_sort()