Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

## edu.princeton.repeatedgames.rgsolve.polygon
Class RobustConvexHull.PointComparator

    java.lang.Object
      edu.princeton.repeatedgames.rgsolve.polygon.RobustConvexHull.PointComparator

All Implemented Interfaces:
  java.util.Comparator<Point>

Enclosing class:
  RobustConvexHull

    public static class RobustConvexHull.PointComparator

extends java.lang.Object
implements java.util.Comparator<Point>

This object compares Point objects lexicographically, using the rule: p1 < p2 iff p1.x > p2.x || (p1.x == p2.x && p1.y < p2.y) This is the usual Lexicographic ordering except we have flipped the comparison on the x-coordinate; we want points ordered right-to-left.

Constructor Summary
`RobustConvexHull.PointComparator()`

Method Summary
`int` | `compare(Point p1, Point p2)`

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`

Methods inherited from interface java.util.Comparator
`equals`

Constructor Detail

### RobustConvexHull.PointComparator

    public RobustConvexHull.PointComparator()

Method Detail

### compare

    public int compare(Point p1,
                       Point p2)

  Specified by:
    `compare` in interface `java.util.Comparator<Point>`

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD