nl.topicus.jdbc.shaded.com.google.common.collect.ComparisonChain Maven / Gradle / Ivy
Show all versions of spanner-jdbc Show documentation
/*
* Copyright (C) 2009 The Guava Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in nl.topicus.jdbc.shaded.com.liance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.nl.topicus.jdbc.shaded.org.licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package nl.topicus.jdbc.shaded.com.google.nl.topicus.jdbc.shaded.com.on.collect;
import nl.topicus.jdbc.shaded.com.google.nl.topicus.jdbc.shaded.com.on.annotations.GwtCompatible;
import nl.topicus.jdbc.shaded.com.google.nl.topicus.jdbc.shaded.com.on.primitives.Booleans;
import nl.topicus.jdbc.shaded.com.google.nl.topicus.jdbc.shaded.com.on.primitives.Ints;
import nl.topicus.jdbc.shaded.com.google.nl.topicus.jdbc.shaded.com.on.primitives.Longs;
import java.util.Comparator;
import nl.topicus.jdbc.shaded.javax.annotation.Nullable;
/**
* A utility for performing a chained nl.topicus.jdbc.shaded.com.arison statement. For example:
* {@code
*
* public int nl.topicus.jdbc.shaded.com.areTo(Foo that) {
* return ComparisonChain.start()
* .nl.topicus.jdbc.shaded.com.are(this.aString, that.aString)
* .nl.topicus.jdbc.shaded.com.are(this.anInt, that.anInt)
* .nl.topicus.jdbc.shaded.com.are(this.anEnum, that.anEnum, Ordering.natural().nullsLast())
* .result();
* }}
*
* The value of this expression will have the same sign as the first
* nonzero nl.topicus.jdbc.shaded.com.arison result in the chain, or will be zero if every
* nl.topicus.jdbc.shaded.com.arison result was zero.
*
*
Note: {@code ComparisonChain} instances are immutable. For
* this utility to work correctly, calls must be chained as illustrated above.
*
*
Performance note: Even though the {@code ComparisonChain} caller always
* invokes its {@code nl.topicus.jdbc.shaded.com.are} methods unconditionally, the {@code
* ComparisonChain} implementation stops calling its inputs' {@link
* Comparable#nl.topicus.jdbc.shaded.com.areTo nl.topicus.jdbc.shaded.com.areTo} and {@link Comparator#nl.topicus.jdbc.shaded.com.are nl.topicus.jdbc.shaded.com.are}
* methods as soon as one of them returns a nonzero result. This optimization is
* typically important only in the presence of expensive {@code nl.topicus.jdbc.shaded.com.areTo} and
* {@code nl.topicus.jdbc.shaded.com.are} implementations.
*
*
See the Guava User Guide article on
* {@code ComparisonChain}.
*
* @author Mark Davis
* @author Kevin Bourrillion
* @since 2.0
*/
@GwtCompatible
public abstract class ComparisonChain {
private ComparisonChain() {}
/**
* Begins a new chained nl.topicus.jdbc.shaded.com.arison statement. See example in the class
* documentation.
*/
public static ComparisonChain start() {
return ACTIVE;
}
private static final ComparisonChain ACTIVE =
new ComparisonChain() {
@SuppressWarnings("unchecked")
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(Comparable left, Comparable right) {
return classify(left.nl.topicus.jdbc.shaded.com.areTo(right));
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(
@Nullable T left, @Nullable T right, Comparator nl.topicus.jdbc.shaded.com.arator) {
return classify(nl.topicus.jdbc.shaded.com.arator.nl.topicus.jdbc.shaded.com.are(left, right));
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(int left, int right) {
return classify(Ints.nl.topicus.jdbc.shaded.com.are(left, right));
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(long left, long right) {
return classify(Longs.nl.topicus.jdbc.shaded.com.are(left, right));
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(float left, float right) {
return classify(Float.nl.topicus.jdbc.shaded.com.are(left, right));
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(double left, double right) {
return classify(Double.nl.topicus.jdbc.shaded.com.are(left, right));
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.areTrueFirst(boolean left, boolean right) {
return classify(Booleans.nl.topicus.jdbc.shaded.com.are(right, left)); // reversed
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.areFalseFirst(boolean left, boolean right) {
return classify(Booleans.nl.topicus.jdbc.shaded.com.are(left, right));
}
ComparisonChain classify(int result) {
return (result < 0) ? LESS : (result > 0) ? GREATER : ACTIVE;
}
@Override
public int result() {
return 0;
}
};
private static final ComparisonChain LESS = new InactiveComparisonChain(-1);
private static final ComparisonChain GREATER = new InactiveComparisonChain(1);
private static final class InactiveComparisonChain extends ComparisonChain {
final int result;
InactiveComparisonChain(int result) {
this.result = result;
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(@Nullable Comparable left, @Nullable Comparable right) {
return this;
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(
@Nullable T left, @Nullable T right, @Nullable Comparator nl.topicus.jdbc.shaded.com.arator) {
return this;
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(int left, int right) {
return this;
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(long left, long right) {
return this;
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(float left, float right) {
return this;
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.are(double left, double right) {
return this;
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.areTrueFirst(boolean left, boolean right) {
return this;
}
@Override
public ComparisonChain nl.topicus.jdbc.shaded.com.areFalseFirst(boolean left, boolean right) {
return this;
}
@Override
public int result() {
return result;
}
}
/**
* Compares two nl.topicus.jdbc.shaded.com.arable objects as specified by {@link
* Comparable#nl.topicus.jdbc.shaded.com.areTo}, if the result of this nl.topicus.jdbc.shaded.com.arison chain
* has not already been determined.
*/
public abstract ComparisonChain nl.topicus.jdbc.shaded.com.are(Comparable left, Comparable right);
/**
* Compares two objects using a nl.topicus.jdbc.shaded.com.arator, if the result of this
* nl.topicus.jdbc.shaded.com.arison chain has not already been determined.
*/
public abstract ComparisonChain nl.topicus.jdbc.shaded.com.are(
@Nullable T left, @Nullable T right, Comparator nl.topicus.jdbc.shaded.com.arator);
/**
* Compares two {@code int} values as specified by {@link Ints#nl.topicus.jdbc.shaded.com.are},
* if the result of this nl.topicus.jdbc.shaded.com.arison chain has not already been
* determined.
*/
public abstract ComparisonChain nl.topicus.jdbc.shaded.com.are(int left, int right);
/**
* Compares two {@code long} values as specified by {@link Longs#nl.topicus.jdbc.shaded.com.are},
* if the result of this nl.topicus.jdbc.shaded.com.arison chain has not already been
* determined.
*/
public abstract ComparisonChain nl.topicus.jdbc.shaded.com.are(long left, long right);
/**
* Compares two {@code float} values as specified by {@link
* Float#nl.topicus.jdbc.shaded.com.are}, if the result of this nl.topicus.jdbc.shaded.com.arison chain has not
* already been determined.
*/
public abstract ComparisonChain nl.topicus.jdbc.shaded.com.are(float left, float right);
/**
* Compares two {@code double} values as specified by {@link
* Double#nl.topicus.jdbc.shaded.com.are}, if the result of this nl.topicus.jdbc.shaded.com.arison chain has not
* already been determined.
*/
public abstract ComparisonChain nl.topicus.jdbc.shaded.com.are(double left, double right);
/**
* Discouraged synonym for {@link #nl.topicus.jdbc.shaded.com.areFalseFirst}.
*
* @deprecated Use {@link #nl.topicus.jdbc.shaded.com.areFalseFirst}; or, if the parameters passed
* are being either negated or reversed, undo the negation or reversal and
* use {@link #nl.topicus.jdbc.shaded.com.areTrueFirst}.
* @since 19.0
*/
@Deprecated
public final ComparisonChain nl.topicus.jdbc.shaded.com.are(Boolean left, Boolean right) {
return nl.topicus.jdbc.shaded.com.areFalseFirst(left, right);
}
/**
* Compares two {@code boolean} values, considering {@code true} to be less
* than {@code false}, if the result of this nl.topicus.jdbc.shaded.com.arison chain has not
* already been determined.
*
* @since 12.0
*/
public abstract ComparisonChain nl.topicus.jdbc.shaded.com.areTrueFirst(boolean left, boolean right);
/**
* Compares two {@code boolean} values, considering {@code false} to be less
* than {@code true}, if the result of this nl.topicus.jdbc.shaded.com.arison chain has not
* already been determined.
*
* @since 12.0 (present as {@code nl.topicus.jdbc.shaded.com.are} since 2.0)
*/
public abstract ComparisonChain nl.topicus.jdbc.shaded.com.areFalseFirst(boolean left, boolean right);
/**
* Ends this nl.topicus.jdbc.shaded.com.arison chain and returns its result: a value having the
* same sign as the first nonzero nl.topicus.jdbc.shaded.com.arison result in the chain, or zero if
* every result was zero.
*/
public abstract int result();
}