Home
last modified time | relevance | path

Searched refs:top_node (Results 1 – 25 of 471) sorted by relevance

12345678910>>...19

/dports/x11/workrave/workrave-1.10.44/libs/dbus/bin/
H A Ddbusgen.py60 top_node = None variable in TypeNode
68 self.top_node = None
94 self.top_node = None
103 def __init__(self, top_node): argument
105 self.top_node = top_node
216 self.top_node = top_node
405 self.top_node = top_node
440 self.top_node = top_node
459 self.top_node = top_node
484 self.top_node = top_node
[all …]
/dports/misc/mmdnn/MMdnn-0.3.1/mmdnn/conversion/tensorflow/rewriter/
H A Dgru_rewriter.py14 top_node = match_result._pattern_to_op[match_result._name_to_pattern['gru_cell']]
25 if hasattr(top_node, 'kwargs'):
26 top_node.kwargs.update(kwargs)
28 top_node.kwargs = kwargs
35 top_node = match_result._pattern_to_op[match_result._name_to_pattern['h_zero']]
43 if hasattr(top_node, 'kwargs'):
44 top_node.kwargs.update(kwargs)
46 top_node.kwargs = kwargs
H A Dlstm_rewriter.py17 top_node = match_result._pattern_to_op[match_result._name_to_pattern['lstm_cell']]
29 if hasattr(top_node, 'kwargs'):
30 top_node.kwargs.update(kwargs)
32 top_node.kwargs = kwargs
39 top_node = match_result._pattern_to_op[match_result._name_to_pattern['h_zero']]
47 if hasattr(top_node, 'kwargs'):
48 top_node.kwargs.update(kwargs)
50 top_node.kwargs = kwargs
/dports/comms/nmealib/nmealib/src/
H A Dparser.c245 if(!parser->top_node) in nmea_parser_real_push()
246 parser->top_node = node; in nmea_parser_real_push()
298 nmeaParserNODE *node = (nmeaParserNODE *)parser->top_node; in nmea_parser_top()
316 nmeaParserNODE *node = (nmeaParserNODE *)parser->top_node; in nmea_parser_pop()
324 parser->top_node = node->next_node; in nmea_parser_pop()
325 if(!parser->top_node) in nmea_parser_pop()
341 nmeaParserNODE *node = (nmeaParserNODE *)parser->top_node; in nmea_parser_peek()
362 nmeaParserNODE *node = (nmeaParserNODE *)parser->top_node; in nmea_parser_drop()
371 parser->top_node = node->next_node; in nmea_parser_drop()
372 if(!parser->top_node) in nmea_parser_drop()
[all …]
/dports/www/sogo2/SOGo-2.4.1/Tests/Integration/
H A Dwebdavlib.py202 self.top_node = None
207 self.top_node.append(props)
213 if self.top_node is not None:
273 self.top_node.append(set_node)
306 self.top_node.append(psearch)
321 self.top_node.append(sync_token)
396 self.top_node.append(href_node)
421 self.top_node.append(filter_node)
434 self.top_node.append(filter_node)
462 self.top_node.append(mailfilter_node)
[all …]
/dports/math/polymake/polymake-4.5/apps/graph/include/
H A DLatticeTools.h51 Int top_node; variable
56 while (n = *(*this), HD->out_adjacent_nodes(n).front() != top_node) in valid_position()
68 , top_node(HD_arg.top_node()) in HasseDiagram_facet_iterator()
70 if (!at_end() && *(*this)!=top_node) valid_position(); in HasseDiagram_facet_iterator()
76 , top_node(HD_arg.top_node()) in HasseDiagram_facet_iterator()
78 if (!at_end() && *(*this)!=top_node) valid_position(); in HasseDiagram_facet_iterator()
/dports/devel/py-intervaltree/intervaltree-3.1.0/intervaltree/
H A Dintervaltree.py329 if not self.top_node:
332 self.top_node = self.top_node.add(interval)
367 self.top_node = self.top_node.remove(interval)
390 self.top_node = self.top_node.discard(interval)
797 root = self.top_node
813 root = self.top_node
847 root = self.top_node
911 if self.top_node:
984 self.top_node.verify(set())
989 assert self.top_node is None, \
[all …]
/dports/math/polymake/polymake-4.5/apps/topaz/src/
H A Dcomplex_tools.cc25 for (auto it=entire(HD.in_edges(HD.top_node())); !it.at_end(); ++it) { in is_pure()
47 const Int top_node = HD.top_node(); in remove_vertex_star() local
52 if (n != top_node) { in remove_vertex_star()
56 HD.graph().edge(nn,top_node); in remove_vertex_star()
63 HD.delete_nodes(n_it.node_visitor().get_visited_nodes()-top_node); in remove_vertex_star()
/dports/security/silktools/silk-3.19.1/src/libsilk/
H A Dskheap.c341 skheapnode_t top_node) in skHeapExtractTop() argument
349 if (NULL != top_node) { in skHeapExtractTop()
350 HEAP_COPY_OUT(heap, 0, top_node); in skHeapExtractTop()
499 skheapnode_t *top_node) in skHeapPeekTop() argument
502 assert(NULL != top_node); in skHeapPeekTop()
508 *top_node = HEAP_NODE(heap, 0); in skHeapPeekTop()
518 skheapnode_t top_node) in skHeapReplaceTop() argument
527 if (NULL != top_node) { in skHeapReplaceTop()
528 HEAP_COPY_OUT(heap, 0, top_node); in skHeapReplaceTop()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/SPIRV-Tools/src/source/opt/
H A Dtree_iterator.h56 explicit inline TreeDFIterator(NodePtr top_node) : current_(top_node) { in TreeDFIterator() argument
150 static inline PostOrderTreeDFIterator begin(NodePtr top_node) { in begin() argument
151 return PostOrderTreeDFIterator(top_node); in begin()
182 explicit inline PostOrderTreeDFIterator(NodePtr top_node) in PostOrderTreeDFIterator() argument
183 : current_(top_node) { in PostOrderTreeDFIterator()
/dports/devel/intel-graphics-compiler/SPIRV-Tools/source/opt/
H A Dtree_iterator.h56 explicit inline TreeDFIterator(NodePtr top_node) : current_(top_node) { in TreeDFIterator() argument
150 static inline PostOrderTreeDFIterator begin(NodePtr top_node) { in begin() argument
151 return PostOrderTreeDFIterator(top_node); in begin()
182 explicit inline PostOrderTreeDFIterator(NodePtr top_node) in PostOrderTreeDFIterator() argument
183 : current_(top_node) { in PostOrderTreeDFIterator()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dtree_iterator.h56 explicit inline TreeDFIterator(NodePtr top_node) : current_(top_node) { in TreeDFIterator() argument
150 static inline PostOrderTreeDFIterator begin(NodePtr top_node) { in begin() argument
151 return PostOrderTreeDFIterator(top_node); in begin()
182 explicit inline PostOrderTreeDFIterator(NodePtr top_node) in PostOrderTreeDFIterator() argument
183 : current_(top_node) { in PostOrderTreeDFIterator()
/dports/emulators/mess/mame-mame0226/3rdparty/bgfx/3rdparty/spirv-tools/source/opt/
H A Dtree_iterator.h56 explicit inline TreeDFIterator(NodePtr top_node) : current_(top_node) { in TreeDFIterator() argument
150 static inline PostOrderTreeDFIterator begin(NodePtr top_node) { in begin() argument
151 return PostOrderTreeDFIterator(top_node); in begin()
182 explicit inline PostOrderTreeDFIterator(NodePtr top_node) in PostOrderTreeDFIterator() argument
183 : current_(top_node) { in PostOrderTreeDFIterator()
/dports/emulators/mame/mame-mame0226/3rdparty/bgfx/3rdparty/spirv-tools/source/opt/
H A Dtree_iterator.h56 explicit inline TreeDFIterator(NodePtr top_node) : current_(top_node) { in TreeDFIterator() argument
150 static inline PostOrderTreeDFIterator begin(NodePtr top_node) { in begin() argument
151 return PostOrderTreeDFIterator(top_node); in begin()
182 explicit inline PostOrderTreeDFIterator(NodePtr top_node) in PostOrderTreeDFIterator() argument
183 : current_(top_node) { in PostOrderTreeDFIterator()
/dports/graphics/spirv-tools/SPIRV-Tools-2021.4/source/opt/
H A Dtree_iterator.h56 explicit inline TreeDFIterator(NodePtr top_node) : current_(top_node) { in TreeDFIterator() argument
150 static inline PostOrderTreeDFIterator begin(NodePtr top_node) { in begin() argument
151 return PostOrderTreeDFIterator(top_node); in begin()
182 explicit inline PostOrderTreeDFIterator(NodePtr top_node) in PostOrderTreeDFIterator() argument
183 : current_(top_node) { in PostOrderTreeDFIterator()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/SPIRV-Tools/src/source/opt/
H A Dtree_iterator.h56 explicit inline TreeDFIterator(NodePtr top_node) : current_(top_node) { in TreeDFIterator() argument
150 static inline PostOrderTreeDFIterator begin(NodePtr top_node) { in begin() argument
151 return PostOrderTreeDFIterator(top_node); in begin()
182 explicit inline PostOrderTreeDFIterator(NodePtr top_node) in PostOrderTreeDFIterator() argument
183 : current_(top_node) { in PostOrderTreeDFIterator()
/dports/math/polymake/polymake-4.5/apps/tropical/src/
H A Dcovector_decomposition.cc131 Int top_node = cone_cov_obj.give("TOP_NODE"); in compute_covector_decomposition() local
134 for (auto max_node : cone_cov_graph.in_adjacent_nodes(top_node)) { in compute_covector_decomposition()
135 queuing_nodes += ( max_node > top_node? max_node-1 : max_node); in compute_covector_decomposition()
138 queuing_nodes += ( atom > top_node? atom-1 : atom); in compute_covector_decomposition()
155 const Int n_max_nodes = result.in_degree(result.top_node()); in compute_covector_decomposition()
156 auto max_nodes = select(result.decoration(), result.in_adjacent_nodes(result.top_node())); in compute_covector_decomposition()
/dports/graphics/box/box-0.4.0/box/
H A Dtypes.c264 assert(top_node && item_node); in BoxTypeNode_Append_Node()
271 if (top_node->previous != NULL) { in BoxTypeNode_Append_Node()
278 if (top_node->next == NULL) in BoxTypeNode_Append_Node()
279 top_node->next = item; in BoxTypeNode_Append_Node()
280 top_node->previous = item; in BoxTypeNode_Append_Node()
289 assert(top_node && item_node); in BoxTypeNode_Prepend_Node()
296 if (top_node->next != NULL) { in BoxTypeNode_Prepend_Node()
303 if (top_node->previous == NULL) in BoxTypeNode_Prepend_Node()
304 top_node->previous = item; in BoxTypeNode_Prepend_Node()
305 top_node->next = item; in BoxTypeNode_Prepend_Node()
[all …]
/dports/graphics/cogl/cogl-1.22.8/cogl/
H A Dcogl-rectangle-map.c242 CoglRectangleMapNode *top_node, *bottom_node; in _cogl_rectangle_map_node_split_vertically() local
247 top_node = _cogl_rectangle_map_node_new (); in _cogl_rectangle_map_node_split_vertically()
248 top_node->type = COGL_RECTANGLE_MAP_EMPTY_LEAF; in _cogl_rectangle_map_node_split_vertically()
249 top_node->parent = node; in _cogl_rectangle_map_node_split_vertically()
250 top_node->rectangle.x = node->rectangle.x; in _cogl_rectangle_map_node_split_vertically()
251 top_node->rectangle.y = node->rectangle.y; in _cogl_rectangle_map_node_split_vertically()
252 top_node->rectangle.width = node->rectangle.width; in _cogl_rectangle_map_node_split_vertically()
253 top_node->rectangle.height = top_height; in _cogl_rectangle_map_node_split_vertically()
254 top_node->largest_gap = (top_node->rectangle.width * in _cogl_rectangle_map_node_split_vertically()
256 node->d.branch.left = top_node; in _cogl_rectangle_map_node_split_vertically()
[all …]
/dports/x11-wm/muffin/muffin-4.8.0/cogl/cogl/
H A Dcogl-rectangle-map.c242 CoglRectangleMapNode *top_node, *bottom_node; in _cogl_rectangle_map_node_split_vertically() local
247 top_node = _cogl_rectangle_map_node_new (); in _cogl_rectangle_map_node_split_vertically()
248 top_node->type = COGL_RECTANGLE_MAP_EMPTY_LEAF; in _cogl_rectangle_map_node_split_vertically()
249 top_node->parent = node; in _cogl_rectangle_map_node_split_vertically()
250 top_node->rectangle.x = node->rectangle.x; in _cogl_rectangle_map_node_split_vertically()
251 top_node->rectangle.y = node->rectangle.y; in _cogl_rectangle_map_node_split_vertically()
252 top_node->rectangle.width = node->rectangle.width; in _cogl_rectangle_map_node_split_vertically()
253 top_node->rectangle.height = top_height; in _cogl_rectangle_map_node_split_vertically()
254 top_node->largest_gap = (top_node->rectangle.width * in _cogl_rectangle_map_node_split_vertically()
256 node->d.branch.left = top_node; in _cogl_rectangle_map_node_split_vertically()
[all …]
/dports/x11-wm/mutter/mutter-41.1/cogl/cogl/
H A Dcogl-rectangle-map.c240 CoglRectangleMapNode *top_node, *bottom_node; in _cogl_rectangle_map_node_split_vertically() local
245 top_node = _cogl_rectangle_map_node_new (); in _cogl_rectangle_map_node_split_vertically()
246 top_node->type = COGL_RECTANGLE_MAP_EMPTY_LEAF; in _cogl_rectangle_map_node_split_vertically()
247 top_node->parent = node; in _cogl_rectangle_map_node_split_vertically()
248 top_node->rectangle.x = node->rectangle.x; in _cogl_rectangle_map_node_split_vertically()
249 top_node->rectangle.y = node->rectangle.y; in _cogl_rectangle_map_node_split_vertically()
250 top_node->rectangle.width = node->rectangle.width; in _cogl_rectangle_map_node_split_vertically()
251 top_node->rectangle.height = top_height; in _cogl_rectangle_map_node_split_vertically()
252 top_node->largest_gap = (top_node->rectangle.width * in _cogl_rectangle_map_node_split_vertically()
254 node->d.branch.left = top_node; in _cogl_rectangle_map_node_split_vertically()
[all …]
/dports/biology/hyphy/hyphy-2.5.33/src/core/
H A Dformula.cpp927 top_node->kill_all_nodes(); in InternalSimplify()
938 top_node->kill_all_nodes(); in InternalSimplify()
948 top_node->kill_node(1); in InternalSimplify()
985 if (!top_node) { in SubtreeToString()
1069 if (!top_node || top_node->get_num_nodes() == 2 ) { in SubtreeToString()
1089 if (top_node) { in SubtreeToString()
1093 if (top_node) { in SubtreeToString()
1099 if (top_node) { in SubtreeToString()
1109 if (top_node) { in SubtreeToString()
1119 if (top_node) { in SubtreeToString()
[all …]
/dports/www/ilias/ILIAS-5.4.25/Services/Repository/classes/
H A Dclass.ilRepositoryGUI.php391 $top_node = 0;
395 if ($top_node > 0) {
402 $top_node = $n;
407 … $exp = new ilRepositoryExplorer("ilias.php?baseClass=ilRepositoryGUI&cmd=goto", $top_node);
423 if ($top_node > 0) {
427 $exp->setForceOpenPath($path + array($top_node));
433 if ($top_node > 0) {
459 $tree->getParentId($top_node),
461 ilObject::_lookupObjId($tree->getParentId($top_node))
/dports/math/polymake/polymake-4.5/apps/matroid/src/
H A Dnested.cc38 Int top_node = cgraph.top_node(); in __anon788443570102()
40 while (current_node != top_node) { in __anon788443570102()
72 Set<Int> coloops = sequence(0,n) - cyclic_flats.face(cyclic_flats.top_node());
/dports/www/ilias6/ILIAS-6.14/Services/Repository/classes/
H A Dclass.ilRepositoryGUI.php416 $top_node = 0;
420 if ($top_node > 0) {
427 $top_node = $n;
432 … $exp = new ilRepositoryExplorer("ilias.php?baseClass=ilRepositoryGUI&amp;cmd=goto", $top_node);
448 if ($top_node > 0) {
452 $exp->setForceOpenPath($path + array($top_node));
458 if ($top_node > 0) {
484 $tree->getParentId($top_node),
486 ilObject::_lookupObjId($tree->getParentId($top_node))

12345678910>>...19