pub struct Reflection<T, D, S> { /* private fields */ }Expand description
A reflection wrt. a plane.
Implementations§
Source§impl<T, S, const D: usize> Reflection<T, Const<D>, S>
impl<T, S, const D: usize> Reflection<T, Const<D>, S>
Sourcepub fn new_containing_point(
axis: Unit<Matrix<T, Const<D>, Const<1>, S>>,
pt: &OPoint<T, Const<D>>,
) -> Reflection<T, Const<D>, S>
pub fn new_containing_point( axis: Unit<Matrix<T, Const<D>, Const<1>, S>>, pt: &OPoint<T, Const<D>>, ) -> Reflection<T, Const<D>, S>
Creates a new reflection wrt. the plane orthogonal to the given axis and that contains the
point pt.
Source§impl<T, D, S> Reflection<T, D, S>
impl<T, D, S> Reflection<T, D, S>
Sourcepub fn new(
axis: Unit<Matrix<T, D, Const<1>, S>>,
bias: T,
) -> Reflection<T, D, S>
pub fn new( axis: Unit<Matrix<T, D, Const<1>, S>>, bias: T, ) -> Reflection<T, D, S>
Creates a new reflection wrt. the plane orthogonal to the given axis and bias.
The bias is the position of the plane on the axis. In particular, a bias equal to zero represents a plane that passes through the origin.
Sourcepub fn bias(&self) -> T
pub fn bias(&self) -> T
The reflection bias.
The bias is the position of the plane on the axis. In particular, a bias equal to zero represents a plane that passes through the origin.
Sourcepub fn reflect<R2, C2, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>)
pub fn reflect<R2, C2, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>)
Applies the reflection to the columns of rhs.
Sourcepub fn reflect_with_sign<R2, C2, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>,
sign: T,
)
pub fn reflect_with_sign<R2, C2, S2>( &self, rhs: &mut Matrix<T, R2, C2, S2>, sign: T, )
Applies the reflection to the columns of rhs.
Sourcepub fn reflect_rows<R2, C2, S2, S3>(
&self,
lhs: &mut Matrix<T, R2, C2, S2>,
work: &mut Matrix<T, R2, Const<1>, S3>,
)where
R2: Dim,
C2: Dim,
S2: StorageMut<T, R2, C2>,
S3: StorageMut<T, R2>,
ShapeConstraint: DimEq<C2, D> + AreMultipliable<R2, C2, D, Const<1>>,
pub fn reflect_rows<R2, C2, S2, S3>(
&self,
lhs: &mut Matrix<T, R2, C2, S2>,
work: &mut Matrix<T, R2, Const<1>, S3>,
)where
R2: Dim,
C2: Dim,
S2: StorageMut<T, R2, C2>,
S3: StorageMut<T, R2>,
ShapeConstraint: DimEq<C2, D> + AreMultipliable<R2, C2, D, Const<1>>,
Applies the reflection to the rows of lhs.
Sourcepub fn reflect_rows_with_sign<R2, C2, S2, S3>(
&self,
lhs: &mut Matrix<T, R2, C2, S2>,
work: &mut Matrix<T, R2, Const<1>, S3>,
sign: T,
)where
R2: Dim,
C2: Dim,
S2: StorageMut<T, R2, C2>,
S3: StorageMut<T, R2>,
ShapeConstraint: DimEq<C2, D> + AreMultipliable<R2, C2, D, Const<1>>,
pub fn reflect_rows_with_sign<R2, C2, S2, S3>(
&self,
lhs: &mut Matrix<T, R2, C2, S2>,
work: &mut Matrix<T, R2, Const<1>, S3>,
sign: T,
)where
R2: Dim,
C2: Dim,
S2: StorageMut<T, R2, C2>,
S3: StorageMut<T, R2>,
ShapeConstraint: DimEq<C2, D> + AreMultipliable<R2, C2, D, Const<1>>,
Applies the reflection to the rows of lhs.
Auto Trait Implementations§
impl<T, D, S> Freeze for Reflection<T, D, S>
impl<T, D, S> RefUnwindSafe for Reflection<T, D, S>
impl<T, D, S> Send for Reflection<T, D, S>
impl<T, D, S> Sync for Reflection<T, D, S>
impl<T, D, S> Unpin for Reflection<T, D, S>
impl<T, D, S> UnwindSafe for Reflection<T, D, S>
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
Mutably borrows from an owned value. Read more
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§fn 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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.