/guava/guava/src/com/google/common/collect/Collections2.java
r = -3;
r = 0;
int n = 1; int r = 1; while (n < sortedInputList.size()) { int comparison = comparator.compare(sortedInputList.get(n - 1), sortedInputList.get(n)); if (comparison < 0) { permutations = IntMath.saturatedMultiply(permutations, IntMath.binomial(n, r)); <extra_id_0> if (permutations == Integer.MAX_VALUE) { return Integer.MAX_VALUE; } } n++; r++;