pub struct DfaState {
pub accept: bool,
pub on_element: Vec<ElementTransition>,
pub on_wildcard: Vec<WildcardTransition>,
}Fields§
§accept: boolTrue iff the parent’s content is allowed to end at this state (all required particles satisfied so far).
on_element: Vec<ElementTransition>Element-name transitions. Each carries the [ElementDecl]
the matched element resolves to — stored inline so the
validator gets both the next state AND the decl in one lookup.
Linear scan — for typical N≤8 it beats a HashMap on cache use.
on_wildcard: Vec<WildcardTransition>Wildcard transitions — consulted only after element-name transitions don’t match (specific declarations take priority over wildcards per spec).
Trait Implementations§
Auto Trait Implementations§
impl Freeze for DfaState
impl RefUnwindSafe for DfaState
impl Send for DfaState
impl Sync for DfaState
impl Unpin for DfaState
impl UnsafeUnpin for DfaState
impl UnwindSafe for DfaState
Blanket Implementations§
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