INode

abstract def iDist(v: T): Iterable[(Double, Node[T, U])]

Defines the distance between a query and the internal nodes of an index.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def addChild(n: Node[T, U]): Unit

Adds a child node to this node.

final def asInstanceOf[T0]: T0

var children: List[Node[T, U]]

The children of a node.

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

val leaf: Boolean

Indicates if this is a leaf node

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def oDist(o: T): Map[Double, Set[U]]

Defines the distance between a query and the leaf nodes of an index.

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit