41   private final double lo;  field in S1Interval
48   public S1Interval(double lo, double hi) {  in S1Interval()  argument
49     this(lo, hi, false);  in S1Interval()
58     this.lo = interval.lo;  in S1Interval()
66   private S1Interval(double lo, double hi, boolean checked) {  in S1Interval()  argument
67     double newLo = lo;  in S1Interval()
70       if (lo == -S2.M_PI && hi != S2.M_PI) {  in S1Interval()
73       if (hi == -S2.M_PI && lo != S2.M_PI) {  in S1Interval()
77     this.lo = newLo;  in S1Interval()
117   public double lo() {  in lo()  method in S1Interval
118     return lo;  in lo()
130     return (Math.abs(lo()) <= S2.M_PI && Math.abs(hi()) <= S2.M_PI  in isValid()
131         && !(lo() == -S2.M_PI && hi() != S2.M_PI) && !(hi() == -S2.M_PI && lo() != S2.M_PI));  in isValid()
136     return hi() - lo() == 2 * S2.M_PI;  in isFull()
142     return lo() - hi() == 2 * S2.M_PI;  in isEmpty()
148     return lo() > hi();  in isInverted()
156     double center = 0.5 * (lo() + hi());  in getCenter()
169     double length = hi() - lo();  in getLength()
186     if (lo() == hi()) {  in complement()
189     return new S1Interval(hi(), lo(), true); // Handles  in complement()
211       return (p >= lo() || p <= hi()) && !isEmpty();  in fastContains()
213       return p >= lo() && p <= hi();  in fastContains()
226       return p > lo() || p < hi();  in interiorContains()
228       return (p > lo() && p < hi()) || isFull();  in interiorContains()
242         return y.lo() >= lo() && y.hi() <= hi();  in contains()
244       return (y.lo() >= lo() || y.hi() <= hi()) && !isEmpty();  in contains()
249       return y.lo() >= lo() && y.hi() <= hi();  in contains()
262         return y.lo() > lo() || y.hi() < hi();  in interiorContains()
264       return (y.lo() > lo() && y.hi() < hi()) || y.isEmpty();  in interiorContains()
269       return (y.lo() > lo() && y.hi() < hi()) || isFull();  in interiorContains()
284       return y.isInverted() || y.lo() <= hi() || y.hi() >= lo();  in intersects()
287         return y.lo() <= hi() || y.hi() >= lo();  in intersects()
289       return y.lo() <= hi() && y.hi() >= lo();  in intersects()
299     if (isEmpty() || y.isEmpty() || lo() == hi()) {  in interiorIntersects()
303       return y.isInverted() || y.lo() < hi() || y.hi() > lo();  in interiorIntersects()
306         return y.lo() < hi() || y.hi() > lo();  in interiorIntersects()
308       return (y.lo() < hi() && y.hi() > lo()) || isFull();  in interiorIntersects()
330       double dlo = positiveDistance(p, lo());  in addPoint()
335         return new S1Interval(lo(), p);  in addPoint()
359     double lo = Math.IEEEremainder(lo() - radius, 2 * S2.M_PI);  in expanded()  local
361     if (lo == -S2.M_PI) {  in expanded()
362       lo = S2.M_PI;  in expanded()
364     return new S1Interval(lo, hi);  in expanded()
379     if (fastContains(y.lo())) {  in union()
388       return new S1Interval(lo(), y.hi(), true);  in union()
391       return new S1Interval(y.lo(), hi(), true);  in union()
396     if (isEmpty() || y.fastContains(lo())) {  in union()
401     double dlo = positiveDistance(y.hi(), lo());  in union()
402     double dhi = positiveDistance(hi(), y.lo());  in union()
404       return new S1Interval(y.lo(), hi(), true);  in union()
406       return new S1Interval(lo(), y.hi(), true);  in union()
423     if (fastContains(y.lo())) {  in intersection()
433       return new S1Interval(y.lo(), hi(), true);  in intersection()
436       return new S1Interval(lo(), y.hi(), true);  in intersection()
442     if (y.fastContains(lo())) {  in intersection()
460     return (Math.abs(Math.IEEEremainder(y.lo() - lo(), 2 * S2.M_PI))  in approxEquals()
475       return lo() == thatInterval.lo() && hi() == thatInterval.hi();  in equals()
483     value = 37 * value + Double.doubleToLongBits(lo());  in hashCode()
490     return "[" + this.lo() + ", " + this.hi() + "]";  in toString()