| AbstractVisitor | |
| Ast | |
| Ast2Cpp | |
| Ast2Php | |
| AstNode | |
| AstRange | |
| Bound< T > | |
| BoxedFunction | |
| ControlFlow | |
| FlawsAnalyzer | |
| Metric | |
| MetricResult | |
| NumberClasses | |
| NumberDiffuseInputs | |
| NumberFunctions | |
| NumberInput | |
| NumberResources | |
| NumberSinks | |
| NumberSunkDiffuseInputs | |
| NumberVariables | |
| NumericResult | |
| Obfuscator | |
| Range< T > | |
| RangeChecker | |
| RenameClass | |
| RenameFunction | |
| RenameVariable | |
| Security | |
| SecurityAnalysisToken | |
| StringBuffer | |
| Translation | |
| tree< T, tree_node_allocator > | |
| tree< T, tree_node_allocator >::breadth_first_queued_iterator | Breadth-first iterator, using a queue |
| tree< T, tree_node_allocator >::compare_nodes< StrictWeakOrdering > | Comparator class for two nodes of a tree (used for sorting and searching) |
| tree< T, tree_node_allocator >::fixed_depth_iterator | Iterator which traverses only the nodes at a given depth from the root |
| tree< T, tree_node_allocator >::iterator_base | Base class for iterators, only pointers stored, no traversal logic |
| tree< T, tree_node_allocator >::iterator_base_less | Comparator class for iterators (compares pointer values; why doesn't this work automatically?) |
| tree< T, tree_node_allocator >::leaf_iterator | Iterator which traverses only the leaves |
| tree< T, tree_node_allocator >::post_order_iterator | Depth-first iterator, first accessing the children, then the node itself |
| tree< T, tree_node_allocator >::pre_order_iterator | Depth-first iterator, first accessing the node, then its children |
| tree< T, tree_node_allocator >::sibling_iterator | Iterator which traverses only the nodes which are siblings of each other |
| tree_node_< T > | A node in the tree, combining links to other nodes as well as the actual data |
| VarBase | Simple Variable declaration using the position in the tree |
| VarBaseCmp | |
| yy_buffer_state | |
| yy_trans_info | |
| yyalloc | |
