Home
last modified time | relevance | path

Searched refs:new_node (Results 1 – 25 of 3777) sorted by relevance

12345678910>>...152

/dports/devel/py-gast/gast-0.5.3/gast/
H A Dast2.py27 new_node.end_lineno = new_node.end_col_offset = None
40 new_node.end_lineno = new_node.end_col_offset = None
51 new_node.end_lineno = new_node.end_col_offset = None
63 new_node.end_lineno = new_node.end_col_offset = None
76 new_node.end_lineno = new_node.end_col_offset = None
107 new_node.end_lineno = new_node.end_col_offset = None
118 new_node.end_lineno = new_node.end_col_offset = None
129 new_node.end_lineno = new_node.end_col_offset = None
142 new_node.end_lineno = new_node.end_col_offset = None
151 new_node.end_lineno = new_node.end_col_offset = None
[all …]
H A Dast3.py11 new_node = gast.alias(
15 new_node.lineno = new_node.col_offset = None
16 new_node.end_lineno = new_node.end_col_offset = None
17 return new_node
36 new_node.end_lineno = new_node.end_col_offset = None
37 return new_node
45 return new_node
60 new_node.end_lineno = new_node.end_col_offset = None
61 return new_node
234 return new_node
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/fs/hfs/
H A Dbrec.c84 new_node = NULL; in hfs_brec_insert()
100 if (new_node) in hfs_brec_insert()
145 if (new_node) { in hfs_brec_insert()
163 new_node = NULL; in hfs_brec_insert()
243 return new_node; in hfs_bnode_split()
349 return new_node; in hfs_bnode_split()
362 new_node = NULL; in hfs_brec_update_parent()
425 if (new_node) { in hfs_brec_update_parent()
448 new_node = NULL; in hfs_brec_update_parent()
487 new_node->next = 0; in hfs_btree_inc_height()
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/fs/hfsplus/
H A Dbrec.c82 new_node = NULL; in hfs_brec_insert()
98 if (new_node) in hfs_brec_insert()
145 if (new_node) { in hfs_brec_insert()
163 new_node = NULL; in hfs_brec_insert()
247 return new_node; in hfs_bnode_split()
353 return new_node; in hfs_bnode_split()
366 new_node = NULL; in hfs_brec_update_parent()
429 if (new_node) { in hfs_brec_update_parent()
452 new_node = NULL; in hfs_brec_update_parent()
491 new_node->next = 0; in hfs_btree_inc_height()
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/fs/hfsplus/
H A Dbrec.c82 new_node = NULL; in hfs_brec_insert()
98 if (new_node) in hfs_brec_insert()
145 if (new_node) { in hfs_brec_insert()
163 new_node = NULL; in hfs_brec_insert()
247 return new_node; in hfs_bnode_split()
353 return new_node; in hfs_bnode_split()
366 new_node = NULL; in hfs_brec_update_parent()
429 if (new_node) { in hfs_brec_update_parent()
452 new_node = NULL; in hfs_brec_update_parent()
491 new_node->next = 0; in hfs_btree_inc_height()
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/fs/hfs/
H A Dbrec.c84 new_node = NULL; in hfs_brec_insert()
100 if (new_node) in hfs_brec_insert()
145 if (new_node) { in hfs_brec_insert()
163 new_node = NULL; in hfs_brec_insert()
243 return new_node; in hfs_bnode_split()
349 return new_node; in hfs_bnode_split()
362 new_node = NULL; in hfs_brec_update_parent()
425 if (new_node) { in hfs_brec_update_parent()
448 new_node = NULL; in hfs_brec_update_parent()
487 new_node->next = 0; in hfs_btree_inc_height()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/fs/hfs/
H A Dbrec.c84 new_node = NULL; in hfs_brec_insert()
100 if (new_node) in hfs_brec_insert()
145 if (new_node) { in hfs_brec_insert()
163 new_node = NULL; in hfs_brec_insert()
243 return new_node; in hfs_bnode_split()
349 return new_node; in hfs_bnode_split()
362 new_node = NULL; in hfs_brec_update_parent()
425 if (new_node) { in hfs_brec_update_parent()
448 new_node = NULL; in hfs_brec_update_parent()
487 new_node->next = 0; in hfs_btree_inc_height()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/fs/hfsplus/
H A Dbrec.c82 new_node = NULL; in hfs_brec_insert()
98 if (new_node) in hfs_brec_insert()
145 if (new_node) { in hfs_brec_insert()
163 new_node = NULL; in hfs_brec_insert()
247 return new_node; in hfs_bnode_split()
353 return new_node; in hfs_bnode_split()
366 new_node = NULL; in hfs_brec_update_parent()
429 if (new_node) { in hfs_brec_update_parent()
452 new_node = NULL; in hfs_brec_update_parent()
491 new_node->next = 0; in hfs_btree_inc_height()
[all …]
/dports/devel/smv/smv/
H A Dgrammar.m494 moduletype : ATOM {$$ = new_node(MODTYPE,$1,NIL);}
143 usertype : ATOM {$$ = new_node(MODTYPE,$1,NIL);}
175 {$$ = new_node(AND,$1,new_node(EQDEF,$2,$4));}
212 | SELF {$$ = new_node(SELF,NIL,NIL);}
237 | NOT `expr' { $$ = new_node(NOT,$2,NIL); }
247 { $$ = new_node(ABU,new_node(AU,$3,$6),$5); }
249 { $$ = new_node(EBU,new_node(EU,$3,$6),$5); }
271 { $$ = new_node(NOT,new_node(SETIN,$1,$3),NIL); }
273 { $$ = new_node(SIGMA,new_node(EQUAL,$3,$5),$7); }
291 caselist : {$$=new_node(TRUEEXP,NIL,NIL);}
[all …]
/dports/cad/geda/geda-gaf-1.8.2/libgeda/src/
H A Ds_basic.c63 new_node->type = type; in s_basic_init_object()
66 new_node->name = g_strdup_printf("%s.%d", name, new_node->sid); in s_basic_init_object()
69 new_node->page = NULL; in s_basic_init_object()
72 new_node->w_top = 0; in s_basic_init_object()
73 new_node->w_left = 0; in s_basic_init_object()
74 new_node->w_right = 0; in s_basic_init_object()
79 new_node->line = NULL; in s_basic_init_object()
80 new_node->path = NULL; in s_basic_init_object()
82 new_node->arc = NULL; in s_basic_init_object()
83 new_node->box = NULL; in s_basic_init_object()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/connectivity/tests/
H A Dtest_kcutsets.py48 G.add_edge(new_node + 2, new_node + 11)
49 G.add_edge(new_node + 3, new_node + 12)
50 G.add_edge(new_node + 4, new_node + 13)
57 G.add_edge(new_node + 16, new_node + 5)
80 G.add_edge(new_node + 2, new_node + 11)
81 G.add_edge(new_node + 3, new_node + 12)
82 G.add_edge(new_node + 4, new_node + 13)
91 G.add_edge(new_node + 16, new_node + 8)
105 G.add_edge(new_node + 2, new_node + 11)
106 G.add_edge(new_node + 3, new_node + 12)
[all …]
H A Dtest_kcomponents.py23 new_node = G.order() + 1
34 G.add_edge(new_node + 2, new_node + 11)
35 G.add_edge(new_node + 3, new_node + 12)
36 G.add_edge(new_node + 4, new_node + 13)
39 nbrs = G[new_node + 10]
45 G.add_edge(new_node + 16, new_node + 8)
59 G.add_edge(new_node + 2, new_node + 11)
60 G.add_edge(new_node + 3, new_node + 12)
61 G.add_edge(new_node + 4, new_node + 13)
64 nbrs = G[new_node + 10]
[all …]
/dports/math/py-nevergrad/nevergrad-0.4.3.post2/nevergrad/optimization/multiobjective/
H A Dtest_hypervolume.py92 new_node = VectorNode(dim)
96 assert new_node.next[i] is new_node
97 assert new_node.prev[i] is new_node
109 assert new_node.next[i] is new_node
110 assert new_node.prev[i] is new_node
125 new_node = VectorNode(dim)
141 new_node = VectorNode(dim)
168 new_node = VectorNode(dim)
184 new_node = VectorNode(dim)
218 new_node = VectorNode(dim)
[all …]
/dports/devel/gnulib/gnulib-20140202-stable/lib/
H A Dgl_anyrbtree_list2.h787 if (new_node == NULL) in gl_tree_nx_add_first()
837 free (new_node); in gl_tree_nx_add_first()
843 return new_node; in gl_tree_nx_add_first()
853 if (new_node == NULL) in gl_tree_nx_add_last()
903 free (new_node); in gl_tree_nx_add_last()
909 return new_node; in gl_tree_nx_add_last()
919 if (new_node == NULL) in gl_tree_nx_add_before()
962 free (new_node); in gl_tree_nx_add_before()
968 return new_node; in gl_tree_nx_add_before()
1021 free (new_node); in gl_tree_nx_add_after()
[all …]
H A Dgl_anyavltree_list2.h544 if (new_node == NULL) in gl_tree_nx_add_first()
596 free (new_node); in gl_tree_nx_add_first()
602 return new_node; in gl_tree_nx_add_first()
664 free (new_node); in gl_tree_nx_add_last()
670 return new_node; in gl_tree_nx_add_last()
680 new_node = in gl_tree_nx_add_before()
733 free (new_node); in gl_tree_nx_add_before()
739 return new_node; in gl_tree_nx_add_before()
749 new_node = in gl_tree_nx_add_after()
802 free (new_node); in gl_tree_nx_add_after()
[all …]
/dports/security/pkcs11-tools/pkcs11-tools-2.5.0/.gnulib/lib/
H A Dgl_anyrbtree_list2.h787 if (new_node == NULL) in gl_tree_nx_add_first()
837 free (new_node); in gl_tree_nx_add_first()
843 return new_node; in gl_tree_nx_add_first()
853 if (new_node == NULL) in gl_tree_nx_add_last()
903 free (new_node); in gl_tree_nx_add_last()
909 return new_node; in gl_tree_nx_add_last()
919 if (new_node == NULL) in gl_tree_nx_add_before()
962 free (new_node); in gl_tree_nx_add_before()
968 return new_node; in gl_tree_nx_add_before()
1021 free (new_node); in gl_tree_nx_add_after()
[all …]
H A Dgl_anyavltree_list2.h544 if (new_node == NULL)
596 free (new_node);
602 return new_node;
664 free (new_node);
670 return new_node;
680 new_node =
733 free (new_node);
739 return new_node;
749 new_node =
802 free (new_node);
[all …]
/dports/devel/bison/bison-3.7.6/lib/
H A Dgl_anyrbtree_list2.h787 if (new_node == NULL) in gl_tree_nx_add_first()
837 free (new_node); in gl_tree_nx_add_first()
843 return new_node; in gl_tree_nx_add_first()
853 if (new_node == NULL) in gl_tree_nx_add_last()
903 free (new_node); in gl_tree_nx_add_last()
909 return new_node; in gl_tree_nx_add_last()
919 if (new_node == NULL) in gl_tree_nx_add_before()
962 free (new_node); in gl_tree_nx_add_before()
968 return new_node; in gl_tree_nx_add_before()
1021 free (new_node); in gl_tree_nx_add_after()
[all …]
/dports/www/p5-HTML-DOM/HTML-DOM-0.058/lib/HTML/DOM/
H A DNode.pm267 for $new_node, $new_node->descendants;
273 : $new_node
279 for($new_node, $new_node->descendants) {
294 $new_node;
326 if($new_node->is_inside($doc) && !$new_node->is_inside($old_node)){
328 for $new_node, $new_node->descendants;
340 : $new_node
346 for($new_node, $new_node->descendants) {
413 for $new_node, $new_node->descendants;
425 for($new_node, $new_node->descendants) {
[all …]
/dports/www/ilias/ILIAS-5.4.25/Services/Utilities/classes/
H A Dclass.ilDOMUtil.php69 $new_node = &$doc->create_element($a_node_name);
70 $new_node = &$parent_node->append_child($new_node);
72 $new_node->set_content($a_content);
89 $new_node = &$child->insert_before($new_node, $child);
91 $new_node->set_content($a_content);
158 $new_node = $doc->create_element($a_node_name);
159 $new_node = $parent_node->append_child($new_node);
161 $new_node->set_content($a_content);
166 $new_node = $child->insert_before($new_node, $child);
168 $new_node->set_content($a_content);
[all …]
/dports/www/ilias6/ILIAS-6.14/Services/Utilities/classes/
H A Dclass.ilDOMUtil.php69 $new_node = &$doc->create_element($a_node_name);
70 $new_node = &$parent_node->append_child($new_node);
72 $new_node->set_content($a_content);
89 $new_node = &$child->insert_before($new_node, $child);
91 $new_node->set_content($a_content);
158 $new_node = $doc->create_element($a_node_name);
159 $new_node = $parent_node->append_child($new_node);
161 $new_node->set_content($a_content);
166 $new_node = $child->insert_before($new_node, $child);
168 $new_node->set_content($a_content);
[all …]
/dports/net/libyang/libyang-1.0.240/swig/cpp/src/
H A DTree_Data.cpp85 if (!new_node) { in Data_Node()
89 node = new_node; in Data_Node()
100 if (!new_node) { in Data_Node()
104 node = new_node; in Data_Node()
115 if (!new_node) { in Data_Node()
119 node = new_node; in Data_Node()
131 if (!new_node) { in Data_Node()
135 node = new_node; in Data_Node()
147 if (!new_node) { in Data_Node()
151 node = new_node; in Data_Node()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/approximation/tests/
H A Dtest_kcomponents.py46 G.add_edge(new_node + 2, new_node + 11)
47 G.add_edge(new_node + 3, new_node + 12)
48 G.add_edge(new_node + 4, new_node + 13)
55 G.add_edge(new_node + 16, new_node + 5)
78 G.add_edge(new_node + 2, new_node + 11)
79 G.add_edge(new_node + 3, new_node + 12)
80 G.add_edge(new_node + 4, new_node + 13)
89 G.add_edge(new_node + 16, new_node + 8)
103 G.add_edge(new_node + 2, new_node + 11)
104 G.add_edge(new_node + 3, new_node + 12)
[all …]
/dports/textproc/py-sphinx/Sphinx-3.5.2/build/lib/sphinx/
H A Dversioning.py70 new_nodes.append(new_node)
75 if new_node is None:
81 seen.add(new_node)
85 new_nodes.append(new_node)
89 if new_node in seen or (old_node, new_node) in ratios:
94 seen.add(new_node)
102 if new_node in seen:
105 seen.add(new_node)
110 yield new_node
114 new_node.uid = uuid4().hex
[all …]
/dports/textproc/py-sphinx/stage/usr/local/lib/python3.8/site-packages/sphinx/
H A Dversioning.py70 new_nodes.append(new_node)
75 if new_node is None:
81 seen.add(new_node)
85 new_nodes.append(new_node)
89 if new_node in seen or (old_node, new_node) in ratios:
94 seen.add(new_node)
102 if new_node in seen:
105 seen.add(new_node)
110 yield new_node
114 new_node.uid = uuid4().hex
[all …]

12345678910>>...152