Searched refs:top_node (Results 1 – 6 of 6) sorted by relevance
56 explicit inline TreeDFIterator(NodePtr top_node) : current_(top_node) { in TreeDFIterator() argument150 static inline PostOrderTreeDFIterator begin(NodePtr top_node) { in begin() argument151 return PostOrderTreeDFIterator(top_node); in begin()182 explicit inline PostOrderTreeDFIterator(NodePtr top_node) in PostOrderTreeDFIterator() argument183 : current_(top_node) { in PostOrderTreeDFIterator()
1217 node* top_node = new cat_node(newnode, cnode); in create_mb_node_seq() local1218 newnode = top_node; in create_mb_node_seq()1363 node* top_node = new cat_node(newnode, cnode); in create_mb_node_for_byte() local1364 return top_node; in create_mb_node_for_byte()1442 node* top_node = new or_node(savednode, newnode); in handle_mb_range() local1443 savednode = top_node; in handle_mb_range()1473 node* top_node = new cat_node(newnode, cnode); in handle_mb_range() local1474 newnode = top_node; in handle_mb_range()1480 node* top_node = new or_node(savednode, newnode); in handle_mb_range() local1481 savednode = top_node; in handle_mb_range()[all …]
216 …tree_iterator(NodePointerIterator begin, NodePointerIterator end, const Node * top_node, ValueComp… in tree_iterator() argument223 adaptor_type::base_reference() = top_node; in tree_iterator()224 discover_nodes(top_node); in tree_iterator()228 if (current_node != top_node) in tree_iterator()
228 std::shared_ptr<DatasetNode> top_node = nullptr; in PopFromCachedNodeStack() local230 top_node = cached_node_stacks_.top(); in PopFromCachedNodeStack()233 return top_node; in PopFromCachedNodeStack()