Home
last modified time | relevance | path

Searched refs:byValue (Results 1 – 4 of 4) sorted by relevance

/external/cldr/tools/java/org/unicode/cldr/util/
DCounter.java150 Comparator<T> byValue; field in Counter.EntryComparator
152 public EntryComparator(boolean ascending, Comparator<T> byValue) { in EntryComparator() argument
154 this.byValue = byValue; in EntryComparator()
160 if (byValue != null) { in compare()
161 return byValue.compare(o1.value, o2.value); in compare()
171 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) { in getKeysetSortedByCount() argument
172 Set<Entry<T>> count_key = new TreeSet<Entry<T>>(new EntryComparator<T>(ascending, byValue)); in getKeysetSortedByCount()
184 public Set<Row.R2<Long, T>> getEntrySetSortedByCount(boolean ascending, Comparator<T> byValue) { in getEntrySetSortedByCount() argument
185 Set<Entry<T>> count_key = new TreeSet<Entry<T>>(new EntryComparator<T>(ascending, byValue)); in getEntrySetSortedByCount()
DCounter2.java108 Comparator<T> byValue; field in Counter2.EntryComparator
110 public EntryComparator(boolean ascending, Comparator<T> byValue) { in EntryComparator() argument
112 this.byValue = byValue; in EntryComparator()
120 if (byValue != null) { in compare()
121 return byValue.compare(o1.value, o2.value); in compare()
131 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) { in getKeysetSortedByCount() argument
132 Set<Entry<T>> count_key = new TreeSet<Entry<T>>(new EntryComparator<T>(ascending, byValue)); in getKeysetSortedByCount()
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/
DCounter.java114 Comparator<T> byValue; field in Counter.EntryComparator
116 public EntryComparator(boolean ascending, Comparator<T> byValue) { in EntryComparator() argument
118 this.byValue = byValue; in EntryComparator()
123 if (byValue != null) { in compare()
124 return byValue.compare(o1.value, o2.value); in compare()
134 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) { in getKeysetSortedByCount() argument
135 Set<Entry<T>> count_key = new TreeSet<Entry<T>>(new EntryComparator<T>(ascending, byValue)); in getKeysetSortedByCount()
/external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
DCounter.java111 Comparator<T> byValue; field in Counter.EntryComparator
113 public EntryComparator(boolean ascending, Comparator<T> byValue) { in EntryComparator() argument
115 this.byValue = byValue; in EntryComparator()
120 if (byValue != null) { in compare()
121 return byValue.compare(o1.value, o2.value); in compare()
131 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) { in getKeysetSortedByCount() argument
132 Set<Entry<T>> count_key = new TreeSet<Entry<T>>(new EntryComparator<T>(ascending, byValue)); in getKeysetSortedByCount()