Transition

Struct Transition 

Source
pub struct Transition {
    pub matcher: Matcher,
    pub ref_marker: RefTransition,
    pub nav: Nav,
    pub successor_count: u32,
    pub successor_data: [u32; 8],
    /* private fields */
}
Expand description

A single transition in the query graph.

Transitions use SSO (small-size optimization) for successors:

  • 0-8 successors: stored inline in successor_data
  • 9+ successors: successor_data[0] is index into successors segment

Layout (64 bytes total, 64-byte aligned):

offset 0:  matcher (16 bytes)
offset 16: ref_marker (4 bytes)
offset 20: nav (2 bytes)
offset 22: effects_len (2 bytes)
offset 24: successor_count (4 bytes)
offset 28: effects_start (4 bytes)
offset 32: successor_data (32 bytes)

Fields§

§matcher: Matcher

What this transition matches (node kind, wildcard, epsilon).

§ref_marker: RefTransition

Reference call/return marker for recursive definitions.

§nav: Nav

Navigation instruction (descend/ascend/sibling traversal).

§successor_count: u32

Number of successor transitions.

§successor_data: [u32; 8]

Successor storage (inline or spilled index).

  • If successor_count <= 8: contains TransitionId values directly
  • If successor_count > 8: successor_data[0] is index into successors segment

Implementations§

Source§

impl Transition

Source

pub fn new( matcher: Matcher, ref_marker: RefTransition, nav: Nav, effects: Slice<EffectOp>, successor_count: u32, successor_data: [u32; 8], ) -> Self

Creates a new transition with all fields.

Source

pub fn effects(&self) -> Slice<EffectOp>

Returns the effects slice.

Source

pub fn set_effects(&mut self, effects: Slice<EffectOp>)

Sets the effects slice.

Source

pub fn has_inline_successors(&self) -> bool

Returns true if successors are stored inline.

Source

pub fn inline_successors(&self) -> Option<&[TransitionId]>

Returns inline successors if they fit, None if spilled.

Source

pub fn spilled_successors_index(&self) -> u32

Returns the spilled successor segment index and count. Panics if successors are inline.

Trait Implementations§

Source§

impl Clone for Transition

Source§

fn clone(&self) -> Transition

Returns a duplicate of the value. Read more
1.0.0§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for Transition

Auto Trait Implementations§

Blanket Implementations§

§

impl<T> Any for T
where T: 'static + ?Sized,

§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<T> Borrow<T> for T
where T: ?Sized,

§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
§

impl<T> BorrowMut<T> for T
where T: ?Sized,

§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> CloneToUninit for T
where T: Clone,

§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
§

impl<T> From<T> for T

§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T, U> Into<U> for T
where U: From<T>,

§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.