Struct StridedMapping 

pub struct StridedMapping<S: Shape> { /* private fields */ }

Strided layout mapping type.

Implementations

impl<S: Shape> StridedMapping<S>

pub fn new(shape: S, strides: &[isize]) -> Self

Creates a new, strided layout mapping with the specified shape and strides.

pub fn strides(&self) -> &[isize]

Returns the distance between elements in each dimension.

Trait Implementations

impl<S: Shape> Clone for StridedMapping<S>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S: Debug + Shape> Debug for StridedMapping<S>

where S::Dims<isize>: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<S: Shape> Default for StridedMapping<S>

fn default() -> Self

Returns the “default value” for a type.

impl<S: Hash + Shape> Hash for StridedMapping<S>

where S::Dims<isize>: Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<S: Shape> Mapping for StridedMapping<S>

type Shape = S

Array shape type.

type Layout = Strided

Array layout type.

fn is_contiguous(&self) -> bool

Returns true if the array strides are consistent with contiguous memory layout.

fn shape(&self) -> &S

Returns the array shape.

fn stride(&self, index: usize) -> isize

Returns the distance between elements in the specified dimension.

fn dim(&self, index: usize) -> usize

Returns the number of elements in the specified dimension.

fn dims(&self) -> &[usize]

where Self: Mapping<Shape = DynRank>,

Returns the number of elements in each dimension.

fn is_empty(&self) -> bool

Returns true if the array contains no elements.

fn len(&self) -> usize

Returns the number of elements in the array.

fn rank(&self) -> usize

Returns the array rank, i.e. the number of dimensions.

impl<S: PartialEq + Shape> PartialEq for StridedMapping<S>

where S::Dims<isize>: PartialEq,

fn eq(&self, other: &StridedMapping<S>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<S: Shape<Dims<isize>: Copy> + Copy> Copy for StridedMapping<S>

impl<S: Eq + Shape> Eq for StridedMapping<S>

where S::Dims<isize>: Eq,

impl<S: Shape> StructuralPartialEq for StridedMapping<S>