/dports/math/cgal/CGAL-5.3/include/CGAL/Partition_2/ |
H A D | Rotation_tree_2_impl.h | 53 if (left_sibling(q) != this->end()) in set_left_sibling() 55 (*left_sibling(q)).set_right_sibling(p); in set_left_sibling() 56 (*p).set_left_sibling(left_sibling(q)); in set_left_sibling() 67 if (left_sibling(q) != this->end()) in set_left_sibling() 68 (*(*q).left_sibling()).clear_right_sibling(); in set_left_sibling() 112 set_left_sibling(left_sibling(p),s); in erase() 113 s = left_sibling(p); in erase() 120 set_rightmost_child(left_sibling(p),s); in erase()
|
H A D | Rotation_tree_node_2.h | 65 Tree_iterator left_sibling() const in left_sibling() function 152 os << " left sibling " << (*node.left_sibling()).x() 153 << " " << (*node.left_sibling()).y() << " ";
|
H A D | Rotation_tree_2.h | 122 Self_iterator left_sibling(Self_iterator p) in left_sibling() function 125 return (*p).left_sibling(); in left_sibling()
|
H A D | Vertex_visibility_graph_2.h | 178 z = tree.left_sibling(q); in build() 223 if (tree.left_sibling(p) == tree.end() && in build()
|
/dports/devel/bsdelf/elftoolchain-0.7.1/libdwarf/ |
H A D | dwarf_pro_die.c | 48 Dwarf_P_Die parent, Dwarf_P_Die child, Dwarf_P_Die left_sibling, in dwarf_new_die() argument 59 count = _dwarf_die_count_links(parent, child, left_sibling, in dwarf_new_die() 78 _dwarf_die_link(die, parent, child, left_sibling, right_sibling); in dwarf_new_die() 85 Dwarf_P_Die child, Dwarf_P_Die left_sibling, Dwarf_P_Die right_sibling, in dwarf_die_link() argument 98 count = _dwarf_die_count_links(parent, child, left_sibling, in dwarf_die_link() 107 _dwarf_die_link(die, parent, child, left_sibling, right_sibling); in dwarf_die_link()
|
H A D | libdwarf_die.c | 170 Dwarf_P_Die left_sibling, Dwarf_P_Die right_sibling) in _dwarf_die_link() argument 225 if (left_sibling) { in _dwarf_die_link() 229 if (die->die_left != left_sibling) { in _dwarf_die_link() 236 die->die_left = left_sibling; in _dwarf_die_link() 237 left_sibling->die_right = die; in _dwarf_die_link() 258 Dwarf_P_Die left_sibling, Dwarf_P_Die right_sibling) in _dwarf_die_count_links() argument 268 if (left_sibling) in _dwarf_die_count_links()
|
/dports/devel/elftoolchain/elftoolchain-0.7.1/libdwarf/ |
H A D | dwarf_pro_die.c | 48 Dwarf_P_Die parent, Dwarf_P_Die child, Dwarf_P_Die left_sibling, in dwarf_new_die() argument 59 count = _dwarf_die_count_links(parent, child, left_sibling, in dwarf_new_die() 78 _dwarf_die_link(die, parent, child, left_sibling, right_sibling); in dwarf_new_die() 85 Dwarf_P_Die child, Dwarf_P_Die left_sibling, Dwarf_P_Die right_sibling, in dwarf_die_link() argument 98 count = _dwarf_die_count_links(parent, child, left_sibling, in dwarf_die_link() 107 _dwarf_die_link(die, parent, child, left_sibling, right_sibling); in dwarf_die_link()
|
H A D | libdwarf_die.c | 170 Dwarf_P_Die left_sibling, Dwarf_P_Die right_sibling) in _dwarf_die_link() argument 225 if (left_sibling) { in _dwarf_die_link() 229 if (die->die_left != left_sibling) { in _dwarf_die_link() 236 die->die_left = left_sibling; in _dwarf_die_link() 237 left_sibling->die_right = die; in _dwarf_die_link() 258 Dwarf_P_Die left_sibling, Dwarf_P_Die right_sibling) in _dwarf_die_count_links() argument 268 if (left_sibling) in _dwarf_die_count_links()
|
/dports/databases/p5-DBIx-Class-Tree-NestedSet/DBIx-Class-Tree-NestedSet-0.10/t/ |
H A D | 16-siblings.t | 129 $sibling = $child1_4->left_sibling; 132 $sibling = $child1_1->left_sibling;
|
/dports/lang/gcc6-aux/gcc-6-20180516/libcilkrts/runtime/ |
H A D | full_frame.h | 216 full_frame *left_sibling; member
|
H A D | full_frame.c | 61 ff->left_sibling = ff->right_sibling = 0; in __cilkrts_make_full_frame()
|
H A D | scheduler.c | 201 right_ff->left_sibling = left_ff; in double_link() 215 double_link(child_ff->left_sibling, child_ff->right_sibling); in unlink_child() 220 parent_ff->rightmost_child = child_ff->left_sibling; in unlink_child() 222 child_ff->left_sibling = child_ff->right_sibling = 0; /* paranoia */ in unlink_child() 3358 if (ff->left_sibling) { in compute_left_ptrs_for_spawn_return() 3359 left_ptrs.map_ptr = &ff->left_sibling->right_reducer_map; in compute_left_ptrs_for_spawn_return() 3360 left_ptrs.exception_ptr = &ff->left_sibling->right_pending_exception; in compute_left_ptrs_for_spawn_return() 3424 if (child_ff->left_sibling || parent_ff->fiber_child) { in finish_spawn_return_on_user_stack()
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libcilkrts/runtime/ |
H A D | full_frame.h | 216 full_frame *left_sibling; member
|
H A D | full_frame.c | 61 ff->left_sibling = ff->right_sibling = 0; in __cilkrts_make_full_frame()
|
H A D | scheduler.c | 201 right_ff->left_sibling = left_ff; in double_link() 215 double_link(child_ff->left_sibling, child_ff->right_sibling); in unlink_child() 220 parent_ff->rightmost_child = child_ff->left_sibling; in unlink_child() 222 child_ff->left_sibling = child_ff->right_sibling = 0; /* paranoia */ in unlink_child() 3358 if (ff->left_sibling) { in compute_left_ptrs_for_spawn_return() 3359 left_ptrs.map_ptr = &ff->left_sibling->right_reducer_map; in compute_left_ptrs_for_spawn_return() 3360 left_ptrs.exception_ptr = &ff->left_sibling->right_pending_exception; in compute_left_ptrs_for_spawn_return() 3424 if (child_ff->left_sibling || parent_ff->fiber_child) { in finish_spawn_return_on_user_stack()
|
/dports/lang/gnat_util/gcc-6-20180516/libcilkrts/runtime/ |
H A D | full_frame.h | 216 full_frame *left_sibling; member
|
H A D | full_frame.c | 61 ff->left_sibling = ff->right_sibling = 0; in __cilkrts_make_full_frame()
|
H A D | scheduler.c | 201 right_ff->left_sibling = left_ff; in double_link() 215 double_link(child_ff->left_sibling, child_ff->right_sibling); in unlink_child() 220 parent_ff->rightmost_child = child_ff->left_sibling; in unlink_child() 222 child_ff->left_sibling = child_ff->right_sibling = 0; /* paranoia */ in unlink_child() 3358 if (ff->left_sibling) { in compute_left_ptrs_for_spawn_return() 3359 left_ptrs.map_ptr = &ff->left_sibling->right_reducer_map; in compute_left_ptrs_for_spawn_return() 3360 left_ptrs.exception_ptr = &ff->left_sibling->right_pending_exception; in compute_left_ptrs_for_spawn_return() 3424 if (child_ff->left_sibling || parent_ff->fiber_child) { in finish_spawn_return_on_user_stack()
|
/dports/science/py-scipy/scipy-1.7.1/scipy/sparse/csgraph/ |
H A D | _shortest_path.pyx | 1440 FibonacciNode* left_sibling 1457 node.left_sibling = NULL 1473 while(temp.left_sibling): 1474 temp = temp.left_sibling 1490 new_child.left_sibling = NULL 1500 new_sibling.left_sibling = temp 1511 if node.left_sibling: 1512 node.parent.children = node.left_sibling 1518 if node.left_sibling: 1521 node.right_sibling.left_sibling = node.left_sibling [all …]
|
/dports/databases/p5-DBIx-Class-Tree-NestedSet/DBIx-Class-Tree-NestedSet-0.10/lib/DBIx/Class/Tree/ |
H A D | NestedSet.pm | 609 my $previous = $self->left_sibling; 743 sub left_sibling { subroutine 761 *previous_sibling = \&left_sibling;
|
/dports/textproc/py-nltk/nltk-3.4.1/nltk/test/ |
H A D | tree.doctest | 330 `parent_index()`, `left_sibling()`, `right_sibling()`, `root()`, and 387 The methods `left_sibling()` and `right_sibling()` can be used to get a 393 ... print(' Left Sibling = %s' % subtree.left_sibling()) 449 above (`parent()`, `parent_index()`, `left_sibling()`, `right_sibling()`, 461 >>> print(dog.parent(), dog.parent_index(), dog.left_sibling()) 474 >>> print(cat.left_sibling()) 507 ... assert ptree.left_sibling() is ptree.parent()[i-1] 519 ... assert ptree.left_sibling() is None 531 ... assert child.left_sibling() is None 533 ... assert child.left_sibling() is ptree[i-1]
|
/dports/audio/ardour6/Ardour-6.8.0/libs/ardour/ardour/ |
H A D | export_multiplication.h | 40 void add_child (GraphNode * child, GraphNode * left_sibling);
|
/dports/www/py-dj32-django-mptt/django-mptt-0.13.4/mptt/ |
H A D | managers.py | 976 left_sibling = target.get_previous_sibling() 977 if node == left_sibling: 979 new_tree_id = getattr(left_sibling, self.tree_id_attr)
|
/dports/www/py-django-mptt/django-mptt-0.13.4/mptt/ |
H A D | managers.py | 976 left_sibling = target.get_previous_sibling() 977 if node == left_sibling: 979 new_tree_id = getattr(left_sibling, self.tree_id_attr)
|
/dports/textproc/py-nltk/nltk-3.4.1/nltk/ |
H A D | tgrep.py | 609 and bool(n.left_sibling()) 610 and predicate(n.left_sibling(), m, l)
|