com.cra.figaro.algorithm.decision.index

LNode

trait LNode[T, U] extends Node[T, U]

Convenience trait for leaf node of a tree.

Linear Supertypes
Node[T, U], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. LNode
  2. Node
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type ObjectMapType = HashMap[Distance[T], Set[U]] with MultiMap[Distance[T], U]

    Attributes
    protected
    Definition Classes
    Node

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 addChild(n: Node[T, U]): Unit

    Adds a child node to this node.

    Adds a child node to this node.

    Definition Classes
    Node

  5. def addObject(k: Distance[T], v: U): ObjectMapType

    Adds an object of Distance[T] to the node that contains a value v of type U.

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

    The children of a node.

    The children of a node.

    Definition Classes
    Node

  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  9. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  12. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  14. def iDist(o: T): Map[Double, Node[T, U]]

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

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

    Definition Classes
    LNode → Node

  15. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  16. val leaf: Boolean

    Indicates if this is a leaf node

    Indicates if this is a leaf node

    Definition Classes
    Node

  17. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  18. final def notify(): Unit

    Definition Classes
    AnyRef

  19. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  20. def oDist(o: T): Iterable[(Double, Set[U])]

    Compute the distance between each object stored in the leaf node and a query value of type Distance[T].

    Compute the distance between each object stored in the leaf node and a query value of type Distance[T]. Will return the distances in sorted order.

    Definition Classes
    LNode → Node

  21. val objects: ObjectMapType

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

    Definition Classes
    AnyRef

  23. def toString(): String

    Definition Classes
    AnyRef → Any

  24. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  26. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Node[T, U]

Inherited from AnyRef

Inherited from Any

Ungrouped