dregex.impl

Dfa

Related Docs: object Dfa | package impl

class Dfa extends StrictLogging

Linear Supertypes
StrictLogging, Logging, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Dfa
  2. StrictLogging
  3. Logging
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Dfa(impl: GenericDfa[State], minimal: Boolean = false)

Type Members

  1. case class BiState(first: State, second: State) extends Product with Serializable

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. def diff(other: Dfa): Dfa

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

    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  11. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  12. val impl: GenericDfa[State]

  13. def intersect(other: Dfa): Dfa

  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  15. val logger: Logger

    Attributes
    protected
    Definition Classes
    StrictLogging → Logging

  16. def matchesAnything(): Boolean

    Return whether a DFA matches anything.

    Return whether a DFA matches anything. A DFA matches at least some language if there is a path from the initial state to any of the accepting states

  17. val minimal: Boolean

  18. def minimize(): Dfa

    DFA minimization, using Brzozowski's algorithm http://cs.stackexchange.com/questions/1872/brzozowskis-algorithm-for-dfa-minimization

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

    Definition Classes
    AnyRef

  20. final def notify(): Unit

    Definition Classes
    AnyRef

  21. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  22. def removeUnreachableStates(): Dfa

  23. def reverse(): Nfa

  24. lazy val stateCount: Int

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

    Definition Classes
    AnyRef

  26. def toString(): String

    Definition Classes
    Dfa → AnyRef → Any

  27. def union(other: Dfa): Dfa

  28. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from StrictLogging

Inherited from Logging

Inherited from AnyRef

Inherited from Any

Ungrouped