Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  def apply[T](tup: (Long, T, Long)): TSEntry[T]
5.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

6.  def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.CloneNotSupportedException]) @native()

7.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

8.  def equals(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef → Any

9.  def finalize(): Unit

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.Throwable])

10.  final def getClass(): Class[_ <: AnyRef]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

11.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

12.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

13.  def merge[A, B, R](a: TSEntry[A], b: TSEntry[B])(op: (Option[A], Option[B]) => Option[R]): Seq[TSEntry[R]]

    Merge two entries.

    Merge two entries. The domain covered by the returned entries (including a potential discontinuities) will be between min(a.timestamp, b.timestamp) and max(a.definedUntil, b.definedUntil)

14.  def mergeDisjointDomain[A, B, R](a: TSEntry[A], b: TSEntry[B])(op: (Option[A], Option[B]) => Option[R]): Seq[TSEntry[R]]

    Merge two entries that have a disjoint domain.

    Merge two entries that have a disjoint domain. The merge operator will be applied to each individually

    Attributes

    protected

15.  def mergeOverlapping[A, B, R](a: TSEntry[A], b: TSEntry[B])(op: (Option[A], Option[B]) => Option[R]): Seq[TSEntry[R]]

    Merge two overlapping TSEntries and return the result as an ordered sequence of TSEntries.

    Merge two overlapping TSEntries and return the result as an ordered sequence of TSEntries.

    This method returns a Seq containing one to three TSEntries defining a timeseries valid from first.timestamp to max(first.validUntil, second.validUntil).

    • one entry if first and second share the exact same domain
    • two entries if first and second share one bound of their domain,
    • three entries if the domains overlap without sharing a bound

    If the passed merge operator is commutative, then the 'merge' function is commutative as well. (merge(op)(E_a,E_b) == merge(op)(E_b,E_a) only if op(a,b) == op(b,a))

    Attributes

    protected

16.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

17.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

18.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

19.  implicit def orderByTs[T]: Ordering[TSEntry[T]]

    Define an implicit ordering for TSEntries of any type.

    Define an implicit ordering for TSEntries of any type. TSEntryOrdering extends the correct type but as Ordering[T] is invariant we still need to enforce this type here.

20.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

21.  def toString(): String

    Definition Classes

    AnyRef → Any

22.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

23.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

24.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()