Enum rbop::node::unstructured::UnstructuredNode

pub enum UnstructuredNode {
    Token(Token),
    Sqrt(UnstructuredNodeList),
    Fraction(UnstructuredNodeList, UnstructuredNodeList),
    Parentheses(UnstructuredNodeList),
    Power(UnstructuredNodeList),
    FunctionCall(Function, Vec<UnstructuredNodeList>),
}

An unstructured node is one which can be inputted by the user. Unstructured nodes have as little structure as possible - for example, “2+3*5” is represented as a flat list of tokens, with no respect for precedence.

Variants

Token(Token)

Sqrt(UnstructuredNodeList)

Fraction(UnstructuredNodeList, UnstructuredNodeList)

Parentheses(UnstructuredNodeList)

Power(UnstructuredNodeList)

FunctionCall(Function, Vec<UnstructuredNodeList>)

Implementations

impl UnstructuredNode

pub fn new_function_call(func: Function) -> Self

Creates a new UnstructuredNode::FunctionCall given a function.

Trait Implementations

impl Clone for UnstructuredNode

fn clone(&self) -> UnstructuredNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for UnstructuredNode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Layoutable for UnstructuredNode

fn layout(
    &self,
    renderer: &mut impl Renderer,
    path: Option<&mut NavPathNavigator<'_>>,
    properties: LayoutComputationProperties
) -> LayoutBlock

Computes the layout for a node tree, converting it into a set of glyphs at particular locations.

impl Navigable for UnstructuredNode

fn navigate_trace<F>(
    &mut self,
    path: &mut NavPathNavigator<'_>,
    trace: F
) -> (&mut UnstructuredNodeList, usize) where
    F: FnMut(UnstructuredItem<'_>), 

fn navigate(
    &mut self,
    path: &mut NavPathNavigator<'_>
) -> (&mut UnstructuredNodeList, usize)

Given a navigation path, returns the node from following that path, and the index into that node. The navigation path will always terminate on an unstructured node list, so the final index in the path will be an index into the unstructured node list’s items.

impl PartialEq<UnstructuredNode> for UnstructuredNode

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

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

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

This method tests for !=.

impl Serializable for UnstructuredNode

fn serialize(&self) -> Vec<u8>

fn deserialize(bytes: &mut dyn Iterator<Item = u8>) -> Option<Self>

impl Upgradable for UnstructuredNode

fn upgrade(&self) -> Result<StructuredNode, NodeError>

impl Eq for UnstructuredNode

impl StructuralEq for UnstructuredNode

impl StructuralPartialEq for UnstructuredNode