Searched refs:comparator (Results 1 - 25 of 175) sorted by relevance

1234567

/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DEmptyImmutableSortedSet.java27 EmptyImmutableSortedSet(Comparator<? super E> comparator) { argument
28 super(comparator);
H A DImmutableSortedSet.java63 Comparator<? super E> comparator) {
64 checkNotNull(comparator);
65 if (NATURAL_ORDER.equals(comparator)) {
68 return new EmptyImmutableSortedSet<E>(comparator);
124 Comparator<? super E> comparator, E... elements) {
128 return emptySet(comparator);
130 SortedSet<E> delegate = new TreeSet<E>(comparator);
160 Comparator<? super E> comparator, Iterable<? extends E> elements) {
161 checkNotNull(comparator);
162 return copyOfInternal(comparator, element
62 emptySet( Comparator<? super E> comparator) argument
123 ofInternal( Comparator<? super E> comparator, E... elements) argument
159 copyOf( Comparator<? super E> comparator, Iterable<? extends E> elements) argument
165 copyOf( Comparator<? super E> comparator, Collection<? extends E> elements) argument
171 copyOf( Comparator<? super E> comparator, Iterator<? extends E> elements) argument
186 copyOfInternal( Comparator<? super E> comparator, Iterable<? extends E> elements, boolean fromSortedSet) argument
207 copyOfInternal( Comparator<? super E> comparator, Iterator<? extends E> elements) argument
222 hasSameComparator( Iterable<?> elements, Comparator<?> comparator) argument
249 ImmutableSortedSet(Comparator<? super E> comparator) argument
258 public Comparator<? super E> comparator() { method in class:ImmutableSortedSet
370 orderedBy(Comparator<E> comparator) argument
383 private final Comparator<? super E> comparator; field in class:ImmutableSortedSet.Builder
385 Builder(Comparator<? super E> comparator) argument
[all...]
H A DImmutableSortedMap.java60 // The comparator used by this map. It's the same as that of sortedDelegate,
61 // except that when sortedDelegate's comparator is null, it points to a
63 private transient final Comparator<K> comparator; field in class:ImmutableSortedMap
65 // If map has a null comparator, the keys should have a natural ordering,
70 this.comparator = (delegate.comparator() == null)
71 ? NATURAL_ORDER : delegate.comparator();
76 Comparator<? super K> comparator,
78 checkNotNull(comparator);
79 SortedMap<K, V> delegate = Maps.newTreeMap(comparator);
75 create( Comparator<? super K> comparator, Entry<? extends K, ? extends V>... entries) argument
126 copyOf( Map<? extends K, ? extends V> map, Comparator<? super K> comparator) argument
141 copyOfInternal( Map<? extends K, ? extends V> map, Comparator<? super K> comparator) argument
186 orderedBy(Comparator<K> comparator) argument
195 private final Comparator<? super K> comparator; field in class:ImmutableSortedMap.Builder
197 Builder(Comparator<? super K> comparator) argument
244 public Comparator<? super K> comparator() { method in class:ImmutableSortedMap
314 emptyMap(Comparator<? super K> comparator) argument
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DComparatorOrdering.java30 /** An ordering for a pre-existing comparator. */
33 final Comparator<T> comparator; field in class:ComparatorOrdering
35 ComparatorOrdering(Comparator<T> comparator) { argument
36 this.comparator = checkNotNull(comparator);
40 return comparator.compare(a, b);
45 return Collections.binarySearch(sortedList, key, comparator);
51 Collections.sort(list, comparator);
61 return this.comparator.equals(that.comparator);
[all...]
H A DImmutableSortedSet.java40 * Some instances are ordered by an explicit comparator, while others follow the
61 * two elements are equivalent. Instead, with an explicit comparator, the
65 * {(x, y) | comparator.compare(x, y) == 0}}</pre>
104 Comparator<? super E> comparator) {
105 if (NATURAL_ORDER.equals(comparator)) {
108 return new EmptyImmutableSortedSet<E>(comparator);
217 * copy of a {@code SortedSet} that preserves the comparator, call {@link
252 * copy of a {@code SortedSet} that preserves the comparator, call
312 * @throws NullPointerException if {@code comparator} or any of
316 Comparator<? super E> comparator, Iterato
103 emptySet( Comparator<? super E> comparator) argument
315 copyOf( Comparator<? super E> comparator, Iterator<? extends E> elements) argument
334 copyOf( Comparator<? super E> comparator, Iterable<? extends E> elements) argument
358 copyOf( Comparator<? super E> comparator, Collection<? extends E> elements) argument
390 copyOfInternal( Comparator<? super E> comparator, Iterable<? extends E> elements) argument
409 copyOfInternal( Comparator<? super E> comparator, Iterator<? extends E> elements) argument
426 orderedBy(Comparator<E> comparator) argument
477 private final Comparator<? super E> comparator; field in class:ImmutableSortedSet.Builder
483 Builder(Comparator<? super E> comparator) argument
554 unsafeCompare( Comparator<?> comparator, Object a, Object b) argument
564 final transient Comparator<? super E> comparator; field in class:ImmutableSortedSet
566 ImmutableSortedSet(Comparator<? super E> comparator) argument
578 public Comparator<? super E> comparator() { method in class:ImmutableSortedSet
674 final Comparator<? super E> comparator; field in class:ImmutableSortedSet.SerializedForm
677 SerializedForm(Comparator<? super E> comparator, Object[] elements) argument
[all...]
H A DSortedIterables.java43 * to {@code comparator}.
45 public static boolean hasSameComparator(Comparator<?> comparator, Iterable<?> elements) { argument
46 checkNotNull(comparator);
51 comparator2 = sortedSet.comparator();
56 comparator2 = ((SortedIterable<?>) elements).comparator();
60 return comparator.equals(comparator2);
64 * Returns a sorted collection of the unique elements according to the specified comparator. Does
69 Comparator<? super E> comparator, Iterator<E> elements) {
70 SortedSet<E> sortedSet = Sets.newTreeSet(comparator);
76 * Returns a sorted collection of the unique elements according to the specified comparator
68 sortedUnique( Comparator<? super E> comparator, Iterator<E> elements) argument
80 sortedUnique( Comparator<? super E> comparator, Iterable<E> elements) argument
100 uniquifySortedArray( Comparator<? super E> comparator, E[] array) argument
122 sortedCounts( Comparator<? super E> comparator, Iterator<E> elements) argument
133 sortedCounts( Comparator<? super E> comparator, Iterable<E> elements) argument
[all...]
H A DImmutableSortedMultiset.java32 * are ordered by an explicit comparator, while others follow the natural sort ordering of their
50 * are equivalent. Instead, with an explicit comparator, the following relation determines whether
55 * {(x, y) | comparator.compare(x, y) == 0}}</pre>
181 * comparator, call {@link #copyOfSorted} instead. This method iterates over {@code elements} at
230 * @throws NullPointerException if {@code comparator} or any of {@code elements} is null
233 Comparator<? super E> comparator, Iterator<? extends E> elements) {
234 checkNotNull(comparator);
235 return copyOfInternal(comparator, elements);
246 * @throws NullPointerException if {@code comparator} or any of {@code elements} is null
249 Comparator<? super E> comparator, Iterabl
232 copyOf( Comparator<? super E> comparator, Iterator<? extends E> elements) argument
248 copyOf( Comparator<? super E> comparator, Iterable<? extends E> elements) argument
278 copyOfInternal( Comparator<? super E> comparator, Iterable<? extends E> iterable) argument
296 copyOfInternal( Comparator<? super E> comparator, Iterator<? extends E> iterator) argument
315 emptyMultiset(Comparator<? super E> comparator) argument
322 private final transient Comparator<? super E> comparator; field in class:ImmutableSortedMultiset
324 ImmutableSortedMultiset(Comparator<? super E> comparator) argument
329 public Comparator<? super E> comparator() { method in class:ImmutableSortedMultiset
419 orderedBy(Comparator<E> comparator) argument
467 private final Comparator<? super E> comparator; field in class:ImmutableSortedMultiset.Builder
473 Builder(Comparator<? super E> comparator) argument
574 Comparator comparator; field in class:ImmutableSortedMultiset.SerializedForm
[all...]
H A DGeneralRange.java32 * {@link Range}, this allows the use of an arbitrary comparator. This is designed for use in the
57 * Returns the whole range relative to the specified comparator.
59 static <T> GeneralRange<T> all(Comparator<? super T> comparator) { argument
60 return new GeneralRange<T>(comparator, false, null, OPEN, false, null, OPEN);
64 * Returns everything above the endpoint relative to the specified comparator, with the specified
67 static <T> GeneralRange<T> downTo(Comparator<? super T> comparator, @Nullable T endpoint, argument
69 return new GeneralRange<T>(comparator, true, endpoint, boundType, false, null, OPEN);
73 * Returns everything below the endpoint relative to the specified comparator, with the specified
76 static <T> GeneralRange<T> upTo(Comparator<? super T> comparator, @Nullable T endpoint, argument
78 return new GeneralRange<T>(comparator, fals
85 range(Comparator<? super T> comparator, @Nullable T lower, BoundType lowerType, @Nullable T upper, BoundType upperType) argument
90 private final Comparator<? super T> comparator; field in class:GeneralRange
100 GeneralRange(Comparator<? super T> comparator, boolean hasLowerBound, @Nullable T lowerEndpoint, BoundType lowerBoundType, boolean hasUpperBound, @Nullable T upperEndpoint, BoundType upperBoundType) argument
128 Comparator<? super T> comparator() { method in class:GeneralRange
[all...]
H A DImmutableSortedMap.java83 // unsafe, comparator() returns a comparator on the specified type
84 // TODO(kevinb): evaluate whether or not of().comparator() should return null
91 Comparator<? super K> comparator) {
92 if (NATURAL_ORDER.equals(comparator)) {
96 ImmutableList.<Entry<K, V>>of(), comparator);
189 * keys sorted by the provided comparator.
197 * comparator
200 Map<? extends K, ? extends V> map, Comparator<? super K> comparator) {
201 return copyOfInternal(map, checkNotNull(comparator));
90 emptyMap( Comparator<? super K> comparator) argument
199 copyOf( Map<? extends K, ? extends V> map, Comparator<? super K> comparator) argument
226 copyOfInternal( Map<? extends K, ? extends V> map, Comparator<? super K> comparator) argument
268 sortEntries( List<Entry<K, V>> entries, final Comparator<? super K> comparator) argument
280 validateEntries(List<Entry<K, V>> entries, Comparator<? super K> comparator) argument
314 orderedBy(Comparator<K> comparator) argument
352 private final Comparator<? super K> comparator; field in class:ImmutableSortedMap.Builder
358 Builder(Comparator<? super K> comparator) argument
414 private final transient Comparator<? super K> comparator; field in class:ImmutableSortedMap
416 ImmutableSortedMap( ImmutableList<Entry<K, V>> entries, Comparator<? super K> comparator) argument
619 public Comparator<? super K> comparator() { method in class:ImmutableSortedMap
747 private final Comparator<Object> comparator; field in class:ImmutableSortedMap.SerializedForm
[all...]
H A DSortedIterable.java34 Comparator<? super T> comparator(); method in interface:SortedIterable
38 * nondecreasing order according to the associated {@link #comparator}.
H A DSortedLists.java34 * <i>lesser</i> are considered to refer to the comparator on the elements, and the terms
56 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
66 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
74 int c = comparator.compare(list.get(middle), key);
90 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
99 int c = comparator.compare(list.get(middle), key);
116 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
117 return LAST_PRESENT.resultIndex(comparator, key, list, foundIndex) + 1;
127 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
128 return FIRST_PRESENT.resultIndex(comparator, ke
131 resultIndex( Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) argument
255 binarySearch(List<? extends E> list, @Nullable E key, Comparator<? super E> comparator, KeyPresentBehavior presentBehavior, KeyAbsentBehavior absentBehavior) argument
[all...]
H A DAbstractSortedMultiset.java36 final Comparator<? super E> comparator; field in class:AbstractSortedMultiset
44 AbstractSortedMultiset(Comparator<? super E> comparator) { argument
45 this.comparator = checkNotNull(comparator);
64 public Comparator<? super E> comparator() { method in class:AbstractSortedMultiset
65 return comparator;
H A DForwardingSortedMap.java43 * comparator of the map to test equality for both keys and values, unlike
65 public Comparator<? super K> comparator() { method in class:ForwardingSortedMap
66 return delegate().comparator();
97 Comparator<? super K> comparator = comparator();
98 if (comparator == null) {
101 return ((Comparator<Object>) comparator).compare(k1, k2);
/external/easymock/src/org/easymock/internal/matchers/
H A DCompare.java30 private Comparator<? super T> comparator; field in class:Compare
34 public Compare(T expected, Comparator<? super T> comparator, LogicalOperator result) { argument
36 this.comparator = comparator;
41 buffer.append(comparator + "(" + expected + ") " + operator.getSymbol()
50 return operator.matchResult(comparator.compare((T) actual, expected));
/external/replicaisland/src/com/replica/replicaisland/
H A DQuickSorter.java22 public void sort(Type[] array, int count, Comparator<Type> comparator) { argument
23 quicksort(array, 0, count - 1, comparator);
45 public void quicksort(Type[] a, int left, int right, Comparator<Type> comparator) { argument
47 int i = partition(a, left, right, comparator);
48 quicksort(a, left, i - 1, comparator);
49 quicksort(a, i + 1, right, comparator);
53 private int partition(Type[] a, int left, int right, Comparator<Type> comparator) { argument
57 while (comparator.compare(a[++i], a[right]) < 0) { // find item on left to swap
59 while (comparator.compare(a[right], a[--j]) < 0) { // find item on right to swap
H A DStandardSorter.java25 public void sort(Object[] array, int count, Comparator comparator) { argument
26 Arrays.sort(array, 0, count, comparator);
H A DSorter.java22 public abstract void sort(Type[] array, int count, Comparator<Type> comparator); argument
H A DShellSorter.java30 public void sort(Type[] array, int count, Comparator<Type> comparator) { argument
36 insertionSort(array, count, start, increment, comparator);
44 insertionSort(array, count, 0, 1, comparator );
59 Comparator<Type> comparator) {
67 int delta = comparator.compare(array[j], array[k]);
77 } while ( j != start && comparator.compare(array[k], temp) > 0 );
58 insertionSort(Type[] array, int count, int start, int increment, Comparator<Type> comparator) argument
H A DFixedSizeArray.java51 public FixedSizeArray(int size, Comparator<T> comparator) { argument
56 mComparator = comparator;
79 * Otherwise, the comparator set on this array (if any) will be used to find the object.
185 * binary search will be performed. If a comparator has been specified with setComparator(),
186 * it will be used to perform the search. If not, the default comparator for the object type
189 * performed. Otherwise, the comparator set on this array (if any) will be used to find the
198 final Comparator comparator = mComparator;
201 if (comparator != null) {
202 index = Arrays.binarySearch(contents, object, comparator);
214 if (comparator !
269 setComparator(Comparator<T> comparator) argument
[all...]
/external/emma/core/java12/com/vladium/emma/report/
H A DItemComparator.java45 final Comparator comparator = IItemAttribute.Factory.getAttribute (attributeID, unitsID).comparator ();
46 comparators [a >> 1] = attributeIDsWithDir [a + 1] < 0 ? new ReverseComparator (comparator) : comparator;
70 ReverseComparator (final Comparator comparator) argument
72 m_comparator = comparator;
/external/jmonkeyengine/engine/src/core/com/jme3/renderer/queue/
H A DGeometryList.java54 private GeometryComparator comparator; field in class:GeometryList
60 * @param comparator The comparator to use.
62 public GeometryList(GeometryComparator comparator) { argument
66 this.comparator = comparator;
76 this.comparator.setCamera(cam);
132 // sort the spatial list using the comparator
134 // SortUtil.qsort(geometries, 0, size, comparator);
135 // Arrays.sort(geometries, 0, size, comparator);
[all...]
/external/guava/guava-gwt/src/com/google/common/collect/
H A DEmptyImmutableSortedSet_CustomFieldSerializer.java43 Comparator<Object> comparator = (Comparator<Object>) reader.readObject();
52 ImmutableSortedSet.orderedBy(comparator).build();
57 writer.writeObject(instance.comparator());
H A DImmutableSortedMap_CustomFieldSerializer.java45 Comparator<Object> comparator = (Comparator<Object>) reader.readObject();
47 SortedMap<Object, Object> entries = new TreeMap<Object, Object>(comparator);
50 return ImmutableSortedMap.orderedBy(comparator).putAll(entries).build();
55 writer.writeObject(instance.comparator());
/external/junit/src/org/junit/internal/requests/
H A DSortingRequest.java14 public SortingRequest(Request request, Comparator<Description> comparator) { argument
16 fComparator= comparator;
/external/junit/src/org/junit/runner/manipulation/
H A DSorter.java24 * Creates a <code>Sorter</code> that uses <code>comparator</code>
26 * @param comparator the {@link Comparator} to use when sorting tests
28 public Sorter(Comparator<Description> comparator) { argument
29 fComparator= comparator;
33 * Sorts the test in <code>runner</code> using <code>comparator</code>

Completed in 425 milliseconds

1234567