dregex.impl

GenericDfa

Related Doc: package impl

case class GenericDfa[A](initial: A, transitions: Map[A, Map[SglChar, A]], accepting: Set[A]) extends StrictLogging with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, StrictLogging, Logging, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GenericDfa
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. StrictLogging
  7. Logging
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GenericDfa(initial: A, transitions: Map[A, Map[SglChar, A]], accepting: Set[A])

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. val accepting: Set[A]

  5. lazy val allButAccepting: Set[A]

  6. lazy val allChars: Set[SglChar]

  7. lazy val allStates: Set[A]

  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  11. def finalize(): Unit

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

    Definition Classes
    AnyRef → Any
  13. val initial: A

  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  15. val logger: Logger

    Attributes
    protected
    Definition Classes
    StrictLogging → Logging
  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 rewrite[B](stateFactory: () ⇒ B): GenericDfa[B]

    Rewrite a DFA using canonical names for the states.

    Rewrite a DFA using canonical names for the states. Useful for simplifying the DFA product of intersections or NFA conversions. This function does not change the language matched by the DFA

  20. lazy val stateCount: Int

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

    Definition Classes
    AnyRef
  22. def toString(): String

    Definition Classes
    GenericDfa → AnyRef → Any
  23. def transitionMap(state: A): Map[SglChar, A]

  24. val transitions: Map[A, Map[SglChar, A]]

  25. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from StrictLogging

Inherited from Logging

Inherited from AnyRef

Inherited from Any

Ungrouped