Reflection in nalgebra::geometry - Rust
Description: A reflection wrt. a plane.
Keywords: rust, rustlang, rust-lang, Reflection

# Struct nalgebra::geometry::Reflection

source ·

    pub struct Reflection<T, D, S> { /* private fields */ }

Expand description

A reflection wrt. a plane.

## Implementations§

source§

### impl<T: ComplexField, S: Storage<T, Const<D>>, const D: usize> Reflection<T, Const<D>, S>

source

#### pub fn new_containing_point(
axis: Unit<Vector<T, Const<D>, S>>,
pt: &Point<T, D>
) -> Self

Creates a new reflection wrt. the plane orthogonal to the given axis and that contains the point `pt`.

source§

### impl<T: ComplexField, D: Dim, S: Storage<T, D>> Reflection<T, D, S>

source

#### pub fn new(axis: Unit<Vector<T, D, S>>, bias: T) -> Self

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.

source

#### pub fn axis(&self) -> &Vector<T, D, S>

The reflection axis.

source

#### 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.

source

#### pub fn reflect<R2: Dim, C2: Dim, S2>(&self, rhs: &mut Matrix<T, R2, C2, S2>)where
S2: StorageMut<T, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,

Applies the reflection to the columns of `rhs`.

source

#### pub fn reflect_with_sign<R2: Dim, C2: Dim, S2>(
&self,
rhs: &mut Matrix<T, R2, C2, S2>,
sign: T
)where
S2: StorageMut<T, R2, C2>,
ShapeConstraint: SameNumberOfRows<R2, D>,

Applies the reflection to the columns of `rhs`.

source

#### pub fn reflect_rows<R2: Dim, C2: Dim, S2, S3>(
&self,
lhs: &mut Matrix<T, R2, C2, S2>,
work: &mut Vector<T, R2, S3>
)where
S2: StorageMut<T, R2, C2>,
S3: StorageMut<T, R2>,
ShapeConstraint: DimEq<C2, D> + AreMultipliable<R2, C2, D, U1>,

Applies the reflection to the rows of `lhs`.

source

#### pub fn reflect_rows_with_sign<R2: Dim, C2: Dim, S2, S3>(
&self,
lhs: &mut Matrix<T, R2, C2, S2>,
work: &mut Vector<T, R2, S3>,
sign: T
)where
S2: StorageMut<T, R2, C2>,
S3: StorageMut<T, R2>,
ShapeConstraint: DimEq<C2, D> + AreMultipliable<R2, C2, D, U1>,

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> Any for Twhere
T: 'static + ?Sized,

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
source§

### impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

### impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

### impl<T> From<T> for T

const: unstable · source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

### impl<T, U> Into<U> for Twhere
U: From<T>,

const: unstable · source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

source§

### impl<T> Same<T> for T

§

#### type Output = T

Should always be `Self`
source§

### impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,

source§

#### fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct `self` from the equivalent element of its superset. Read more
source§

#### 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

Use with care! Same as `self.to_subset` but without any property checks. Always succeeds.
source§

#### fn from_subset(element: &SS) -> SP

The inclusion map: converts `self` to the equivalent element of its superset.
source§

### impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

§

#### type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

### impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,

§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.