com.carrotsearch.hppcrt.strategies.DoubleComparator Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of hppcrt Show documentation
Show all versions of hppcrt Show documentation
High Performance Primitive Collections Realtime
(fork of HPPC from Carrotsearch)
Fundamental data structures (maps, sets, lists, queues, heaps, sorts) generated for
combinations of object and primitive types to conserve JVM memory and speed
up execution. The Realtime fork intends to extend the existing collections, by tweaking to remove any dynamic allocations at runtime,
and to obtain low variance execution times whatever the input nature.
The newest version!
package com.carrotsearch.hppcrt.strategies;
import java.util.Comparator;
/**
* Interface to support custom comparisons of double
s,
* as replacement of either natural ordering or Comparable objects.
*/
@javax.annotation.Generated(
date = "2017-07-11T19:16:33+0200",
value = "KTypeComparator.java")
public interface DoubleComparator
{
/**
* Defines the relative ordering of e1 and e2:
* @return 0 if e1 is "equal" to e2, or else < 0 if e1 is "smaller" than e2, or else > 0 if e1 is "bigger" than e2
*/
int compare(double e1, double e2);
}