com.cra.figaro.algorithm.decision.index

FlatIndex

class FlatIndex[T, U] extends Index[T, U]

FlatIndex class implements a nearest neighbor index that simply computes the distance between the query and all the stored samples, and returns the k nearest values using a simple sort.

T

The type of the parent

U

The type of the decision

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

Instance Constructors

  1. new FlatIndex(stratMap: Map[(T, U), DecisionSample])(implicit arg0: (T) ⇒ Distance[T])

    stratMap

    A mapping from parent/decision values to observed utilities. This is output by a DecisionAlgorithm.

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  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

  12. def getNN(parent: T, num: Int): List[(Double, U, DecisionSample)]

    Get the specified number of nearest neighbors of the parent value.

    Get the specified number of nearest neighbors of the parent value. Returns a tuple list of (distance to parent, decision value, weighted utility)

    Definition Classes
    FlatIndex → Index

  13. def getNNDebug(parent: T, num: Int): Iterable[(Double, Set[(U, DecisionSample)])]

    Attributes
    protected
    Definition Classes
    FlatIndex → Index

  14. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  15. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  19. def size: Int

    Get the size of the index

    Get the size of the index

    Definition Classes
    Index

  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( ... )

  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
    @throws( ... )

Inherited from Index[T, U]

Inherited from AnyRef

Inherited from Any

Ungrouped