Struct AffineP 

pub struct AffineP {
    pub p: u64,
    pub n: usize,
    pub matrix: Vec<Vec<u64>>,
    pub translation: Vec<u64>,
}

An affine map of GF(p)ⁿ: x ↦ A x + b. matrix[i][j] is A’s entry, translation is b; both reduced mod p. A bijection iff A ∈ GL(n,p).

Fields

p: u64

n: usize

matrix: Vec<Vec<u64>>

translation: Vec<u64>

Implementations

impl AffineP

pub fn identity(n: usize, p: u64) -> Self

The identity x ↦ x.

pub fn apply(&self, x: &[u64]) -> Vec<u64>

Apply: output i is (Σⱼ A[i][j]·x[j] + b[i]) mod p.

pub fn compose(&self, other: &AffineP) -> AffineP

Composition self ∘ other over GF(p): linear parts multiply, b ↦ A_self·b_other + b_self.

pub fn is_bijection(&self) -> bool

Whether the linear part is invertible over GF(p) (so the map is a bijection of the cube).

pub fn is_monomial(&self) -> bool

Whether the linear part is monomial — one nonzero entry per row and per column (a scaled permutation). These are exactly the Bₙ-analog over GF(p); everything else is a genuine shear.

Trait Implementations

impl Clone for AffineP

fn clone(&self) -> AffineP

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AffineP

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

Formats the value using the given formatter.

impl PartialEq for AffineP

fn eq(&self, other: &AffineP) -> 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 Eq for AffineP

impl StructuralPartialEq for AffineP