Struct RuleMeta 

#[repr(C)]
pub struct RuleMeta {
    pub transition_base: u32,
    pub accept_base: u32,
    pub state_count: u32,
    pub class_map_base: u32,
    pub num_classes: u32,
}

Packed metadata for one byte-class-compressed DFA rule entry.

The on-device transition table is transitions[transition_base + state * num_classes + class_maps[class_map_base + byte]]: each rule carries a 256-entry byte→class map (into the shared class_maps buffer) and a compressed state_count * num_classes transition block, instead of a dense state_count * 256 block. The compression is LOSSLESS — bytes share a class only when their transition column is identical across every state — so GPU firings are byte-for-byte identical to the dense table.

Fields

transition_base: u32

Word offset into the flattened (compressed) transition table.

accept_base: u32

Word offset into the flattened accept table.

state_count: u32

DFA state count for this rule.

class_map_base: u32

Word offset into the shared 256-entry-per-rule byte→class map table.

num_classes: u32

Number of distinct byte classes for this rule (the compressed row width).

Trait Implementations

impl Clone for RuleMeta

fn clone(&self) -> RuleMeta

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RuleMeta

impl Debug for RuleMeta

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

Formats the value using the given formatter.

impl Eq for RuleMeta

impl PartialEq for RuleMeta

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

impl StructuralPartialEq for RuleMeta

impl Zeroable for RuleMeta

fn zeroed() -> Self

Calls zeroed.