# Class Sorter.AOrder

public abstract class AOrder
extends Object

An abstract ordering strategy. The subclass must provide the fundamental less than and equals methods. The other methods are provided as conveniences and are derived from the two fundamental methods.

##

eq (Object, Object)
  Abstractly defines a strict "less than" ordering between the two input objects
ge (Object, Object)
  Greater than or equal to, defined as the negation of lt(x,y);
gt (Object, Object)
  Greater than, defined as the negation of le(x,y)
le (Object, Object)
  Less than or equal, defined as lt(x, y) || eq(x, y)
lt (Object, Object)
  Abstractly defines an equality between the two input objects
ne (Object, Object)
  Not equal to, defined as the negation of eq(x,y)

##

eq

    public abstract boolean eq(Object x, Object y)

  Abstractly defines a strict "less than" ordering between the two input objects.

  Parameters:
    x -
    y -
  Returns:
    true if x < y

lt

    public abstract boolean lt(Object x, Object y)

  Abstractly defines an equality between the two input objects.

  Parameters:
    x -
    y -
  Returns:
    true if equal.

ne

    public boolean ne(Object x, Object y)

  Not equal to, defined as the negation of eq(x,y).

  Parameters:
    x -
    y -
  Returns:
    true if x does not equal y.

le

    public boolean le(Object x, Object y)

  Less than or equal, defined as lt(x, y) || eq(x, y)

  Parameters:
    x -
    y -
  Returns:

gt

    public boolean gt(Object x, Object y)

  Greater than, defined as the negation of le(x,y).

  Parameters:
    x -
    y -
  Returns:

ge

    public boolean ge(Object x, Object y)

  Greater than or equal to, defined as the negation of lt(x,y);

  Parameters:
    x -
    y -
  Returns: