Struct na::geometry::Reflection
source · 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>where
T: ComplexField,
S: Storage<T, Const<D>, Const<1>>,
impl<T, S, const D: usize> Reflection<T, Const<D>, S>where T: ComplexField, S: Storage<T, Const<D>, Const<1>>,
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>where
T: ComplexField,
D: Dim,
S: Storage<T, D, Const<1>>,
impl<T, D, S> Reflection<T, D, S>where T: ComplexField, D: Dim, S: Storage<T, D, Const<1>>,
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>)where
R2: Dim,
C2: Dim,
S2: StorageMut<T, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn reflect<R2, C2, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>)where R2: Dim, C2: Dim, S2: StorageMut<T, R2, C2>, ShapeConstraint: SameNumberOfRows<R2, D>,
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
)where
R2: Dim,
C2: Dim,
S2: StorageMut<T, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn reflect_with_sign<R2, C2, S2>( &self, rhs: &mut Matrix<T, R2, C2, S2>, sign: T )where R2: Dim, C2: Dim, S2: StorageMut<T, R2, C2>, ShapeConstraint: SameNumberOfRows<R2, D>,
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, Const<1>>,
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, Const<1>>, 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, Const<1>>,
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, Const<1>>, 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> RefUnwindSafe for Reflection<T, D, S>where D: RefUnwindSafe, S: RefUnwindSafe, T: RefUnwindSafe,
impl<T, D, S> Send for Reflection<T, D, S>where D: Send, S: Send, T: Send,
impl<T, D, S> Sync for Reflection<T, D, S>where D: Sync, S: Sync, T: Sync,
impl<T, D, S> Unpin for Reflection<T, D, S>where D: Unpin, S: Unpin, T: Unpin,
impl<T, D, S> UnwindSafe for Reflection<T, D, S>where D: UnwindSafe, S: UnwindSafe, T: UnwindSafe,
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.