Lines Matching refs:hi
1246 * loInclusive) and (toEnd, hi, hiInclusive). If fromStart is
1252 final K lo, hi;
1258 boolean toEnd, K hi, boolean hiInclusive) {
1260 if (m.compare(lo, hi) > 0)
1266 m.compare(hi, hi);
1274 this.hi = hi;
1291 int c = m.compare(key, hi);
1304 && (toEnd || m.compare(hi, key) >= 0);
1328 (hiInclusive ? m.getFloorEntry(hi) :
1329 m.getLowerEntry(hi)));
1364 m.getHigherEntry(hi) :
1365 m.getCeilingEntry(hi)));
1698 boolean toEnd, K hi, boolean hiInclusive) {
1699 super(m, fromStart, lo, loInclusive, toEnd, hi, hiInclusive);
1730 toEnd, hi, hiInclusive);
1739 toEnd, hi, hiInclusive));
1776 boolean toEnd, K hi, boolean hiInclusive) {
1777 super(m, fromStart, lo, loInclusive, toEnd, hi, hiInclusive);
1803 toEnd, hi, hiInclusive);
1820 toEnd, hi, hiInclusive));
2357 * @param hi the last element index of this subtree. Initial should be
2362 private final Entry<K,V> buildFromSorted(int level, int lo, int hi,
2374 * The lo and hi arguments are the minimum and maximum
2380 if (hi < lo) return null;
2382 int mid = (lo + hi) >>> 1;
2417 if (mid < hi) {
2418 Entry<K,V> right = buildFromSorted(level+1, mid+1, hi, redLevel,