Struct Bivector 

pub struct Bivector<const P: usize, const Q: usize, const R: usize> {
    pub mv: Multivector<P, Q, R>,
}

Bivector type - wrapper around Multivector with only grade 2

Fields

mv: Multivector<P, Q, R>

Implementations

impl<const P: usize, const Q: usize, const R: usize> Bivector<P, Q, R>

pub fn from_components(xy: f64, xz: f64, yz: f64) -> Bivector<P, Q, R>

pub fn e12() -> Bivector<P, Q, R>

pub fn e13() -> Bivector<P, Q, R>

pub fn e23() -> Bivector<P, Q, R>

pub fn from_multivector(mv: &Multivector<P, Q, R>) -> Bivector<P, Q, R>

pub fn geometric_product(&self, other: &Vector<P, Q, R>) -> Multivector<P, Q, R>

pub fn geometric_product_with_bivector( &self, other: &Bivector<P, Q, R>, ) -> Multivector<P, Q, R>

Geometric product with another bivector

pub fn magnitude(&self) -> f64

pub fn get(&self, index: usize) -> f64

Index access for bivector components

pub fn inner_product(&self, other: &Bivector<P, Q, R>) -> Multivector<P, Q, R>

Inner product with another bivector

pub fn inner_product_with_vector( &self, other: &Vector<P, Q, R>, ) -> Multivector<P, Q, R>

Inner product with a vector

pub fn outer_product(&self, other: &Bivector<P, Q, R>) -> Multivector<P, Q, R>

Outer product with another bivector

pub fn outer_product_with_vector( &self, other: &Vector<P, Q, R>, ) -> Multivector<P, Q, R>

Outer product with a vector

pub fn right_contraction(&self, other: &Vector<P, Q, R>) -> Multivector<P, Q, R>

Right contraction with vector

Trait Implementations

impl<const P: usize, const Q: usize, const R: usize> Clone for Bivector<P, Q, R>

fn clone(&self) -> Bivector<P, Q, R>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<const P: usize, const Q: usize, const R: usize> Debug for Bivector<P, Q, R>

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<const P: usize, const Q: usize, const R: usize> Index<usize> for Bivector<P, Q, R>

type Output = f64

The returned type after indexing.

fn index(&self, index: usize) -> &<Bivector<P, Q, R> as Index<usize>>::Output

Performs the indexing (container[index]) operation.

impl<const P: usize, const Q: usize, const R: usize> PartialEq for Bivector<P, Q, R>

fn eq(&self, other: &Bivector<P, Q, R>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const P: usize, const Q: usize, const R: usize> StructuralPartialEq for Bivector<P, Q, R>