| /dports/databases/grass7/grass-7.8.6/raster/r.li/r.li.daemon/ |
| H A D | avl.c | 73 save = it->right_child; in avl_destroy()
81 save->right_child = it; in avl_destroy()
322 b = s->right_child; in avl_rotation_ll()
323 s->right_child = r; in avl_rotation_ll()
350 r->right_child = b; in avl_rotation_rr()
375 g = t->right_child; in avl_rotation_lr()
378 t->right_child = r; in avl_rotation_lr()
382 s->right_child = b; in avl_rotation_lr()
410 g = t->right_child; in avl_rotation_rl()
413 t->right_child = s; in avl_rotation_rl()
[all …]
|
| H A D | avlID.c | 43 root->right_child = NULL; in avlID_make()
65 save = it->right_child; in avlID_destroy()
299 b = s->right_child; in avlID_rotation_ll()
300 s->right_child = r; in avlID_rotation_ll()
327 r->right_child = b; in avlID_rotation_rr()
352 g = t->right_child; in avlID_rotation_lr()
355 t->right_child = r; in avlID_rotation_lr()
359 s->right_child = b; in avlID_rotation_lr()
387 g = t->right_child; in avlID_rotation_rl()
390 t->right_child = s; in avlID_rotation_rl()
[all …]
|
| /dports/net/zmap/zmap-2.1.1/src/ |
| H A D | parser.y | 55 $$->right_child = $3;
61 $$->right_child = $3;
87 $$->right_child = make_int_node($3);
94 $$->right_child = make_int_node($3);
101 $$->right_child = make_int_node($3);
108 $$->right_child = make_int_node($3);
115 $$->right_child = make_int_node($3);
122 $$->right_child = make_int_node($3);
131 $$->right_child = make_string_node($3);
138 $$->right_child = make_string_node($3);
|
| H A D | expression.c | 33 uint64_t expected = node->right_child->value.int_literal; in eval_gt_node()
41 uint64_t expected = node->right_child->value.int_literal; in eval_lt_node()
48 node_t *literal = node->right_child; in eval_eq_node()
138 && evaluate_expression(root->right_child, fields)); in evaluate_expression()
141 || evaluate_expression(root->right_child, fields)); in evaluate_expression()
167 print_expression(root->right_child); in print_expression()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Minkowski_sum_2/ |
| H A D | AABB_node_with_join.h | 104 const Node& right_child() const in right_child() function
112 Node& right_child() { return *static_cast<Node*>(m_p_right_child); } in right_child() function
156 right_child().expand(first+1, beyond, 2,traits); in expand()
163 right_child().expand(first + new_range, beyond, range - new_range,traits); in expand()
187 if( traits.go_further() && traits.do_intersect(query, right_child()) ) in traversal()
189 right_child().traversal(query, traits, 2); in traversal()
196 if( traits.go_further() && traits.do_intersect(query, right_child()) ) in traversal()
198 right_child().traversal(query, traits, nb_primitives-nb_primitives/2); in traversal()
201 else if( traits.do_intersect(query, right_child()) ) in traversal()
203 right_child().traversal(query, traits, nb_primitives-nb_primitives/2); in traversal()
[all …]
|
| /dports/science/afni/afni-AFNI_21.3.16/src/ |
| H A D | plug_threshold.c | 145 n->right_child = r; in create_node()
163 n = n->right_child; in destroy_tree()
177 *prune_site = n->right_child; in prune()
182 else if(n->right_child == NULLTREE) in prune()
192 for(largest = n->left_child; largest->right_child != NULLTREE; largest = largest->right_child) in prune()
196 for(largest = n->left_child; largest->right_child != NULLTREE; largest = largest->right_child) in prune()
217 n->parent->right_child = largest; in prune()
220 largest->right_child = n->right_child; in prune()
267 right_size = (n->right_child==NULLTREE? 0: n->right_child->subtree_ref_count); in extract_median()
282 n = n->right_child; in extract_median()
[all …]
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/internal/AABB_tree/ |
| H A D | AABB_node.h | 81 const Node& right_child() const in right_child() function
99 Node& right_child() { return *static_cast<Node*>(m_p_right_child); } in right_child() function
134 if( traits.go_further() && traits.do_intersect(query, right_child()) ) in traversal()
136 right_child().traversal(query, traits, 2); in traversal()
143 if( traits.go_further() && traits.do_intersect(query, right_child()) ) in traversal()
145 right_child().traversal(query, traits, nb_primitives-nb_primitives/2); in traversal()
148 else if( traits.do_intersect(query, right_child()) ) in traversal()
150 right_child().traversal(query, traits, nb_primitives-nb_primitives/2); in traversal()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/mul/clsfy/ |
| H A D | clsfy_binary_tree.cxx | 206 link.left_child = link.right_child = -1; in b_write()
220 link.right_child=nodeId; in b_write()
252 vsl_b_write(bfs,arcIter->right_child); in b_write()
296 vsl_b_read(bfs,link.right_child); in b_read()
310 if (link.right_child != -1) in b_read()
311 right_child=workmap[link.right_child]; in b_read()
324 if ((link.right_child != -1) && in b_read()
325 (!right_child || right_child->nodeId_ != link.right_child)) in b_read()
336 parent->right_child_=right_child; in b_read()
337 if (right_child) in b_read()
[all …]
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Arr_point_location/ |
| H A D | Td_dag_node.h | 261 const Self& right_child() const in right_child() function
267 Self& right_child() in right_child() function
409 right_child().init_visited(); in init_visited()
427 right_child().preorder(); in preorder()
437 right_child().inorder(); in inorder()
446 right_child().postorder(); in postorder()
480 if (right_child().depth() < depth() + 1) in depth_propagation()
482 right_child().depth() = depth() + 1; in depth_propagation()
483 right_child().depth_propagation(); in depth_propagation()
517 right_child().rec_max_depth()); in rec_max_depth()
[all …]
|
| /dports/misc/xdelta3/xdelta-3.1.0/xdelta3/ |
| H A D | xdelta3-fgk.h | 64 fgk_node *right_child; member
419 if (my_left == node->right_child && in fgk_promote()
473 this_zero->right_child = NULL; in fgk_increase_zero_weight()
496 new_internal->right_child = this_zero; in fgk_increase_zero_weight()
539 this_zero->right_child = NULL; in fgk_increase_zero_weight()
559 head_ptr = head_ptr->right_child; in fgk_find_nth_zero()
581 else if (node->right_child == NULL) in fgk_eliminate_zero()
588 node->left_child->right_child = node->right_child; in fgk_eliminate_zero()
596 node->right_child = node + 1; in fgk_init_node()
600 node->right_child = NULL; in fgk_init_node()
[all …]
|
| /dports/sysutils/fwup/fwup-1.9.0/src/3rdparty/xdelta3/ |
| H A D | xdelta3-fgk.h | 61 fgk_node *right_child; member
416 if (my_left == node->right_child && in fgk_promote()
470 this_zero->right_child = NULL; in fgk_increase_zero_weight()
493 new_internal->right_child = this_zero; in fgk_increase_zero_weight()
536 this_zero->right_child = NULL; in fgk_increase_zero_weight()
556 head_ptr = head_ptr->right_child; in fgk_find_nth_zero()
578 else if (node->right_child == NULL) in fgk_eliminate_zero()
585 node->left_child->right_child = node->right_child; in fgk_eliminate_zero()
593 node->right_child = node + 1; in fgk_init_node()
597 node->right_child = NULL; in fgk_init_node()
[all …]
|
| /dports/graphics/vigra/vigra-8acd73a/include/vigra/ |
| H A D | binary_forest.hxx | 145 right_child(-1) in NodeT()
147 index_type parent, left_child, right_child; member
186 if (u_node.right_child == v.id()) in addArc()
194 else if (u_node.right_child == -1) in addArc()
196 u_node.right_child = v.id(); in addArc()
236 return nodes_[uid].right_child != -1; in valid()
252 return Node(u_node.right_child); in target()
312 if (n.left_child == -1 && n.right_child == -1) in outDegree()
365 return Node(n.right_child); in getChild()
392 if (n.right_child != -1) in merge()
[all …]
|
| /dports/devel/p5-Tickit-Widgets/Tickit-Widgets-0.34/lib/Tickit/Widget/ |
| H A D | VSplit.pm | 110 if delete $params->{right_child};
117 $self->right_child ? $self->right_child->requested_lines : 1,
127 $self->right_child ? $self->right_child->requested_cols : 1,
169 *right_child = __PACKAGE__->can( "B_child" );
|
| /dports/devel/glib20/glib-2.70.4/glib/ |
| H A D | gtree.c | 97 guint8 right_child; member
142 node->right_child = FALSE; in g_tree_node_new()
281 while (tmp->right_child) in g_tree_node_last()
308 while (tmp->right_child) in g_tree_node_previous()
334 if (node->right_child) in g_tree_node_next()
1530 if (node->right_child) in g_tree_node_pre_order()
1553 if (node->right_child) in g_tree_node_in_order()
1573 if (node->right_child) in g_tree_node_post_order()
1667 if (left->right_child) in g_tree_node_rotate_right()
1714 if (node->right_child) in g_tree_node_height()
[all …]
|
| /dports/math/highs/HiGHS-cfe064e/src/mip/ |
| H A D | SolveMip.cpp | 109 node.right_child = std::unique_ptr<Node>( in branch()
119 node.right_child->branch_col = col; in branch()
120 node.right_child->col_lower_bound = node.col_lower_bound; in branch()
121 node.right_child->col_upper_bound = node.col_upper_bound; in branch()
122 node.right_child->col_lower_bound[col] = value_ceil; in branch()
123 node.right_child->integer_variables = node.integer_variables; in branch()
127 std::reference_wrapper<Node> right(*(node.right_child).get()); in branch()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/optimize/_highs/src/mip/ |
| H A D | SolveMip.cpp | 109 node.right_child = std::unique_ptr<Node>( in branch()
119 node.right_child->branch_col = col; in branch()
120 node.right_child->col_lower_bound = node.col_lower_bound; in branch()
121 node.right_child->col_upper_bound = node.col_upper_bound; in branch()
122 node.right_child->col_lower_bound[col] = value_ceil; in branch()
123 node.right_child->integer_variables = node.integer_variables; in branch()
127 std::reference_wrapper<Node> right(*(node.right_child).get()); in branch()
|
| /dports/math/gretl/gretl-2021d/lib/src/ |
| H A D | gretl_btree.c | 53 guint8 right_child; member
68 node->right_child = FALSE; in btree_node_new()
122 while (tmp->right_child) { in btree_node_previous()
134 if (node->right_child) { in btree_node_next()
229 if (node->right_child) { in gretl_btree_insert()
238 node->right_child = TRUE; in gretl_btree_insert()
299 if (!node->right_child) { in btree_find_node()
350 node->right_child = FALSE; in btree_node_rotate_left()
384 if (left->right_child) { in btree_node_rotate_right()
388 left->right_child = TRUE; in btree_node_rotate_right()
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/base/ |
| H A D | adjustable_priority_queue.h | 140 int right_child = left_child + 1; in CheckValid() local
141 if (right_child < elems_.size()) { in CheckValid()
143 !(LowerPriorityThan<T, Comp>(&c_))(elems_[i], elems_[right_child])); in CheckValid()
176 const int right_child = left_child + 1; in AdjustDownwards() local
177 const int next_i = (right_child < elems_.size() && in AdjustDownwards()
178 c_(*elems_[left_child], *elems_[right_child])) in AdjustDownwards()
179 ? right_child in AdjustDownwards()
|
| /dports/games/widelands/widelands-build21/src/logic/ |
| H A D | cookie_priority_queue.h | 249 CookieSizeType right_child = right_child_pos(cookie_pos(elt_cookie));
259 if (right_child >= d.size() || c(*d[left_child], *d[right_child], type_)) {
265 if (right_child >= d.size())
268 Cookie& right_cookie(ca(d[right_child], type_));
270 assert(cookie_pos(right_cookie) == right_child);
272 if (c(*d[right_child], *elt, type_)) {
301 CookieSizeType right_child = right_child_pos(pos);
307 if (right_child < d.size()) {
308 assert(!c(*d[right_child], *d[pos], type_));
|
| /dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/HDF5/src/itkhdf5/src/ |
| H A D | H5B2int.c | 200 right_child = right_int; in H5B2__split1()
230 right_child = right_leaf; in H5B2__split1()
322 …if(right_child && H5AC_unprotect(hdr->f, child_class, right_addr, right_child, right_child_flags) … in H5B2__split1()
460 right_child = right_internal; in H5B2__redistribute2()
486 right_child = right_leaf; in H5B2__redistribute2()
717 right_child = right_internal; in H5B2__redistribute3()
751 right_child = right_leaf; in H5B2__redistribute3()
1080 right_child = right_internal; in H5B2__merge2()
1106 right_child = right_leaf; in H5B2__merge2()
1255 right_child = right_internal; in H5B2__merge3()
[all …]
|
| /dports/math/vtk9/VTK-9.1.0/ThirdParty/hdf5/vtkhdf5/src/ |
| H A D | H5B2int.c | 195 right_child = right_int; in H5B2__split1()
227 right_child = right_leaf; in H5B2__split1()
322 …if (right_child && H5AC_unprotect(hdr->f, child_class, right_addr, right_child, right_child_flags)… in H5B2__split1()
495 right_child = right_leaf; in H5B2__redistribute2()
675 …if (right_child && H5AC_unprotect(hdr->f, child_class, right_addr, right_child, right_child_flags)… in H5B2__redistribute2()
791 right_child = right_leaf; in H5B2__redistribute3()
1100 …if (right_child && H5AC_unprotect(hdr->f, child_class, right_addr, right_child, right_child_flags)… in H5B2__redistribute3()
1195 right_child = right_leaf; in H5B2__merge2()
1275 …if (right_child && H5AC_unprotect(hdr->f, child_class, right_addr, right_child, right_child_flags)… in H5B2__merge2()
1393 right_child = right_leaf; in H5B2__merge3()
[all …]
|
| /dports/science/hdf5/hdf5-1.10.6/src/ |
| H A D | H5B2int.c | 200 right_child = right_int; in H5B2__split1()
230 right_child = right_leaf; in H5B2__split1()
322 …if(right_child && H5AC_unprotect(hdr->f, child_class, right_addr, right_child, right_child_flags) … in H5B2__split1()
460 right_child = right_internal; in H5B2__redistribute2()
486 right_child = right_leaf; in H5B2__redistribute2()
717 right_child = right_internal; in H5B2__redistribute3()
751 right_child = right_leaf; in H5B2__redistribute3()
1080 right_child = right_internal; in H5B2__merge2()
1106 right_child = right_leaf; in H5B2__merge2()
1255 right_child = right_internal; in H5B2__merge3()
[all …]
|
| /dports/math/vtk8/VTK-8.2.0/ThirdParty/hdf5/vtkhdf5/src/ |
| H A D | H5B2int.c | 200 right_child = right_int; in H5B2__split1()
230 right_child = right_leaf; in H5B2__split1()
322 …if(right_child && H5AC_unprotect(hdr->f, dxpl_id, child_class, right_addr, right_child, right_chil… in H5B2__split1()
460 right_child = right_internal; in H5B2__redistribute2()
486 right_child = right_leaf; in H5B2__redistribute2()
717 right_child = right_internal; in H5B2__redistribute3()
751 right_child = right_leaf; in H5B2__redistribute3()
1080 right_child = right_internal; in H5B2__merge2()
1106 right_child = right_leaf; in H5B2__merge2()
1255 right_child = right_internal; in H5B2__merge3()
[all …]
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/mysql-test/suite/ndb/r/ |
| H A D | ndb_fk_cascade_delete_multi.result | 65 right_child int null,
68 unique (right_child)) engine = ndb;
77 id value parent left_child right_child
90 id value parent left_child right_child
99 id value parent left_child right_child
108 id value parent left_child right_child
|
| /dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/mysql-test/suite/ndb/r/ |
| H A D | ndb_fk_cascade_delete_multi.result | 65 right_child int null,
68 unique (right_child)) engine = ndb;
77 id value parent left_child right_child
90 id value parent left_child right_child
99 id value parent left_child right_child
108 id value parent left_child right_child
|