Struct SemanticPolicyLayout 

pub struct SemanticPolicyLayout {
    pub z: Range<usize>,
    pub recurrence: Range<usize>,
    pub positions: Range<usize>,
    pub fields: Vec<SemanticPolicyFieldLayout>,
    pub parameter_cells: usize,
}

Packing of the immutable policy inputs consumed by the serial component loop. These ranges describe storage, not authority to substitute a model generation. A session derives the layout from its retained admission’s actual codebooks.

Fields

z: Range<usize>

recurrence: Range<usize>

positions: Range<usize>

fields: Vec<SemanticPolicyFieldLayout>

parameter_cells: usize

Implementations

impl SemanticPolicyLayout

pub const fn recurrent_cells(&self) -> usize

Both lanes retain the initial state and all thirty-six field successors.

pub fn score_cells(&self) -> usize

The same score bank is reused serially by every structural component.

Trait Implementations

impl Clone for SemanticPolicyLayout

fn clone(&self) -> SemanticPolicyLayout

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SemanticPolicyLayout

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

Formats the value using the given formatter.

impl Eq for SemanticPolicyLayout

impl PartialEq for SemanticPolicyLayout

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for SemanticPolicyLayout