class Arborist::ExprCallTree

Direct Known Subclasses

Defined in:

expression_call_tree.cr

Constructors

Instance Method Summary

Constructor Detail

def self.new(expr_call : Arborist::ExprCall, parent : Arborist::ExprCallTree | Nil, parent_apply_node : Nil | Arborist::ApplyCallTree) #

[View source]

Instance Method Detail

def append_child(expr_call : ExprCall, root_memoization_scope : RootMemoizationScope) #

returns the newly created child tree node


[View source]
def append_child(child_tree : ExprCallTree) #

returns the child tree node


[View source]
def children : Array(ExprCallTree) #

[View source]
def children=(children : Array(ExprCallTree)) #

[View source]
def delete_child(child_tree : ExprCallTree) #

[View source]
def expr_call : ExprCall #

[View source]
def expr_call=(expr_call : ExprCall) #

[View source]
def hash(hasher) #
Description copied from class Reference

See Object#hash(hasher)


[View source]
def parent : ExprCallTree | Nil #

[View source]
def parent=(parent : ExprCallTree | Nil) #

[View source]
def parent_apply_node : ApplyCallTree | Nil #

[View source]
def parent_apply_node=(parent_apply_node : ApplyCallTree | Nil) #

[View source]
def postorder_traverse(&blk : ExprCallTree -> ) #

[View source]
def prune_tree! #

[View source]
def self_and_descendants #

This method returns a list of nodes in order of a postorder traversal of nodes in the tree rooted at


[View source]
def sever_from_parent! #

[View source]