Struct heron::rapier_plugin::rapier2d::prelude::nalgebra::SliceStorage
source · pub struct SliceStorage<'a, T, R, C, RStride, CStride>where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,{ /* private fields */ }
Expand description
A matrix data storage for a matrix slice. Only contains an internal reference to another matrix data storage.
Implementations
sourceimpl<'a, T, R, C, RStride, CStride> SliceStorage<'a, T, R, C, RStride, CStride>where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
impl<'a, T, R, C, RStride, CStride> SliceStorage<'a, T, R, C, RStride, CStride>where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
sourcepub unsafe fn from_raw_parts(
ptr: *const T,
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorage<'a, T, R, C, RStride, CStride>where
RStride: Dim,
CStride: Dim,
pub unsafe fn from_raw_parts(
ptr: *const T,
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorage<'a, T, R, C, RStride, CStride>where
RStride: Dim,
CStride: Dim,
Create a new matrix slice without bound checking and from a raw pointer.
sourceimpl<'a, T, R, C> SliceStorage<'a, T, R, C, Dynamic, Dynamic>where
R: Dim,
C: Dim,
impl<'a, T, R, C> SliceStorage<'a, T, R, C, Dynamic, Dynamic>where
R: Dim,
C: Dim,
sourcepub unsafe fn new_unchecked<RStor, CStor, S>(
storage: &'a S,
start: (usize, usize),
shape: (R, C)
) -> SliceStorage<'a, T, R, C, <S as RawStorage<T, RStor, CStor>>::RStride, <S as RawStorage<T, RStor, CStor>>::CStride>where
RStor: Dim,
CStor: Dim,
S: RawStorage<T, RStor, CStor>,
pub unsafe fn new_unchecked<RStor, CStor, S>(
storage: &'a S,
start: (usize, usize),
shape: (R, C)
) -> SliceStorage<'a, T, R, C, <S as RawStorage<T, RStor, CStor>>::RStride, <S as RawStorage<T, RStor, CStor>>::CStride>where
RStor: Dim,
CStor: Dim,
S: RawStorage<T, RStor, CStor>,
Create a new matrix slice without bound checking.
sourcepub unsafe fn new_with_strides_unchecked<S, RStor, CStor, RStride, CStride>(
storage: &'a S,
start: (usize, usize),
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorage<'a, T, R, C, RStride, CStride>where
RStor: Dim,
CStor: Dim,
S: RawStorage<T, RStor, CStor>,
RStride: Dim,
CStride: Dim,
pub unsafe fn new_with_strides_unchecked<S, RStor, CStor, RStride, CStride>(
storage: &'a S,
start: (usize, usize),
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorage<'a, T, R, C, RStride, CStride>where
RStor: Dim,
CStor: Dim,
S: RawStorage<T, RStor, CStor>,
RStride: Dim,
CStride: Dim,
Create a new matrix slice without bound checking.
sourceimpl<'a, T, R, C, RStride, CStride> SliceStorage<'a, T, R, C, RStride, CStride>where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
SliceStorage<'a, T, R, C, RStride, CStride>: RawStorage<T, R, C> + IsContiguous,
impl<'a, T, R, C, RStride, CStride> SliceStorage<'a, T, R, C, RStride, CStride>where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
SliceStorage<'a, T, R, C, RStride, CStride>: RawStorage<T, R, C> + IsContiguous,
sourcepub fn into_slice(self) -> &'a [T] ⓘ
pub fn into_slice(self) -> &'a [T] ⓘ
Extracts the original slice from this storage
Trait Implementations
sourceimpl<'a, T, R, C, RStride, CStride> Clone for SliceStorage<'a, T, R, C, RStride, CStride>where
T: Scalar,
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
impl<'a, T, R, C, RStride, CStride> Clone for SliceStorage<'a, T, R, C, RStride, CStride>where
T: Scalar,
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
sourcefn clone(&self) -> SliceStorage<'a, T, R, C, RStride, CStride>
fn clone(&self) -> SliceStorage<'a, T, R, C, RStride, CStride>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresourceimpl<'a, T, R, C, RStride, CStride> Debug for SliceStorage<'a, T, R, C, RStride, CStride>where
T: Debug,
R: Debug + Dim,
C: Debug + Dim,
RStride: Debug + Dim,
CStride: Debug + Dim,
impl<'a, T, R, C, RStride, CStride> Debug for SliceStorage<'a, T, R, C, RStride, CStride>where
T: Debug,
R: Debug + Dim,
C: Debug + Dim,
RStride: Debug + Dim,
CStride: Debug + Dim,
sourceimpl<'a, T, R, C, RStride, CStride> RawStorage<T, R, C> for SliceStorage<'a, T, R, C, RStride, CStride>where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
impl<'a, T, R, C, RStride, CStride> RawStorage<T, R, C> for SliceStorage<'a, T, R, C, RStride, CStride>where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
type RStride = RStride
type RStride = RStride
The static stride of this storage’s rows.
type CStride = CStride
type CStride = CStride
The static stride of this storage’s columns.
sourcefn shape(&self) -> (R, C)
fn shape(&self) -> (R, C)
The dimension of the matrix at run-time. Arr length of zero indicates the additive identity
element of any dimension. Must be equal to
Self::dimension()
if it is not None
. Read moresourcefn strides(
&self
) -> (<SliceStorage<'a, T, R, C, RStride, CStride> as RawStorage<T, R, C>>::RStride, <SliceStorage<'a, T, R, C, RStride, CStride> as RawStorage<T, R, C>>::CStride)
fn strides(
&self
) -> (<SliceStorage<'a, T, R, C, RStride, CStride> as RawStorage<T, R, C>>::RStride, <SliceStorage<'a, T, R, C, RStride, CStride> as RawStorage<T, R, C>>::CStride)
The spacing between consecutive row elements and consecutive column elements. Read more
sourcefn is_contiguous(&self) -> bool
fn is_contiguous(&self) -> bool
Indicates whether this data buffer stores its elements contiguously. Read more
sourceunsafe fn as_slice_unchecked(&self) -> &[T] ⓘ
unsafe fn as_slice_unchecked(&self) -> &[T] ⓘ
Retrieves the data buffer as a contiguous slice. Read more
sourcefn linear_index(&self, irow: usize, icol: usize) -> usize
fn linear_index(&self, irow: usize, icol: usize) -> usize
Compute the index corresponding to the irow-th row and icol-th column of this matrix. The
index must be such that the following holds: Read more
sourcefn get_address_unchecked_linear(&self, i: usize) -> *const T
fn get_address_unchecked_linear(&self, i: usize) -> *const T
Gets the address of the i-th matrix component without performing bound-checking. Read more
sourcefn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const T
Gets the address of the i-th matrix component without performing bound-checking. Read more
sourceunsafe fn get_unchecked_linear(&self, i: usize) -> &T
unsafe fn get_unchecked_linear(&self, i: usize) -> &T
Retrieves a reference to the i-th element without bound-checking. Read more
sourceimpl<'a, T, R, C, RStride, CStride> Storage<T, R, C> for SliceStorage<'a, T, R, C, RStride, CStride>where
T: Scalar,
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
impl<'a, T, R, C, RStride, CStride> Storage<T, R, C> for SliceStorage<'a, T, R, C, RStride, CStride>where
T: Scalar,
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
sourcefn into_owned(self) -> <DefaultAllocator as Allocator<T, R, C>>::Bufferwhere
DefaultAllocator: Allocator<T, R, C>,
fn into_owned(self) -> <DefaultAllocator as Allocator<T, R, C>>::Bufferwhere
DefaultAllocator: Allocator<T, R, C>,
Builds a matrix data storage that does not contain any reference.
sourcefn clone_owned(&self) -> <DefaultAllocator as Allocator<T, R, C>>::Bufferwhere
DefaultAllocator: Allocator<T, R, C>,
fn clone_owned(&self) -> <DefaultAllocator as Allocator<T, R, C>>::Bufferwhere
DefaultAllocator: Allocator<T, R, C>,
Clones this data storage to one that does not contain any reference.
impl<'a, T, R, C, RStride, CStride> Copy for SliceStorage<'a, T, R, C, RStride, CStride>where
T: Scalar,
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
impl<'a, T, R, C> IsContiguous for SliceStorage<'a, T, R, C, Const<1>, R>where
R: DimName,
C: Dim + IsNotStaticOne,
impl<'a, T, R, CStride> IsContiguous for SliceStorage<'a, T, R, Const<1>, Const<1>, CStride>where
R: Dim,
CStride: Dim,
impl<'a, T, R, C, RStride, CStride> Send for SliceStorage<'a, T, R, C, RStride, CStride>where
T: Send,
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
impl<'a, T, R, C, RStride, CStride> Sync for SliceStorage<'a, T, R, C, RStride, CStride>where
T: Sync,
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
Auto Trait Implementations
impl<'a, T, R, C, RStride, CStride> RefUnwindSafe for SliceStorage<'a, T, R, C, RStride, CStride>where
C: RefUnwindSafe,
CStride: RefUnwindSafe,
R: RefUnwindSafe,
RStride: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, T, R, C, RStride, CStride> Unpin for SliceStorage<'a, T, R, C, RStride, CStride>where
C: Unpin,
CStride: Unpin,
R: Unpin,
RStride: Unpin,
impl<'a, T, R, C, RStride, CStride> UnwindSafe for SliceStorage<'a, T, R, C, RStride, CStride>where
C: UnwindSafe,
CStride: UnwindSafe,
R: UnwindSafe,
RStride: UnwindSafe,
T: RefUnwindSafe,
Blanket Implementations
impl<T, U> AsBindGroupShaderType<U> for Twhere
U: ShaderType,
&'a T: for<'a> Into<U>,
impl<T, U> AsBindGroupShaderType<U> for Twhere
U: ShaderType,
&'a T: for<'a> Into<U>,
fn as_bind_group_shader_type(
&self,
_images: &HashMap<Handle<Image>, <Image as RenderAsset>::PreparedAsset, RandomState, Global>
) -> U
fn as_bind_group_shader_type(
&self,
_images: &HashMap<Handle<Image>, <Image as RenderAsset>::PreparedAsset, RandomState, Global>
) -> U
Return the
T
[ShaderType
] for self
. When used in [AsBindGroup
]
derives, it is safe to assume that all images in self
exist. Read moresourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read morefn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read morefn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read morefn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read moresourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read morefn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.