Struct nalgebra::geometry::Reflection [−][src]
Expand description
A reflection wrt. a plane.
Implementations
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.
pub fn new_containing_point(
axis: Unit<Vector<N, D, S>>,
pt: &Point<N, D>
) -> Self where
D: DimName,
DefaultAllocator: Allocator<N, D>,
pub fn new_containing_point(
axis: Unit<Vector<N, D, S>>,
pt: &Point<N, D>
) -> Self where
D: DimName,
DefaultAllocator: Allocator<N, D>,
Creates a new reflection wrt. the plane orthogonal to the given axis and that contains the
point pt.
pub fn reflect<R2: Dim, C2: Dim, S2>(&self, rhs: &mut Matrix<N, R2, C2, S2>) where
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn reflect<R2: Dim, C2: Dim, S2>(&self, rhs: &mut Matrix<N, R2, C2, S2>) where
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Applies the reflection to the columns of rhs.
pub fn reflect_with_sign<R2: Dim, C2: Dim, S2>(
&self,
rhs: &mut Matrix<N, R2, C2, S2>,
sign: N
) where
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
pub fn reflect_with_sign<R2: Dim, C2: Dim, S2>(
&self,
rhs: &mut Matrix<N, R2, C2, S2>,
sign: N
) where
S2: StorageMut<N, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,
Applies the reflection to the columns of rhs.
pub fn reflect_rows<R2: Dim, C2: Dim, S2, S3>(
&self,
lhs: &mut Matrix<N, R2, C2, S2>,
work: &mut Vector<N, R2, S3>
) where
S2: StorageMut<N, R2, C2>,
S3: StorageMut<N, R2>,
ShapeConstraint: DimEq<C2, D> + AreMultipliable<R2, C2, D, U1>,
pub fn reflect_rows<R2: Dim, C2: Dim, S2, S3>(
&self,
lhs: &mut Matrix<N, R2, C2, S2>,
work: &mut Vector<N, R2, S3>
) where
S2: StorageMut<N, R2, C2>,
S3: StorageMut<N, R2>,
ShapeConstraint: DimEq<C2, D> + AreMultipliable<R2, C2, D, U1>,
Applies the reflection to the rows of lhs.
pub fn reflect_rows_with_sign<R2: Dim, C2: Dim, S2, S3>(
&self,
lhs: &mut Matrix<N, R2, C2, S2>,
work: &mut Vector<N, R2, S3>,
sign: N
) where
S2: StorageMut<N, R2, C2>,
S3: StorageMut<N, R2>,
ShapeConstraint: DimEq<C2, D> + AreMultipliable<R2, C2, D, U1>,
pub fn reflect_rows_with_sign<R2: Dim, C2: Dim, S2, S3>(
&self,
lhs: &mut Matrix<N, R2, C2, S2>,
work: &mut Vector<N, R2, S3>,
sign: N
) where
S2: StorageMut<N, R2, C2>,
S3: StorageMut<N, R2>,
ShapeConstraint: DimEq<C2, D> + AreMultipliable<R2, C2, D, U1>,
Applies the reflection to the rows of lhs.
Auto Trait Implementations
impl<N, D, S> RefUnwindSafe for Reflection<N, D, S> where
D: RefUnwindSafe,
N: RefUnwindSafe,
S: RefUnwindSafe,
impl<N, D, S> Send for Reflection<N, D, S> where
N: Send,
S: Send,
impl<N, D, S> Sync for Reflection<N, D, S> where
N: Sync,
S: Sync,
impl<N, D, S> Unpin for Reflection<N, D, S> where
D: Unpin,
N: Unpin,
S: Unpin,
impl<N, D, S> UnwindSafe for Reflection<N, D, S> where
D: UnwindSafe,
N: UnwindSafe,
S: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
Checks if self is actually part of its subset T (and can be converted to it).
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
The inclusion map: converts self to the equivalent element of its superset.