Searched refs:ofs (Results 1 – 5 of 5) sorted by relevance
508 int ofs = 1; in gallopLeft()512 while (ofs < maxOfs && key.compareTo(a[base + hint + ofs]) > 0) { in gallopLeft()513 lastOfs = ofs; in gallopLeft()514 ofs = (ofs << 1) + 1; in gallopLeft()515 if (ofs <= 0) // int overflow in gallopLeft()516 ofs = maxOfs; in gallopLeft()518 if (ofs > maxOfs) in gallopLeft()519 ofs = maxOfs; in gallopLeft()523 ofs += hint; in gallopLeft()527 while (ofs < maxOfs && key.compareTo(a[base + hint - ofs]) <= 0) { in gallopLeft()[all …]
541 int ofs = 1; in gallopLeft()545 while (ofs < maxOfs && c.compare(key, a[base + hint + ofs]) > 0) { in gallopLeft()546 lastOfs = ofs; in gallopLeft()547 ofs = (ofs << 1) + 1; in gallopLeft()548 if (ofs <= 0) // int overflow in gallopLeft()549 ofs = maxOfs; in gallopLeft()551 if (ofs > maxOfs) in gallopLeft()552 ofs = maxOfs; in gallopLeft()556 ofs += hint; in gallopLeft()560 while (ofs < maxOfs && c.compare(key, a[base + hint - ofs]) <= 0) { in gallopLeft()[all …]
107 int ofs = input.arrayOffset(); in engineUpdate() local110 engineUpdate(b, ofs + pos, lim - pos); in engineUpdate()
111 int ofs = input.arrayOffset(); in engineUpdate() local114 engineUpdate(b, ofs + pos, lim - pos); in engineUpdate()
149 int ofs = input.arrayOffset(); in engineUpdate() local152 engineUpdate(b, ofs + pos, lim - pos); in engineUpdate()