Struct Node 

pub struct Node { /* private fields */ }

Implementations

impl Node

pub fn new_list_node(child_nodes: Vec<Node>) -> Node

pub fn new_parsing_error_node( pos: CodePosition, error: ParsingError, message: impl Into<Box<str>>, ) -> Node

pub fn new_assignment_node(lvalue: Node, rvalue: Node) -> Node

pub fn new_escape_sequence_node(pos: CodePosition, char: char) -> Node

pub fn new_unicode_escape_sequence_node( pos: CodePosition, hex_codepoint: impl Into<Box<str>>, ) -> Node

pub fn new_unprocessed_variable_name_node( pos: CodePosition, variable_name: impl Into<Box<str>>, ) -> Node

pub fn new_variable_name_node( pos: CodePosition, variable_name: impl Into<Box<str>>, type_constraint: Option<Box<str>>, ) -> Node

pub fn new_argument_separator_node( pos: CodePosition, original_text: impl Into<Box<str>>, ) -> Node

pub fn new_function_call_node( pos: CodePosition, argument_list: Vec<Node>, function_name: impl Into<Box<str>>, ) -> Node

pub fn new_function_call_previous_node_value_node( pos: CodePosition, leading_whitespace: impl Into<Box<str>>, trailing_whitespace: impl Into<Box<str>>, argument_list: Vec<Node>, ) -> Node

pub fn new_function_definition_node( pos: CodePosition, function_definition: FunctionDefinition, parameter_list: Vec<Node>, ) -> Node

pub fn new_if_statement_part_if_node( pos: CodePosition, if_body: AST, condition: ConditionalNode, ) -> Node

pub fn new_if_statement_part_else_node(pos: CodePosition, if_body: AST) -> Node

pub fn new_if_statement_node(pos: CodePosition, nodes: Vec<Node>) -> Node

pub fn new_loop_statement_part_loop_node( pos: CodePosition, loop_body: AST, ) -> Node

pub fn new_loop_statement_part_while_node( pos: CodePosition, loop_body: AST, condition: ConditionalNode, ) -> Node

pub fn new_loop_statement_part_until_node( pos: CodePosition, loop_body: AST, condition: ConditionalNode, ) -> Node

pub fn new_loop_statement_part_repeat_node( pos: CodePosition, loop_body: AST, var_pointer_node: Node, repeat_count_node: Node, ) -> Node

pub fn new_loop_statement_part_for_each_node( pos: CodePosition, loop_body: AST, var_pointer_node: Node, composite_or_text_node: Node, ) -> Node

pub fn new_loop_statement_part_else_node( pos: CodePosition, loop_body: AST, ) -> Node

pub fn new_loop_statement_node(pos: CodePosition, nodes: Vec<Node>) -> Node

pub fn new_continue_break_statement_node( pos: CodePosition, number_node: Option<Box<Node>>, continue_node: bool, ) -> Node

pub fn new_try_statement_part_try_node(pos: CodePosition, try_body: AST) -> Node

pub fn new_try_statement_part_soft_try_node( pos: CodePosition, try_body: AST, ) -> Node

pub fn new_try_statement_part_non_try_node( pos: CodePosition, try_body: AST, ) -> Node

pub fn new_try_statement_part_catch_node( pos: CodePosition, try_body: AST, errors: Option<Vec<Node>>, ) -> Node

pub fn new_try_statement_part_else_node( pos: CodePosition, try_body: AST, ) -> Node

pub fn new_try_statement_part_finally_node( pos: CodePosition, try_body: AST, ) -> Node

pub fn new_try_statement_node(pos: CodePosition, nodes: Vec<Node>) -> Node

pub fn new_operation_statement_node( pos: CodePosition, operation_expression: OperationExpression, ) -> Node

pub fn new_return_statement_node( pos: CodePosition, return_value: Option<Node>, ) -> Node

pub fn new_throw_statement_node( pos: CodePosition, throw_value: Node, message_value: Option<Node>, ) -> Node

pub fn new_int_value_node(pos: CodePosition, value: i32) -> Node

pub fn new_long_value_node(pos: CodePosition, value: i64) -> Node

pub fn new_float_value_node(pos: CodePosition, value: f32) -> Node

pub fn new_double_value_node(pos: CodePosition, value: f64) -> Node

pub fn new_char_value_node(pos: CodePosition, value: char) -> Node

pub fn new_text_value_node( pos: CodePosition, value: impl Into<Box<str>>, ) -> Node

pub fn new_null_value_node(pos: CodePosition) -> Node

pub fn new_void_value_node(pos: CodePosition) -> Node

pub fn new_array_value_node(pos: CodePosition, child_nodes: Vec<Node>) -> Node

pub fn new_struct_definition_node( pos: CodePosition, struct_definition: StructDefinition, ) -> Node

pub fn new_class_definition_node( pos: CodePosition, class_definition: ClassDefinition, ) -> Node

pub fn pos(&self) -> CodePosition

pub fn child_nodes(&self) -> &[Node]

pub fn node_data(&self) -> &NodeData

pub fn operator(&self) -> Option<Operator>

pub fn left_side_operand(&self) -> Option<&Node>

pub fn into_left_side_operand(self) -> Option<Node>

pub fn middle_operand(&self) -> Option<&Node>

pub fn into_middle_operand(self) -> Option<Node>

pub fn right_side_operand(&self) -> Option<&Node>

pub fn into_right_side_operand(self) -> Option<Node>

pub fn operands(&self) -> (Option<&Node>, Option<&Node>, Option<&Node>)

pub fn into_operands(self) -> (Option<Node>, Option<Node>, Option<Node>)

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl Display for Node

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

Formats the value using the given formatter.

impl PartialEq for Node

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.