Struct stack_graphs::c::sg_partial_path [−][src]
#[repr(C)]pub struct sg_partial_path {
pub start_node: sg_node_handle,
pub end_node: sg_node_handle,
pub symbol_stack_precondition: sg_partial_symbol_stack,
pub symbol_stack_postcondition: sg_partial_symbol_stack,
pub scope_stack_precondition: sg_partial_scope_stack,
pub scope_stack_postcondition: sg_partial_scope_stack,
pub edges: sg_partial_path_edge_list,
}
Expand description
A portion of a name-binding path.
Partial paths can be computed incrementally, in which case all of the edges in the partial path belong to a single file. At query time, we can efficiently concatenate partial paths to yield a name-binding path.
Paths describe the contents of the symbol stack and scope stack at the end of the path. Partial paths, on the other hand, have preconditions and postconditions for each stack. The precondition describes what the stack must look like for us to be able to concatenate this partial path onto the end of a path. The postcondition describes what the resulting stack looks like after doing so.
The preconditions can contain scope stack variables, which describe parts of the scope stack (or parts of a scope symbol’s attached scope list) whose contents we don’t care about. The postconditions can also refer to those variables, and describe how those variable parts of the input scope stacks are carried through unmodified into the resulting scope stack.
Fields
start_node: sg_node_handle
end_node: sg_node_handle
symbol_stack_precondition: sg_partial_symbol_stack
symbol_stack_postcondition: sg_partial_symbol_stack
scope_stack_precondition: sg_partial_scope_stack
scope_stack_postcondition: sg_partial_scope_stack
edges: sg_partial_path_edge_list
Trait Implementations
Performs the conversion.
Auto Trait Implementations
impl RefUnwindSafe for sg_partial_path
impl Send for sg_partial_path
impl Sync for sg_partial_path
impl Unpin for sg_partial_path
impl UnwindSafe for sg_partial_path
Blanket Implementations
Mutably borrows from an owned value. Read more