1 /*
   2  * Copyright (c) 1998, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.  Oracle designates this
   8  * particular file as subject to the "Classpath" exception as provided
   9  * by Oracle in the LICENSE file that accompanied this code.
  10  *
  11  * This code is distributed in the hope that it will be useful, but WITHOUT
  12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14  * version 2 for more details (a copy is included in the LICENSE file that
  15  * accompanied this code).
  16  *
  17  * You should have received a copy of the GNU General Public License version
  18  * 2 along with this work; if not, write to the Free Software Foundation,
  19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  20  *
  21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  22  * or visit www.oracle.com if you need additional information or have any

  56     public int getEdgeTag() {
  57         return etag;
  58     }
  59 
  60     public void setEdgeTag(int etag) {
  61         this.etag = etag;
  62     }
  63 
  64     public int getEquivalence() {
  65         return equivalence;
  66     }
  67 
  68     public void setEquivalence(int eq) {
  69         equivalence = eq;
  70     }
  71 
  72     private Edge lastEdge;
  73     private int lastResult;
  74     private double lastLimit;
  75 
  76     public int compareTo(Edge other, double yrange[]) {
  77         if (other == lastEdge && yrange[0] < lastLimit) {
  78             if (yrange[1] > lastLimit) {
  79                 yrange[1] = lastLimit;
  80             }
  81             return lastResult;
  82         }
  83         if (this == other.lastEdge && yrange[0] < other.lastLimit) {
  84             if (yrange[1] > other.lastLimit) {
  85                 yrange[1] = other.lastLimit;
  86             }
  87             return 0-other.lastResult;
  88         }
  89         //long start = System.currentTimeMillis();
  90         int ret = curve.compareTo(other.curve, yrange);
  91         //long end = System.currentTimeMillis();
  92         /*
  93         System.out.println("compare: "+
  94                            ((System.identityHashCode(this) <
  95                              System.identityHashCode(other))
  96                             ? this+" to "+other

   1 /*
   2  * Copyright (c) 1998, 2018, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.  Oracle designates this
   8  * particular file as subject to the "Classpath" exception as provided
   9  * by Oracle in the LICENSE file that accompanied this code.
  10  *
  11  * This code is distributed in the hope that it will be useful, but WITHOUT
  12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14  * version 2 for more details (a copy is included in the LICENSE file that
  15  * accompanied this code).
  16  *
  17  * You should have received a copy of the GNU General Public License version
  18  * 2 along with this work; if not, write to the Free Software Foundation,
  19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  20  *
  21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  22  * or visit www.oracle.com if you need additional information or have any

  56     public int getEdgeTag() {
  57         return etag;
  58     }
  59 
  60     public void setEdgeTag(int etag) {
  61         this.etag = etag;
  62     }
  63 
  64     public int getEquivalence() {
  65         return equivalence;
  66     }
  67 
  68     public void setEquivalence(int eq) {
  69         equivalence = eq;
  70     }
  71 
  72     private Edge lastEdge;
  73     private int lastResult;
  74     private double lastLimit;
  75 
  76     public int compareTo(Edge other, double[] yrange) {
  77         if (other == lastEdge && yrange[0] < lastLimit) {
  78             if (yrange[1] > lastLimit) {
  79                 yrange[1] = lastLimit;
  80             }
  81             return lastResult;
  82         }
  83         if (this == other.lastEdge && yrange[0] < other.lastLimit) {
  84             if (yrange[1] > other.lastLimit) {
  85                 yrange[1] = other.lastLimit;
  86             }
  87             return 0-other.lastResult;
  88         }
  89         //long start = System.currentTimeMillis();
  90         int ret = curve.compareTo(other.curve, yrange);
  91         //long end = System.currentTimeMillis();
  92         /*
  93         System.out.println("compare: "+
  94                            ((System.identityHashCode(this) <
  95                              System.identityHashCode(other))
  96                             ? this+" to "+other