Class

de.uni_luebeck.isp.rltlconv.formula

Options

Related Doc: package formula

Permalink

case class Options(alphabet: Set[String], propositions: Option[Set[String]]) extends Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Options
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Options(alphabet: Set[String], propositions: Option[Set[String]])

    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. val alphabet: Set[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. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  10. def hasPropositions: Boolean

    Permalink
  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  15. val propositions: Option[Set[String]]

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

    Permalink
    Definition Classes
    AnyRef
  17. def toLabels(proposition: String): List[String]

    Permalink

    Converts a proposition of a formula into a list of labels for the automata if the options contains propositions.

    Converts a proposition of a formula into a list of labels for the automata if the options contains propositions. If not it converts the given proposition into a set containing only this proposition for easier usage.

  18. def toOtherLabels(proposition: String): List[String]

    Permalink

    Converts a proposition of a formula into a list of labels for the automata _not_ containing the proposition if the options contains propositions.

    Converts a proposition of a formula into a list of labels for the automata _not_ containing the proposition if the options contains propositions. If not it converts the given proposition into a set containing all proposition without the given one for easier usage.

  19. def toSymbols(label: String): Set[String]

    Permalink

    Converts a label into all symbols of the formula that are encoded in this label.

    Converts a label into all symbols of the formula that are encoded in this label. If the labels are events the symbol is equivalent to the label. If the labels are sets of propositions encoded as strings the encoded propositions are returned as set.

  20. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long): Unit

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped