LLZK 0.1.0
Veridise's ZK Language IR
|
#include <SymbolDefTree.h>
Public Types | |
using | GraphType = const llzk::SymbolDefTree * |
using | nodes_iterator = llzk::SymbolDefTree::iterator |
nodes_iterator/begin/end - Allow iteration over all nodes in the graph. | |
![]() | |
using | NodeRef = const llzk::SymbolDefTreeNode * |
using | ChildIteratorType = llzk::SymbolDefTreeNode::child_iterator |
ChildIteratorType/begin/end - Allow iteration over all nodes in the graph. | |
Static Public Member Functions | |
static NodeRef | getEntryNode (GraphType g) |
The entry node into the graph is the external node. | |
static nodes_iterator | nodes_begin (GraphType g) |
static nodes_iterator | nodes_end (GraphType g) |
static unsigned | size (GraphType g) |
Return total number of nodes in the graph. | |
![]() | |
static NodeRef | getEntryNode (NodeRef node) |
static ChildIteratorType | child_begin (NodeRef node) |
static ChildIteratorType | child_end (NodeRef node) |
Definition at line 149 of file SymbolDefTree.h.
using llvm::GraphTraits< const llzk::SymbolDefTree * >::GraphType = const llzk::SymbolDefTree * |
Definition at line 151 of file SymbolDefTree.h.
using llvm::GraphTraits< const llzk::SymbolDefTree * >::nodes_iterator = llzk::SymbolDefTree::iterator |
nodes_iterator/begin/end - Allow iteration over all nodes in the graph.
Definition at line 157 of file SymbolDefTree.h.
|
inlinestatic |
The entry node into the graph is the external node.
Definition at line 154 of file SymbolDefTree.h.
|
inlinestatic |
Definition at line 158 of file SymbolDefTree.h.
|
inlinestatic |
Definition at line 159 of file SymbolDefTree.h.
|
inlinestatic |
Return total number of nodes in the graph.
Definition at line 162 of file SymbolDefTree.h.