Lines Matching defs:n_lbound
138 * For those not familiar with binary search: n_lbound is the leftmost
140 * We examine the item halfway between n_lbound and n_rbound, and that
141 * tells us either that we can increase n_lbound, or decrease n_rbound,
142 * or that we have found it, or if n_lbound <= n_rbound that there are
159 int n_rbound, n_lbound, n_j;
161 for (n_j = ((n_rbound = p_n_num - 1) + (n_lbound = 0)) / 2;
162 n_lbound <= n_rbound; n_j = (n_rbound + n_lbound) / 2) {
167 n_lbound = n_j + 1;
182 *p_n_pos = n_lbound;