com.carrotsearch.hppcrt.sorting.BooleanComparator Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
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.

There is a newer version: 0.7.5

Show newest version

package com.carrotsearch.hppcrt.sorting;

import java.util.Comparator;

 @javax.annotation.Generated(date = "2014-10-25T20:54:12+0200", value = "HPPC-RT generated from: BooleanComparator.java") 
public interface BooleanComparator   
{
    /**
     * 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(boolean e1, boolean e2);
}