#[repr(C)]pub struct RuleMeta {
pub transition_base: u32,
pub accept_base: u32,
pub state_count: u32,
}Expand description
Packed metadata for one dense DFA rule entry.
Fields§
§transition_base: u32Word offset into the flattened transition table.
accept_base: u32Word offset into the flattened accept table.
state_count: u32DFA state count for this rule.
Trait Implementations§
impl Copy for RuleMeta
impl Eq for RuleMeta
impl Pod for RuleMeta
impl StructuralPartialEq for RuleMeta
Auto Trait Implementations§
impl Freeze for RuleMeta
impl RefUnwindSafe for RuleMeta
impl Send for RuleMeta
impl Sync for RuleMeta
impl Unpin for RuleMeta
impl UnsafeUnpin for RuleMeta
impl UnwindSafe for RuleMeta
Blanket Implementations§
impl<T> AnyBitPattern for Twhere
T: Pod,
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
Source§type Bits = T
type Bits = T
Self must have the same layout as the specified Bits except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern.Source§fn is_valid_bit_pattern(_bits: &T) -> bool
fn is_valid_bit_pattern(_bits: &T) -> bool
If this function returns true, then it must be valid to reinterpret
bits
as &Self.Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.