Packages

o

com.cra.figaro.algorithm.AbstractionScheme

RegularDiscretization

object RegularDiscretization extends AbstractionScheme[Double]

Default abstraction scheme for Double elements divides the range of an element into equal sized bins.

Linear Supertypes
AbstractionScheme[Double], PointMapper[Double], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RegularDiscretization
  2. AbstractionScheme
  3. PointMapper
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. def map(concretePoint: Double, abstractPoint: Set[Double]): Double

    Map a concrete Double to the closest abstract point.

    Map a concrete Double to the closest abstract point.

    Definition Classes
    RegularDiscretizationPointMapper
  13. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. final def notify(): Unit
    Definition Classes
    AnyRef
  15. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  16. def select(concretePoints: Seq[Double], numAbstractPoints: Int): SortedSet[Double]

    Produce a sorted set of abstract points from the given concrete points by dividing the range of the concrete points into equal sized bins.

    Produce a sorted set of abstract points from the given concrete points by dividing the range of the concrete points into equal sized bins.

    Definition Classes
    RegularDiscretizationAbstractionScheme
  17. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  18. def toString(): String
    Definition Classes
    AnyRef → Any
  19. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AbstractionScheme[Double]

Inherited from PointMapper[Double]

Inherited from AnyRef

Inherited from Any

Ungrouped