Struct LinearTransformationLayout 

pub struct LinearTransformationLayout {
    pub indexes: Vec<i64>,
    pub slots: usize,
    pub strategy: LinearTransformationStrategy,
}

Scheme-agnostic specification of a linear transformation.

Carries only the integer-level information needed to derive the BSGS schedule: the non-zero diagonal indexes, the slot count, and the schedule-selection strategy.

Fields

indexes: Vec<i64>

Non-zero diagonal indexes of the matrix.

slots: usize

Number of slots (typically n / 2 for a CKKS plaintext over C^{n/2}).

strategy: LinearTransformationStrategy

Strategy used to pick the BSGS schedule.

Implementations

impl LinearTransformationLayout

pub fn index(&self) -> LinearTransformationPlan

Returns the BSGS index schedule implied by this layout.

pub fn plan(&self, giant_step: usize) -> LinearTransformationPlan

Returns the BSGS schedule for an explicit giant_step, ignoring strategy.

pub fn baby_steps(&self) -> Vec<i64>

Distinct baby-step rotations (k) used by the schedule.

This is the set of rotations the prepared baby cache must hold; pass it to LinearTransformationBabySteps::alloc to size the cache up-front.

pub fn galois_elements(&self, cyclotomic_order: i64) -> Vec<i64>

Galois elements required for all non-zero baby- and giant-step rotations.

Trait Implementations

impl Clone for LinearTransformationLayout

fn clone(&self) -> LinearTransformationLayout

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LinearTransformationLayout

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

Formats the value using the given formatter.

impl Eq for LinearTransformationLayout

impl PartialEq for LinearTransformationLayout

fn eq(&self, other: &LinearTransformationLayout) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for LinearTransformationLayout