Struct ConstraintDeriver 

pub struct ConstraintDeriver<'a> { /* private fields */ }

Derives constraint expressions from algebra structure.

Implementations

impl<'a> ConstraintDeriver<'a>

pub fn new(algebra: &'a Algebra, involution: InvolutionKind) -> Self

Creates a new constraint deriver with the specified involution.

pub fn derive_geometric_constraint( &self, ty: &TypeSpec, field_prefix: &str, ) -> Option<DerivedConstraint>

Derives the geometric constraint for a type.

Computes u * involution(u) symbolically and returns the non-scalar terms that must equal zero. The involution used is determined by the algebra’s configuration (reverse, grade involution, or Clifford conjugate).

Returns

• Some(constraint) if the type has non-trivial constraints
• None if u * reverse(u) is purely scalar (no constraints needed)

pub fn derive_antiproduct_constraint( &self, ty: &TypeSpec, field_prefix: &str, ) -> Option<DerivedConstraint>

Derives the antiproduct constraint for a type.

Computes u ⊟ antireverse(u) symbolically and returns the non-pseudoscalar terms that must equal zero.

The antiproduct is defined as: a ⊟ b = dual(dual(a) * dual(b)) where dual(x) = x * I⁻¹ (right complement with pseudoscalar).

Returns

• Some(constraint) if the type has non-trivial antiproduct constraints
• None if u ⊟ antireverse(u) is purely pseudoscalar (no constraints needed)

pub fn derive_all_constraints( &self, ty: &TypeSpec, field_prefix: &str, ) -> Option<DerivedConstraint>

Derives all constraints for a type (both geometric and antiproduct).

Returns the combined set of constraint expressions that must equal zero. Symbolically equivalent expressions are deduplicated using Symbolica.

pub fn derive_norm_squared(&self, ty: &TypeSpec, field_prefix: &str) -> Atom

Derives the scalar norm expression (scalar part of u * reverse(u)).

This is useful for generating norm_squared() implementations.

pub fn derive_antinorm_squared(&self, ty: &TypeSpec, field_prefix: &str) -> Atom

Derives the antiscalar norm expression (pseudoscalar part of u ⊟ antireverse(u)).

This is useful for generating weight norm implementations in PGA.

pub fn derive_weight_norm_squared( &self, ty: &TypeSpec, field_prefix: &str, ) -> Atom

Derives the weight norm squared expression for PGA types.

In PGA, the weight norm is the degenerate part of the element. For points, this is the w coordinate. For planes, it’s the d coefficient. The weight norm squared is the sum of squares of all weight (degenerate) fields.

Weight fields are those whose blade contains the degenerate basis vector (e0).

pub fn derive_bulk_norm_squared( &self, ty: &TypeSpec, field_prefix: &str, ) -> Atom

Derives the bulk norm squared expression for PGA types.

In PGA, the bulk norm is the non-degenerate part of the element. The bulk norm squared is the sum of squares of all bulk (non-degenerate) fields.

Bulk fields are those whose blade does NOT contain the degenerate basis vector (e0).

pub fn derive_weight_components( &self, ty: &TypeSpec, field_prefix: &str, ) -> Vec<Atom>

Derives individual weight component expressions for the Ideal wrapper.

For Ideal elements (elements at infinity in PGA), all weight components must be zero. This returns a list of the symbolic expressions for each weight field, which can be used as constraints in Groebner simplification.