Struct heron::rapier_plugin::rapier2d::prelude::nalgebra::base::SliceStorageMut [−][src]
pub struct SliceStorageMut<'a, T, R, C, RStride, CStride> where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim, { /* fields omitted */ }
Expand description
A mutable matrix data storage for mutable matrix slice. Only contains an internal mutable reference to another matrix data storage.
Implementations
impl<'a, T, R, C, RStride, CStride> SliceStorageMut<'a, T, R, C, RStride, CStride> where
T: Scalar,
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
SliceStorageMut<'a, T, R, C, RStride, CStride>: RawStorageMut<T, R, C>,
SliceStorageMut<'a, T, R, C, RStride, CStride>: IsContiguous,
impl<'a, T, R, C, RStride, CStride> SliceStorageMut<'a, T, R, C, RStride, CStride> where
T: Scalar,
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
SliceStorageMut<'a, T, R, C, RStride, CStride>: RawStorageMut<T, R, C>,
SliceStorageMut<'a, T, R, C, RStride, CStride>: IsContiguous,
Extracts the original slice from this storage
pub unsafe fn from_raw_parts(
ptr: *mut T,
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorageMut<'a, T, R, C, RStride, CStride> where
RStride: Dim,
CStride: Dim,
pub unsafe fn from_raw_parts(
ptr: *mut T,
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorageMut<'a, T, R, C, RStride, CStride> where
RStride: Dim,
CStride: Dim,
Create a new matrix slice without bound checking and from a raw pointer.
pub unsafe fn new_unchecked<RStor, CStor, S>(
storage: &'a mut S,
start: (usize, usize),
shape: (R, C)
) -> SliceStorageMut<'a, T, R, C, <S as RawStorage<T, RStor, CStor>>::RStride, <S as RawStorage<T, RStor, CStor>>::CStride> where
RStor: Dim,
CStor: Dim,
S: RawStorageMut<T, RStor, CStor>,
pub unsafe fn new_unchecked<RStor, CStor, S>(
storage: &'a mut S,
start: (usize, usize),
shape: (R, C)
) -> SliceStorageMut<'a, T, R, C, <S as RawStorage<T, RStor, CStor>>::RStride, <S as RawStorage<T, RStor, CStor>>::CStride> where
RStor: Dim,
CStor: Dim,
S: RawStorageMut<T, RStor, CStor>,
Create a new matrix slice without bound checking.
pub unsafe fn new_with_strides_unchecked<S, RStor, CStor, RStride, CStride>(
storage: &'a mut S,
start: (usize, usize),
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorageMut<'a, T, R, C, RStride, CStride> where
RStor: Dim,
CStor: Dim,
S: RawStorageMut<T, RStor, CStor>,
RStride: Dim,
CStride: Dim,
pub unsafe fn new_with_strides_unchecked<S, RStor, CStor, RStride, CStride>(
storage: &'a mut S,
start: (usize, usize),
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorageMut<'a, T, R, C, RStride, CStride> where
RStor: Dim,
CStor: Dim,
S: RawStorageMut<T, RStor, CStor>,
RStride: Dim,
CStride: Dim,
Create a new matrix slice without bound checking.
impl<'a, T, R, C, RStride, CStride> SliceStorageMut<'a, T, R, C, RStride, CStride> where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
SliceStorageMut<'a, T, R, C, RStride, CStride>: RawStorage<T, R, C>,
SliceStorageMut<'a, T, R, C, RStride, CStride>: IsContiguous,
impl<'a, T, R, C, RStride, CStride> SliceStorageMut<'a, T, R, C, RStride, CStride> where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
SliceStorageMut<'a, T, R, C, RStride, CStride>: RawStorage<T, R, C>,
SliceStorageMut<'a, T, R, C, RStride, CStride>: IsContiguous,
Extracts the original slice from this storage
Trait Implementations
impl<'a, T, R, C, RStride, CStride> RawStorage<T, R, C> for SliceStorageMut<'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 SliceStorageMut<'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.
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 more
pub fn strides(
&self
) -> (<SliceStorageMut<'a, T, R, C, RStride, CStride> as RawStorage<T, R, C>>::RStride, <SliceStorageMut<'a, T, R, C, RStride, CStride> as RawStorage<T, R, C>>::CStride)
pub fn strides(
&self
) -> (<SliceStorageMut<'a, T, R, C, RStride, CStride> as RawStorage<T, R, C>>::RStride, <SliceStorageMut<'a, T, R, C, RStride, CStride> as RawStorage<T, R, C>>::CStride)
The spacing between consecutive row elements and consecutive column elements. Read more
Indicates whether this data buffer stores its elements contiguously. Read more
Retrieves the data buffer as a contiguous slice. Read more
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
Gets the address of the i-th matrix component without performing bound-checking. Read more
Gets the address of the i-th matrix component without performing bound-checking. Read more
Retrieves a reference to the i-th element without bound-checking. Read more
impl<'a, T, R, C, RStride, CStride> RawStorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride> where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
impl<'a, T, R, C, RStride, CStride> RawStorageMut<T, R, C> for SliceStorageMut<'a, T, R, C, RStride, CStride> where
R: Dim,
C: Dim,
RStride: Dim,
CStride: Dim,
Retrieves the mutable data buffer as a contiguous slice. Read more
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
Gets the mutable address of the i-th matrix component without performing bound-checking. Read more
Retrieves a mutable reference to the i-th element without bound-checking. Read more
Retrieves a mutable reference to the element at (irow, icol)
without bound-checking. Read more
Swaps two elements using their linear index without bound-checking. Read more
pub fn into_owned(self) -> <DefaultAllocator as Allocator<T, R, C>>::Buffer where
DefaultAllocator: Allocator<T, R, C>,
pub fn into_owned(self) -> <DefaultAllocator as Allocator<T, R, C>>::Buffer where
DefaultAllocator: Allocator<T, R, C>,
Builds a matrix data storage that does not contain any reference.
pub fn clone_owned(&self) -> <DefaultAllocator as Allocator<T, R, C>>::Buffer where
DefaultAllocator: Allocator<T, R, C>,
pub fn clone_owned(&self) -> <DefaultAllocator as Allocator<T, R, C>>::Buffer where
DefaultAllocator: Allocator<T, R, C>,
Clones this data storage to one that does not contain any reference.
impl<'a, T, R, C> IsContiguous for SliceStorageMut<'a, T, R, C, Const<1_usize>, R> where
R: DimName,
C: Dim + IsNotStaticOne,
impl<'a, T, R, CStride> IsContiguous for SliceStorageMut<'a, T, R, Const<1_usize>, Const<1_usize>, CStride> where
R: Dim,
CStride: Dim,
Auto Trait Implementations
impl<'a, T, R, C, RStride, CStride> RefUnwindSafe for SliceStorageMut<'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 SliceStorageMut<'a, T, R, C, RStride, CStride> where
C: Unpin,
CStride: Unpin,
R: Unpin,
RStride: Unpin,
impl<'a, T, R, C, RStride, CStride> !UnwindSafe for SliceStorageMut<'a, T, R, C, RStride, CStride>
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
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 more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub 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 more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub 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 more
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn vzip(self) -> V
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more