object ValueBound
Companion object for open/closed bounds, used to construct intervals from a set of bounds.
In the comments, we write
- [v, (v or ?v when the bound is interpreted as a lower bound, - v], v), v? when the bound is interpreted as an upper bound.
The symbols [], (), ? correspond to closed, open or unknown bounds.
- Alphabetic
- By Inheritance
- ValueBound
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def unapply[A](b: Bound[A]): Option[A]
-
def
union2[A](v1: ValueBound[A], v2: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval containing the two given bounds.
Returns the interval containing the two given bounds.
- Annotations
- @inline()
-
def
union3[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
- Annotations
- @inline()
-
def
union3_1approx2[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a === v2.a.
- Annotations
- @inline()
-
def
union3_1approx2_2approx3[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a === v2.a === v3.a.
- Annotations
- @inline()
-
def
union3_1approx2_2less3[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a === v2.a < v3.a.
- Annotations
- @inline()
-
def
union3_1less2[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a < v2.a.
- Annotations
- @inline()
-
def
union3_1less2_2approx3[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a < v2.a === v3.a.
- Annotations
- @inline()
-
def
union4[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
- Annotations
- @inline()
-
def
union4_1approx2[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a === v2.a.
- Annotations
- @inline()
-
def
union4_1approx2_2approx3[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a === v2.a == v3.a.
- Annotations
- @inline()
-
def
union4_1approx2_2approx3_3less4[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a === v2.a === v3.a < v4.a.
- Annotations
- @inline()
-
def
union4_1approx2_2less3[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a === v2.a < v3.a.
- Annotations
- @inline()
-
def
union4_1approx2_2less3_3approx4[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a === v2.a < v3.a === v4.a.
- Annotations
- @inline()
-
def
union4_1less2[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds. * Assumption: v1.a < v2.a.
- Annotations
- @inline()
-
def
union4_1less2_1less3[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a < v2.a and v1.a < v3.a (i.e. v1 is the minimum of all).
- Annotations
- @inline()
-
def
union4_1less2_2approx3[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a < v2.a === v3.a.
- Annotations
- @inline()
-
def
union4_1less2_2approx3_3approx4[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a < v2.a === v3.a === v4.a.
- Annotations
- @inline()
-
def
union4_1less3_2less3[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a < v3.a and v2.a < v3.a (i.e. v3 is the maximum of all).
- Annotations
- @inline()
-
def
union4_1less3_2less3_3approx4[A](v1: ValueBound[A], v2: ValueBound[A], v3: ValueBound[A], v4: ValueBound[A])(implicit arg0: Order[A]): Interval[A]
Returns the interval which contains all the given bounds.
Returns the interval which contains all the given bounds.
Assumption: v1.a < v3.a === v4.a and v2.a < v3.a === v4.a.
- Annotations
- @inline()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )