Class

de.uni_luebeck.isp.rltlconv.automata

PosBool

Related Doc: package automata

Permalink

abstract class PosBool[+A] extends AnyRef

Represents a general positive boolean formula.

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

Instance Constructors

  1. new PosBool()

    Permalink

Abstract Value Members

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

    Permalink

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

    Permalink

  3. abstract def toList: List[A]

    Permalink

Concrete 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

  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

  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 foreach[B >: A](f: (B) ⇒ Unit): PosBool[B]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink

  16. 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.

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

    Permalink
    Definition Classes
    AnyRef

  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  21. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  22. final def wait(): Unit

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped