pub struct Geometry { /* private fields */ }Expand description
One operand’s physical (extent, stride) per dim, in scalars, and its storage tiling.
Implementations§
Source§impl Geometry
impl Geometry
Sourcepub fn new(dims: &[(usize, usize)]) -> Self
pub fn new(dims: &[(usize, usize)]) -> Self
One (extent, stride) per physical dim, coarsest first, both in scalars.
Sourcepub fn row_major(shape: &[usize]) -> Self
pub fn row_major(shape: &[usize]) -> Self
A dense row-major buffer of shape, coarsest first: what an output with no tensor behind it
is counted in.
Sourcepub fn tiling(&self) -> Tiling
pub fn tiling(&self) -> Tiling
Which dims are pieces of one logical dim: untiled unless the binding said otherwise.
Sourcepub fn labels(&self, axes: &[Axis]) -> Vec<Axis>
pub fn labels(&self, axes: &[Axis]) -> Vec<Axis>
Its trailing dims, coarsest first, each named by the axis it is a piece of: axes name the
trailing logical dims in the tensor’s order, each once per piece its tiling stores it as, in
StoragePartitioning::labels’ order. The dims ahead of them are batch dims, one each.
§Panics
When the tiling does not fit the rank, when the buffer stands for fewer logical dims than
axes name, or when it tiles a batch dim, which is stored one dim.
Sourcepub fn in_stride_order(&self, labels: &[Axis]) -> (Geometry, Vec<Axis>)
pub fn in_stride_order(&self, labels: &[Axis]) -> (Geometry, Vec<Axis>)
This geometry with its trailing labels.len() dims and labels reordered by stride, coarsest
first; leading (batch) dims stay put.
pub fn dims(&self) -> impl Iterator<Item = (usize, usize)> + '_
Trait Implementations§
impl Eq for Geometry
Source§impl From<&TensorBinding> for Geometry
impl From<&TensorBinding> for Geometry
Source§fn from(binding: &TensorBinding) -> Self
fn from(binding: &TensorBinding) -> Self
impl StructuralPartialEq for Geometry
Auto Trait Implementations§
impl Freeze for Geometry
impl RefUnwindSafe for Geometry
impl Send for Geometry
impl Sync for Geometry
impl Unpin for Geometry
impl UnsafeUnpin for Geometry
impl UnwindSafe for Geometry
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneExpand for Twhere
T: Clone,
impl<T> CloneExpand for Twhere
T: Clone,
fn __expand_clone_method(&self, _: &Scope) -> T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> CompilationArg for T
impl<T> CompilationArg for T
Source§fn dynamic_cast<Arg>(&self) -> Argwhere
Arg: CompilationArg,
fn dynamic_cast<Arg>(&self) -> Argwhere
Arg: CompilationArg,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.Source§impl<K, Q> Equivalent<Q> for K
impl<K, Q> Equivalent<Q> for K
Source§fn equivalent(&self, key: &Q) -> bool
fn equivalent(&self, key: &Q) -> bool
key and return true if they are equal.impl<T> ErasedDestructor for Twhere
T: 'static,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more