Home
last modified time | relevance | path

Searched refs:leftmost (Results 1 – 25 of 83) sorted by relevance

1234

/netbsd-src/external/public-domain/xz/dist/src/liblzma/common/
H A Dindex.c53 index_tree_node *leftmost; member
185 tree->leftmost = NULL; in index_tree_init()
241 tree->leftmost = node; in index_tree_append()
320 assert(tree->leftmost == NULL in index_tree_locate()
321 || tree->leftmost->uncompressed_base == 0); in index_tree_locate()
822 if (s->groups.leftmost == &g->node) { in lzma_index_cat()
824 s->groups.leftmost = &newg->node; in lzma_index_cat()
885 if (src->groups.leftmost == NULL) in index_dup_stream()
907 const index_group *srcg = (const index_group *)(src->groups.leftmost); in index_dup_stream()
941 = (const index_stream *)(src->streams.leftmost); in lzma_index_dup()
[all …]
/netbsd-src/external/bsd/tre/dist/lib/
H A DREADME32 leftmost longest match and submatches in one pass over the input
34 a leftmost match and longest match is found.
42 the leftmost longest match and submatches. Portions of the
50 * Finds the leftmost and longest match and submatches in one pass
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
H A Derase_fn_imps.hpp133 node_pointer p_target_r = leftmost(p_r); in erase_node()
153 leftmost(node_pointer p_nd) in leftmost() function in PB_DS_CLASS_C_DEC
H A Dsplit_join_fn_imps.hpp57 node_pointer p_target_r = other.leftmost(other.m_p_head); in join()
H A Dsplay_tree_.hpp250 leftmost(node_pointer);
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
H A Derase_fn_imps.hpp133 node_pointer p_target_r = leftmost(p_r); in erase_node()
153 leftmost(node_pointer p_nd) in leftmost() function in PB_DS_CLASS_C_DEC
H A Dsplit_join_fn_imps.hpp57 node_pointer p_target_r = other.leftmost(other.m_p_head); in join()
H A Dsplay_tree_.hpp250 leftmost(node_pointer);
/netbsd-src/sys/external/bsd/drm2/dist/drm/
H A Ddrm_mm.c191 bool leftmost; in drm_mm_interval_tree_add_node() local
208 leftmost = false; in drm_mm_interval_tree_add_node()
212 leftmost = true; in drm_mm_interval_tree_add_node()
224 leftmost = false; in drm_mm_interval_tree_add_node()
229 rb_insert_augmented_cached(&node->rb, &mm->interval_tree, leftmost, in drm_mm_interval_tree_add_node()
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/
H A Dpackage.d2696 auto leftmost = n.right;
2698 while (leftmost.left)
2700 leftmostReferrer = &leftmost.left;
2701 leftmost = leftmost.left;
2704 *leftmostReferrer = leftmost.right;
2706 leftmost.left = n.left;
2707 leftmost.right = n.right;
2708 *referrer = leftmost;
/netbsd-src/tests/lib/libc/regex/data/att/
H A Dcategorization.dat3 ?E aa* xaxaax (1,2) POSITION=leftmost
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/experimental/allocator/
H A Dpackage.d3509 auto leftmost = n.right; in EmbeddedTree() local
3511 while (leftmost.left) in EmbeddedTree()
3513 leftmostReferrer = &leftmost.left; in EmbeddedTree()
3514 leftmost = leftmost.left; in EmbeddedTree()
3517 *leftmostReferrer = leftmost.right; in EmbeddedTree()
3519 leftmost.left = n.left; in EmbeddedTree()
3520 leftmost.right = n.right; in EmbeddedTree()
3521 *referrer = leftmost; in EmbeddedTree()
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/container/
H A Drbtree.d554 @property inout(RBNode)* leftmost() inout in RBNode()
589 return n.right.leftmost; in RBNode()
644 static assert(is(typeof(n.leftmost)));
1750 _begin = end.leftmost; in this()
/netbsd-src/external/bsd/unbound/dist/pythonmod/doc/examples/
H A Dexample0.rst15 As soon as the DNS query arrives, Unbound calls modules starting from leftmost - the validator *(it…
/netbsd-src/crypto/external/bsd/openssl/dist/doc/man3/
H A DOPENSSL_s390xcap.pod61 column are consistent with [1], that is, 0 denotes the leftmost bit and
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/container/
H A Drbtree.d561 @property inout(RBNode)* leftmost() inout return in RBNode()
596 return n.right.leftmost; in RBNode()
651 static assert(is(typeof(n.leftmost)));
1891 _begin = end.leftmost;
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Lanai/
H A DLanaiInstrInfo.td142 // bits set and the leftmost 16 bits 1's.
150 // i32hi16 predicate - true if the 32-bit immediate has only leftmost 16
159 // i32lo16 predicate - true if the 32-bit immediate has the leftmost 16
/netbsd-src/external/gpl2/groff/dist/doc/
H A Dgroff-2138 Draw a circle with a diameter of D with the leftmost point at
148 diameter of Y with the leftmost point at the current position.
2757 (integer in basic units `u') with leftmost point at the current
2765 leftmost point at the current position; then move the current
2771 units `u') with the leftmost point at the current position; then
2778 leftmost point at current position; then move to the rightmost
/netbsd-src/external/gpl3/gcc.old/dist/gcc/d/
H A Dgdc.texi374 imported module matches all or the leftmost part of @var{module}, the file
/netbsd-src/external/gpl3/gcc.old/dist/gcc/config/rs6000/
H A Dvsx.md1300 /* 2 is leftmost element in register */
1350 /* 3 is leftmost element in register */
1450 /* 2 is leftmost element in register */
1508 /* 3 is leftmost element in register */
/netbsd-src/regress/lib/libc/ieeefp/testfloat/notes/
H A Dtestfloat.txt396 leftmost column, and any subsequent ``continuation'' lines are indented with
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/
H A Dpackage.d963 Find the first (leftmost) slice of the $(D input) that
/netbsd-src/external/gpl3/gcc/dist/gcc/d/
H A Dgdc.texi477 imported module matches all or the leftmost part of @var{module}, the file
/netbsd-src/external/gpl3/gcc/dist/gcc/config/rs6000/
H A Dvsx.md1403 /* 2 is leftmost element in register */
1453 /* 3 is leftmost element in register */
1553 /* 2 is leftmost element in register */
1611 /* 3 is leftmost element in register */
/netbsd-src/external/gpl3/gcc/dist/gcc/doc/
H A Dgcov.texi796 the lowest numbered branch or call will correspond to the leftmost construct

1234