|
| Tree (Block *block=new Block()) |
| Construct a new Tree from a given Block, transferring ownership of the Block to the tree and updating parent data on the Block.
|
|
| Tree (const Tree &other) |
| Deep copy constructor for a Tree, performing a deep copy on the held Block, ensuring parent information is updated.
|
|
| ~Tree () override=default |
|
Tree * | copy () const override final |
| The deep copy method for a Node.
|
|
NodeType | nodetype () const override |
| Virtual method for accessing node type information.
|
|
const char * | nodename () const override |
| Virtual method for accessing node name information.
|
|
const char * | subname () const override |
| Virtual method for accessing node name information.
|
|
const Node * | basetype () const override |
| Virtual method for accessing a node's base class. Note that if this is called explicitly on an instance of ast::Node (the top most base class) a nullptr is returned. This is primarily used by the Visitor to support hierarchical visits.
|
|
size_t | children () const override final |
| Virtual method for accessing child information. Returns the number of children a given AST node owns.
|
|
const Block * | child (const size_t i) const override final |
| Virtual method for accessing child information. Returns a const pointer to a child node at the given index. If the index is out of range, a nullptr is returned.
|
|
|
template<typename NodeT> |
bool | isType () const |
| Query whether or not this node is of a specific (derived) type. This method should be used to check if a node is of a particular abstract type. When checking concrete types, it's generally more efficient to check the return value of Node::nodetype()
|
|
|
int64_t | childidx () const |
| Returns the child index of this node in relation to its parent, or -1 if no valid index is found (usually representing the top most node (i.e. Tree)
|
|
|
bool | replace (Node *node) |
| In place replacement. Attempts to replace this node at its specific location within its Abstract Syntax Tree. On a successful replacement, this node is destroyed, the provided node is inserted in its place and ownership is transferred to the parent node. No further calls to this node can be made on successful replacements.
|
|
virtual bool | replacechild (const size_t index, Node *node) |
| Virtual method that attempted to replace a child at a given index with a provided node type.
|
|
|
const Node * | parent () const |
| Access a const pointer to this nodes parent.
|
|
void | setParent (Node *parent) |
| Set this node's parent. This is used during construction of an AST and should not be used.
|
|
A Tree is the highest concrete (non-abstract) node in the entire AX AST hierarchy. It represents an entire conversion of a valid AX string.
- Note
- A tree is the only node type which has typedefs for use as a shared pointer. All other nodes are expected to be handled through unique pointers to infer ownership.
bool replacechild |
( |
const size_t | index, |
|
|
Node * | node ) |
|
inlinevirtualinherited |
Virtual method that attempted to replace a child at a given index with a provided node type.
- Note
- See Node::replace for a more detailed description
- Parameters
-
index | The child index where a replacement should be attempted |
node | The node to insert on a successful replacement. |
- Returns
- True if the replacement was successful, false otherwise
Reimplemented in ArrayPack, ArrayUnpack, AssignExpression, BinaryOperator, Block, Cast, CommaOperator, ConditionalStatement, Crement, DeclareLocal, FunctionCall, Loop, StatementList, TernaryOperator, and UnaryOperator.