Lines Matching refs:comparator
326 * handle infusing comparator-vs-comparable choice into search
327 * loops. Static method cpr(comparator, x, y) is used for all
328 * comparisons, which works well as long as the comparator
370 * The comparator used to maintain order in this map, or null if
375 final Comparator<? super K> comparator;
389 * (Note that comparator must be separately initialized.)
645 * Compares using comparator or natural ordering if null.
738 Comparator<? super K> cmp = comparator;
774 Comparator<? super K> cmp = comparator;
816 Comparator<? super K> cmp = comparator;
953 Comparator<? super K> cmp = comparator;
1125 findPredecessor(key, comparator);
1261 Comparator<? super K> cmp = comparator;
1279 this.comparator = null;
1285 * comparator.
1287 * @param comparator the comparator that will be used to order this map.
1291 public ConcurrentSkipListMap(Comparator<? super K> comparator) {
1292 this.comparator = comparator;
1308 this.comparator = null;
1318 * map, and whose comparator is to be used to sort this map
1323 this.comparator = m.comparator();
1808 * key order. The spliterator's comparator (see
1810 * the map's comparator (see {@link #comparator()}) is {@code null}.
1811 * Otherwise, the spliterator's comparator is the same as or imposes the
1812 * same total ordering as the map's comparator.
2021 public Comparator<? super K> comparator() {
2022 return comparator;
2133 Node<K,V> n = findNear(key, LT, comparator);
2157 Node<K,V> n = findNear(key, LT|EQ, comparator);
2179 Node<K,V> n = findNear(key, GT|EQ, comparator);
2203 Node<K,V> n = findNear(key, GT, comparator);
2372 public Comparator<? super K> comparator() { return m.comparator(); }
2595 Comparator<? super K> cmp = map.comparator;
2680 Comparator<? super K> cmp = m.comparator;
2692 Comparator<? super K> cmp = m.comparator;
2703 Comparator<? super K> cmp = m.comparator;
2715 Comparator<? super K> cmp = m.comparator;
2727 Comparator<? super K> cmp = m.comparator;
2742 Comparator<? super K> cmp = m.comparator;
2760 Comparator<? super K> cmp = m.comparator;
2784 Comparator<? super K> cmp = m.comparator;
2825 return inBounds(key, m.comparator) && m.containsKey(key);
2830 return (!inBounds(key, m.comparator)) ? null : m.get(key);
2834 checkKeyBounds(key, m.comparator);
2839 return (!inBounds(key, m.comparator)) ? null : m.remove(key);
2843 Comparator<? super K> cmp = m.comparator;
2855 Comparator<? super K> cmp = m.comparator;
2862 Comparator<? super K> cmp = m.comparator;
2874 Comparator<? super K> cmp = m.comparator;
2886 checkKeyBounds(key, m.comparator);
2891 return inBounds(key, m.comparator) && m.remove(key, value);
2895 checkKeyBounds(key, m.comparator);
2900 checkKeyBounds(key, m.comparator);
2906 public Comparator<? super K> comparator() {
2907 Comparator<? super K> cmp = m.comparator();
2920 Comparator<? super K> cmp = m.comparator;
3088 Comparator<? super K> cmp = m.comparator;
3121 Comparator<? super K> cmp = m.comparator;
3140 Comparator<? super K> cmp = m.comparator;
3211 return SubMap.this.comparator();
3305 final Comparator<? super K> comparator;
3310 CSLMSpliterator(Comparator<? super K> comparator, Index<K,V> row,
3312 this.comparator = comparator; this.row = row;
3321 KeySpliterator(Comparator<? super K> comparator, Index<K,V> row,
3323 super(comparator, row, origin, fence, est);
3328 Comparator<? super K> cmp = comparator;
3350 Comparator<? super K> cmp = comparator;
3365 Comparator<? super K> cmp = comparator;
3391 return comparator;
3396 Comparator<? super K> cmp = comparator;
3409 ValueSpliterator(Comparator<? super K> comparator, Index<K,V> row,
3411 super(comparator, row, origin, fence, est);
3416 Comparator<? super K> cmp = comparator;
3438 Comparator<? super K> cmp = comparator;
3455 Comparator<? super K> cmp = comparator;
3483 Comparator<? super K> cmp = comparator;
3496 EntrySpliterator(Comparator<? super K> comparator, Index<K,V> row,
3498 super(comparator, row, origin, fence, est);
3503 Comparator<? super K> cmp = comparator;
3525 Comparator<? super K> cmp = comparator;
3543 Comparator<? super K> cmp = comparator;
3571 // Adapt or create a key-based comparator
3572 if (comparator != null) {
3573 return Map.Entry.comparingByKey(comparator);
3587 Comparator<? super K> cmp = comparator;