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.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  final val chebyshev: M

   A chebychev distance measure, based on the maximum of the absolute distances across all dimensions.

6.  def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @native() @throws( ... )

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

   Definition Classes

   AnyRef

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

   Definition Classes

   AnyRef → Any

9.  final val euclideanSq: M

   A measure that uses the euclidean squared distance which is faster than the euclidean distance as the square root does not need to be taken.

10.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

11.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

12.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

13.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

15.  def nextSpanEvent(quad: IntSquare): M

    A 'next event' search when the quadtree is used to store spans (intervals).

    A 'next event' search when the quadtree is used to store spans (intervals). It assumes that a span or interval is represented by a point whose x coordinate corresponds to the span's start and whose y coordinate corresponds to the span's stop. Furthermore, it allows for spans to be unbounded: A span which does not have a defined start, should use quad.left as the x coordinate, and a span which does not have a defined stop, should use quad.right as the y coordinate. A span denoting the special value 'void' (no extent) can be encoded by giving it quad.right as x coordinate.

    The measure searches for the next 'event' beginning from the query point which is supposed to have x == y == query-time point. It finds the closest span start _or_ span stop which is greater than or equal to the query-time point, i.e. the nearest neighbor satisfying qx >= x || qy >= y (given the special treatment of unbounded coordinates).

    quad

    the tree's root square which is used to deduce the special values for representing unbounded spans

    returns

    the measure instance

16.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

17.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

18.  def prevSpanEvent(quad: IntSquare): M

    A 'previous event' search when the quadtree is used to store spans (intervals).

    A 'previous event' search when the quadtree is used to store spans (intervals). It assumes that a span or interval is represented by a point whose x coordinate corresponds to the span's start and whose y coordinate corresponds to the span's stop. Furthermore, it allows for spans to be unbounded: A span which does not have a defined start, should use quad.left as the x coordinate, and a span which does not have a defined stop, should use quad.right as the y coordinate. A span denoting the special value 'void' (no extent) can be encoded by giving it quad.right as x coordinate.

    The measure searches for the previous 'event' beginning from the query point which is supposed to have x == y == query-time point. It finds the closest span start _or_ span stop which is smaller than or equal to the query-time point, i.e. the nearest neighbor satisfying qx <= x || qy <= y (given the special treatment of unbounded coordinates).

    quad

    the tree's root square which is used to deduce the special values for representing unbounded spans

    returns

    the measure instance

19.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

20.  def toString(): String

    Definition Classes

    AnyRef → Any

21.  final val vehsybehc: M

    An 'inverted' chebychev distance measure, based on the *minimum* of the absolute distances across all dimensions.

    An 'inverted' chebychev distance measure, based on the *minimum* of the absolute distances across all dimensions. This is, strictly speaking, only a semi metric, and probably totally **useless**.

22.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @native() @throws( ... )