Lines Matching refs:lbound
146 * For those not familiar with binary search: lbound is the leftmost item
148 * the item halfway between lbound and rbound, and that tells us either
149 * that we can increase lbound, or decrease rbound, or that we have found it,
150 * or if lbound <= rbound that there are no possible items, and we have not
169 int rbound, lbound, j;
171 for (j = ((rbound = num - 1) + (lbound = 0)) / 2;
172 lbound <= rbound; j = (rbound + lbound) / 2)
177 lbound = j + 1;
191 *pos = lbound;