util/concurrent/ConcurrentSkipListMap.java

1215     private static final int LT = 2;
1216     private static final int GT = 0; // Actually checked as !LT
1221      * @param rel the relation -- OR'ed combination of EQ, LT, GT
1231                     return ((rel & LT) == 0 || b.isBaseHeader()) ? null : b;
1243                     (c <  0 && (rel & LT) == 0))
1245                 if ( c <= 0 && (rel & LT) != 0)
1256      * @param rel the relation -- OR'ed combination of EQ, LT, GT
2148         return getNear(key, LT);
2156         Node<K,V> n = findNear(key, LT, comparator);
2171         return getNear(key, LT|EQ);
2180         Node<K,V> n = findNear(key, LT|EQ, comparator);
2694                 return m.findNear(hi, LT|EQ, cmp);
2696                 return m.findNear(hi, LT, cmp);
2785                 if ((rel & LT) == 0)
2786                     rel |= LT;
2788                     rel &= ~LT;
2791                 return ((rel & LT) != 0) ? null : lowestEntry();
2793                 return ((rel & LT) != 0) ? highestEntry() : null;
2809                 if ((rel & LT) == 0)
2810                     rel |= LT;
2812                     rel &= ~LT;
2815                 if ((rel & LT) == 0) {
2823                 if ((rel & LT) != 0) {
3025             return getNearEntry(key, LT);
3029             return getNearKey(key, LT);
3033             return getNearEntry(key, LT|EQ);
3037             return getNearKey(key, LT|EQ);
3169                     next = m.findNear(lastReturned.key, LT, cmp);