[−][src]Struct oxygengine_physics_2d::prelude::nalgebra::base::SliceStorage
A matrix data storage for a matrix slice. Only contains an internal reference to another matrix data storage.
Implementations
impl<'a, N, R, C, RStride, CStride> SliceStorage<'a, N, R, C, RStride, CStride> where
C: Dim,
CStride: Dim,
N: Scalar,
R: Dim,
RStride: Dim,
[src]
C: Dim,
CStride: Dim,
N: Scalar,
R: Dim,
RStride: Dim,
pub unsafe fn from_raw_parts(
ptr: *const N,
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorage<'a, N, R, C, RStride, CStride> where
CStride: Dim,
RStride: Dim,
[src]
ptr: *const N,
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorage<'a, N, R, C, RStride, CStride> where
CStride: Dim,
RStride: Dim,
Create a new matrix slice without bound checking and from a raw pointer.
impl<'a, N, R, C> SliceStorage<'a, N, R, C, Dynamic, Dynamic> where
C: Dim,
N: Scalar,
R: Dim,
[src]
C: Dim,
N: Scalar,
R: Dim,
pub unsafe fn new_unchecked<RStor, CStor, S>(
storage: &'a S,
start: (usize, usize),
shape: (R, C)
) -> SliceStorage<'a, N, R, C, <S as Storage<N, RStor, CStor>>::RStride, <S as Storage<N, RStor, CStor>>::CStride> where
CStor: Dim,
RStor: Dim,
S: Storage<N, RStor, CStor>,
[src]
storage: &'a S,
start: (usize, usize),
shape: (R, C)
) -> SliceStorage<'a, N, R, C, <S as Storage<N, RStor, CStor>>::RStride, <S as Storage<N, RStor, CStor>>::CStride> where
CStor: Dim,
RStor: Dim,
S: Storage<N, RStor, CStor>,
Create a new matrix slice without bound checking.
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, N, R, C, RStride, CStride> where
CStor: Dim,
CStride: Dim,
RStor: Dim,
RStride: Dim,
S: Storage<N, RStor, CStor>,
[src]
storage: &'a S,
start: (usize, usize),
shape: (R, C),
strides: (RStride, CStride)
) -> SliceStorage<'a, N, R, C, RStride, CStride> where
CStor: Dim,
CStride: Dim,
RStor: Dim,
RStride: Dim,
S: Storage<N, RStor, CStor>,
Create a new matrix slice without bound checking.
Trait Implementations
impl<'a, N, R, C, RStride, CStride> Clone for SliceStorage<'a, N, R, C, RStride, CStride> where
C: Dim,
CStride: Dim,
N: Scalar,
R: Dim,
RStride: Dim,
[src]
C: Dim,
CStride: Dim,
N: Scalar,
R: Dim,
RStride: Dim,
fn clone(&self) -> SliceStorage<'a, N, R, C, RStride, CStride>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<'a, N, R, C> ContiguousStorage<N, R, C> for SliceStorage<'a, N, R, C, U1, R> where
C: IsNotStaticOne + Dim,
N: Scalar,
R: DimName,
[src]
C: IsNotStaticOne + Dim,
N: Scalar,
R: DimName,
impl<'a, N, R, CStride> ContiguousStorage<N, R, U1> for SliceStorage<'a, N, R, U1, U1, CStride> where
CStride: Dim,
N: Scalar,
R: Dim,
[src]
CStride: Dim,
N: Scalar,
R: Dim,
impl<'a, N, R, C, RStride, CStride> Copy for SliceStorage<'a, N, R, C, RStride, CStride> where
C: Dim,
CStride: Dim,
N: Scalar,
R: Dim,
RStride: Dim,
[src]
C: Dim,
CStride: Dim,
N: Scalar,
R: Dim,
RStride: Dim,
impl<'a, N, R, C, RStride, CStride> Debug for SliceStorage<'a, N, R, C, RStride, CStride> where
C: Dim + Debug,
CStride: Dim + Debug,
N: Scalar + Debug,
R: Dim + Debug,
RStride: Dim + Debug,
[src]
C: Dim + Debug,
CStride: Dim + Debug,
N: Scalar + Debug,
R: Dim + Debug,
RStride: Dim + Debug,
impl<'a, N, R, C, RStride, CStride> Send for SliceStorage<'a, N, R, C, RStride, CStride> where
C: Dim,
CStride: Dim,
N: Scalar + Send,
R: Dim,
RStride: Dim,
[src]
C: Dim,
CStride: Dim,
N: Scalar + Send,
R: Dim,
RStride: Dim,
impl<'a, N, R, C, RStride, CStride> Storage<N, R, C> for SliceStorage<'a, N, R, C, RStride, CStride> where
C: Dim,
CStride: Dim,
N: Scalar,
R: Dim,
RStride: Dim,
[src]
C: Dim,
CStride: Dim,
N: Scalar,
R: Dim,
RStride: Dim,
type RStride = RStride
The static stride of this storage's rows.
type CStride = CStride
The static stride of this storage's columns.
fn ptr(&self) -> *const N
[src]
fn shape(&self) -> (R, C)
[src]
fn strides(
&self
) -> (<SliceStorage<'a, N, R, C, RStride, CStride> as Storage<N, R, C>>::RStride, <SliceStorage<'a, N, R, C, RStride, CStride> as Storage<N, R, C>>::CStride)
[src]
&self
) -> (<SliceStorage<'a, N, R, C, RStride, CStride> as Storage<N, R, C>>::RStride, <SliceStorage<'a, N, R, C, RStride, CStride> as Storage<N, R, C>>::CStride)
fn is_contiguous(&self) -> bool
[src]
fn into_owned(self) -> <DefaultAllocator as Allocator<N, R, C>>::Buffer where
DefaultAllocator: Allocator<N, R, C>,
[src]
DefaultAllocator: Allocator<N, R, C>,
fn clone_owned(&self) -> <DefaultAllocator as Allocator<N, R, C>>::Buffer where
DefaultAllocator: Allocator<N, R, C>,
[src]
DefaultAllocator: Allocator<N, R, C>,
fn as_slice(&self) -> &[N]ⓘ
[src]
fn linear_index(&self, irow: usize, icol: usize) -> usize
[src]
unsafe fn get_address_unchecked_linear(&self, i: usize) -> *const N
[src]
unsafe fn get_address_unchecked(&self, irow: usize, icol: usize) -> *const N
[src]
unsafe fn get_unchecked_linear(&self, i: usize) -> &N
[src]
unsafe fn get_unchecked(&self, irow: usize, icol: usize) -> &N
[src]
impl<'a, N, R, C, RStride, CStride> Sync for SliceStorage<'a, N, R, C, RStride, CStride> where
C: Dim,
CStride: Dim,
N: Scalar + Sync,
R: Dim,
RStride: Dim,
[src]
C: Dim,
CStride: Dim,
N: Scalar + Sync,
R: Dim,
RStride: Dim,
Auto Trait Implementations
impl<'a, N, R, C, RStride, CStride> RefUnwindSafe for SliceStorage<'a, N, R, C, RStride, CStride> where
C: RefUnwindSafe,
CStride: RefUnwindSafe,
N: RefUnwindSafe,
R: RefUnwindSafe,
RStride: RefUnwindSafe,
C: RefUnwindSafe,
CStride: RefUnwindSafe,
N: RefUnwindSafe,
R: RefUnwindSafe,
RStride: RefUnwindSafe,
impl<'a, N, R, C, RStride, CStride> Unpin for SliceStorage<'a, N, R, C, RStride, CStride> where
C: Unpin,
CStride: Unpin,
R: Unpin,
RStride: Unpin,
C: Unpin,
CStride: Unpin,
R: Unpin,
RStride: Unpin,
impl<'a, N, R, C, RStride, CStride> UnwindSafe for SliceStorage<'a, N, R, C, RStride, CStride> where
C: UnwindSafe,
CStride: UnwindSafe,
N: RefUnwindSafe,
R: UnwindSafe,
RStride: UnwindSafe,
C: UnwindSafe,
CStride: UnwindSafe,
N: RefUnwindSafe,
R: UnwindSafe,
RStride: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Any for T where
T: Any,
T: Any,
fn get_type_id(&self) -> TypeId
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Downcast for T where
T: Any,
T: Any,
fn into_any(self: Box<T>) -> Box<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn as_any(&self) -> &(dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
impl<T> DowncastSync for T where
T: Send + Sync + Any,
T: Send + Sync + Any,
impl<T> Event for T where
T: Send + Sync + 'static,
T: Send + Sync + 'static,
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Resource for T where
T: Any,
T: Any,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> Slottable for T where
T: Copy,
[src]
T: Copy,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn is_in_subset(&self) -> bool
fn to_subset_unchecked(&self) -> SS
fn from_subset(element: &SS) -> SP
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> UserData for T where
T: Clone + Send + Sync + Any,
[src]
T: Clone + Send + Sync + Any,
fn clone_boxed(&self) -> Box<dyn UserData + 'static>
[src]
fn to_any(&self) -> Box<dyn Any + 'static + Sync + Send>
[src]
fn as_any(&self) -> &(dyn Any + 'static + Sync + Send)
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,