Struct bevy_rapier2d::prelude::nalgebra::geometry::Reflection [−][src]
pub struct Reflection<T, D, S> where
T: Scalar,
S: Storage<T, D, Const<1_usize>>,
D: Dim, { /* fields omitted */ }
Expand description
A reflection wrt. a plane.
Implementations
impl<T, S, const D: usize> Reflection<T, Const<D>, S> where
T: ComplexField,
S: Storage<T, Const<D>, Const<1_usize>>,
[src]
impl<T, S, const D: usize> Reflection<T, Const<D>, S> where
T: ComplexField,
S: Storage<T, Const<D>, Const<1_usize>>,
[src]pub fn new_containing_point(
axis: Unit<Matrix<T, Const<D>, Const<1_usize>, S>>,
pt: &Point<T, D>
) -> Reflection<T, Const<D>, S>
[src]
pub fn new_containing_point(
axis: Unit<Matrix<T, Const<D>, Const<1_usize>, S>>,
pt: &Point<T, D>
) -> Reflection<T, Const<D>, S>
[src]Creates a new reflection wrt. the plane orthogonal to the given axis and that contains the
point pt
.
impl<T, D, S> Reflection<T, D, S> where
T: ComplexField,
S: Storage<T, D, Const<1_usize>>,
D: Dim,
[src]
impl<T, D, S> Reflection<T, D, S> where
T: ComplexField,
S: Storage<T, D, Const<1_usize>>,
D: Dim,
[src]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 reflect<R2, C2, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>) where
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
ShapeConstraint: SameNumberOfRows<R2, D>,
[src]
pub fn reflect<R2, C2, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>) where
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
ShapeConstraint: SameNumberOfRows<R2, D>,
[src]Applies the reflection to the columns of rhs
.
pub fn reflect_with_sign<R2, C2, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>,
sign: T
) where
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
ShapeConstraint: SameNumberOfRows<R2, D>,
[src]
pub fn reflect_with_sign<R2, C2, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>,
sign: T
) where
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
ShapeConstraint: SameNumberOfRows<R2, D>,
[src]Applies the reflection to the columns of rhs
.
pub fn reflect_rows<R2, C2, S2, S3>(
&self,
lhs: &mut Matrix<T, R2, C2, S2>,
work: &mut Matrix<T, R2, Const<1_usize>, S3>
) where
S3: StorageMut<T, R2, Const<1_usize>>,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
ShapeConstraint: DimEq<C2, D>,
ShapeConstraint: AreMultipliable<R2, C2, D, Const<1_usize>>,
[src]
pub fn reflect_rows<R2, C2, S2, S3>(
&self,
lhs: &mut Matrix<T, R2, C2, S2>,
work: &mut Matrix<T, R2, Const<1_usize>, S3>
) where
S3: StorageMut<T, R2, Const<1_usize>>,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
ShapeConstraint: DimEq<C2, D>,
ShapeConstraint: AreMultipliable<R2, C2, D, Const<1_usize>>,
[src]Applies the reflection to the rows of lhs
.
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_usize>, S3>,
sign: T
) where
S3: StorageMut<T, R2, Const<1_usize>>,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
ShapeConstraint: DimEq<C2, D>,
ShapeConstraint: AreMultipliable<R2, C2, D, Const<1_usize>>,
[src]
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_usize>, S3>,
sign: T
) where
S3: StorageMut<T, R2, Const<1_usize>>,
C2: Dim,
S2: StorageMut<T, R2, C2>,
R2: Dim,
ShapeConstraint: DimEq<C2, D>,
ShapeConstraint: AreMultipliable<R2, C2, D, Const<1_usize>>,
[src]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
S: Send,
T: Send,
impl<T, D, S> Sync for Reflection<T, D, S> where
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
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
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
type Output = T
type Output = T
Should always be Self
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