it.unimi.dsi.fastutil.shorts.ShortComparators Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of fastutil Show documentation
Show all versions of fastutil Show documentation
fastutil extends the Java Collections Framework by providing type-specific maps, sets, lists, and queues with a small memory footprint and fast access and insertion; it provides also big (64-bit) arrays, sets and lists, sorting algorithms, fast, practical I/O classes for binary and text files, and facilities for memory mapping large files. Note that if you have both this jar and fastutil-core.jar in your dependencies, fastutil-core.jar should be excluded.
/*
* Copyright (C) 2003-2022 Paolo Boldi and Sebastiano Vigna
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.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 it.unimi.dsi.fastutil.shorts;
import java.util.Comparator;
/**
* A class providing static methods and objects that do useful things with comparators.
*/
public final class ShortComparators {
private ShortComparators() {
}
/** A type-specific comparator mimicking the natural order. */
protected static class NaturalImplicitComparator implements ShortComparator, java.io.Serializable {
private static final long serialVersionUID = 1L;
@Override
public final int compare(final short a, final short b) {
return (Short.compare((a), (b)));
}
@Override
public ShortComparator reversed() {
return OPPOSITE_COMPARATOR;
}
private Object readResolve() {
return NATURAL_COMPARATOR;
}
};
public static final ShortComparator NATURAL_COMPARATOR = new NaturalImplicitComparator();
/** A type-specific comparator mimicking the opposite of the natural order. */
protected static class OppositeImplicitComparator implements ShortComparator, java.io.Serializable {
private static final long serialVersionUID = 1L;
@Override
public final int compare(final short a, final short b) {
return -(Short.compare((a), (b)));
}
@Override
public ShortComparator reversed() {
return NATURAL_COMPARATOR;
}
private Object readResolve() {
return OPPOSITE_COMPARATOR;
}
};
public static final ShortComparator OPPOSITE_COMPARATOR = new OppositeImplicitComparator();
protected static class OppositeComparator implements ShortComparator, java.io.Serializable {
private static final long serialVersionUID = 1L;
final ShortComparator comparator;
protected OppositeComparator(final ShortComparator c) {
comparator = c;
}
@Override
public final int compare(final short a, final short b) {
return comparator.compare(b, a);
}
@Override
public final ShortComparator reversed() {
return comparator;
}
};
/**
* Returns a comparator representing the opposite order of the given comparator.
*
* @param c a comparator.
* @return a comparator representing the opposite order of {@code c}.
*/
public static ShortComparator oppositeComparator(final ShortComparator c) {
if (c instanceof OppositeComparator) return ((OppositeComparator)c).comparator;
return new OppositeComparator(c);
}
/**
* Returns a type-specific comparator that is equivalent to the given comparator.
*
* @param c a comparator, or {@code null}.
* @return a type-specific comparator representing the order of {@code c}.
*/
public static ShortComparator asShortComparator(final Comparator super Short> c) {
if (c == null || c instanceof ShortComparator) return (ShortComparator)c;
return new ShortComparator() {
@Override
public int compare(short x, short y) {
return c.compare(Short.valueOf(x), Short.valueOf(y));
}
@SuppressWarnings("deprecation")
@Override
public int compare(Short x, Short y) {
return c.compare(x, y);
}
};
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy