Enum DynRank 

pub enum DynRank {
    Dyn(Box<[usize]>),
    One(usize),
}

Array shape type with dynamic rank.

If the rank is 0 or 1, no heap allocation is necessary. The default value will have rank 1 and contain no elements.

Variants

Dyn(Box<[usize]>)

Shape variant with dynamic rank.

One(usize)

Shape variant with rank 1.

Implementations

impl DynRank

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

Returns the number of elements in each dimension.

Trait Implementations

impl Clone for DynRank

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DynRank

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

Formats the value using the given formatter.

impl Default for DynRank

fn default() -> Self

Returns the “default value” for a type.

impl Hash for DynRank

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 Ord for DynRank

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for DynRank

fn eq(&self, other: &Self) -> 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 PartialOrd for DynRank

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Permutation for DynRank

type Shape<S: Shape> = <S as Shape>::Dyn

Shape after permuting dimensions.

type Layout<L: Layout> = Strided

Layout after permuting dimensions.

impl Shape for DynRank

const RANK: Option<usize> = None

Array rank if known statically, or None if dynamic.

type Head = usize

First dimension.

type Tail = DynRank

Shape excluding the first dimension.

type Reverse = DynRank

Shape with the reverse ordering of dimensions.

type Prepend<D: Dim> = DynRank

Prepend the dimension to the shape.

type Dyn = DynRank

Corresponding shape with dynamically-sized dimensions.

type Merge<S: Shape> = DynRank

Merge each dimension pair, where constant size is preferred over dynamic. The result has dynamic rank if at least one of the inputs has dynamic rank.

type Layout<L: Layout> = Strided

Select layout L for rank 0, or Strided for rank >0 or dynamic.

type Owned<T> = Tensor<T>

Corresponding array type owning its contents.

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

Returns the number of elements in the specified dimension.

fn from_dims(dims: &[usize]) -> Self

Creates an array shape with the given dimensions.

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 Eq for DynRank