| /dports/devel/py-breathe/breathe-4.31.0/breathe/finder/ |
| H A D | compound.py | 9 node_stack = stack(self.data_object, ancestors)
18 node_stack = stack(self.data_object, ancestors)
19 if filter_.allow(node_stack):
20 matches.append(node_stack)
36 if filter_.allow(node_stack):
37 matches.append(node_stack)
47 node_stack = stack(data_object, ancestors)
49 if filter_.allow(node_stack):
50 matches.append(node_stack)
62 if filter_.allow(node_stack):
[all …]
|
| H A D | index.py | 15 node_stack = stack(self.data_object, ancestors)
18 compound_finder.filter_(node_stack, filter_, matches)
36 node_stack = stack(self.data_object, ancestors)
39 if filter_.allow(node_stack):
40 matches.append(node_stack)
48 member_finder.filter_(node_stack, filter_, member_matches)
59 finder.filter_(node_stack, ref_filter, matches)
64 finder.filter_(node_stack, filter_, matches)
69 node_stack = stack(self.data_object, ancestors)
72 if filter_.allow(node_stack):
[all …]
|
| /dports/textproc/p5-XML-Validator-Schema/XML-Validator-Schema-1.10/Schema/ |
| H A D | Parser.pm | 25 $self->{node_stack} = $self->{schema}{node_stack};
32 my $node_stack = $self->{node_stack};
33 my $mother = @$node_stack ? $node_stack->[-1] : undef;
44 push(@$node_stack, $node);
71 push @$node_stack, $node;
83 push @$node_stack, $node;
178 push @$node_stack,$node;
246 my $node_stack = $self->{node_stack};
264 pop @$node_stack;
270 pop @$node_stack;
[all …]
|
| /dports/textproc/p5-XML-Validator-Schema/XML-Validator-Schema-1.10/ |
| H A D | Schema.pm | 524 $self->{node_stack} = $CACHE{$self->{file}}{node_stack};
528 $#{$self->{node_stack}} = 0;
531 $self->{node_stack}[0]->walk_down(
536 $self->{node_stack} = [];
544 $CACHE{$self->{file}}{node_stack} = $self->{node_stack};
591 my $node_stack = $self->{node_stack};
592 my $element = $node_stack->[-1];
612 push(@$node_stack, $daughter);
630 my $node_stack = $self->{node_stack};
631 my $element = $node_stack->[-1];
[all …]
|
| /dports/devel/py-breathe/breathe-4.31.0/breathe/renderer/ |
| H A D | filter.py | 219 def __call__(self, node_stack): argument
263 def __call__(self, node_stack): argument
268 def __call__(self, node_stack): argument
269 return node_stack[1]
273 def __call__(self, node_stack): argument
274 return node_stack[0]
285 def __call__(self, node_stack): argument
357 def __call__(self, node_stack): argument
362 def __call__(self, node_stack): argument
371 def allow(self, node_stack) -> bool: argument
[all …]
|
| H A D | __init__.py | 34 def __init__(self, node_stack, mask_factory, directive_args, argument
36 self.node_stack = node_stack
43 node_stack = self.node_stack[:]
44 node_stack.insert(0, self.mask_factory.mask(data_object))
45 return RenderContext(node_stack, self.mask_factory, self.directive_args, self.domain, True)
|
| /dports/devel/mdds/mdds-1.7.0/include/mdds/ |
| H A D | trie_map_itr.hpp | 150 auto& si = node_stack.back(); in descend_to_previus_leaf_node()
168 m_node_stack(std::move(node_stack)), in iterator_base()
470 node_stack_type node_stack; in begin() local
492 node_stack_type node_stack; in end() local
597 m_node_stack(std::move(node_stack)), in packed_iterator_base()
603 m_node_stack(std::move(node_stack)), in packed_iterator_base()
831 node_stack_type node_stack; in get_root_node() local
833 return node_stack; in get_root_node()
878 const_iterator::push_child_node_to_stack(node_stack, buf, node_stack.back().child_pos); in begin()
882 std::move(node_stack), std::move(buf), *node_stack.back().get_value()); in begin()
[all …]
|
| H A D | trie_map_def.inl | 378 node_stack_type node_stack; local
412 node_stack_type node_stack; local
460 if (node_stack.empty() || !node_stack.back().node->has_value)
473 node_stack.pop_back();
559 auto end = node_stack.end();
605 if (node_stack.empty() || !node_stack.back().node->has_value)
632 node_stack_type node_stack; local
634 if (node_stack.empty() || !node_stack.back().node->has_value)
1142 node_stack.back().child_pos = node_stack.back().child_end;
1164 return node_stack;
[all …]
|
| /dports/www/firefox/firefox-99.0/third_party/rust/jsparagus-parser/src/ |
| H A D | parser.rs | 32 debug_assert!(self.node_stack.queue_empty()); in shift()
33 self.node_stack.enqueue(tv); in shift()
38 while !self.node_stack.queue_empty() { in shift()
49 self.node_stack.shift(); in shift()
80 self.node_stack.shift(); in shift_replayed()
84 self.node_stack.unshift() in unshift()
88 self.node_stack.pop().unwrap() in pop()
91 self.node_stack.push_next(tv) in replay()
175 if self.node_stack.stack_len() > 1 { in close()
176 self.node_stack.pop(); in close()
[all …]
|
| H A D | simulator.rs | 23 node_stack: &'parser [TermValue<StackValue<'alloc>>], field
96 let t = self.node_stack[self.sp - 1].term; in pop()
107 term: self.node_stack[self.sp - 1].term, in epsilon()
125 node_stack: &'parser [TermValue<StackValue<'alloc>>], in new()
128 assert_eq!(state_stack.len(), node_stack.len() + 1); in new()
132 node_stack, in new()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/jsparagus-parser/src/ |
| H A D | parser.rs | 32 debug_assert!(self.node_stack.queue_empty()); in shift()
33 self.node_stack.enqueue(tv); in shift()
38 while !self.node_stack.queue_empty() { in shift()
49 self.node_stack.shift(); in shift()
80 self.node_stack.shift(); in shift_replayed()
84 self.node_stack.unshift() in unshift()
88 self.node_stack.pop().unwrap() in pop()
91 self.node_stack.push_next(tv) in replay()
175 if self.node_stack.stack_len() > 1 { in close()
176 self.node_stack.pop(); in close()
[all …]
|
| /dports/www/firefox-esr/firefox-91.8.0/third_party/rust/jsparagus-parser/src/ |
| H A D | parser.rs | 32 debug_assert!(self.node_stack.queue_empty()); in shift()
33 self.node_stack.enqueue(tv); in shift()
38 while !self.node_stack.queue_empty() { in shift()
49 self.node_stack.shift(); in shift()
80 self.node_stack.shift(); in shift_replayed()
84 self.node_stack.unshift() in unshift()
88 self.node_stack.pop().unwrap() in pop()
91 self.node_stack.push_next(tv) in replay()
175 if self.node_stack.stack_len() > 1 { in close()
176 self.node_stack.pop(); in close()
[all …]
|
| /dports/lang/spidermonkey78/firefox-78.9.0/third_party/rust/jsparagus-parser/src/ |
| H A D | parser.rs | 32 debug_assert!(self.node_stack.queue_empty()); in shift()
33 self.node_stack.enqueue(tv); in shift()
38 while !self.node_stack.queue_empty() { in shift()
49 self.node_stack.shift(); in shift()
58 self.node_stack.shift(); in shift()
74 self.node_stack.unshift() in unshift()
78 self.node_stack.pop().unwrap() in pop()
81 self.node_stack.push_next(tv) in replay()
162 if self.node_stack.stack_len() > 1 { in close()
163 self.node_stack.pop(); in close()
[all …]
|
| /dports/graphics/R-cran-DiagrammeR/DiagrammeR/R/ |
| H A D | trav_in_until.R | 154 node_stack <- vector(mode = "integer") functionVar
220 node_stack <-
221 c(node_stack,
228 graph %>% deselect_nodes(nodes = node_stack)
242 if (length(node_stack > 0)) {
247 node_stack <-
248 intersect(node_stack, all_nodes_conditions_met)
252 node_stack %>%
274 select_nodes_by_id(unique(node_stack))
281 } else if (length(node_stack) < 1) {
|
| H A D | trav_out_until.R | 154 node_stack <- vector(mode = "integer") functionVar
220 node_stack <-
221 c(node_stack,
228 graph %>% deselect_nodes(nodes = node_stack)
242 if (length(node_stack > 0)) {
247 node_stack <-
248 intersect(node_stack, all_nodes_conditions_met)
252 node_stack %>%
274 select_nodes_by_id(unique(node_stack))
281 } else if (length(node_stack) < 1) {
|
| /dports/devel/dbus-glib/dbus-glib-0.112/dbus/ |
| H A D | dbus-gparser.c | 179 GSList *node_stack; member
305 if (parser->node_stack != NULL) in parse_node()
311 parser->node_stack = g_slist_prepend (parser->node_stack, in parse_node()
334 (parser->node_stack == NULL)) in parse_interface()
367 top = parser->node_stack->data; in parse_interface()
389 parser->node_stack == NULL || in parse_method()
447 parser->node_stack == NULL || in parse_signal()
525 parser->node_stack == NULL || in parse_property()
626 parser->node_stack == NULL || in parse_arg()
730 parser->node_stack == NULL || in parse_annotation()
[all …]
|
| /dports/devel/binutils/binutils-2.37/gold/ |
| H A D | arm-reloc-property.cc | 47 Tree_node_vector node_stack; in make_tree() local
59 size_stack.push(node_stack.size()); in make_tree()
64 size_t current_size = node_stack.size(); in make_tree()
68 new Tree_node(node_stack.begin() + prev_size, in make_tree()
69 node_stack.begin() + current_size); in make_tree()
70 node_stack.resize(prev_size); in make_tree()
71 node_stack.push_back(node); in make_tree()
75 node_stack.push_back(new Tree_node(token)); in make_tree()
84 gold_assert(size_stack.empty() && node_stack.size() == 1); in make_tree()
85 return node_stack[0]; in make_tree()
|
| /dports/lang/gnatdroid-binutils-x86/binutils-2.27/gold/ |
| H A D | arm-reloc-property.cc | 47 Tree_node_vector node_stack; in make_tree() local
59 size_stack.push(node_stack.size()); in make_tree()
64 size_t current_size = node_stack.size(); in make_tree()
68 new Tree_node(node_stack.begin() + prev_size, in make_tree()
69 node_stack.begin() + current_size); in make_tree()
70 node_stack.resize(prev_size); in make_tree()
71 node_stack.push_back(node); in make_tree()
75 node_stack.push_back(new Tree_node(token)); in make_tree()
84 gold_assert(size_stack.empty() && node_stack.size() == 1); in make_tree()
85 return node_stack[0]; in make_tree()
|
| /dports/devel/arm-elf-binutils/binutils-2.37/gold/ |
| H A D | arm-reloc-property.cc | 47 Tree_node_vector node_stack; in make_tree() local
59 size_stack.push(node_stack.size()); in make_tree()
64 size_t current_size = node_stack.size(); in make_tree()
68 new Tree_node(node_stack.begin() + prev_size, in make_tree()
69 node_stack.begin() + current_size); in make_tree()
70 node_stack.resize(prev_size); in make_tree()
71 node_stack.push_back(node); in make_tree()
75 node_stack.push_back(new Tree_node(token)); in make_tree()
84 gold_assert(size_stack.empty() && node_stack.size() == 1); in make_tree()
85 return node_stack[0]; in make_tree()
|
| /dports/devel/gnulibiberty/binutils-2.37/gold/ |
| H A D | arm-reloc-property.cc | 47 Tree_node_vector node_stack; in make_tree() local
59 size_stack.push(node_stack.size()); in make_tree()
64 size_t current_size = node_stack.size(); in make_tree()
68 new Tree_node(node_stack.begin() + prev_size, in make_tree()
69 node_stack.begin() + current_size); in make_tree()
70 node_stack.resize(prev_size); in make_tree()
71 node_stack.push_back(node); in make_tree()
75 node_stack.push_back(new Tree_node(token)); in make_tree()
84 gold_assert(size_stack.empty() && node_stack.size() == 1); in make_tree()
85 return node_stack[0]; in make_tree()
|
| /dports/lang/gnatdroid-binutils/binutils-2.27/gold/ |
| H A D | arm-reloc-property.cc | 47 Tree_node_vector node_stack; in make_tree() local
59 size_stack.push(node_stack.size()); in make_tree()
64 size_t current_size = node_stack.size(); in make_tree()
68 new Tree_node(node_stack.begin() + prev_size, in make_tree()
69 node_stack.begin() + current_size); in make_tree()
70 node_stack.resize(prev_size); in make_tree()
71 node_stack.push_back(node); in make_tree()
75 node_stack.push_back(new Tree_node(token)); in make_tree()
84 gold_assert(size_stack.empty() && node_stack.size() == 1); in make_tree()
85 return node_stack[0]; in make_tree()
|
| /dports/math/polymake/polymake-4.5/apps/graph/include/ |
| H A D | biconnected.h | 43 node_stack.reserve(G.nodes()); in NodeVisitor()
78 … return component_type(node_stack, range(discovery[articulation_node], Int(node_stack.size()-1))); in get_cur_component()
90 assert(node_stack.back() == n_to); in is_new_component()
91 node_stack.pop_back(); in is_new_component()
107 node_stack.resize(cur_time+1); in next_component()
114 node_stack.push_back(n); in discover()
117 std::vector<Int> node_stack, discovery, low; variable
|
| H A D | strong_connected.h | 42 node_stack.reserve(G.nodes()); in NodeVisitor()
80 … return component_type(node_stack, range(discovery[n] - start_time, Int(node_stack.size()-1))); in get_cur_component()
97 node_stack.resize((cur_time--) - start_time); in next_component()
103 node_stack.push_back(n); in discover()
106 std::vector<Int> node_stack, discovery, low; variable
|
| /dports/devel/liborcus/liborcus-0.16.1/src/liborcus/ |
| H A D | json_map_tree.cpp | 381 if (stack.node_stack.empty()) in set_cell_link()
384 node* p = stack.node_stack.back(); in set_cell_link()
431 if (stack.node_stack.empty()) in commit_range()
445 if (stack.node_stack.empty() || stack.node_stack.back()->type != map_node_type::unknown) in commit_range()
448 node* p = stack.node_stack.back(); in commit_range()
474 for (auto it = stack.node_stack.rbegin(); it != stack.node_stack.rend(); ++it) in commit_range()
603 stack.node_stack.push_back(p); in get_or_create_destination_node()
629 stack.node_stack.push_back(p); in get_or_create_destination_node()
645 stack.node_stack.clear(); in get_or_create_destination_node()
672 stack.node_stack.push_back(p); in get_or_create_destination_node()
[all …]
|
| /dports/devel/py-breathe/breathe-4.31.0/breathe/directives/ |
| H A D | content_block.py | 62 (node_stack,) = matches
67 contents_finder = self.finder_factory.create_finder_from_root(node_stack[0],
80 for node_stack in matches:
84 node_stack,
93 context = RenderContext(node_stack, mask_factory, self.directive_args)
94 node_list.extend(object_renderer.render(context.node_stack[0], context))
|