Struct PatternedOrder2 

pub struct PatternedOrder2<P, const K: usize, const H: usize> { /* private fields */ }

Exact order-two jet with a dense gradient and a compile-time patterned upper-triangle Hessian.

This carries 1 + K + H scalars instead of 1 + K + K². Its arithmetic is the same Leibniz/Faà-di-Bruno algebra as Order2, evaluated only for the Hessian pairs declared by P. A family row NLL remains written once over JetScalar; the pattern is an execution schedule, not a second derivative formula.

Implementations

impl<P, const K: usize, const H: usize> PatternedOrder2<P, K, H>

where P: HessianPattern<K, H>,

pub fn g(&self) -> [f64; K]

pub fn h(&self) -> [[f64; K]; K]

Expand the patterned upper triangle into the dense symmetric shape required by the existing RowKernel interface. Missing pairs are exact structural zeros.

Trait Implementations

impl<P, const K: usize, const H: usize> Clone for PatternedOrder2<P, K, H>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P, const K: usize, const H: usize> Copy for PatternedOrder2<P, K, H>

impl<P: Debug, const K: usize, const H: usize> Debug for PatternedOrder2<P, K, H>

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

Formats the value using the given formatter.

impl<P, const K: usize, const H: usize> JetField for PatternedOrder2<P, K, H>

where P: HessianPattern<K, H>,

fn value(&self) -> f64

The real value channel (recurses through any nesting to the f64 leaf).

fn add(&self, other: &Self) -> Self

fn sub(&self, other: &Self) -> Self

fn mul(&self, other: &Self) -> Self

fn neg(&self) -> Self

fn scale(&self, scale: f64) -> Self

Multiply every channel by a plain f64.

fn compose_unary(&self, derivatives: [f64; 5]) -> Self

Faà di Bruno composition f ∘ self given the OUTER real function’s derivative stack d = [f(u), f′(u), f″(u), f‴(u), f⁗(u)] evaluated at u = self.value() — the identical [f64; 5] stack shape crate::jet_tower::Tower4::compose_unary consumes.

impl<P, const K: usize, const H: usize> JetScalar<K> for PatternedOrder2<P, K, H>

where P: HessianPattern<K, H>,

fn constant(c: f64) -> Self

A constant: value c, every derivative channel zero.

fn variable(x: f64, axis: usize) -> Self

The seeded variable p_axis at value x: unit first derivative in slot axis, all higher channels zero. (The nilpotent / cross channels of the directional scalars are seeded zero — callers set ε/δ directions through the scalar-specific OneSeed::seed_direction / TwoSeed::seed.)

fn symmetric_quadratic_form<C: SymmetricQuadraticCoefficients>( inputs: &[Self], coefficients: &C, ) -> Self

Evaluate inputs' A inputs from one universal semantic primitive. Order-specific scalars may lower the mechanically derived channels directly; the default is the exact scalar program over mul/add/scale.

fn linear_combination(inputs: &[Self], weights: &[f64]) -> Self

Evaluate sum_i weights[i] * inputs[i] in one semantic primitive.

fn add_constant(&self, constant: f64) -> Self

Add a primal constant without changing derivative channels.

fn multiply_add(&self, right: &Self, addend: &Self) -> Self

Evaluate self * right + addend in one semantic primitive.

fn composed_sum(inputs: &[Self], derivative_stacks: &[[f64; 5]]) -> Self

Sum unary compositions directly from certified derivative stacks.

fn product(&self, right: &Self) -> Self

Exact product as an explicit compiled graph node.

fn affine_compose( &self, input_scale: f64, input_shift: f64, derivative_stack: [f64; 5], ) -> Self

Compose a certified outer stack after the affine map u = input_scale * self + input_shift.

fn affine_composed_sum( inputs: &[Self], input_scales: &[f64], derivative_stacks: &[[f64; 5]], ) -> Self

Sum unary compositions whose inputs each carry an affine scale.

fn shared_multiply_add_affine_composed_sum<const N: usize>( lefts: &[&Self; N], right: &Self, addend: &Self, addend_scales: &[f64; N], input_scales: &[f64; N], derivative_stacks: &[[f64; 5]; N], ) -> Self

Evaluate Σ_i f_i(input_scale_i · (left_i · right + addend_scale_i · addend)) from the certified derivative stack of each f_i. The shared operands make expression-level common subexpressions explicit, so optimized backends apply their inherited derivative channels once. Expression arity is part of the type, and borrowed operands never copy a full tower. An exact-zero addend scale (either sign of IEEE zero) removes that addend from the corresponding term entirely.

fn compose_unary_with(&self, stack_fn: impl Fn(f64) -> [f64; 5]) -> Self

Compose with a unary special-function whose derivative stack is built from the scalar base value through stack_fn. This evaluates stack_fn(self.value()) once and forwards to compose_unary, so it is bit-identical to the explicit self.compose_unary(stack_fn(self.value())) form.

fn exp(&self) -> Self

e^self. Convenience for tame arguments (see module stability note).

fn sqrt(&self) -> Self

√self. Caller guarantees positivity.

fn ln(&self) -> Self

ln(self). Caller guarantees positivity. Same derivative stack crate::jet_tower::Tower4::ln uses, so any program written over both matches term-for-term.

fn recip(&self) -> Self

1/self.

fn powf(&self, a: f64) -> Self

self^a for real exponent a. Caller guarantees a positive base. Mirrors crate::jet_tower::Tower4::powf (falling-factorial stack).

fn ln_gamma(&self) -> Self

ln Γ(self). Caller guarantees a positive argument. Uses the SAME hand-certified derivative stack crate::jet_tower::Tower4::ln_gamma consumes (crate::jet_tower::ln_gamma_derivative_stack), so any program written over both matches term-for-term.

fn digamma(&self) -> Self

ψ(self) = d/dx ln Γ(x) (digamma). Caller guarantees a positive argument. Same hand-certified stack crate::jet_tower::digamma_derivative_stack.