#![doc = " Trait implementations for euclidean2."]
#![doc = ""]
#![doc = " This file is auto-generated by clifford-codegen."]
#![doc = " Do not edit manually."]
use super::types::{Bivector, Rotor, Scalar, Vector};
#[allow(unused_imports)]
use crate::ops::{
Antidot, Antireverse, Antisandwich, Antiwedge, BulkContract, BulkExpand, Dot,
InverseAntisandwich, InverseSandwich, Involute, LeftContract, Reverse, RightComplement,
RightContract, Sandwich, ScalarProduct, Transform, Versor, VersorInverse, Wedge,
WeightContract, WeightDual, WeightExpand,
};
use crate::scalar::Float;
#[allow(unused_imports)]
use crate::wrappers::Unit;
use approx::{AbsDiffEq, RelativeEq, UlpsEq};
use std::ops::{Add, Mul, Neg, Sub};
impl<T: Float> Add for Bivector<T> {
type Output = Self;
#[inline]
fn add(self, rhs: Self) -> Self {
Self::new_unchecked(self.b() + rhs.b())
}
}
impl<T: Float> Sub for Bivector<T> {
type Output = Self;
#[inline]
fn sub(self, rhs: Self) -> Self {
Self::new_unchecked(self.b() - rhs.b())
}
}
impl<T: Float> Neg for Bivector<T> {
type Output = Self;
#[inline]
fn neg(self) -> Self {
Self::new_unchecked(-self.b())
}
}
impl<T: Float> Mul<T> for Bivector<T> {
type Output = Self;
#[inline]
fn mul(self, scalar: T) -> Self {
self.scale(scalar)
}
}
impl Mul<Bivector<f32>> for f32 {
type Output = Bivector<f32>;
#[inline]
fn mul(self, v: Bivector<f32>) -> Bivector<f32> {
v.scale(self)
}
}
impl Mul<Bivector<f64>> for f64 {
type Output = Bivector<f64>;
#[inline]
fn mul(self, v: Bivector<f64>) -> Bivector<f64> {
v.scale(self)
}
}
impl<T: Float> Mul<Bivector<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn mul(self, rhs: Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.b() * self.b()))
}
}
impl<T: Float> Mul<Rotor<T>> for Bivector<T> {
type Output = Rotor<T>;
#[inline]
fn mul(self, rhs: Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(-(rhs.b() * self.b()), rhs.s() * self.b())
}
}
impl<T: Float> Mul<Scalar<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn mul(self, rhs: Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.s() * self.b())
}
}
impl<T: Float> Mul<Vector<T>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn mul(self, rhs: Vector<T>) -> Vector<T> {
Vector::new_unchecked(rhs.y() * self.b(), -(rhs.x() * self.b()))
}
}
impl<T: Float> Add for Rotor<T> {
type Output = Self;
#[inline]
fn add(self, rhs: Self) -> Self {
Self::new_unchecked(self.s() + rhs.s(), self.b() + rhs.b())
}
}
impl<T: Float> Sub for Rotor<T> {
type Output = Self;
#[inline]
fn sub(self, rhs: Self) -> Self {
Self::new_unchecked(self.s() - rhs.s(), self.b() - rhs.b())
}
}
impl<T: Float> Neg for Rotor<T> {
type Output = Self;
#[inline]
fn neg(self) -> Self {
Self::new_unchecked(-self.s(), -self.b())
}
}
impl<T: Float> Mul<T> for Rotor<T> {
type Output = Self;
#[inline]
fn mul(self, scalar: T) -> Self {
self.scale(scalar)
}
}
impl Mul<Rotor<f32>> for f32 {
type Output = Rotor<f32>;
#[inline]
fn mul(self, v: Rotor<f32>) -> Rotor<f32> {
v.scale(self)
}
}
impl Mul<Rotor<f64>> for f64 {
type Output = Rotor<f64>;
#[inline]
fn mul(self, v: Rotor<f64>) -> Rotor<f64> {
v.scale(self)
}
}
impl<T: Float> Mul<Bivector<T>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn mul(self, rhs: Bivector<T>) -> Rotor<T> {
Rotor::new_unchecked(-(rhs.b() * self.b()), rhs.b() * self.s())
}
}
impl<T: Float> Mul<Rotor<T>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn mul(self, rhs: Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(
rhs.b() * self.s() + rhs.s() * self.b(),
-(rhs.s() * self.s()) + rhs.b() * self.b(),
)
}
}
impl<T: Float> Mul<Scalar<T>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn mul(self, rhs: Scalar<T>) -> Rotor<T> {
Rotor::new_unchecked(rhs.s() * self.s(), rhs.s() * self.b())
}
}
impl<T: Float> Mul<Vector<T>> for Rotor<T> {
type Output = Vector<T>;
#[inline]
fn mul(self, rhs: Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.x() * self.b()) + -(rhs.y() * self.s()),
-(rhs.y() * self.b()) + rhs.x() * self.s(),
)
}
}
impl<T: Float> Add for Scalar<T> {
type Output = Self;
#[inline]
fn add(self, rhs: Self) -> Self {
Self::new_unchecked(self.s() + rhs.s())
}
}
impl<T: Float> Sub for Scalar<T> {
type Output = Self;
#[inline]
fn sub(self, rhs: Self) -> Self {
Self::new_unchecked(self.s() - rhs.s())
}
}
impl<T: Float> Neg for Scalar<T> {
type Output = Self;
#[inline]
fn neg(self) -> Self {
Self::new_unchecked(-self.s())
}
}
impl<T: Float> Mul<T> for Scalar<T> {
type Output = Self;
#[inline]
fn mul(self, scalar: T) -> Self {
self.scale(scalar)
}
}
impl Mul<Scalar<f32>> for f32 {
type Output = Scalar<f32>;
#[inline]
fn mul(self, v: Scalar<f32>) -> Scalar<f32> {
v.scale(self)
}
}
impl Mul<Scalar<f64>> for f64 {
type Output = Scalar<f64>;
#[inline]
fn mul(self, v: Scalar<f64>) -> Scalar<f64> {
v.scale(self)
}
}
impl<T: Float> Mul<Bivector<T>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn mul(self, rhs: Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.b() * self.s())
}
}
impl<T: Float> Mul<Rotor<T>> for Scalar<T> {
type Output = Rotor<T>;
#[inline]
fn mul(self, rhs: Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(rhs.s() * self.s(), rhs.b() * self.s())
}
}
impl<T: Float> Mul<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn mul(self, rhs: Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.s() * self.s())
}
}
impl<T: Float> Mul<Vector<T>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn mul(self, rhs: Vector<T>) -> Vector<T> {
Vector::new_unchecked(rhs.x() * self.s(), rhs.y() * self.s())
}
}
impl<T: Float> Add for Vector<T> {
type Output = Self;
#[inline]
fn add(self, rhs: Self) -> Self {
Self::new_unchecked(self.x() + rhs.x(), self.y() + rhs.y())
}
}
impl<T: Float> Sub for Vector<T> {
type Output = Self;
#[inline]
fn sub(self, rhs: Self) -> Self {
Self::new_unchecked(self.x() - rhs.x(), self.y() - rhs.y())
}
}
impl<T: Float> Neg for Vector<T> {
type Output = Self;
#[inline]
fn neg(self) -> Self {
Self::new_unchecked(-self.x(), -self.y())
}
}
impl<T: Float> Mul<T> for Vector<T> {
type Output = Self;
#[inline]
fn mul(self, scalar: T) -> Self {
self.scale(scalar)
}
}
impl Mul<Vector<f32>> for f32 {
type Output = Vector<f32>;
#[inline]
fn mul(self, v: Vector<f32>) -> Vector<f32> {
v.scale(self)
}
}
impl Mul<Vector<f64>> for f64 {
type Output = Vector<f64>;
#[inline]
fn mul(self, v: Vector<f64>) -> Vector<f64> {
v.scale(self)
}
}
impl<T: Float> Mul<Bivector<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn mul(self, rhs: Bivector<T>) -> Vector<T> {
Vector::new_unchecked(-(rhs.b() * self.y()), rhs.b() * self.x())
}
}
impl<T: Float> Mul<Rotor<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn mul(self, rhs: Rotor<T>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.b() * self.x()) + rhs.s() * self.y(),
-(rhs.b() * self.y()) + -(rhs.s() * self.x()),
)
}
}
impl<T: Float> Mul<Scalar<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn mul(self, rhs: Scalar<T>) -> Vector<T> {
Vector::new_unchecked(rhs.s() * self.x(), rhs.s() * self.y())
}
}
impl<T: Float> Mul<Vector<T>> for Vector<T> {
type Output = Rotor<T>;
#[inline]
fn mul(self, rhs: Vector<T>) -> Rotor<T> {
Rotor::new_unchecked(
-(rhs.x() * self.y()) + rhs.y() * self.x(),
rhs.x() * self.x() + rhs.y() * self.y(),
)
}
}
#[doc = "Wedge (exterior/outer) product of [`Bivector`] and [`Scalar`].\n\nThe wedge product `a ^ b` computes the outer product, which represents\nthe oriented subspace spanned by both operands. The result grade is the\nsum of the input grades (or zero if they share common factors)."]
impl<T: Float> Wedge<Scalar<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.s() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Scalar<T>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.s() * self.as_inner().b())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Scalar<T>>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().s() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Scalar<T>>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().s() * self.as_inner().b())
}
}
#[doc = "Wedge (exterior/outer) product of [`Scalar`] and [`Bivector`].\n\nThe wedge product `a ^ b` computes the outer product, which represents\nthe oriented subspace spanned by both operands. The result grade is the\nsum of the input grades (or zero if they share common factors)."]
impl<T: Float> Wedge<Bivector<T>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.b() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Bivector<T>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.b() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Bivector<T>>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().b() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Bivector<T>>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().b() * self.as_inner().s())
}
}
#[doc = "Wedge (exterior/outer) product of [`Scalar`] and [`Scalar`].\n\nThe wedge product `a ^ b` computes the outer product, which represents\nthe oriented subspace spanned by both operands. The result grade is the\nsum of the input grades (or zero if they share common factors)."]
impl<T: Float> Wedge<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn wedge(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Scalar<T>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn wedge(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.s() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Scalar<T>>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().s() * self.as_inner().s())
}
}
#[doc = "Wedge (exterior/outer) product of [`Scalar`] and [`Vector`].\n\nThe wedge product `a ^ b` computes the outer product, which represents\nthe oriented subspace spanned by both operands. The result grade is the\nsum of the input grades (or zero if they share common factors)."]
impl<T: Float> Wedge<Vector<T>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn wedge(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(rhs.x() * self.s(), rhs.y() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Vector<T>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn wedge(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(rhs.x() * self.as_inner().s(), rhs.y() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Vector<T>>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(rhs.as_inner().x() * self.s(), rhs.as_inner().y() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Vector<T>>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().x() * self.as_inner().s(),
rhs.as_inner().y() * self.as_inner().s(),
)
}
}
#[doc = "Wedge (exterior/outer) product of [`Vector`] and [`Scalar`].\n\nThe wedge product `a ^ b` computes the outer product, which represents\nthe oriented subspace spanned by both operands. The result grade is the\nsum of the input grades (or zero if they share common factors)."]
impl<T: Float> Wedge<Scalar<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn wedge(&self, rhs: &Scalar<T>) -> Vector<T> {
Vector::new_unchecked(rhs.s() * self.x(), rhs.s() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Scalar<T>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn wedge(&self, rhs: &Scalar<T>) -> Vector<T> {
Vector::new_unchecked(rhs.s() * self.as_inner().x(), rhs.s() * self.as_inner().y())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Scalar<T>>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Scalar<T>>) -> Vector<T> {
Vector::new_unchecked(rhs.as_inner().s() * self.x(), rhs.as_inner().s() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Scalar<T>>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Scalar<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().s() * self.as_inner().x(),
rhs.as_inner().s() * self.as_inner().y(),
)
}
}
#[doc = "Wedge (exterior/outer) product of [`Vector`] and [`Vector`].\n\nThe wedge product `a ^ b` computes the outer product, which represents\nthe oriented subspace spanned by both operands. The result grade is the\nsum of the input grades (or zero if they share common factors)."]
impl<T: Float> Wedge<Vector<T>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Vector<T>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.x() * self.y()) + rhs.y() * self.x())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Vector<T>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Vector<T>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.x() * self.as_inner().y()) + rhs.y() * self.as_inner().x())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Vector<T>>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Vector<T>>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.as_inner().x() * self.y()) + rhs.as_inner().y() * self.x())
}
}
#[allow(unused_variables)]
impl<T: Float> Wedge<Unit<Vector<T>>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn wedge(&self, rhs: &Unit<Vector<T>>) -> Bivector<T> {
Bivector::new_unchecked(
-(rhs.as_inner().x() * self.as_inner().y()) + rhs.as_inner().y() * self.as_inner().x(),
)
}
}
#[doc = "Antiwedge (regressive/meet) product of [`Bivector`] and [`Bivector`].\n\nThe antiwedge product `a v b` computes the meet of two subspaces,\nreturning the largest subspace contained in both. In projective geometry,\nthis finds intersections (e.g., where two planes meet to form a line)."]
impl<T: Float> Antiwedge<Bivector<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn antiwedge(&self, rhs: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Bivector<T>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn antiwedge(&self, rhs: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.b() * self.as_inner().b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Bivector<T>>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().b() * self.as_inner().b())
}
}
#[doc = "Antiwedge (regressive/meet) product of [`Bivector`] and [`Scalar`].\n\nThe antiwedge product `a v b` computes the meet of two subspaces,\nreturning the largest subspace contained in both. In projective geometry,\nthis finds intersections (e.g., where two planes meet to form a line)."]
impl<T: Float> Antiwedge<Scalar<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.s() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Scalar<T>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.s() * self.as_inner().b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Scalar<T>>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().s() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Scalar<T>>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().s() * self.as_inner().b())
}
}
#[doc = "Antiwedge (regressive/meet) product of [`Bivector`] and [`Vector`].\n\nThe antiwedge product `a v b` computes the meet of two subspaces,\nreturning the largest subspace contained in both. In projective geometry,\nthis finds intersections (e.g., where two planes meet to form a line)."]
impl<T: Float> Antiwedge<Vector<T>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn antiwedge(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(-(rhs.x() * self.b()), -(rhs.y() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Vector<T>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn antiwedge(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.x() * self.as_inner().b()),
-(rhs.y() * self.as_inner().b()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Vector<T>>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().x() * self.b()),
-(rhs.as_inner().y() * self.b()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Vector<T>>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().x() * self.as_inner().b()),
-(rhs.as_inner().y() * self.as_inner().b()),
)
}
}
#[doc = "Antiwedge (regressive/meet) product of [`Scalar`] and [`Bivector`].\n\nThe antiwedge product `a v b` computes the meet of two subspaces,\nreturning the largest subspace contained in both. In projective geometry,\nthis finds intersections (e.g., where two planes meet to form a line)."]
impl<T: Float> Antiwedge<Bivector<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.b() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Bivector<T>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.b() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Bivector<T>>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().b() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Bivector<T>>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().b() * self.as_inner().s())
}
}
#[doc = "Antiwedge (regressive/meet) product of [`Vector`] and [`Bivector`].\n\nThe antiwedge product `a v b` computes the meet of two subspaces,\nreturning the largest subspace contained in both. In projective geometry,\nthis finds intersections (e.g., where two planes meet to form a line)."]
impl<T: Float> Antiwedge<Bivector<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn antiwedge(&self, rhs: &Bivector<T>) -> Vector<T> {
Vector::new_unchecked(-(rhs.b() * self.x()), -(rhs.b() * self.y()))
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Bivector<T>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn antiwedge(&self, rhs: &Bivector<T>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.b() * self.as_inner().x()),
-(rhs.b() * self.as_inner().y()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Bivector<T>>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Bivector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().b() * self.x()),
-(rhs.as_inner().b() * self.y()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Bivector<T>>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Bivector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().b() * self.as_inner().x()),
-(rhs.as_inner().b() * self.as_inner().y()),
)
}
}
#[doc = "Antiwedge (regressive/meet) product of [`Vector`] and [`Vector`].\n\nThe antiwedge product `a v b` computes the meet of two subspaces,\nreturning the largest subspace contained in both. In projective geometry,\nthis finds intersections (e.g., where two planes meet to form a line)."]
impl<T: Float> Antiwedge<Vector<T>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Vector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.x() * self.y()) + rhs.y() * self.x())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Vector<T>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Vector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.x() * self.as_inner().y()) + rhs.y() * self.as_inner().x())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Vector<T>>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Vector<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().x() * self.y()) + rhs.as_inner().y() * self.x())
}
}
#[allow(unused_variables)]
impl<T: Float> Antiwedge<Unit<Vector<T>>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn antiwedge(&self, rhs: &Unit<Vector<T>>) -> Scalar<T> {
Scalar::new_unchecked(
-(rhs.as_inner().x() * self.as_inner().y()) + rhs.as_inner().y() * self.as_inner().x(),
)
}
}
#[doc = "Left contraction of [`Bivector`] into [`Bivector`].\n\nThe left contraction `a _| b` projects `a` onto `b`, returning the\ncomponent of `b` orthogonal to `a`. The result grade is grade(b) - grade(a)\n(or zero if grade(a) > grade(b))."]
impl<T: Float> LeftContract<Bivector<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.b() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Bivector<T>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.b() * self.as_inner().b()))
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Bivector<T>>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().b() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().b() * self.as_inner().b()))
}
}
#[doc = "Left contraction of [`Scalar`] into [`Bivector`].\n\nThe left contraction `a _| b` projects `a` onto `b`, returning the\ncomponent of `b` orthogonal to `a`. The result grade is grade(b) - grade(a)\n(or zero if grade(a) > grade(b))."]
impl<T: Float> LeftContract<Bivector<T>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn left_contract(&self, rhs: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.b() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Bivector<T>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn left_contract(&self, rhs: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.b() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Bivector<T>>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().b() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Bivector<T>>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().b() * self.as_inner().s())
}
}
#[doc = "Left contraction of [`Scalar`] into [`Scalar`].\n\nThe left contraction `a _| b` projects `a` onto `b`, returning the\ncomponent of `b` orthogonal to `a`. The result grade is grade(b) - grade(a)\n(or zero if grade(a) > grade(b))."]
impl<T: Float> LeftContract<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Scalar<T>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.s() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Scalar<T>>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().s() * self.as_inner().s())
}
}
#[doc = "Left contraction of [`Scalar`] into [`Vector`].\n\nThe left contraction `a _| b` projects `a` onto `b`, returning the\ncomponent of `b` orthogonal to `a`. The result grade is grade(b) - grade(a)\n(or zero if grade(a) > grade(b))."]
impl<T: Float> LeftContract<Vector<T>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn left_contract(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(rhs.x() * self.s(), rhs.y() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Vector<T>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn left_contract(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(rhs.x() * self.as_inner().s(), rhs.y() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Vector<T>>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(rhs.as_inner().x() * self.s(), rhs.as_inner().y() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Vector<T>>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().x() * self.as_inner().s(),
rhs.as_inner().y() * self.as_inner().s(),
)
}
}
#[doc = "Left contraction of [`Vector`] into [`Bivector`].\n\nThe left contraction `a _| b` projects `a` onto `b`, returning the\ncomponent of `b` orthogonal to `a`. The result grade is grade(b) - grade(a)\n(or zero if grade(a) > grade(b))."]
impl<T: Float> LeftContract<Bivector<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn left_contract(&self, rhs: &Bivector<T>) -> Vector<T> {
Vector::new_unchecked(-(rhs.b() * self.y()), rhs.b() * self.x())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Bivector<T>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn left_contract(&self, rhs: &Bivector<T>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.b() * self.as_inner().y()),
rhs.b() * self.as_inner().x(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Bivector<T>>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Bivector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().b() * self.y()),
rhs.as_inner().b() * self.x(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Bivector<T>>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Bivector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().b() * self.as_inner().y()),
rhs.as_inner().b() * self.as_inner().x(),
)
}
}
#[doc = "Left contraction of [`Vector`] into [`Vector`].\n\nThe left contraction `a _| b` projects `a` onto `b`, returning the\ncomponent of `b` orthogonal to `a`. The result grade is grade(b) - grade(a)\n(or zero if grade(a) > grade(b))."]
impl<T: Float> LeftContract<Vector<T>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Vector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.x() * self.x() + rhs.y() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Vector<T>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Vector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.x() * self.as_inner().x() + rhs.y() * self.as_inner().y())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Vector<T>>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Vector<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().x() * self.x() + rhs.as_inner().y() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> LeftContract<Unit<Vector<T>>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn left_contract(&self, rhs: &Unit<Vector<T>>) -> Scalar<T> {
Scalar::new_unchecked(
rhs.as_inner().x() * self.as_inner().x() + rhs.as_inner().y() * self.as_inner().y(),
)
}
}
#[doc = "Right contraction of [`Bivector`] by [`Bivector`].\n\nThe right contraction `a |_ b` projects `b` onto `a`, returning the\ncomponent of `a` orthogonal to `b`. The result grade is grade(a) - grade(b)\n(or zero if grade(b) > grade(a))."]
impl<T: Float> RightContract<Bivector<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.b() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Bivector<T>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.b() * self.as_inner().b()))
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Bivector<T>>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().b() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().b() * self.as_inner().b()))
}
}
#[doc = "Right contraction of [`Bivector`] by [`Scalar`].\n\nThe right contraction `a |_ b` projects `b` onto `a`, returning the\ncomponent of `a` orthogonal to `b`. The result grade is grade(a) - grade(b)\n(or zero if grade(b) > grade(a))."]
impl<T: Float> RightContract<Scalar<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn right_contract(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.s() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Scalar<T>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn right_contract(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.s() * self.as_inner().b())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Scalar<T>>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().s() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Scalar<T>>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().s() * self.as_inner().b())
}
}
#[doc = "Right contraction of [`Bivector`] by [`Vector`].\n\nThe right contraction `a |_ b` projects `b` onto `a`, returning the\ncomponent of `a` orthogonal to `b`. The result grade is grade(a) - grade(b)\n(or zero if grade(b) > grade(a))."]
impl<T: Float> RightContract<Vector<T>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn right_contract(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(rhs.y() * self.b(), -(rhs.x() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Vector<T>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn right_contract(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
rhs.y() * self.as_inner().b(),
-(rhs.x() * self.as_inner().b()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Vector<T>>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().y() * self.b(),
-(rhs.as_inner().x() * self.b()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Vector<T>>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().y() * self.as_inner().b(),
-(rhs.as_inner().x() * self.as_inner().b()),
)
}
}
#[doc = "Right contraction of [`Scalar`] by [`Scalar`].\n\nThe right contraction `a |_ b` projects `b` onto `a`, returning the\ncomponent of `a` orthogonal to `b`. The result grade is grade(a) - grade(b)\n(or zero if grade(b) > grade(a))."]
impl<T: Float> RightContract<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Scalar<T>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.s() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Scalar<T>>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().s() * self.as_inner().s())
}
}
#[doc = "Right contraction of [`Vector`] by [`Scalar`].\n\nThe right contraction `a |_ b` projects `b` onto `a`, returning the\ncomponent of `a` orthogonal to `b`. The result grade is grade(a) - grade(b)\n(or zero if grade(b) > grade(a))."]
impl<T: Float> RightContract<Scalar<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn right_contract(&self, rhs: &Scalar<T>) -> Vector<T> {
Vector::new_unchecked(rhs.s() * self.x(), rhs.s() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Scalar<T>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn right_contract(&self, rhs: &Scalar<T>) -> Vector<T> {
Vector::new_unchecked(rhs.s() * self.as_inner().x(), rhs.s() * self.as_inner().y())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Scalar<T>>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Scalar<T>>) -> Vector<T> {
Vector::new_unchecked(rhs.as_inner().s() * self.x(), rhs.as_inner().s() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Scalar<T>>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Scalar<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().s() * self.as_inner().x(),
rhs.as_inner().s() * self.as_inner().y(),
)
}
}
#[doc = "Right contraction of [`Vector`] by [`Vector`].\n\nThe right contraction `a |_ b` projects `b` onto `a`, returning the\ncomponent of `a` orthogonal to `b`. The result grade is grade(a) - grade(b)\n(or zero if grade(b) > grade(a))."]
impl<T: Float> RightContract<Vector<T>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Vector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.x() * self.x() + rhs.y() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Vector<T>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Vector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.x() * self.as_inner().x() + rhs.y() * self.as_inner().y())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Vector<T>>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Vector<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().x() * self.x() + rhs.as_inner().y() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> RightContract<Unit<Vector<T>>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn right_contract(&self, rhs: &Unit<Vector<T>>) -> Scalar<T> {
Scalar::new_unchecked(
rhs.as_inner().x() * self.as_inner().x() + rhs.as_inner().y() * self.as_inner().y(),
)
}
}
#[doc = "Sandwich product: [`Bivector`] x [`Bivector`] x rev([`Bivector`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Bivector<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(self.b() * operand.b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Bivector<T>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Bivector<T>>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(operand.as_inner().b() * self.b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(operand.as_inner().b())
}
}
#[doc = "Sandwich product: [`Bivector`] x [`Rotor`] x rev([`Bivector`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Rotor<T>> for Bivector<T> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(
self.b() * operand.s() * self.b(),
self.b() * operand.b() * self.b(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Rotor<T>> for Unit<Bivector<T>> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(operand.s(), operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Rotor<T>>> for Bivector<T> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(
operand.as_inner().s() * self.b() * self.b(),
operand.as_inner().b() * self.b() * self.b(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Rotor<T>>> for Unit<Bivector<T>> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(operand.as_inner().s(), operand.as_inner().b())
}
}
#[doc = "Sandwich product: [`Bivector`] x [`Scalar`] x rev([`Bivector`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Scalar<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(self.b() * operand.s() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Scalar<T>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(operand.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Scalar<T>>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s() * self.b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Scalar<T>>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s())
}
}
#[doc = "Sandwich product: [`Bivector`] x [`Vector`] x rev([`Bivector`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Vector<T>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-(self.b() * operand.x() * self.b()),
-(self.b() * operand.y() * self.b()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Vector<T>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(-(operand.x()), -(operand.y()))
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Vector<T>>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(operand.as_inner().x() * self.b() * self.b()),
-(operand.as_inner().y() * self.b() * self.b()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Vector<T>>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(-(operand.as_inner().x()), -(operand.as_inner().y()))
}
}
#[doc = "Sandwich product: [`Rotor`] x [`Bivector`] x rev([`Rotor`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Bivector<T>> for Rotor<T> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(
self.b() * operand.b() * self.b() + self.s() * operand.b() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Bivector<T>> for Unit<Rotor<T>> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Bivector<T>>> for Rotor<T> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(
operand.as_inner().b() * self.b() * self.b()
+ operand.as_inner().b() * self.s() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Bivector<T>>> for Unit<Rotor<T>> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(operand.as_inner().b())
}
}
#[doc = "Sandwich product: [`Rotor`] x [`Rotor`] x rev([`Rotor`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Rotor<T>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(
-(self.b() * operand.b() * self.s())
+ self.b() * operand.s() * self.b()
+ self.s() * operand.b() * self.b()
+ self.s() * operand.s() * self.s(),
self.b() * operand.b() * self.b()
+ self.b() * operand.s() * self.s()
+ self.s() * operand.b() * self.s()
- self.s() * operand.s() * self.b(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Rotor<T>> for Unit<Rotor<T>> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(operand.s(), operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Rotor<T>>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(
operand.as_inner().s() * self.b() * self.b()
+ operand.as_inner().s() * self.s() * self.s(),
operand.as_inner().b() * self.b() * self.b()
+ operand.as_inner().b() * self.s() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Rotor<T>>> for Unit<Rotor<T>> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(operand.as_inner().s(), operand.as_inner().b())
}
}
#[doc = "Sandwich product: [`Rotor`] x [`Scalar`] x rev([`Rotor`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Scalar<T>> for Rotor<T> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(self.b() * operand.s() * self.b() + self.s() * operand.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Scalar<T>> for Unit<Rotor<T>> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(operand.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Scalar<T>>> for Rotor<T> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(
operand.as_inner().s() * self.b() * self.b()
+ operand.as_inner().s() * self.s() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Scalar<T>>> for Unit<Rotor<T>> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s())
}
}
#[doc = "Sandwich product: [`Rotor`] x [`Vector`] x rev([`Rotor`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Vector<T>> for Rotor<T> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-(self.b() * operand.x() * self.b())
+ self.b() * operand.y() * self.s()
+ self.s() * operand.x() * self.s()
+ self.s() * operand.y() * self.b(),
-(self.b() * operand.x() * self.s())
- self.b() * operand.y() * self.b()
- self.s() * operand.x() * self.b()
+ self.s() * operand.y() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Vector<T>> for Unit<Rotor<T>> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-(operand.x())
+ T::TWO * operand.x() * self.as_inner().s() * self.as_inner().s()
+ T::TWO * operand.y() * self.as_inner().b() * self.as_inner().s(),
-(operand.y())
+ -T::TWO * operand.x() * self.as_inner().b() * self.as_inner().s()
+ T::TWO * operand.y() * self.as_inner().s() * self.as_inner().s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Vector<T>>> for Rotor<T> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(operand.as_inner().x() * self.b() * self.b())
+ T::TWO * operand.as_inner().y() * self.b() * self.s()
+ operand.as_inner().x() * self.s() * self.s(),
-(operand.as_inner().y() * self.b() * self.b())
+ -T::TWO * operand.as_inner().x() * self.b() * self.s()
+ operand.as_inner().y() * self.s() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Vector<T>>> for Unit<Rotor<T>> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(operand.as_inner().x())
+ T::TWO * operand.as_inner().x() * self.as_inner().s() * self.as_inner().s()
+ T::TWO * operand.as_inner().y() * self.as_inner().b() * self.as_inner().s(),
-(operand.as_inner().y())
+ -T::TWO * operand.as_inner().x() * self.as_inner().b() * self.as_inner().s()
+ T::TWO * operand.as_inner().y() * self.as_inner().s() * self.as_inner().s(),
)
}
}
#[doc = "Sandwich product: [`Scalar`] x [`Bivector`] x rev([`Scalar`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Bivector<T>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(self.s() * operand.b() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Bivector<T>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Bivector<T>>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(operand.as_inner().b() * self.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Bivector<T>>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(operand.as_inner().b())
}
}
#[doc = "Sandwich product: [`Scalar`] x [`Rotor`] x rev([`Scalar`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Rotor<T>> for Scalar<T> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(
self.s() * operand.s() * self.s(),
self.s() * operand.b() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Rotor<T>> for Unit<Scalar<T>> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(operand.s(), operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Rotor<T>>> for Scalar<T> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(
operand.as_inner().s() * self.s() * self.s(),
operand.as_inner().b() * self.s() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Rotor<T>>> for Unit<Scalar<T>> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(operand.as_inner().s(), operand.as_inner().b())
}
}
#[doc = "Sandwich product: [`Scalar`] x [`Scalar`] x rev([`Scalar`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(self.s() * operand.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Scalar<T>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(operand.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Scalar<T>>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s() * self.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s())
}
}
#[doc = "Sandwich product: [`Scalar`] x [`Vector`] x rev([`Scalar`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Vector<T>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
self.s() * operand.x() * self.s(),
self.s() * operand.y() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Vector<T>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(operand.x(), operand.y())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Vector<T>>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
operand.as_inner().x() * self.s() * self.s(),
operand.as_inner().y() * self.s() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Vector<T>>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(operand.as_inner().x(), operand.as_inner().y())
}
}
#[doc = "Sandwich product: [`Vector`] x [`Bivector`] x rev([`Vector`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Bivector<T>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(
-(self.x() * operand.b() * self.x()) - self.y() * operand.b() * self.y(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Bivector<T>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(-(operand.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Bivector<T>>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(
-(operand.as_inner().b() * self.x() * self.x())
+ -(operand.as_inner().b() * self.y() * self.y()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Bivector<T>>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(-(operand.as_inner().b()))
}
}
#[doc = "Sandwich product: [`Vector`] x [`Rotor`] x rev([`Vector`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Rotor<T>> for Vector<T> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(
self.x() * operand.b() * self.y() + self.x() * operand.s() * self.x()
- self.y() * operand.b() * self.x()
+ self.y() * operand.s() * self.y(),
-(self.x() * operand.b() * self.x()) + self.x() * operand.s() * self.y()
- self.y() * operand.b() * self.y()
- self.y() * operand.s() * self.x(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Rotor<T>> for Unit<Vector<T>> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(operand.s(), -(operand.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Rotor<T>>> for Vector<T> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(
operand.as_inner().s() * self.x() * self.x()
+ operand.as_inner().s() * self.y() * self.y(),
-(operand.as_inner().b() * self.x() * self.x())
+ -(operand.as_inner().b() * self.y() * self.y()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Rotor<T>>> for Unit<Vector<T>> {
type Output = Rotor<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(operand.as_inner().s(), -(operand.as_inner().b()))
}
}
#[doc = "Sandwich product: [`Vector`] x [`Scalar`] x rev([`Vector`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Scalar<T>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(self.x() * operand.s() * self.x() + self.y() * operand.s() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Scalar<T>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(operand.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Scalar<T>>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(
operand.as_inner().s() * self.x() * self.x()
+ operand.as_inner().s() * self.y() * self.y(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Scalar<T>>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s())
}
}
#[doc = "Sandwich product: [`Vector`] x [`Vector`] x rev([`Vector`]).\n\nThe sandwich product `v x a x rev(v)` applies the transformation\nrepresented by the versor `v` to the operand `a`. For rotors, this\nperforms rotation; for motors, it performs rigid body transformation."]
#[allow(unused_variables)]
impl<T: Float> Sandwich<Vector<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
self.x() * operand.x() * self.x() + self.x() * operand.y() * self.y()
- self.y() * operand.x() * self.y()
+ self.y() * operand.y() * self.x(),
self.x() * operand.x() * self.y() - self.x() * operand.y() * self.x()
+ self.y() * operand.x() * self.x()
+ self.y() * operand.y() * self.y(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Vector<T>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-T::TWO * operand.x() * self.as_inner().y() * self.as_inner().y()
+ T::TWO * operand.y() * self.as_inner().x() * self.as_inner().y()
+ operand.x(),
-(operand.y())
+ T::TWO * operand.x() * self.as_inner().x() * self.as_inner().y()
+ T::TWO * operand.y() * self.as_inner().y() * self.as_inner().y(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Vector<T>>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(operand.as_inner().x() * self.y() * self.y())
+ T::TWO * operand.as_inner().y() * self.x() * self.y()
+ operand.as_inner().x() * self.x() * self.x(),
-(operand.as_inner().y() * self.x() * self.x())
+ T::TWO * operand.as_inner().x() * self.x() * self.y()
+ operand.as_inner().y() * self.y() * self.y(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Sandwich<Unit<Vector<T>>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn sandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-T::TWO * operand.as_inner().x() * self.as_inner().y() * self.as_inner().y()
+ T::TWO * operand.as_inner().y() * self.as_inner().x() * self.as_inner().y()
+ operand.as_inner().x(),
-(operand.as_inner().y())
+ T::TWO * operand.as_inner().x() * self.as_inner().x() * self.as_inner().y()
+ T::TWO * operand.as_inner().y() * self.as_inner().y() * self.as_inner().y(),
)
}
}
#[doc = "Antisandwich product: [`Bivector`] x [`Bivector`] x antirev([`Bivector`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Bivector<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(self.b() * operand.b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Bivector<T>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Bivector<T>>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(operand.as_inner().b() * self.b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(operand.as_inner().b())
}
}
#[doc = "Antisandwich product: [`Bivector`] x [`Rotor`] x antirev([`Bivector`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Rotor<T>> for Bivector<T> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(
self.b() * operand.s() * self.b(),
self.b() * operand.b() * self.b(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Rotor<T>> for Unit<Bivector<T>> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(operand.s(), operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Rotor<T>>> for Bivector<T> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(
operand.as_inner().s() * self.b() * self.b(),
operand.as_inner().b() * self.b() * self.b(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Rotor<T>>> for Unit<Bivector<T>> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(operand.as_inner().s(), operand.as_inner().b())
}
}
#[doc = "Antisandwich product: [`Bivector`] x [`Scalar`] x antirev([`Bivector`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Scalar<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(self.b() * operand.s() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Scalar<T>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(operand.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Scalar<T>>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s() * self.b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Scalar<T>>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s())
}
}
#[doc = "Antisandwich product: [`Bivector`] x [`Vector`] x antirev([`Bivector`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Vector<T>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
self.b() * operand.x() * self.b(),
self.b() * operand.y() * self.b(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Vector<T>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(operand.x(), operand.y())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Vector<T>>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
operand.as_inner().x() * self.b() * self.b(),
operand.as_inner().y() * self.b() * self.b(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Vector<T>>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(operand.as_inner().x(), operand.as_inner().y())
}
}
#[doc = "Antisandwich product: [`Rotor`] x [`Bivector`] x antirev([`Rotor`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Bivector<T>> for Rotor<T> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(
self.b() * operand.b() * self.b() + self.s() * operand.b() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Bivector<T>> for Unit<Rotor<T>> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Bivector<T>>> for Rotor<T> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(
operand.as_inner().b() * self.b() * self.b()
+ operand.as_inner().b() * self.s() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Bivector<T>>> for Unit<Rotor<T>> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(operand.as_inner().b())
}
}
#[doc = "Antisandwich product: [`Rotor`] x [`Rotor`] x antirev([`Rotor`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Rotor<T>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(
-(self.b() * operand.b() * self.s())
+ self.b() * operand.s() * self.b()
+ self.s() * operand.b() * self.b()
+ self.s() * operand.s() * self.s(),
self.b() * operand.b() * self.b()
+ self.b() * operand.s() * self.s()
+ self.s() * operand.b() * self.s()
- self.s() * operand.s() * self.b(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Rotor<T>> for Unit<Rotor<T>> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(operand.s(), operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Rotor<T>>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(
operand.as_inner().s() * self.b() * self.b()
+ operand.as_inner().s() * self.s() * self.s(),
operand.as_inner().b() * self.b() * self.b()
+ operand.as_inner().b() * self.s() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Rotor<T>>> for Unit<Rotor<T>> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(operand.as_inner().s(), operand.as_inner().b())
}
}
#[doc = "Antisandwich product: [`Rotor`] x [`Scalar`] x antirev([`Rotor`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Scalar<T>> for Rotor<T> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(self.b() * operand.s() * self.b() + self.s() * operand.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Scalar<T>> for Unit<Rotor<T>> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(operand.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Scalar<T>>> for Rotor<T> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(
operand.as_inner().s() * self.b() * self.b()
+ operand.as_inner().s() * self.s() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Scalar<T>>> for Unit<Rotor<T>> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s())
}
}
#[doc = "Antisandwich product: [`Rotor`] x [`Vector`] x antirev([`Rotor`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Vector<T>> for Rotor<T> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
self.b() * operand.x() * self.b() + self.b() * operand.y() * self.s()
- self.s() * operand.x() * self.s()
+ self.s() * operand.y() * self.b(),
-(self.b() * operand.x() * self.s()) + self.b() * operand.y() * self.b()
- self.s() * operand.x() * self.b()
- self.s() * operand.y() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Vector<T>> for Unit<Rotor<T>> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-T::TWO * operand.x() * self.as_inner().s() * self.as_inner().s()
+ T::TWO * operand.y() * self.as_inner().b() * self.as_inner().s()
+ operand.x(),
-T::TWO * operand.x() * self.as_inner().b() * self.as_inner().s()
+ -T::TWO * operand.y() * self.as_inner().s() * self.as_inner().s()
+ operand.y(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Vector<T>>> for Rotor<T> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(operand.as_inner().x() * self.s() * self.s())
+ T::TWO * operand.as_inner().y() * self.b() * self.s()
+ operand.as_inner().x() * self.b() * self.b(),
-(operand.as_inner().y() * self.s() * self.s())
+ -T::TWO * operand.as_inner().x() * self.b() * self.s()
+ operand.as_inner().y() * self.b() * self.b(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Vector<T>>> for Unit<Rotor<T>> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-T::TWO * operand.as_inner().x() * self.as_inner().s() * self.as_inner().s()
+ T::TWO * operand.as_inner().y() * self.as_inner().b() * self.as_inner().s()
+ operand.as_inner().x(),
-T::TWO * operand.as_inner().x() * self.as_inner().b() * self.as_inner().s()
+ -T::TWO * operand.as_inner().y() * self.as_inner().s() * self.as_inner().s()
+ operand.as_inner().y(),
)
}
}
#[doc = "Antisandwich product: [`Scalar`] x [`Bivector`] x antirev([`Scalar`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Bivector<T>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(self.s() * operand.b() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Bivector<T>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Bivector<T>>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(operand.as_inner().b() * self.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Bivector<T>>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(operand.as_inner().b())
}
}
#[doc = "Antisandwich product: [`Scalar`] x [`Rotor`] x antirev([`Scalar`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Rotor<T>> for Scalar<T> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(
self.s() * operand.s() * self.s(),
self.s() * operand.b() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Rotor<T>> for Unit<Scalar<T>> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(operand.s(), operand.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Rotor<T>>> for Scalar<T> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(
operand.as_inner().s() * self.s() * self.s(),
operand.as_inner().b() * self.s() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Rotor<T>>> for Unit<Scalar<T>> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(operand.as_inner().s(), operand.as_inner().b())
}
}
#[doc = "Antisandwich product: [`Scalar`] x [`Scalar`] x antirev([`Scalar`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(self.s() * operand.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Scalar<T>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(operand.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Scalar<T>>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s() * self.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s())
}
}
#[doc = "Antisandwich product: [`Scalar`] x [`Vector`] x antirev([`Scalar`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Vector<T>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-(self.s() * operand.x() * self.s()),
-(self.s() * operand.y() * self.s()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Vector<T>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(-(operand.x()), -(operand.y()))
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Vector<T>>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(operand.as_inner().x() * self.s() * self.s()),
-(operand.as_inner().y() * self.s() * self.s()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Vector<T>>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(-(operand.as_inner().x()), -(operand.as_inner().y()))
}
}
#[doc = "Antisandwich product: [`Vector`] x [`Bivector`] x antirev([`Vector`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Bivector<T>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(
-(self.x() * operand.b() * self.x()) - self.y() * operand.b() * self.y(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Bivector<T>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(-(operand.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Bivector<T>>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(
-(operand.as_inner().b() * self.x() * self.x())
+ -(operand.as_inner().b() * self.y() * self.y()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Bivector<T>>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(-(operand.as_inner().b()))
}
}
#[doc = "Antisandwich product: [`Vector`] x [`Rotor`] x antirev([`Vector`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Rotor<T>> for Vector<T> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(
-(self.x() * operand.b() * self.y())
+ self.x() * operand.s() * self.x()
+ self.y() * operand.b() * self.x()
+ self.y() * operand.s() * self.y(),
-(self.x() * operand.b() * self.x())
- self.x() * operand.s() * self.y()
- self.y() * operand.b() * self.y()
+ self.y() * operand.s() * self.x(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Rotor<T>> for Unit<Vector<T>> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Rotor<T>) -> Rotor<T> {
Rotor::new_unchecked(operand.s(), -(operand.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Rotor<T>>> for Vector<T> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(
operand.as_inner().s() * self.x() * self.x()
+ operand.as_inner().s() * self.y() * self.y(),
-(operand.as_inner().b() * self.x() * self.x())
+ -(operand.as_inner().b() * self.y() * self.y()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Rotor<T>>> for Unit<Vector<T>> {
type Output = Rotor<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
Rotor::new_unchecked(operand.as_inner().s(), -(operand.as_inner().b()))
}
}
#[doc = "Antisandwich product: [`Vector`] x [`Scalar`] x antirev([`Vector`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Scalar<T>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(self.x() * operand.s() * self.x() + self.y() * operand.s() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Scalar<T>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(operand.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Scalar<T>>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(
operand.as_inner().s() * self.x() * self.x()
+ operand.as_inner().s() * self.y() * self.y(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Scalar<T>>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(operand.as_inner().s())
}
}
#[doc = "Antisandwich product: [`Vector`] x [`Vector`] x antirev([`Vector`]).\n\nThe antisandwich product `v x a x antirev(v)` is the dual of the\nsandwich product, used in Projective GA for transforming dual objects\n(planes, ideal points). Motors use antisandwich for plane transforms."]
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Vector<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-(self.x() * operand.x() * self.x()) - self.x() * operand.y() * self.y()
+ self.y() * operand.x() * self.y()
- self.y() * operand.y() * self.x(),
-(self.x() * operand.x() * self.y()) + self.x() * operand.y() * self.x()
- self.y() * operand.x() * self.x()
- self.y() * operand.y() * self.y(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Vector<T>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-(operand.x())
+ -T::TWO * operand.y() * self.as_inner().x() * self.as_inner().y()
+ T::TWO * operand.x() * self.as_inner().y() * self.as_inner().y(),
-T::TWO * operand.x() * self.as_inner().x() * self.as_inner().y()
+ -T::TWO * operand.y() * self.as_inner().y() * self.as_inner().y()
+ operand.y(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Vector<T>>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(operand.as_inner().x() * self.x() * self.x())
+ -T::TWO * operand.as_inner().y() * self.x() * self.y()
+ operand.as_inner().x() * self.y() * self.y(),
-(operand.as_inner().y() * self.y() * self.y())
+ -T::TWO * operand.as_inner().x() * self.x() * self.y()
+ operand.as_inner().y() * self.x() * self.x(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> Antisandwich<Unit<Vector<T>>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn antisandwich(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(operand.as_inner().x())
+ -T::TWO * operand.as_inner().y() * self.as_inner().x() * self.as_inner().y()
+ T::TWO * operand.as_inner().x() * self.as_inner().y() * self.as_inner().y(),
-T::TWO * operand.as_inner().x() * self.as_inner().x() * self.as_inner().y()
+ -T::TWO * operand.as_inner().y() * self.as_inner().y() * self.as_inner().y()
+ operand.as_inner().y(),
)
}
}
#[doc = "Transform a [`Bivector`] using this [`Bivector`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Bivector<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Bivector<T>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Bivector<T>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Bivector<T>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Bivector<T>>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Rotor`] using this [`Bivector`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Rotor<T>> for Bivector<T> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Rotor<T>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Rotor<T>> for Unit<Bivector<T>> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Rotor<T>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Rotor<T>>> for Bivector<T> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Rotor<T>>> for Unit<Bivector<T>> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Scalar`] using this [`Bivector`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Scalar<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Scalar<T>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Scalar<T>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Scalar<T>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Scalar<T>>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Scalar<T>>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Vector`] using this [`Bivector`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Vector<T>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Vector<T>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Vector<T>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Vector<T>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Vector<T>>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Vector<T>>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Bivector`] using this [`Rotor`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Bivector<T>> for Rotor<T> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Bivector<T>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Bivector<T>> for Unit<Rotor<T>> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Bivector<T>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Bivector<T>>> for Rotor<T> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Bivector<T>>> for Unit<Rotor<T>> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Rotor`] using this [`Rotor`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Rotor<T>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Rotor<T>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Rotor<T>> for Unit<Rotor<T>> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Rotor<T>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Rotor<T>>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Rotor<T>>> for Unit<Rotor<T>> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Scalar`] using this [`Rotor`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Scalar<T>> for Rotor<T> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Scalar<T>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Scalar<T>> for Unit<Rotor<T>> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Scalar<T>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Scalar<T>>> for Rotor<T> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Scalar<T>>> for Unit<Rotor<T>> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Vector`] using this [`Rotor`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Vector<T>> for Rotor<T> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Vector<T>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Vector<T>> for Unit<Rotor<T>> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Vector<T>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Vector<T>>> for Rotor<T> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Vector<T>>> for Unit<Rotor<T>> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Bivector`] using this [`Scalar`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Bivector<T>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Bivector<T>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Bivector<T>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Bivector<T>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Bivector<T>>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Bivector<T>>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Rotor`] using this [`Scalar`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Rotor<T>> for Scalar<T> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Rotor<T>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Rotor<T>> for Unit<Scalar<T>> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Rotor<T>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Rotor<T>>> for Scalar<T> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Rotor<T>>> for Unit<Scalar<T>> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Scalar`] using this [`Scalar`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Scalar<T>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Scalar<T>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Scalar<T>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Scalar<T>>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Vector`] using this [`Scalar`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Vector<T>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Vector<T>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Vector<T>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Vector<T>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Vector<T>>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Vector<T>>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Bivector`] using this [`Vector`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Bivector<T>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Bivector<T>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Bivector<T>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Bivector<T>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Bivector<T>>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Bivector<T>>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn transform(&self, operand: &Unit<Bivector<T>>) -> Bivector<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Rotor`] using this [`Vector`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Rotor<T>> for Vector<T> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Rotor<T>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Rotor<T>> for Unit<Vector<T>> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Rotor<T>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Rotor<T>>> for Vector<T> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Rotor<T>>> for Unit<Vector<T>> {
type Output = Rotor<T>;
#[inline]
fn transform(&self, operand: &Unit<Rotor<T>>) -> Rotor<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Scalar`] using this [`Vector`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Scalar<T>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Scalar<T>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Scalar<T>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Scalar<T>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Scalar<T>>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Scalar<T>>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn transform(&self, operand: &Unit<Scalar<T>>) -> Scalar<T> {
self.sandwich(operand)
}
}
#[doc = "Transform a [`Vector`] using this [`Vector`].\n\nApplies the geometric transformation represented by this versor.\nFor rotors, this performs rotation. For motors, this performs rigid\nbody transformation (rotation + translation). Internally uses the\nsandwich product."]
impl<T: Float> Transform<Vector<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Vector<T>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Vector<T>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Vector<T>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Vector<T>>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
self.sandwich(operand)
}
}
impl<T: Float> Transform<Unit<Vector<T>>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn transform(&self, operand: &Unit<Vector<T>>) -> Vector<T> {
self.sandwich(operand)
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Bivector<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Bivector<T>) -> Option<Bivector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Bivector::new_unchecked(
(self.b() * operand.b() * self.b()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Rotor<T>> for Bivector<T> {
type Output = Rotor<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Rotor<T>) -> Option<Rotor<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Rotor::new_unchecked(
(self.b() * operand.s() * self.b()) * inv_norm_sq,
(self.b() * operand.b() * self.b()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Scalar<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Scalar<T>) -> Option<Scalar<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Scalar::new_unchecked(
(self.b() * operand.s() * self.b()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Vector<T>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Vector<T>) -> Option<Vector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Vector::new_unchecked(
(-(self.b() * operand.x() * self.b())) * inv_norm_sq,
(-(self.b() * operand.y() * self.b())) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Bivector<T>> for Rotor<T> {
type Output = Bivector<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Bivector<T>) -> Option<Bivector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Bivector::new_unchecked(
(self.b() * operand.b() * self.b() + self.s() * operand.b() * self.s()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Rotor<T>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Rotor<T>) -> Option<Rotor<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Rotor::new_unchecked(
(-(self.b() * operand.b() * self.s())
+ self.b() * operand.s() * self.b()
+ self.s() * operand.b() * self.b()
+ self.s() * operand.s() * self.s())
* inv_norm_sq,
(self.b() * operand.b() * self.b()
+ self.b() * operand.s() * self.s()
+ self.s() * operand.b() * self.s()
- self.s() * operand.s() * self.b())
* inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Scalar<T>> for Rotor<T> {
type Output = Scalar<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Scalar<T>) -> Option<Scalar<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Scalar::new_unchecked(
(self.b() * operand.s() * self.b() + self.s() * operand.s() * self.s()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Vector<T>> for Rotor<T> {
type Output = Vector<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Vector<T>) -> Option<Vector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Vector::new_unchecked(
(-(self.b() * operand.x() * self.b())
+ self.b() * operand.y() * self.s()
+ self.s() * operand.x() * self.s()
+ self.s() * operand.y() * self.b())
* inv_norm_sq,
(-(self.b() * operand.x() * self.s())
- self.b() * operand.y() * self.b()
- self.s() * operand.x() * self.b()
+ self.s() * operand.y() * self.s())
* inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Bivector<T>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Bivector<T>) -> Option<Bivector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Bivector::new_unchecked(
(self.s() * operand.b() * self.s()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Rotor<T>> for Scalar<T> {
type Output = Rotor<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Rotor<T>) -> Option<Rotor<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Rotor::new_unchecked(
(self.s() * operand.s() * self.s()) * inv_norm_sq,
(self.s() * operand.b() * self.s()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Scalar<T>) -> Option<Scalar<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Scalar::new_unchecked(
(self.s() * operand.s() * self.s()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Vector<T>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Vector<T>) -> Option<Vector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Vector::new_unchecked(
(self.s() * operand.x() * self.s()) * inv_norm_sq,
(self.s() * operand.y() * self.s()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Bivector<T>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Bivector<T>) -> Option<Bivector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Bivector::new_unchecked(
(-(self.x() * operand.b() * self.x()) - self.y() * operand.b() * self.y())
* inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Rotor<T>> for Vector<T> {
type Output = Rotor<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Rotor<T>) -> Option<Rotor<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Rotor::new_unchecked(
(self.x() * operand.b() * self.y() + self.x() * operand.s() * self.x()
- self.y() * operand.b() * self.x()
+ self.y() * operand.s() * self.y())
* inv_norm_sq,
(-(self.x() * operand.b() * self.x()) + self.x() * operand.s() * self.y()
- self.y() * operand.b() * self.y()
- self.y() * operand.s() * self.x())
* inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Scalar<T>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Scalar<T>) -> Option<Scalar<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Scalar::new_unchecked(
(self.x() * operand.s() * self.x() + self.y() * operand.s() * self.y()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseSandwich<Vector<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn try_inverse_sandwich(&self, operand: &Vector<T>) -> Option<Vector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Vector::new_unchecked(
(self.x() * operand.x() * self.x() + self.x() * operand.y() * self.y()
- self.y() * operand.x() * self.y()
+ self.y() * operand.y() * self.x())
* inv_norm_sq,
(self.x() * operand.x() * self.y() - self.x() * operand.y() * self.x()
+ self.y() * operand.x() * self.x()
+ self.y() * operand.y() * self.y())
* inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Bivector<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Bivector<T>) -> Option<Bivector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Bivector::new_unchecked(
(self.b() * operand.b() * self.b()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Rotor<T>> for Bivector<T> {
type Output = Rotor<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Rotor<T>) -> Option<Rotor<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Rotor::new_unchecked(
(self.b() * operand.s() * self.b()) * inv_norm_sq,
(self.b() * operand.b() * self.b()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Scalar<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Scalar<T>) -> Option<Scalar<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Scalar::new_unchecked(
(self.b() * operand.s() * self.b()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Vector<T>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Vector<T>) -> Option<Vector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Vector::new_unchecked(
(self.b() * operand.x() * self.b()) * inv_norm_sq,
(self.b() * operand.y() * self.b()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Bivector<T>> for Rotor<T> {
type Output = Bivector<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Bivector<T>) -> Option<Bivector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Bivector::new_unchecked(
(self.b() * operand.b() * self.b() + self.s() * operand.b() * self.s()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Rotor<T>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Rotor<T>) -> Option<Rotor<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Rotor::new_unchecked(
(-(self.b() * operand.b() * self.s())
+ self.b() * operand.s() * self.b()
+ self.s() * operand.b() * self.b()
+ self.s() * operand.s() * self.s())
* inv_norm_sq,
(self.b() * operand.b() * self.b()
+ self.b() * operand.s() * self.s()
+ self.s() * operand.b() * self.s()
- self.s() * operand.s() * self.b())
* inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Scalar<T>> for Rotor<T> {
type Output = Scalar<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Scalar<T>) -> Option<Scalar<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Scalar::new_unchecked(
(self.b() * operand.s() * self.b() + self.s() * operand.s() * self.s()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Vector<T>> for Rotor<T> {
type Output = Vector<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Vector<T>) -> Option<Vector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Vector::new_unchecked(
(self.b() * operand.x() * self.b() + self.b() * operand.y() * self.s()
- self.s() * operand.x() * self.s()
+ self.s() * operand.y() * self.b())
* inv_norm_sq,
(-(self.b() * operand.x() * self.s()) + self.b() * operand.y() * self.b()
- self.s() * operand.x() * self.b()
- self.s() * operand.y() * self.s())
* inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Bivector<T>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Bivector<T>) -> Option<Bivector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Bivector::new_unchecked(
(self.s() * operand.b() * self.s()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Rotor<T>> for Scalar<T> {
type Output = Rotor<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Rotor<T>) -> Option<Rotor<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Rotor::new_unchecked(
(self.s() * operand.s() * self.s()) * inv_norm_sq,
(self.s() * operand.b() * self.s()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Scalar<T>) -> Option<Scalar<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Scalar::new_unchecked(
(self.s() * operand.s() * self.s()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Vector<T>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Vector<T>) -> Option<Vector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Vector::new_unchecked(
(-(self.s() * operand.x() * self.s())) * inv_norm_sq,
(-(self.s() * operand.y() * self.s())) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Bivector<T>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Bivector<T>) -> Option<Bivector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Bivector::new_unchecked(
(-(self.x() * operand.b() * self.x()) - self.y() * operand.b() * self.y())
* inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Rotor<T>> for Vector<T> {
type Output = Rotor<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Rotor<T>) -> Option<Rotor<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Rotor::new_unchecked(
(-(self.x() * operand.b() * self.y())
+ self.x() * operand.s() * self.x()
+ self.y() * operand.b() * self.x()
+ self.y() * operand.s() * self.y())
* inv_norm_sq,
(-(self.x() * operand.b() * self.x())
- self.x() * operand.s() * self.y()
- self.y() * operand.b() * self.y()
+ self.y() * operand.s() * self.x())
* inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Scalar<T>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Scalar<T>) -> Option<Scalar<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Scalar::new_unchecked(
(self.x() * operand.s() * self.x() + self.y() * operand.s() * self.y()) * inv_norm_sq,
))
}
}
#[allow(unused_variables)]
impl<T: Float> InverseAntisandwich<Vector<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn try_inverse_antisandwich(&self, operand: &Vector<T>) -> Option<Vector<T>> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Vector::new_unchecked(
(-(self.x() * operand.x() * self.x()) - self.x() * operand.y() * self.y()
+ self.y() * operand.x() * self.y()
- self.y() * operand.y() * self.x())
* inv_norm_sq,
(-(self.x() * operand.x() * self.y()) + self.x() * operand.y() * self.x()
- self.y() * operand.x() * self.x()
- self.y() * operand.y() * self.y())
* inv_norm_sq,
))
}
}
impl<T: Float> Versor<Bivector<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn compose(&self, other: &Bivector<T>) -> Scalar<T> {
*self * *other
}
}
impl<T: Float> Versor<Rotor<T>> for Bivector<T> {
type Output = Rotor<T>;
#[inline]
fn compose(&self, other: &Rotor<T>) -> Rotor<T> {
*self * *other
}
}
impl<T: Float> Versor<Scalar<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn compose(&self, other: &Scalar<T>) -> Bivector<T> {
*self * *other
}
}
impl<T: Float> Versor<Vector<T>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn compose(&self, other: &Vector<T>) -> Vector<T> {
*self * *other
}
}
impl<T: Float> Versor<Bivector<T>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn compose(&self, other: &Bivector<T>) -> Rotor<T> {
*self * *other
}
}
impl<T: Float> Versor<Rotor<T>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn compose(&self, other: &Rotor<T>) -> Rotor<T> {
*self * *other
}
}
impl<T: Float> Versor<Scalar<T>> for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn compose(&self, other: &Scalar<T>) -> Rotor<T> {
*self * *other
}
}
impl<T: Float> Versor<Vector<T>> for Rotor<T> {
type Output = Vector<T>;
#[inline]
fn compose(&self, other: &Vector<T>) -> Vector<T> {
*self * *other
}
}
impl<T: Float> Versor<Bivector<T>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn compose(&self, other: &Bivector<T>) -> Bivector<T> {
*self * *other
}
}
impl<T: Float> Versor<Rotor<T>> for Scalar<T> {
type Output = Rotor<T>;
#[inline]
fn compose(&self, other: &Rotor<T>) -> Rotor<T> {
*self * *other
}
}
impl<T: Float> Versor<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn compose(&self, other: &Scalar<T>) -> Scalar<T> {
*self * *other
}
}
impl<T: Float> Versor<Vector<T>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn compose(&self, other: &Vector<T>) -> Vector<T> {
*self * *other
}
}
impl<T: Float> Versor<Bivector<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn compose(&self, other: &Bivector<T>) -> Vector<T> {
*self * *other
}
}
impl<T: Float> Versor<Rotor<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn compose(&self, other: &Rotor<T>) -> Vector<T> {
*self * *other
}
}
impl<T: Float> Versor<Scalar<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn compose(&self, other: &Scalar<T>) -> Vector<T> {
*self * *other
}
}
impl<T: Float> Versor<Vector<T>> for Vector<T> {
type Output = Rotor<T>;
#[inline]
fn compose(&self, other: &Vector<T>) -> Rotor<T> {
*self * *other
}
}
impl<T: Float> ScalarProduct<Bivector<T>> for Bivector<T> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Bivector<T>) -> T {
-(self.b() * rhs.b())
}
}
#[allow(unused_variables)]
impl<T: Float> ScalarProduct<Bivector<T>> for Unit<Bivector<T>> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Bivector<T>) -> T {
-(rhs.b() * self.as_inner().b())
}
}
#[allow(unused_variables)]
impl<T: Float> ScalarProduct<Unit<Bivector<T>>> for Bivector<T> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Unit<Bivector<T>>) -> T {
-(rhs.as_inner().b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> ScalarProduct<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Unit<Bivector<T>>) -> T {
-(rhs.as_inner().b() * self.as_inner().b())
}
}
impl<T: Float> ScalarProduct<Scalar<T>> for Scalar<T> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Scalar<T>) -> T {
self.s() * rhs.s()
}
}
#[allow(unused_variables)]
impl<T: Float> ScalarProduct<Scalar<T>> for Unit<Scalar<T>> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Scalar<T>) -> T {
rhs.s() * self.as_inner().s()
}
}
#[allow(unused_variables)]
impl<T: Float> ScalarProduct<Unit<Scalar<T>>> for Scalar<T> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Unit<Scalar<T>>) -> T {
rhs.as_inner().s() * self.s()
}
}
#[allow(unused_variables)]
impl<T: Float> ScalarProduct<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Unit<Scalar<T>>) -> T {
rhs.as_inner().s() * self.as_inner().s()
}
}
impl<T: Float> ScalarProduct<Vector<T>> for Vector<T> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Vector<T>) -> T {
self.x() * rhs.x() + self.y() * rhs.y()
}
}
#[allow(unused_variables)]
impl<T: Float> ScalarProduct<Vector<T>> for Unit<Vector<T>> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Vector<T>) -> T {
rhs.x() * self.as_inner().x() + rhs.y() * self.as_inner().y()
}
}
#[allow(unused_variables)]
impl<T: Float> ScalarProduct<Unit<Vector<T>>> for Vector<T> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Unit<Vector<T>>) -> T {
rhs.as_inner().x() * self.x() + rhs.as_inner().y() * self.y()
}
}
#[allow(unused_variables)]
impl<T: Float> ScalarProduct<Unit<Vector<T>>> for Unit<Vector<T>> {
type Scalar = T;
#[inline]
fn scalar_product(&self, rhs: &Unit<Vector<T>>) -> T {
rhs.as_inner().x() * self.as_inner().x() + rhs.as_inner().y() * self.as_inner().y()
}
}
#[doc = "Bulk contraction of [`Bivector`] with [`Bivector`].\n\nThe bulk contraction extracts the Euclidean (non-degenerate) component\nof the interior product. In PGA, this isolates the finite/spatial part."]
impl<T: Float> BulkContract<Bivector<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Bivector<T>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.b() * self.as_inner().b())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Bivector<T>>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().b() * self.as_inner().b())
}
}
#[doc = "Bulk contraction of [`Bivector`] with [`Scalar`].\n\nThe bulk contraction extracts the Euclidean (non-degenerate) component\nof the interior product. In PGA, this isolates the finite/spatial part."]
impl<T: Float> BulkContract<Scalar<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.s() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Scalar<T>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.s() * self.as_inner().b())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Scalar<T>>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().s() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Scalar<T>>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().s() * self.as_inner().b())
}
}
#[doc = "Bulk contraction of [`Bivector`] with [`Vector`].\n\nThe bulk contraction extracts the Euclidean (non-degenerate) component\nof the interior product. In PGA, this isolates the finite/spatial part."]
impl<T: Float> BulkContract<Vector<T>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(rhs.y() * self.b(), -(rhs.x() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Vector<T>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
rhs.y() * self.as_inner().b(),
-(rhs.x() * self.as_inner().b()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Vector<T>>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().y() * self.b(),
-(rhs.as_inner().x() * self.b()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Vector<T>>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().y() * self.as_inner().b(),
-(rhs.as_inner().x() * self.as_inner().b()),
)
}
}
#[doc = "Bulk contraction of [`Scalar`] with [`Scalar`].\n\nThe bulk contraction extracts the Euclidean (non-degenerate) component\nof the interior product. In PGA, this isolates the finite/spatial part."]
impl<T: Float> BulkContract<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Scalar<T>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.s() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Scalar<T>>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().s() * self.as_inner().s())
}
}
#[doc = "Bulk contraction of [`Vector`] with [`Scalar`].\n\nThe bulk contraction extracts the Euclidean (non-degenerate) component\nof the interior product. In PGA, this isolates the finite/spatial part."]
impl<T: Float> BulkContract<Scalar<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Scalar<T>) -> Vector<T> {
Vector::new_unchecked(-(rhs.s() * self.x()), -(rhs.s() * self.y()))
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Scalar<T>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Scalar<T>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.s() * self.as_inner().x()),
-(rhs.s() * self.as_inner().y()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Scalar<T>>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Scalar<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().s() * self.x()),
-(rhs.as_inner().s() * self.y()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Scalar<T>>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Scalar<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().s() * self.as_inner().x()),
-(rhs.as_inner().s() * self.as_inner().y()),
)
}
}
#[doc = "Bulk contraction of [`Vector`] with [`Vector`].\n\nThe bulk contraction extracts the Euclidean (non-degenerate) component\nof the interior product. In PGA, this isolates the finite/spatial part."]
impl<T: Float> BulkContract<Vector<T>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Vector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.x() * self.x() + rhs.y() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Vector<T>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Vector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.x() * self.as_inner().x() + rhs.y() * self.as_inner().y())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Vector<T>>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Vector<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().x() * self.x() + rhs.as_inner().y() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkContract<Unit<Vector<T>>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn bulk_contract(&self, rhs: &Unit<Vector<T>>) -> Scalar<T> {
Scalar::new_unchecked(
rhs.as_inner().x() * self.as_inner().x() + rhs.as_inner().y() * self.as_inner().y(),
)
}
}
#[doc = "Weight contraction of [`Bivector`] with [`Bivector`].\n\nThe weight contraction extracts the degenerate/ideal component of the\ninterior product. In PGA, this measures the 'weight' or projective part."]
impl<T: Float> WeightContract<Bivector<T>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.b() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Bivector<T>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.b() * self.as_inner().b()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Bivector<T>>> for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().b() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().b() * self.as_inner().b()))
}
}
#[doc = "Weight contraction of [`Bivector`] with [`Scalar`].\n\nThe weight contraction extracts the degenerate/ideal component of the\ninterior product. In PGA, this measures the 'weight' or projective part."]
impl<T: Float> WeightContract<Scalar<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn weight_contract(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.s() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Scalar<T>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn weight_contract(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.s() * self.as_inner().b()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Scalar<T>>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.as_inner().s() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Scalar<T>>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.as_inner().s() * self.as_inner().b()))
}
}
#[doc = "Weight contraction of [`Bivector`] with [`Vector`].\n\nThe weight contraction extracts the degenerate/ideal component of the\ninterior product. In PGA, this measures the 'weight' or projective part."]
impl<T: Float> WeightContract<Vector<T>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn weight_contract(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(-(rhs.y() * self.b()), rhs.x() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Vector<T>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn weight_contract(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.y() * self.as_inner().b()),
rhs.x() * self.as_inner().b(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Vector<T>>> for Bivector<T> {
type Output = Vector<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().y() * self.b()),
rhs.as_inner().x() * self.b(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Vector<T>>> for Unit<Bivector<T>> {
type Output = Vector<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().y() * self.as_inner().b()),
rhs.as_inner().x() * self.as_inner().b(),
)
}
}
#[doc = "Weight contraction of [`Scalar`] with [`Scalar`].\n\nThe weight contraction extracts the degenerate/ideal component of the\ninterior product. In PGA, this measures the 'weight' or projective part."]
impl<T: Float> WeightContract<Scalar<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.s() * self.s()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Scalar<T>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Scalar<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.s() * self.as_inner().s()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Scalar<T>>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().s() * self.s()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Scalar<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().s() * self.as_inner().s()))
}
}
#[doc = "Weight contraction of [`Vector`] with [`Scalar`].\n\nThe weight contraction extracts the degenerate/ideal component of the\ninterior product. In PGA, this measures the 'weight' or projective part."]
impl<T: Float> WeightContract<Scalar<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn weight_contract(&self, rhs: &Scalar<T>) -> Vector<T> {
Vector::new_unchecked(rhs.s() * self.x(), rhs.s() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Scalar<T>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn weight_contract(&self, rhs: &Scalar<T>) -> Vector<T> {
Vector::new_unchecked(rhs.s() * self.as_inner().x(), rhs.s() * self.as_inner().y())
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Scalar<T>>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Scalar<T>>) -> Vector<T> {
Vector::new_unchecked(rhs.as_inner().s() * self.x(), rhs.as_inner().s() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Scalar<T>>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Scalar<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().s() * self.as_inner().x(),
rhs.as_inner().s() * self.as_inner().y(),
)
}
}
#[doc = "Weight contraction of [`Vector`] with [`Vector`].\n\nThe weight contraction extracts the degenerate/ideal component of the\ninterior product. In PGA, this measures the 'weight' or projective part."]
impl<T: Float> WeightContract<Vector<T>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Vector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.x() * self.x()) + -(rhs.y() * self.y()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Vector<T>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Vector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.x() * self.as_inner().x()) + -(rhs.y() * self.as_inner().y()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Vector<T>>> for Vector<T> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Vector<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().x() * self.x()) + -(rhs.as_inner().y() * self.y()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightContract<Unit<Vector<T>>> for Unit<Vector<T>> {
type Output = Scalar<T>;
#[inline]
fn weight_contract(&self, rhs: &Unit<Vector<T>>) -> Scalar<T> {
Scalar::new_unchecked(
-(rhs.as_inner().x() * self.as_inner().x())
+ -(rhs.as_inner().y() * self.as_inner().y()),
)
}
}
#[doc = "Bulk expansion of [`Bivector`] with [`Bivector`].\n\nThe bulk expansion is the dual of bulk contraction, extracting the\nEuclidean component of the exterior product complement."]
impl<T: Float> BulkExpand<Bivector<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Bivector<T>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.b() * self.as_inner().b())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Bivector<T>>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().b() * self.as_inner().b())
}
}
#[doc = "Bulk expansion of [`Scalar`] with [`Bivector`].\n\nThe bulk expansion is the dual of bulk contraction, extracting the\nEuclidean component of the exterior product complement."]
impl<T: Float> BulkExpand<Bivector<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn bulk_expand(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.b() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Bivector<T>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn bulk_expand(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(rhs.b() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Bivector<T>>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().b() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Bivector<T>>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(rhs.as_inner().b() * self.as_inner().s())
}
}
#[doc = "Bulk expansion of [`Scalar`] with [`Scalar`].\n\nThe bulk expansion is the dual of bulk contraction, extracting the\nEuclidean component of the exterior product complement."]
impl<T: Float> BulkExpand<Scalar<T>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Scalar<T>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.s() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Scalar<T>>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().s() * self.as_inner().s())
}
}
#[doc = "Bulk expansion of [`Scalar`] with [`Vector`].\n\nThe bulk expansion is the dual of bulk contraction, extracting the\nEuclidean component of the exterior product complement."]
impl<T: Float> BulkExpand<Vector<T>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(-(rhs.y() * self.s()), rhs.x() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Vector<T>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.y() * self.as_inner().s()),
rhs.x() * self.as_inner().s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Vector<T>>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().y() * self.s()),
rhs.as_inner().x() * self.s(),
)
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Vector<T>>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().y() * self.as_inner().s()),
rhs.as_inner().x() * self.as_inner().s(),
)
}
}
#[doc = "Bulk expansion of [`Vector`] with [`Bivector`].\n\nThe bulk expansion is the dual of bulk contraction, extracting the\nEuclidean component of the exterior product complement."]
impl<T: Float> BulkExpand<Bivector<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Bivector<T>) -> Vector<T> {
Vector::new_unchecked(rhs.b() * self.x(), rhs.b() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Bivector<T>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Bivector<T>) -> Vector<T> {
Vector::new_unchecked(rhs.b() * self.as_inner().x(), rhs.b() * self.as_inner().y())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Bivector<T>>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Bivector<T>>) -> Vector<T> {
Vector::new_unchecked(rhs.as_inner().b() * self.x(), rhs.as_inner().b() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Bivector<T>>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Bivector<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().b() * self.as_inner().x(),
rhs.as_inner().b() * self.as_inner().y(),
)
}
}
#[doc = "Bulk expansion of [`Vector`] with [`Vector`].\n\nThe bulk expansion is the dual of bulk contraction, extracting the\nEuclidean component of the exterior product complement."]
impl<T: Float> BulkExpand<Vector<T>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Vector<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.x() * self.x() + rhs.y() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Vector<T>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Vector<T>) -> Bivector<T> {
Bivector::new_unchecked(rhs.x() * self.as_inner().x() + rhs.y() * self.as_inner().y())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Vector<T>>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Vector<T>>) -> Bivector<T> {
Bivector::new_unchecked(rhs.as_inner().x() * self.x() + rhs.as_inner().y() * self.y())
}
}
#[allow(unused_variables)]
impl<T: Float> BulkExpand<Unit<Vector<T>>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn bulk_expand(&self, rhs: &Unit<Vector<T>>) -> Bivector<T> {
Bivector::new_unchecked(
rhs.as_inner().x() * self.as_inner().x() + rhs.as_inner().y() * self.as_inner().y(),
)
}
}
#[doc = "Weight expansion of [`Bivector`] with [`Bivector`].\n\nThe weight expansion is the dual of weight contraction, extracting the\ndegenerate/ideal component of the exterior product complement."]
impl<T: Float> WeightExpand<Bivector<T>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.b() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Bivector<T>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Bivector<T>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.b() * self.as_inner().b()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Bivector<T>>> for Bivector<T> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.as_inner().b() * self.b()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Bivector<T>>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.as_inner().b() * self.as_inner().b()))
}
}
#[doc = "Weight expansion of [`Scalar`] with [`Bivector`].\n\nThe weight expansion is the dual of weight contraction, extracting the\ndegenerate/ideal component of the exterior product complement."]
impl<T: Float> WeightExpand<Bivector<T>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn weight_expand(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.b() * self.s()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Bivector<T>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn weight_expand(&self, rhs: &Bivector<T>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.b() * self.as_inner().s()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Bivector<T>>> for Scalar<T> {
type Output = Scalar<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().b() * self.s()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Bivector<T>>> for Unit<Scalar<T>> {
type Output = Scalar<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Bivector<T>>) -> Scalar<T> {
Scalar::new_unchecked(-(rhs.as_inner().b() * self.as_inner().s()))
}
}
#[doc = "Weight expansion of [`Scalar`] with [`Scalar`].\n\nThe weight expansion is the dual of weight contraction, extracting the\ndegenerate/ideal component of the exterior product complement."]
impl<T: Float> WeightExpand<Scalar<T>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.s() * self.s()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Scalar<T>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Scalar<T>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.s() * self.as_inner().s()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Scalar<T>>> for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.as_inner().s() * self.s()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Scalar<T>>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.as_inner().s() * self.as_inner().s()))
}
}
#[doc = "Weight expansion of [`Scalar`] with [`Vector`].\n\nThe weight expansion is the dual of weight contraction, extracting the\ndegenerate/ideal component of the exterior product complement."]
impl<T: Float> WeightExpand<Vector<T>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn weight_expand(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(rhs.y() * self.s(), -(rhs.x() * self.s()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Vector<T>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn weight_expand(&self, rhs: &Vector<T>) -> Vector<T> {
Vector::new_unchecked(
rhs.y() * self.as_inner().s(),
-(rhs.x() * self.as_inner().s()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Vector<T>>> for Scalar<T> {
type Output = Vector<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().y() * self.s(),
-(rhs.as_inner().x() * self.s()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Vector<T>>> for Unit<Scalar<T>> {
type Output = Vector<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Vector<T>>) -> Vector<T> {
Vector::new_unchecked(
rhs.as_inner().y() * self.as_inner().s(),
-(rhs.as_inner().x() * self.as_inner().s()),
)
}
}
#[doc = "Weight expansion of [`Vector`] with [`Bivector`].\n\nThe weight expansion is the dual of weight contraction, extracting the\ndegenerate/ideal component of the exterior product complement."]
impl<T: Float> WeightExpand<Bivector<T>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn weight_expand(&self, rhs: &Bivector<T>) -> Vector<T> {
Vector::new_unchecked(-(rhs.b() * self.x()), -(rhs.b() * self.y()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Bivector<T>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn weight_expand(&self, rhs: &Bivector<T>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.b() * self.as_inner().x()),
-(rhs.b() * self.as_inner().y()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Bivector<T>>> for Vector<T> {
type Output = Vector<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Bivector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().b() * self.x()),
-(rhs.as_inner().b() * self.y()),
)
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Bivector<T>>> for Unit<Vector<T>> {
type Output = Vector<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Bivector<T>>) -> Vector<T> {
Vector::new_unchecked(
-(rhs.as_inner().b() * self.as_inner().x()),
-(rhs.as_inner().b() * self.as_inner().y()),
)
}
}
#[doc = "Weight expansion of [`Vector`] with [`Vector`].\n\nThe weight expansion is the dual of weight contraction, extracting the\ndegenerate/ideal component of the exterior product complement."]
impl<T: Float> WeightExpand<Vector<T>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Vector<T>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.x() * self.x()) + -(rhs.y() * self.y()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Vector<T>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Vector<T>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.x() * self.as_inner().x()) + -(rhs.y() * self.as_inner().y()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Vector<T>>> for Vector<T> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Vector<T>>) -> Bivector<T> {
Bivector::new_unchecked(-(rhs.as_inner().x() * self.x()) + -(rhs.as_inner().y() * self.y()))
}
}
#[allow(unused_variables)]
impl<T: Float> WeightExpand<Unit<Vector<T>>> for Unit<Vector<T>> {
type Output = Bivector<T>;
#[inline]
fn weight_expand(&self, rhs: &Unit<Vector<T>>) -> Bivector<T> {
Bivector::new_unchecked(
-(rhs.as_inner().x() * self.as_inner().x())
+ -(rhs.as_inner().y() * self.as_inner().y()),
)
}
}
impl<T: Float> Dot<Bivector<T>> for Bivector<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Bivector<T>) -> T {
-(self.b() * rhs.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Bivector<T>> for Unit<Bivector<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Bivector<T>) -> T {
-(rhs.b() * self.as_inner().b())
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Bivector<T>>> for Bivector<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Bivector<T>>) -> T {
-(rhs.as_inner().b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Bivector<T>>) -> T {
-(rhs.as_inner().b() * self.as_inner().b())
}
}
impl<T: Float> Dot<Rotor<T>> for Bivector<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Rotor<T>) -> T {
-(self.b() * rhs.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Rotor<T>> for Unit<Bivector<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Rotor<T>) -> T {
-(rhs.b() * self.as_inner().b())
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Rotor<T>>> for Bivector<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Rotor<T>>) -> T {
-(rhs.as_inner().b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Rotor<T>>> for Unit<Bivector<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Rotor<T>>) -> T {
-(rhs.as_inner().b() * self.as_inner().b())
}
}
impl<T: Float> Dot<Bivector<T>> for Rotor<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Bivector<T>) -> T {
-(self.b() * rhs.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Bivector<T>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Bivector<T>) -> T {
-(rhs.b() * self.as_inner().b())
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Bivector<T>>> for Rotor<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Bivector<T>>) -> T {
-(rhs.as_inner().b() * self.b())
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Bivector<T>>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Bivector<T>>) -> T {
-(rhs.as_inner().b() * self.as_inner().b())
}
}
impl<T: Float> Dot<Rotor<T>> for Rotor<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Rotor<T>) -> T {
self.s() * rhs.s() - self.b() * rhs.b()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Rotor<T>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Rotor<T>) -> T {
-(rhs.b() * self.as_inner().b()) + rhs.s() * self.as_inner().s()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Rotor<T>>> for Rotor<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Rotor<T>>) -> T {
-(rhs.as_inner().b() * self.b()) + rhs.as_inner().s() * self.s()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Rotor<T>>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Rotor<T>>) -> T {
-(rhs.as_inner().b() * self.as_inner().b()) + rhs.as_inner().s() * self.as_inner().s()
}
}
impl<T: Float> Dot<Scalar<T>> for Rotor<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Scalar<T>) -> T {
self.s() * rhs.s()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Scalar<T>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Scalar<T>) -> T {
rhs.s() * self.as_inner().s()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Scalar<T>>> for Rotor<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Scalar<T>>) -> T {
rhs.as_inner().s() * self.s()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Scalar<T>>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Scalar<T>>) -> T {
rhs.as_inner().s() * self.as_inner().s()
}
}
impl<T: Float> Dot<Rotor<T>> for Scalar<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Rotor<T>) -> T {
self.s() * rhs.s()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Rotor<T>> for Unit<Scalar<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Rotor<T>) -> T {
rhs.s() * self.as_inner().s()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Rotor<T>>> for Scalar<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Rotor<T>>) -> T {
rhs.as_inner().s() * self.s()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Rotor<T>>> for Unit<Scalar<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Rotor<T>>) -> T {
rhs.as_inner().s() * self.as_inner().s()
}
}
impl<T: Float> Dot<Scalar<T>> for Scalar<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Scalar<T>) -> T {
self.s() * rhs.s()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Scalar<T>> for Unit<Scalar<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Scalar<T>) -> T {
rhs.s() * self.as_inner().s()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Scalar<T>>> for Scalar<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Scalar<T>>) -> T {
rhs.as_inner().s() * self.s()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Scalar<T>>) -> T {
rhs.as_inner().s() * self.as_inner().s()
}
}
impl<T: Float> Dot<Vector<T>> for Vector<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Vector<T>) -> T {
self.x() * rhs.x() + self.y() * rhs.y()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Vector<T>> for Unit<Vector<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Vector<T>) -> T {
rhs.x() * self.as_inner().x() + rhs.y() * self.as_inner().y()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Vector<T>>> for Vector<T> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Vector<T>>) -> T {
rhs.as_inner().x() * self.x() + rhs.as_inner().y() * self.y()
}
}
#[allow(unused_variables)]
impl<T: Float> Dot<Unit<Vector<T>>> for Unit<Vector<T>> {
type Scalar = T;
#[inline]
fn dot(&self, rhs: &Unit<Vector<T>>) -> T {
rhs.as_inner().x() * self.as_inner().x() + rhs.as_inner().y() * self.as_inner().y()
}
}
impl<T: Float> Antidot<Bivector<T>> for Bivector<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Bivector<T>) -> T {
self.b() * rhs.b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Bivector<T>> for Unit<Bivector<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Bivector<T>) -> T {
rhs.b() * self.as_inner().b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Bivector<T>>> for Bivector<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Bivector<T>>) -> T {
rhs.as_inner().b() * self.b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Bivector<T>>> for Unit<Bivector<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Bivector<T>>) -> T {
rhs.as_inner().b() * self.as_inner().b()
}
}
impl<T: Float> Antidot<Rotor<T>> for Bivector<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Rotor<T>) -> T {
self.b() * rhs.b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Rotor<T>> for Unit<Bivector<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Rotor<T>) -> T {
rhs.b() * self.as_inner().b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Rotor<T>>> for Bivector<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Rotor<T>>) -> T {
rhs.as_inner().b() * self.b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Rotor<T>>> for Unit<Bivector<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Rotor<T>>) -> T {
rhs.as_inner().b() * self.as_inner().b()
}
}
impl<T: Float> Antidot<Bivector<T>> for Rotor<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Bivector<T>) -> T {
self.b() * rhs.b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Bivector<T>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Bivector<T>) -> T {
rhs.b() * self.as_inner().b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Bivector<T>>> for Rotor<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Bivector<T>>) -> T {
rhs.as_inner().b() * self.b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Bivector<T>>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Bivector<T>>) -> T {
rhs.as_inner().b() * self.as_inner().b()
}
}
impl<T: Float> Antidot<Rotor<T>> for Rotor<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Rotor<T>) -> T {
-(self.s() * rhs.s()) + self.b() * rhs.b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Rotor<T>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Rotor<T>) -> T {
-(rhs.s() * self.as_inner().s()) + rhs.b() * self.as_inner().b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Rotor<T>>> for Rotor<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Rotor<T>>) -> T {
-(rhs.as_inner().s() * self.s()) + rhs.as_inner().b() * self.b()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Rotor<T>>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Rotor<T>>) -> T {
-(rhs.as_inner().s() * self.as_inner().s()) + rhs.as_inner().b() * self.as_inner().b()
}
}
impl<T: Float> Antidot<Scalar<T>> for Rotor<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Scalar<T>) -> T {
-(self.s() * rhs.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Scalar<T>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Scalar<T>) -> T {
-(rhs.s() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Scalar<T>>> for Rotor<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Scalar<T>>) -> T {
-(rhs.as_inner().s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Scalar<T>>> for Unit<Rotor<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Scalar<T>>) -> T {
-(rhs.as_inner().s() * self.as_inner().s())
}
}
impl<T: Float> Antidot<Rotor<T>> for Scalar<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Rotor<T>) -> T {
-(self.s() * rhs.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Rotor<T>> for Unit<Scalar<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Rotor<T>) -> T {
-(rhs.s() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Rotor<T>>> for Scalar<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Rotor<T>>) -> T {
-(rhs.as_inner().s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Rotor<T>>> for Unit<Scalar<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Rotor<T>>) -> T {
-(rhs.as_inner().s() * self.as_inner().s())
}
}
impl<T: Float> Antidot<Scalar<T>> for Scalar<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Scalar<T>) -> T {
-(self.s() * rhs.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Scalar<T>> for Unit<Scalar<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Scalar<T>) -> T {
-(rhs.s() * self.as_inner().s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Scalar<T>>> for Scalar<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Scalar<T>>) -> T {
-(rhs.as_inner().s() * self.s())
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Scalar<T>>> for Unit<Scalar<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Scalar<T>>) -> T {
-(rhs.as_inner().s() * self.as_inner().s())
}
}
impl<T: Float> Antidot<Vector<T>> for Vector<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Vector<T>) -> T {
self.x() * rhs.x() + self.y() * rhs.y()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Vector<T>> for Unit<Vector<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Vector<T>) -> T {
rhs.x() * self.as_inner().x() + rhs.y() * self.as_inner().y()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Vector<T>>> for Vector<T> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Vector<T>>) -> T {
rhs.as_inner().x() * self.x() + rhs.as_inner().y() * self.y()
}
}
#[allow(unused_variables)]
impl<T: Float> Antidot<Unit<Vector<T>>> for Unit<Vector<T>> {
type Scalar = T;
#[inline]
fn antidot(&self, rhs: &Unit<Vector<T>>) -> T {
rhs.as_inner().x() * self.as_inner().x() + rhs.as_inner().y() * self.as_inner().y()
}
}
impl<T: Float> Reverse for Bivector<T> {
#[inline]
fn reverse(&self) -> Self {
Self::new_unchecked(-self.b())
}
}
impl<T: Float> Reverse for Rotor<T> {
#[inline]
fn reverse(&self) -> Self {
Self::new_unchecked(self.s(), -self.b())
}
}
impl<T: Float> Reverse for Scalar<T> {
#[inline]
fn reverse(&self) -> Self {
Self::new_unchecked(self.s())
}
}
impl<T: Float> Reverse for Vector<T> {
#[inline]
fn reverse(&self) -> Self {
Self::new_unchecked(self.x(), self.y())
}
}
impl<T: Float> Antireverse for Bivector<T> {
#[inline]
fn antireverse(&self) -> Self {
Self::new_unchecked(self.b())
}
}
impl<T: Float> Antireverse for Rotor<T> {
#[inline]
fn antireverse(&self) -> Self {
Self::new_unchecked(-self.s(), self.b())
}
}
impl<T: Float> Antireverse for Scalar<T> {
#[inline]
fn antireverse(&self) -> Self {
Self::new_unchecked(-self.s())
}
}
impl<T: Float> Antireverse for Vector<T> {
#[inline]
fn antireverse(&self) -> Self {
Self::new_unchecked(self.x(), self.y())
}
}
impl<T: Float> Involute for Bivector<T> {
#[inline]
fn involute(&self) -> Self {
Self::new_unchecked(-self.b())
}
}
impl<T: Float> Involute for Rotor<T> {
#[inline]
fn involute(&self) -> Self {
Self::new_unchecked(self.s(), -self.b())
}
}
impl<T: Float> Involute for Scalar<T> {
#[inline]
fn involute(&self) -> Self {
Self::new_unchecked(self.s())
}
}
impl<T: Float> Involute for Vector<T> {
#[inline]
fn involute(&self) -> Self {
Self::new_unchecked(self.x(), self.y())
}
}
impl<T: Float> RightComplement for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn right_complement(&self) -> Scalar<T> {
Scalar::new_unchecked(self.b())
}
}
impl<T: Float> RightComplement for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn right_complement(&self) -> Rotor<T> {
Rotor::new_unchecked(self.b(), self.s())
}
}
impl<T: Float> RightComplement for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn right_complement(&self) -> Bivector<T> {
Bivector::new_unchecked(self.s())
}
}
impl<T: Float> RightComplement for Vector<T> {
type Output = Vector<T>;
#[inline]
fn right_complement(&self) -> Vector<T> {
Vector::new_unchecked(-self.y(), self.x())
}
}
impl<T: Float> WeightDual for Bivector<T> {
type Output = Scalar<T>;
#[inline]
fn weight_dual(&self) -> Scalar<T> {
Scalar::new_unchecked(-self.b())
}
}
impl<T: Float> WeightDual for Rotor<T> {
type Output = Rotor<T>;
#[inline]
fn weight_dual(&self) -> Rotor<T> {
Rotor::new_unchecked(-self.b(), -self.s())
}
}
impl<T: Float> WeightDual for Scalar<T> {
type Output = Bivector<T>;
#[inline]
fn weight_dual(&self) -> Bivector<T> {
Bivector::new_unchecked(-self.s())
}
}
impl<T: Float> WeightDual for Vector<T> {
type Output = Vector<T>;
#[inline]
fn weight_dual(&self) -> Vector<T> {
Vector::new_unchecked(self.y(), -self.x())
}
}
impl<T: Float> VersorInverse for Bivector<T> {
fn try_inverse(&self) -> Option<Self> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Self::new_unchecked(-self.b() * inv_norm_sq))
}
}
impl<T: Float> VersorInverse for Rotor<T> {
fn try_inverse(&self) -> Option<Self> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Self::new_unchecked(
self.s() * inv_norm_sq,
-self.b() * inv_norm_sq,
))
}
}
impl<T: Float> VersorInverse for Scalar<T> {
fn try_inverse(&self) -> Option<Self> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Self::new_unchecked(self.s() * inv_norm_sq))
}
}
impl<T: Float> VersorInverse for Vector<T> {
fn try_inverse(&self) -> Option<Self> {
let norm_sq = <Self as crate::norm::Normed>::norm_squared(self);
if norm_sq.abs() < T::epsilon() {
return None;
}
let inv_norm_sq = T::one() / norm_sq;
Some(Self::new_unchecked(
self.x() * inv_norm_sq,
self.y() * inv_norm_sq,
))
}
}
impl<T: Float> crate::norm::Normed for Bivector<T> {
type Scalar = T;
#[inline]
fn norm_squared(&self) -> T {
self.b() * self.b()
}
fn try_normalize(&self) -> Option<Self> {
let n = self.norm();
if n < T::epsilon() {
None
} else {
Some(self.scale(T::one() / n))
}
}
#[inline]
fn scale(&self, factor: T) -> Self {
Self::new_unchecked(self.b() * factor)
}
}
impl<T: Float> crate::norm::Normed for Rotor<T> {
type Scalar = T;
#[inline]
fn norm_squared(&self) -> T {
self.s() * self.s() + self.b() * self.b()
}
fn try_normalize(&self) -> Option<Self> {
let n = self.norm();
if n < T::epsilon() {
None
} else {
Some(self.scale(T::one() / n))
}
}
#[inline]
fn scale(&self, factor: T) -> Self {
Self::new_unchecked(self.s() * factor, self.b() * factor)
}
}
impl<T: Float> crate::norm::Normed for Scalar<T> {
type Scalar = T;
#[inline]
fn norm_squared(&self) -> T {
self.s() * self.s()
}
fn try_normalize(&self) -> Option<Self> {
let n = self.norm();
if n < T::epsilon() {
None
} else {
Some(self.scale(T::one() / n))
}
}
#[inline]
fn scale(&self, factor: T) -> Self {
Self::new_unchecked(self.s() * factor)
}
}
impl<T: Float> crate::norm::Normed for Vector<T> {
type Scalar = T;
#[inline]
fn norm_squared(&self) -> T {
self.x() * self.x() + self.y() * self.y()
}
fn try_normalize(&self) -> Option<Self> {
let n = self.norm();
if n < T::epsilon() {
None
} else {
Some(self.scale(T::one() / n))
}
}
#[inline]
fn scale(&self, factor: T) -> Self {
Self::new_unchecked(self.x() * factor, self.y() * factor)
}
}
impl<T: Float + AbsDiffEq<Epsilon = T>> AbsDiffEq for Bivector<T> {
type Epsilon = T;
fn default_epsilon() -> Self::Epsilon {
T::default_epsilon()
}
fn abs_diff_eq(&self, other: &Self, epsilon: Self::Epsilon) -> bool {
self.b().abs_diff_eq(&other.b(), epsilon)
}
}
impl<T: Float + RelativeEq<Epsilon = T>> RelativeEq for Bivector<T> {
fn default_max_relative() -> Self::Epsilon {
T::default_max_relative()
}
fn relative_eq(
&self,
other: &Self,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon,
) -> bool {
self.b().relative_eq(&other.b(), epsilon, max_relative)
}
}
impl<T: Float + UlpsEq<Epsilon = T>> UlpsEq for Bivector<T> {
fn default_max_ulps() -> u32 {
T::default_max_ulps()
}
fn ulps_eq(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool {
self.b().ulps_eq(&other.b(), epsilon, max_ulps)
}
}
impl<T: Float + AbsDiffEq<Epsilon = T>> AbsDiffEq for Rotor<T> {
type Epsilon = T;
fn default_epsilon() -> Self::Epsilon {
T::default_epsilon()
}
fn abs_diff_eq(&self, other: &Self, epsilon: Self::Epsilon) -> bool {
self.s().abs_diff_eq(&other.s(), epsilon) && self.b().abs_diff_eq(&other.b(), epsilon)
}
}
impl<T: Float + RelativeEq<Epsilon = T>> RelativeEq for Rotor<T> {
fn default_max_relative() -> Self::Epsilon {
T::default_max_relative()
}
fn relative_eq(
&self,
other: &Self,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon,
) -> bool {
self.s().relative_eq(&other.s(), epsilon, max_relative)
&& self.b().relative_eq(&other.b(), epsilon, max_relative)
}
}
impl<T: Float + UlpsEq<Epsilon = T>> UlpsEq for Rotor<T> {
fn default_max_ulps() -> u32 {
T::default_max_ulps()
}
fn ulps_eq(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool {
self.s().ulps_eq(&other.s(), epsilon, max_ulps)
&& self.b().ulps_eq(&other.b(), epsilon, max_ulps)
}
}
impl<T: Float + AbsDiffEq<Epsilon = T>> AbsDiffEq for Scalar<T> {
type Epsilon = T;
fn default_epsilon() -> Self::Epsilon {
T::default_epsilon()
}
fn abs_diff_eq(&self, other: &Self, epsilon: Self::Epsilon) -> bool {
self.s().abs_diff_eq(&other.s(), epsilon)
}
}
impl<T: Float + RelativeEq<Epsilon = T>> RelativeEq for Scalar<T> {
fn default_max_relative() -> Self::Epsilon {
T::default_max_relative()
}
fn relative_eq(
&self,
other: &Self,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon,
) -> bool {
self.s().relative_eq(&other.s(), epsilon, max_relative)
}
}
impl<T: Float + UlpsEq<Epsilon = T>> UlpsEq for Scalar<T> {
fn default_max_ulps() -> u32 {
T::default_max_ulps()
}
fn ulps_eq(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool {
self.s().ulps_eq(&other.s(), epsilon, max_ulps)
}
}
impl<T: Float + AbsDiffEq<Epsilon = T>> AbsDiffEq for Vector<T> {
type Epsilon = T;
fn default_epsilon() -> Self::Epsilon {
T::default_epsilon()
}
fn abs_diff_eq(&self, other: &Self, epsilon: Self::Epsilon) -> bool {
self.x().abs_diff_eq(&other.x(), epsilon) && self.y().abs_diff_eq(&other.y(), epsilon)
}
}
impl<T: Float + RelativeEq<Epsilon = T>> RelativeEq for Vector<T> {
fn default_max_relative() -> Self::Epsilon {
T::default_max_relative()
}
fn relative_eq(
&self,
other: &Self,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon,
) -> bool {
self.x().relative_eq(&other.x(), epsilon, max_relative)
&& self.y().relative_eq(&other.y(), epsilon, max_relative)
}
}
impl<T: Float + UlpsEq<Epsilon = T>> UlpsEq for Vector<T> {
fn default_max_ulps() -> u32 {
T::default_max_ulps()
}
fn ulps_eq(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool {
self.x().ulps_eq(&other.x(), epsilon, max_ulps)
&& self.y().ulps_eq(&other.y(), epsilon, max_ulps)
}
}
#[cfg(any(test, feature = "proptest-support"))]
#[allow(clippy::missing_docs_in_private_items)]
mod arbitrary_impls {
use super::*;
use proptest::prelude::*;
use proptest::strategy::BoxedStrategy;
use std::fmt::Debug;
impl<T: Float + Debug + 'static> Arbitrary for Bivector<T> {
type Parameters = ();
type Strategy = BoxedStrategy<Self>;
fn arbitrary_with(_: Self::Parameters) -> Self::Strategy {
(-100.0f64..100.0)
.prop_map(|x0| Bivector::new_unchecked(T::from_f64(x0)))
.boxed()
}
}
impl<T: Float + Debug + 'static> Arbitrary for Rotor<T> {
type Parameters = ();
type Strategy = BoxedStrategy<Self>;
fn arbitrary_with(_: Self::Parameters) -> Self::Strategy {
(-100.0f64..100.0, -100.0f64..100.0)
.prop_map(|(x0, x1)| Rotor::new_unchecked(T::from_f64(x0), T::from_f64(x1)))
.boxed()
}
}
impl<T: Float + Debug + 'static> Arbitrary for Scalar<T> {
type Parameters = ();
type Strategy = BoxedStrategy<Self>;
fn arbitrary_with(_: Self::Parameters) -> Self::Strategy {
(-100.0f64..100.0)
.prop_map(|x0| Scalar::new_unchecked(T::from_f64(x0)))
.boxed()
}
}
impl<T: Float + Debug + 'static> Arbitrary for Vector<T> {
type Parameters = ();
type Strategy = BoxedStrategy<Self>;
fn arbitrary_with(_: Self::Parameters) -> Self::Strategy {
(-100.0f64..100.0, -100.0f64..100.0)
.prop_map(|(x0, x1)| Vector::new_unchecked(T::from_f64(x0), T::from_f64(x1)))
.boxed()
}
}
}
#[cfg(test)]
#[allow(clippy::missing_docs_in_private_items)]
mod verification_tests {
use super::*;
use crate::algebra::Multivector;
#[allow(unused_imports)]
use crate::norm::{DegenerateNormed, Normed};
use crate::signature::Euclidean2;
#[allow(unused_imports)]
use crate::wrappers::Unit;
use approx::relative_eq;
use proptest::prelude::*;
const REL_EPSILON: f64 = 1e-10;
proptest! {
#[test]
fn bivector_add_matches_multivector(a in any::<Bivector<f64>>(), b in any::<Bivector<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result = a + b;
let generic_result = mv_a + mv_b;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Add mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
#[test]
fn bivector_sub_matches_multivector(a in any::<Bivector<f64>>(), b in any::<Bivector<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result = a - b;
let generic_result = mv_a - mv_b;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Sub mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
#[test]
fn bivector_neg_matches_multivector(a in any::<Bivector<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let specialized_result = -a;
let generic_result = -mv_a;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Neg mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn rotor_add_matches_multivector(a in any::<Rotor<f64>>(), b in any::<Rotor<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result = a + b;
let generic_result = mv_a + mv_b;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Add mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
#[test]
fn rotor_sub_matches_multivector(a in any::<Rotor<f64>>(), b in any::<Rotor<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result = a - b;
let generic_result = mv_a - mv_b;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Sub mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
#[test]
fn rotor_neg_matches_multivector(a in any::<Rotor<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let specialized_result = -a;
let generic_result = -mv_a;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Neg mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn scalar_add_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Scalar<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result = a + b;
let generic_result = mv_a + mv_b;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Add mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
#[test]
fn scalar_sub_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Scalar<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result = a - b;
let generic_result = mv_a - mv_b;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Sub mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
#[test]
fn scalar_neg_matches_multivector(a in any::<Scalar<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let specialized_result = -a;
let generic_result = -mv_a;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Neg mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn vector_add_matches_multivector(a in any::<Vector<f64>>(), b in any::<Vector<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result = a + b;
let generic_result = mv_a + mv_b;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Add mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
#[test]
fn vector_sub_matches_multivector(a in any::<Vector<f64>>(), b in any::<Vector<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result = a - b;
let generic_result = mv_a - mv_b;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Sub mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
#[test]
fn vector_neg_matches_multivector(a in any::<Vector<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let specialized_result = -a;
let generic_result = -mv_a;
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Neg mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn wedge_bivector_scalar_bivector_matches_multivector(a in any::<Bivector<f64>>(), b in any::<Scalar<f64>>()) {
use crate::ops::Wedge;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Bivector<f64> = a.wedge(&b);
let generic_result = mv_a.exterior(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wedge product mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn wedge_scalar_bivector_bivector_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Bivector<f64>>()) {
use crate::ops::Wedge;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Bivector<f64> = a.wedge(&b);
let generic_result = mv_a.exterior(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wedge product mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn wedge_scalar_scalar_scalar_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Scalar<f64>>()) {
use crate::ops::Wedge;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Scalar<f64> = a.wedge(&b);
let generic_result = mv_a.exterior(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wedge product mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn wedge_scalar_vector_vector_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Vector<f64>>()) {
use crate::ops::Wedge;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Vector<f64> = a.wedge(&b);
let generic_result = mv_a.exterior(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wedge product mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn wedge_vector_scalar_vector_matches_multivector(a in any::<Vector<f64>>(), b in any::<Scalar<f64>>()) {
use crate::ops::Wedge;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Vector<f64> = a.wedge(&b);
let generic_result = mv_a.exterior(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wedge product mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn wedge_vector_vector_bivector_matches_multivector(a in any::<Vector<f64>>(), b in any::<Vector<f64>>()) {
use crate::ops::Wedge;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Bivector<f64> = a.wedge(&b);
let generic_result = mv_a.exterior(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wedge product mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_contraction_bivector_bivector_scalar_matches_multivector(a in any::<Bivector<f64>>(), b in any::<Bivector<f64>>()) {
use crate::ops::BulkContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Scalar<f64> = a.bulk_contract(&b);
let generic_result = mv_a.bulk_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_contraction_bivector_scalar_bivector_matches_multivector(a in any::<Bivector<f64>>(), b in any::<Scalar<f64>>()) {
use crate::ops::BulkContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Bivector<f64> = a.bulk_contract(&b);
let generic_result = mv_a.bulk_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_contraction_bivector_vector_vector_matches_multivector(a in any::<Bivector<f64>>(), b in any::<Vector<f64>>()) {
use crate::ops::BulkContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Vector<f64> = a.bulk_contract(&b);
let generic_result = mv_a.bulk_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_contraction_scalar_scalar_scalar_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Scalar<f64>>()) {
use crate::ops::BulkContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Scalar<f64> = a.bulk_contract(&b);
let generic_result = mv_a.bulk_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_contraction_vector_scalar_vector_matches_multivector(a in any::<Vector<f64>>(), b in any::<Scalar<f64>>()) {
use crate::ops::BulkContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Vector<f64> = a.bulk_contract(&b);
let generic_result = mv_a.bulk_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_contraction_vector_vector_scalar_matches_multivector(a in any::<Vector<f64>>(), b in any::<Vector<f64>>()) {
use crate::ops::BulkContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Scalar<f64> = a.bulk_contract(&b);
let generic_result = mv_a.bulk_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_contraction_bivector_bivector_scalar_matches_multivector(a in any::<Bivector<f64>>(), b in any::<Bivector<f64>>()) {
use crate::ops::WeightContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Scalar<f64> = a.weight_contract(&b);
let generic_result = mv_a.weight_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_contraction_bivector_scalar_bivector_matches_multivector(a in any::<Bivector<f64>>(), b in any::<Scalar<f64>>()) {
use crate::ops::WeightContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Bivector<f64> = a.weight_contract(&b);
let generic_result = mv_a.weight_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_contraction_bivector_vector_vector_matches_multivector(a in any::<Bivector<f64>>(), b in any::<Vector<f64>>()) {
use crate::ops::WeightContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Vector<f64> = a.weight_contract(&b);
let generic_result = mv_a.weight_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_contraction_scalar_scalar_scalar_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Scalar<f64>>()) {
use crate::ops::WeightContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Scalar<f64> = a.weight_contract(&b);
let generic_result = mv_a.weight_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_contraction_vector_scalar_vector_matches_multivector(a in any::<Vector<f64>>(), b in any::<Scalar<f64>>()) {
use crate::ops::WeightContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Vector<f64> = a.weight_contract(&b);
let generic_result = mv_a.weight_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_contraction_vector_vector_scalar_matches_multivector(a in any::<Vector<f64>>(), b in any::<Vector<f64>>()) {
use crate::ops::WeightContract;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Scalar<f64> = a.weight_contract(&b);
let generic_result = mv_a.weight_contraction(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight contraction mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_expansion_bivector_bivector_bivector_matches_multivector(a in any::<Bivector<f64>>(), b in any::<Bivector<f64>>()) {
use crate::ops::BulkExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Bivector<f64> = a.bulk_expand(&b);
let generic_result = mv_a.bulk_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_expansion_scalar_bivector_scalar_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Bivector<f64>>()) {
use crate::ops::BulkExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Scalar<f64> = a.bulk_expand(&b);
let generic_result = mv_a.bulk_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_expansion_scalar_scalar_bivector_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Scalar<f64>>()) {
use crate::ops::BulkExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Bivector<f64> = a.bulk_expand(&b);
let generic_result = mv_a.bulk_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_expansion_scalar_vector_vector_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Vector<f64>>()) {
use crate::ops::BulkExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Vector<f64> = a.bulk_expand(&b);
let generic_result = mv_a.bulk_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_expansion_vector_bivector_vector_matches_multivector(a in any::<Vector<f64>>(), b in any::<Bivector<f64>>()) {
use crate::ops::BulkExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Vector<f64> = a.bulk_expand(&b);
let generic_result = mv_a.bulk_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn bulk_expansion_vector_vector_bivector_matches_multivector(a in any::<Vector<f64>>(), b in any::<Vector<f64>>()) {
use crate::ops::BulkExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Bivector<f64> = a.bulk_expand(&b);
let generic_result = mv_a.bulk_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Bulk expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_expansion_bivector_bivector_bivector_matches_multivector(a in any::<Bivector<f64>>(), b in any::<Bivector<f64>>()) {
use crate::ops::WeightExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Bivector<f64> = a.weight_expand(&b);
let generic_result = mv_a.weight_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_expansion_scalar_bivector_scalar_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Bivector<f64>>()) {
use crate::ops::WeightExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Scalar<f64> = a.weight_expand(&b);
let generic_result = mv_a.weight_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_expansion_scalar_scalar_bivector_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Scalar<f64>>()) {
use crate::ops::WeightExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Bivector<f64> = a.weight_expand(&b);
let generic_result = mv_a.weight_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_expansion_scalar_vector_vector_matches_multivector(a in any::<Scalar<f64>>(), b in any::<Vector<f64>>()) {
use crate::ops::WeightExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Vector<f64> = a.weight_expand(&b);
let generic_result = mv_a.weight_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_expansion_vector_bivector_vector_matches_multivector(a in any::<Vector<f64>>(), b in any::<Bivector<f64>>()) {
use crate::ops::WeightExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Vector<f64> = a.weight_expand(&b);
let generic_result = mv_a.weight_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn weight_expansion_vector_vector_bivector_matches_multivector(a in any::<Vector<f64>>(), b in any::<Vector<f64>>()) {
use crate::ops::WeightExpand;
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let specialized_result: Bivector<f64> = a.weight_expand(&b);
let generic_result = mv_a.weight_expansion(&mv_b);
let specialized_mv: Multivector<f64, Euclidean2> = specialized_result.into();
prop_assert!(
relative_eq!(specialized_mv, generic_result, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Weight expansion mismatch: specialized={:?}, generic={:?}",
specialized_mv, generic_result
);
}
}
proptest! {
#[test]
fn de_morgan_geometric_bivector(a in any::<Bivector<f64>>(), b in any::<Bivector<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let lhs = (mv_a * mv_b).complement();
let rhs = mv_a.complement().antiproduct(&mv_b.complement());
prop_assert!(
relative_eq!(lhs, rhs, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"De Morgan (geometric) failed: complement(a*b)={:?}, complement(a)⋇complement(b)={:?}",
lhs, rhs
);
}
#[test]
fn de_morgan_antiproduct_bivector(a in any::<Bivector<f64>>(), b in any::<Bivector<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let lhs = mv_a.antiproduct(&mv_b).complement();
let rhs = mv_a.complement() * mv_b.complement();
prop_assert!(
relative_eq!(lhs, rhs, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"De Morgan (antiproduct) failed: complement(a⋇b)={:?}, complement(a)*complement(b)={:?}",
lhs, rhs
);
}
}
proptest! {
#[test]
fn de_morgan_geometric_scalar(a in any::<Scalar<f64>>(), b in any::<Scalar<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let lhs = (mv_a * mv_b).complement();
let rhs = mv_a.complement().antiproduct(&mv_b.complement());
prop_assert!(
relative_eq!(lhs, rhs, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"De Morgan (geometric) failed: complement(a*b)={:?}, complement(a)⋇complement(b)={:?}",
lhs, rhs
);
}
#[test]
fn de_morgan_antiproduct_scalar(a in any::<Scalar<f64>>(), b in any::<Scalar<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let lhs = mv_a.antiproduct(&mv_b).complement();
let rhs = mv_a.complement() * mv_b.complement();
prop_assert!(
relative_eq!(lhs, rhs, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"De Morgan (antiproduct) failed: complement(a⋇b)={:?}, complement(a)*complement(b)={:?}",
lhs, rhs
);
}
}
proptest! {
#[test]
fn de_morgan_geometric_vector(a in any::<Vector<f64>>(), b in any::<Vector<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let lhs = (mv_a * mv_b).complement();
let rhs = mv_a.complement().antiproduct(&mv_b.complement());
prop_assert!(
relative_eq!(lhs, rhs, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"De Morgan (geometric) failed: complement(a*b)={:?}, complement(a)⋇complement(b)={:?}",
lhs, rhs
);
}
#[test]
fn de_morgan_antiproduct_vector(a in any::<Vector<f64>>(), b in any::<Vector<f64>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = b.into();
let lhs = mv_a.antiproduct(&mv_b).complement();
let rhs = mv_a.complement() * mv_b.complement();
prop_assert!(
relative_eq!(lhs, rhs, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"De Morgan (antiproduct) failed: complement(a⋇b)={:?}, complement(a)*complement(b)={:?}",
lhs, rhs
);
}
}
proptest! {
#[test]
fn project_idempotent_bivector_vector(a in any::<Bivector<f64>>(), unit_b in any::<Unit<Vector<f64>>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = unit_b.into_inner().into();
let first = mv_a.project(&mv_b);
let second = first.project(&mv_b);
prop_assert!(
relative_eq!(first, second, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Project idempotency failed: first={:?}, second={:?}",
first, second
);
}
}
proptest! {
#[test]
fn antiproject_idempotent_vector_bivector(a in any::<Vector<f64>>(), unit_b in any::<Unit<Bivector<f64>>>()) {
let mv_a: Multivector<f64, Euclidean2> = a.into();
let mv_b: Multivector<f64, Euclidean2> = unit_b.into_inner().into();
let first = mv_a.antiproject(&mv_b);
let second = first.antiproject(&mv_b);
prop_assert!(
relative_eq!(first, second, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Antiproject idempotency failed: first={:?}, second={:?}",
first, second
);
}
}
proptest! {
#[test]
fn unit_bivector_norm_matches_inner(u in any::<Unit<Bivector<f64>>>()) {
let inner_norm = <Bivector<f64> as Normed>::norm(u.as_inner());
let wrapper_norm = <Unit<Bivector<f64>> as Normed>::norm(&u);
prop_assert!(
relative_eq!(inner_norm, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Inner norm should be 1.0, got {}", inner_norm
);
prop_assert!(
relative_eq!(wrapper_norm, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wrapper norm should be 1.0, got {}", wrapper_norm
);
prop_assert!(
relative_eq!(inner_norm, wrapper_norm, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Norms should match: {} vs {}", inner_norm, wrapper_norm
);
}
#[test]
fn unit_bivector_norm_squared_matches_inner(u in any::<Unit<Bivector<f64>>>()) {
let inner_ns = <Bivector<f64> as Normed>::norm_squared(u.as_inner());
let wrapper_ns = <Unit<Bivector<f64>> as Normed>::norm_squared(&u);
prop_assert!(
relative_eq!(inner_ns, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Inner norm_squared should be 1.0, got {}", inner_ns
);
prop_assert!(
relative_eq!(wrapper_ns, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wrapper norm_squared should be 1.0, got {}", wrapper_ns
);
}
}
proptest! {
#[test]
fn unit_rotor_norm_matches_inner(u in any::<Unit<Rotor<f64>>>()) {
let inner_norm = <Rotor<f64> as Normed>::norm(u.as_inner());
let wrapper_norm = <Unit<Rotor<f64>> as Normed>::norm(&u);
prop_assert!(
relative_eq!(inner_norm, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Inner norm should be 1.0, got {}", inner_norm
);
prop_assert!(
relative_eq!(wrapper_norm, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wrapper norm should be 1.0, got {}", wrapper_norm
);
prop_assert!(
relative_eq!(inner_norm, wrapper_norm, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Norms should match: {} vs {}", inner_norm, wrapper_norm
);
}
#[test]
fn unit_rotor_norm_squared_matches_inner(u in any::<Unit<Rotor<f64>>>()) {
let inner_ns = <Rotor<f64> as Normed>::norm_squared(u.as_inner());
let wrapper_ns = <Unit<Rotor<f64>> as Normed>::norm_squared(&u);
prop_assert!(
relative_eq!(inner_ns, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Inner norm_squared should be 1.0, got {}", inner_ns
);
prop_assert!(
relative_eq!(wrapper_ns, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wrapper norm_squared should be 1.0, got {}", wrapper_ns
);
}
}
proptest! {
#[test]
fn unit_scalar_norm_matches_inner(u in any::<Unit<Scalar<f64>>>()) {
let inner_norm = <Scalar<f64> as Normed>::norm(u.as_inner());
let wrapper_norm = <Unit<Scalar<f64>> as Normed>::norm(&u);
prop_assert!(
relative_eq!(inner_norm, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Inner norm should be 1.0, got {}", inner_norm
);
prop_assert!(
relative_eq!(wrapper_norm, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wrapper norm should be 1.0, got {}", wrapper_norm
);
prop_assert!(
relative_eq!(inner_norm, wrapper_norm, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Norms should match: {} vs {}", inner_norm, wrapper_norm
);
}
#[test]
fn unit_scalar_norm_squared_matches_inner(u in any::<Unit<Scalar<f64>>>()) {
let inner_ns = <Scalar<f64> as Normed>::norm_squared(u.as_inner());
let wrapper_ns = <Unit<Scalar<f64>> as Normed>::norm_squared(&u);
prop_assert!(
relative_eq!(inner_ns, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Inner norm_squared should be 1.0, got {}", inner_ns
);
prop_assert!(
relative_eq!(wrapper_ns, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wrapper norm_squared should be 1.0, got {}", wrapper_ns
);
}
}
proptest! {
#[test]
fn unit_vector_norm_matches_inner(u in any::<Unit<Vector<f64>>>()) {
let inner_norm = <Vector<f64> as Normed>::norm(u.as_inner());
let wrapper_norm = <Unit<Vector<f64>> as Normed>::norm(&u);
prop_assert!(
relative_eq!(inner_norm, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Inner norm should be 1.0, got {}", inner_norm
);
prop_assert!(
relative_eq!(wrapper_norm, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wrapper norm should be 1.0, got {}", wrapper_norm
);
prop_assert!(
relative_eq!(inner_norm, wrapper_norm, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Norms should match: {} vs {}", inner_norm, wrapper_norm
);
}
#[test]
fn unit_vector_norm_squared_matches_inner(u in any::<Unit<Vector<f64>>>()) {
let inner_ns = <Vector<f64> as Normed>::norm_squared(u.as_inner());
let wrapper_ns = <Unit<Vector<f64>> as Normed>::norm_squared(&u);
prop_assert!(
relative_eq!(inner_ns, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Inner norm_squared should be 1.0, got {}", inner_ns
);
prop_assert!(
relative_eq!(wrapper_ns, 1.0, epsilon = REL_EPSILON, max_relative = REL_EPSILON),
"Wrapper norm_squared should be 1.0, got {}", wrapper_ns
);
}
}
}