27   private final double lo;  field in R1Interval
31   public R1Interval(double lo, double hi) {  in R1Interval()  argument
32     this.lo = lo;  in R1Interval()
64   public double lo() {  in lo()  method in R1Interval
65     return lo;  in lo()
76     return lo() > hi();  in isEmpty()
84     return 0.5 * (lo() + hi());  in getCenter()
92     return hi() - lo();  in getLength()
96     return p >= lo() && p <= hi();  in contains()
100     return p > lo() && p < hi();  in interiorContains()
108     return y.lo() >= lo() && y.hi() <= hi();  in contains()
119     return y.lo() > lo() && y.hi() < hi();  in interiorContains()
127     if (lo() <= y.lo()) {  in intersects()
128       return y.lo() <= hi() && y.lo() <= y.hi();  in intersects()
130       return lo() <= y.hi() && lo() <= hi();  in intersects()
139     return y.lo() < hi() && lo() < y.hi() && lo() < hi() && y.lo() <= y.hi();  in interiorIntersects()
146     } else if (p < lo()) {  in addPoint()
149       return new R1Interval(lo(), p);  in addPoint()
151       return new R1Interval(lo(), hi());  in addPoint()
165     return new R1Interval(lo() - radius, hi() + radius);  in expanded()
179     return new R1Interval(Math.min(lo(), y.lo()), Math.max(hi(), y.hi()));  in union()
187     return new R1Interval(Math.max(lo(), y.lo()), Math.min(hi(), y.hi()));  in intersection()
195       return (lo() == y.lo() && hi() == y.hi()) || (isEmpty() && y.isEmpty());  in equals()
208     value = 37 * value + Double.doubleToLongBits(lo);  in hashCode()
229     return Math.abs(y.lo() - lo()) + Math.abs(y.hi() - hi()) <= maxError;  in approxEquals()
234     return "[" + lo() + ", " + hi() + "]";  in toString()