001/* 002 * Copyright (C) 2016 The Guava Authors 003 * 004 * Licensed under the Apache License, Version 2.0 (the "License"); 005 * you may not use this file except in compliance with the License. 006 * You may obtain a copy of the License at 007 * 008 * http://www.apache.org/licenses/LICENSE-2.0 009 * 010 * Unless required by applicable law or agreed to in writing, software 011 * distributed under the License is distributed on an "AS IS" BASIS, 012 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 013 * See the License for the specific language governing permissions and 014 * limitations under the License. 015 */ 016 017package com.google.common.collect; 018 019import static com.google.common.base.Preconditions.checkNotNull; 020import static com.google.common.collect.CollectPreconditions.checkNonnegative; 021 022import com.google.common.annotations.GwtCompatible; 023import java.util.Comparator; 024import java.util.Iterator; 025import java.util.List; 026import java.util.stream.Collector; 027import org.checkerframework.checker.nullness.qual.Nullable; 028 029/** 030 * Provides static methods for working with {@link Comparator} instances. For many other helpful 031 * comparator utilities, see either {@code Comparator} itself (for Java 8+), or {@code 032 * com.google.common.collect.Ordering} (otherwise). 033 * 034 * <h3>Relationship to {@code Ordering}</h3> 035 * 036 * <p>In light of the significant enhancements to {@code Comparator} in Java 8, the overwhelming 037 * majority of usages of {@code Ordering} can be written using only built-in JDK APIs. This class is 038 * intended to "fill the gap" and provide those features of {@code Ordering} not already provided by 039 * the JDK. 040 * 041 * @since 21.0 042 * @author Louis Wasserman 043 */ 044@GwtCompatible 045@ElementTypesAreNonnullByDefault 046public final class Comparators { 047 private Comparators() {} 048 049 /** 050 * Returns a new comparator which sorts iterables by comparing corresponding elements pairwise 051 * until a nonzero result is found; imposes "dictionary order." If the end of one iterable is 052 * reached, but not the other, the shorter iterable is considered to be less than the longer one. 053 * For example, a lexicographical natural ordering over integers considers {@code [] < [1] < [1, 054 * 1] < [1, 2] < [2]}. 055 * 056 * <p>Note that {@code Collections.reverseOrder(lexicographical(comparator))} is not equivalent to 057 * {@code lexicographical(Collections.reverseOrder(comparator))} (consider how each would order 058 * {@code [1]} and {@code [1, 1]}). 059 */ 060 // Note: 90% of the time we don't add type parameters or wildcards that serve only to "tweak" the 061 // desired return type. However, *nested* generics introduce a special class of problems that we 062 // think tip it over into being worthwhile. 063 public static <T extends @Nullable Object, S extends T> Comparator<Iterable<S>> lexicographical( 064 Comparator<T> comparator) { 065 return new LexicographicalOrdering<S>(checkNotNull(comparator)); 066 } 067 068 /** 069 * Returns {@code true} if each element in {@code iterable} after the first is greater than or 070 * equal to the element that preceded it, according to the specified comparator. Note that this is 071 * always true when the iterable has fewer than two elements. 072 */ 073 public static <T extends @Nullable Object> boolean isInOrder( 074 Iterable<? extends T> iterable, Comparator<T> comparator) { 075 checkNotNull(comparator); 076 Iterator<? extends T> it = iterable.iterator(); 077 if (it.hasNext()) { 078 T prev = it.next(); 079 while (it.hasNext()) { 080 T next = it.next(); 081 if (comparator.compare(prev, next) > 0) { 082 return false; 083 } 084 prev = next; 085 } 086 } 087 return true; 088 } 089 090 /** 091 * Returns {@code true} if each element in {@code iterable} after the first is <i>strictly</i> 092 * greater than the element that preceded it, according to the specified comparator. Note that 093 * this is always true when the iterable has fewer than two elements. 094 */ 095 public static <T extends @Nullable Object> boolean isInStrictOrder( 096 Iterable<? extends T> iterable, Comparator<T> comparator) { 097 checkNotNull(comparator); 098 Iterator<? extends T> it = iterable.iterator(); 099 if (it.hasNext()) { 100 T prev = it.next(); 101 while (it.hasNext()) { 102 T next = it.next(); 103 if (comparator.compare(prev, next) >= 0) { 104 return false; 105 } 106 prev = next; 107 } 108 } 109 return true; 110 } 111 112 /** 113 * Returns a {@code Collector} that returns the {@code k} smallest (relative to the specified 114 * {@code Comparator}) input elements, in ascending order, as an unmodifiable {@code List}. Ties 115 * are broken arbitrarily. 116 * 117 * <p>For example: 118 * 119 * <pre>{@code 120 * Stream.of("foo", "quux", "banana", "elephant") 121 * .collect(least(2, comparingInt(String::length))) 122 * // returns {"foo", "quux"} 123 * }</pre> 124 * 125 * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log 126 * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n 127 * log n) time and O(n) space. 128 * 129 * @throws IllegalArgumentException if {@code k < 0} 130 */ 131 @SuppressWarnings({"AndroidJdkLibsChecker", "Java7ApiChecker"}) 132 @IgnoreJRERequirement // Users will use this only if they're already using streams. 133 static <T extends @Nullable Object> Collector<T, ?, List<T>> least( 134 int k, Comparator<? super T> comparator) { 135 checkNonnegative(k, "k"); 136 checkNotNull(comparator); 137 return Collector.of( 138 () -> TopKSelector.<T>least(k, comparator), 139 TopKSelector::offer, 140 TopKSelector::combine, 141 TopKSelector::topK, 142 Collector.Characteristics.UNORDERED); 143 } 144 145 /** 146 * Returns a {@code Collector} that returns the {@code k} greatest (relative to the specified 147 * {@code Comparator}) input elements, in descending order, as an unmodifiable {@code List}. Ties 148 * are broken arbitrarily. 149 * 150 * <p>For example: 151 * 152 * <pre>{@code 153 * Stream.of("foo", "quux", "banana", "elephant") 154 * .collect(greatest(2, comparingInt(String::length))) 155 * // returns {"elephant", "banana"} 156 * }</pre> 157 * 158 * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log 159 * k)), as opposed to e.g. {@code Stream.sorted(comparator.reversed()).limit(k)}, which currently 160 * takes O(n log n) time and O(n) space. 161 * 162 * @throws IllegalArgumentException if {@code k < 0} 163 */ 164 @SuppressWarnings({"AndroidJdkLibsChecker", "Java7ApiChecker"}) 165 @IgnoreJRERequirement // Users will use this only if they're already using streams. 166 static <T extends @Nullable Object> Collector<T, ?, List<T>> greatest( 167 int k, Comparator<? super T> comparator) { 168 return least(k, comparator.reversed()); 169 } 170 171 /** 172 * Returns the minimum of the two values. If the values compare as 0, the first is returned. 173 * 174 * <p>The recommended solution for finding the {@code minimum} of some values depends on the type 175 * of your data and the number of elements you have. Read more in the Guava User Guide article on 176 * <a href="https://github.com/google/guava/wiki/CollectionUtilitiesExplained#comparators">{@code 177 * Comparators}</a>. 178 * 179 * @param a first value to compare, returned if less than or equal to b. 180 * @param b second value to compare. 181 * @throws ClassCastException if the parameters are not <i>mutually comparable</i>. 182 * @since 30.0 183 */ 184 public static <T extends Comparable<? super T>> T min(T a, T b) { 185 return (a.compareTo(b) <= 0) ? a : b; 186 } 187 188 /** 189 * Returns the minimum of the two values, according to the given comparator. If the values compare 190 * as equal, the first is returned. 191 * 192 * <p>The recommended solution for finding the {@code minimum} of some values depends on the type 193 * of your data and the number of elements you have. Read more in the Guava User Guide article on 194 * <a href="https://github.com/google/guava/wiki/CollectionUtilitiesExplained#comparators">{@code 195 * Comparators}</a>. 196 * 197 * @param a first value to compare, returned if less than or equal to b 198 * @param b second value to compare. 199 * @throws ClassCastException if the parameters are not <i>mutually comparable</i> using the given 200 * comparator. 201 * @since 30.0 202 */ 203 @ParametricNullness 204 public static <T extends @Nullable Object> T min( 205 @ParametricNullness T a, @ParametricNullness T b, Comparator<T> comparator) { 206 return (comparator.compare(a, b) <= 0) ? a : b; 207 } 208 209 /** 210 * Returns the maximum of the two values. If the values compare as 0, the first is returned. 211 * 212 * <p>The recommended solution for finding the {@code maximum} of some values depends on the type 213 * of your data and the number of elements you have. Read more in the Guava User Guide article on 214 * <a href="https://github.com/google/guava/wiki/CollectionUtilitiesExplained#comparators">{@code 215 * Comparators}</a>. 216 * 217 * @param a first value to compare, returned if greater than or equal to b. 218 * @param b second value to compare. 219 * @throws ClassCastException if the parameters are not <i>mutually comparable</i>. 220 * @since 30.0 221 */ 222 public static <T extends Comparable<? super T>> T max(T a, T b) { 223 return (a.compareTo(b) >= 0) ? a : b; 224 } 225 226 /** 227 * Returns the maximum of the two values, according to the given comparator. If the values compare 228 * as equal, the first is returned. 229 * 230 * <p>The recommended solution for finding the {@code maximum} of some values depends on the type 231 * of your data and the number of elements you have. Read more in the Guava User Guide article on 232 * <a href="https://github.com/google/guava/wiki/CollectionUtilitiesExplained#comparators">{@code 233 * Comparators}</a>. 234 * 235 * @param a first value to compare, returned if greater than or equal to b. 236 * @param b second value to compare. 237 * @throws ClassCastException if the parameters are not <i>mutually comparable</i> using the given 238 * comparator. 239 * @since 30.0 240 */ 241 @ParametricNullness 242 public static <T extends @Nullable Object> T max( 243 @ParametricNullness T a, @ParametricNullness T b, Comparator<T> comparator) { 244 return (comparator.compare(a, b) >= 0) ? a : b; 245 } 246}