Struct TransitionLayout

pub struct TransitionLayout {
    lookup_tables: HashMap<StateID, LookupTable>,
}

This struct contains the layout for the lookup tables used by the TransitionFunctions.

Each transition function may have a differently shaped lookup table.

• For [Transition]s, there is no lookup table and we just embed the start and end directly into the function.
• For [SparseTransitions]s, the table is represented as 2 arrays. The first array the start end tuples from the [Transition]s. The second array contains the [StateID]s arranged to match the same order as the tuples.
• For [DenseTransitions], it will be an array of length 256 containing [StateID]s.

Fields

lookup_tables: HashMap<StateID, LookupTable>

Implementations

impl TransitionLayout

pub fn new( ctx: &mut CompileContext, overall: Layout, ) -> Result<(Layout, Self), LayoutError>

Creates a new TransitionLayout by calculating the memory offsets for transition lookup tables.

fn get(&self, sid: StateID) -> Option<LookupTable>

Trait Implementations

impl Debug for TransitionLayout

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

Formats the value using the given formatter.