Class

de.uni_luebeck.isp.rltlconv.automata

BoolPiece

Related Doc: package automata

Permalink

abstract class BoolPiece[+A] extends PosBool[A]

Linear Supertypes
PosBool[A], AnyRef, Any
Known Subclasses
BoolElement, BoolFalse, BoolTrue
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. BoolPiece
  2. PosBool
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BoolPiece()

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. def addBrackets: String

    Permalink
    Definition Classes
    BoolPiece → PosBool

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. def clone(): AnyRef

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

  7. def contains[B >: A](value: B): Boolean

    Permalink
    Definition Classes
    PosBool

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

    Permalink
    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

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

  11. def flatMap[B >: A, C](f: (B) ⇒ PosBool[C]): PosBool[C]

    Permalink
    Definition Classes
    BoolPiece → PosBool

  12. def foreach[B >: A](f: (B) ⇒ Unit): PosBool[B]

    Permalink
    Definition Classes
    PosBool

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

    Permalink
    Definition Classes
    AnyRef → Any

  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  16. def map[B >: A, C](f: (B) ⇒ C): PosBool[C]

    Permalink
    Definition Classes
    PosBool

  17. def minimalModels: List[List[A]]

    Permalink

    Computes the minimal models of this positive boolean combination.

    Computes the minimal models of this positive boolean combination.

    returns

    the minimal models as a list of lists.

    Definition Classes
    PosBool

  18. def modelledBy[B >: A](assignment: Set[B]): Boolean

    Permalink
    Definition Classes
    BoolPiece → PosBool

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

    Permalink
    Definition Classes
    AnyRef

  20. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  21. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  23. def toList: List[A]

    Permalink
    Definition Classes
    BoolPiece → PosBool

  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  25. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from PosBool[A]

Inherited from AnyRef

Inherited from Any

Ungrouped