Struct DefaultAstProcessor 

pub struct DefaultAstProcessor;

Default implementation of AstProcessor.

Implementations

impl DefaultAstProcessor

pub fn new() -> Self

Creates a new DefaultAstProcessor.

Trait Implementations

impl<'a, L: Language> AstProcessor<'a, L> for DefaultAstProcessor

fn traverse_pre_order( &self, root: RedTree<'a, L>, visitor: &mut impl Visitor<'a, L>, )

Traverses the AST in pre-order, applying the given visitor to each node.

fn traverse_post_order( &self, root: RedTree<'a, L>, visitor: &mut impl Visitor<'a, L>, )

Traverses the AST in post-order, applying the given visitor to each node.

fn find_nodes_by_type( &self, root: RedTree<'a, L>, node_type: L::ElementType, ) -> Vec<RedNode<'a, L>>

Finds all nodes of the specified type.

fn find_tokens_by_type( &self, root: RedTree<'a, L>, token_type: L::TokenType, ) -> Vec<RedLeaf<L>>

Finds all tokens of the specified type.

fn find_node_at_offset( &self, root: RedTree<'a, L>, offset: usize, ) -> Option<RedTree<'a, L>>

Finds the node at the specified offset.

fn replace_node( &self, _old_node: RedNode<'a, L>, _new_node: RedNode<'a, L>, ) -> Result<RedTree<'a, L>, AstError>

Replaces a node with a new one.

fn remove_node(&self, _node: RedNode<'a, L>) -> Result<RedTree<'a, L>, AstError>

Removes a node from the tree.

fn add_child( &self, _parent: RedNode<'a, L>, _child: RedTree<'a, L>, ) -> Result<RedNode<'a, L>, AstError>

Adds a child node to the specified parent.