Searched refs:leftmost (Results 1 – 14 of 14) sorted by relevance
53 index_tree_node *leftmost; member185 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()1131 stream->groups.leftmost); in lzma_index_iter_next()1179 && stream->groups.leftmost == NULL); in lzma_index_iter_next()[all …]
32 leftmost longest match and submatches in one pass over the input34 a leftmost match and longest match is found.42 the leftmost longest match and submatches. Portions of the50 * Finds the leftmost and longest match and submatches in one pass
131 node_pointer p_target_r = leftmost(p_r); in erase_node()151 leftmost(node_pointer p_nd) in leftmost() function in PB_DS_CLASS_C_DEC
55 node_pointer p_target_r = other.leftmost(other.m_p_head); in join()
250 leftmost(node_pointer);
3 ?E aa* xaxaax (1,2) POSITION=leftmost
100 #define rb_insert_color_cached(node, root, leftmost) \ argument
451 the lowest numbered branch or call will correspond to the leftmost construct
117 # coding indicated by setting the high-order bit of the leftmost byte
13281 # 9 corresponds to the leftmost touch target on the screen,13314 # Function key 9 corresponds to the leftmost touch target on the screen,
105303 leftmost