Searched refs:node_stack (Results 1 – 5 of 5) sorted by relevance
46 std::stack<xmlNodePtr> node_stack; in DepthFirstSearch() local47 node_stack.push(parent); in DepthFirstSearch()48 while (!node_stack.empty()) { in DepthFirstSearch()49 const xmlNodePtr current_node = node_stack.top(); in DepthFirstSearch()50 node_stack.pop(); in DepthFirstSearch()66 node_stack.push(stack_to_reverse.top()); in DepthFirstSearch()
297 node_stack = list(node)299 node_stack = [node]306 while node_stack and other_stack:307 assert len(node_stack) == len(other_stack)308 n = node_stack.pop()338 node_stack.extend(n_child)342 node_stack.append(n_child)
181 const auto& node_stack = node_info.stack_trace; in TEST_F() local182 ASSERT_EQ(2, node_stack.size()); in TEST_F()183 EXPECT_EQ("D", node_stack.at(0).name); in TEST_F()184 EXPECT_EQ(kUncompilableFunctionNodeName, node_stack.at(1).name); in TEST_F()254 const auto& node_stack = node_info.stack_trace; in TEST_F() local255 ASSERT_EQ(2, node_stack.size()); in TEST_F()256 const auto& stacktrace_first_node_info = node_stack.at(0); in TEST_F()260 const auto& stacktrace_second_node_info = node_stack.at(1); in TEST_F()
111 node_stack = [parsed_manifest]118 node_stack.insert(0, {})138 node_stack = node_stack[:indent_depth + 1]139 node = node_stack[-1]151 node_stack += [node[manifest_key][-1]]
854 node_stack = self._debug_dump.node_traceback(node_name)856 node_stack):