HomeSort by: relevance | last modified time | path
    Searched refs:leftmost (Results 1 - 10 of 10) sorted by relevancy

  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
erase_fn_imps.hpp 133 node_pointer p_target_r = leftmost(p_r);
153 leftmost(node_pointer p_nd) function in class:PB_DS_CLASS_C_DEC
split_join_fn_imps.hpp 57 node_pointer p_target_r = other.leftmost(other.m_p_head);
splay_tree_.hpp 250 leftmost(node_pointer);
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
erase_fn_imps.hpp 133 node_pointer p_target_r = leftmost(p_r);
153 leftmost(node_pointer p_nd) function in class:PB_DS_CLASS_C_DEC
split_join_fn_imps.hpp 57 node_pointer p_target_r = other.leftmost(other.m_p_head);
splay_tree_.hpp 250 leftmost(node_pointer);
  /src/external/public-domain/xz/dist/src/liblzma/common/
index.c 50 /// Leftmost node. Since the tree will be filled sequentially,
53 index_tree_node *leftmost; member in struct:__anon350
185 tree->leftmost = NULL;
241 tree->leftmost = node;
320 assert(tree->leftmost == NULL
321 || tree->leftmost->uncompressed_base == 0);
856 if (s->groups.leftmost == &g->node) {
858 s->groups.leftmost = &newg->node;
924 if (src->groups.leftmost == NULL)
946 const index_group *srcg = (const index_group *)(src->groups.leftmost);
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/
drm_mm.c 191 bool leftmost; local
208 leftmost = false;
212 leftmost = true;
224 leftmost = false;
229 rb_insert_augmented_cached(&node->rb, &mm->interval_tree, leftmost,
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/
package.d 3508 // Find the leftmost child in the right subtree
3509 auto leftmost = n.right;
3511 while (leftmost.left)
3513 leftmostReferrer = &leftmost.left;
3514 leftmost = leftmost.left;
3516 // Unlink leftmost from there
3517 *leftmostReferrer = leftmost.right;
3518 // Link leftmost in lieu of n
3519 leftmost.left = n.left
    [all...]
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/container/
rbtree.d 559 * Return the leftmost descendant of this node.
561 @property inout(RBNode)* leftmost() inout return
596 return n.right.leftmost;
602 * You should never call this on the leftmost node of the tree as it is
651 static assert(is(typeof(n.leftmost)));
1891 _begin = end.leftmost;

Completed in 50 milliseconds