Struct stack_graphs::c::sg_symbol_stack

#[repr(C)]
pub struct sg_symbol_stack {
    pub cells: sg_symbol_stack_cell_handle,
    pub length: u32,
}

A sequence of symbols that describe what we are currently looking for while in the middle of the path-finding algorithm.

Fields

cells: sg_symbol_stack_cell_handle

The handle of the first element in the symbol stack, or SG_LIST_EMPTY_HANDLE if the list is empty, or 0 if the list is null.

length: u32

Trait Implementations

impl Clone for sg_symbol_stack

fn clone(&self) -> sg_symbol_stack

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Default for sg_symbol_stack

fn default() -> sg_symbol_stack

Returns the “default value” for a type.

impl From<SymbolStack> for sg_symbol_stack

fn from(stack: SymbolStack) -> sg_symbol_stack

Performs the conversion.

impl PartialEq<sg_symbol_stack> for sg_symbol_stack

fn eq(&self, other: &sg_symbol_stack) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &sg_symbol_stack) -> bool

This method tests for !=.

impl Copy for sg_symbol_stack

impl Eq for sg_symbol_stack

impl StructuralEq for sg_symbol_stack

impl StructuralPartialEq for sg_symbol_stack