Packages

  • package root

    Dregex is a Scala/JVM library that implements a regular expression engine using deterministic finite automata (DFA).

    Dregex is a Scala/JVM library that implements a regular expression engine using deterministic finite automata (DFA). The range of features supported is an middle ground between Perl-style (slow) engines and DFA-based ones. Yet it retains the linear matching time offered by the latter.

    Definition Classes
    root
  • package dregex

    Main package for Dregex implementation.

    Main package for Dregex implementation. User-facing classes reside directly in the top-level package. The rest of the sub-packages contain implementation classes.

    Definition Classes
    root
  • package extra
  • package impl
  • CompiledRegex
  • InvalidRegexException
  • ParsedRegex
  • Regex
  • SynteticRegex
  • Universe
  • UnsupportedException
p

dregex

package dregex

Main package for Dregex implementation. User-facing classes reside directly in the top-level package. The rest of the sub-packages contain implementation classes.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. dregex
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class CompiledRegex extends Regex

    A fully-compiled regular expression that was generated from a string literal.

  2. class InvalidRegexException extends Exception
  3. class ParsedRegex extends AnyRef

    A parsed, but uncompiled regular expression.

  4. trait Regex extends AnyRef

    A regular expression, ready to be tested against strings, or to take part in an operation against another.

    A regular expression, ready to be tested against strings, or to take part in an operation against another. Internally, instances of this type have a DFA (Deterministic Finite Automaton).

  5. class SynteticRegex extends Regex

    A regular expression that was generated by an operation between others (not parsing a string), so it lacks a literal expression or NFA.

  6. class Universe extends AnyRef

    Represent the set of characters that is the union of the sets of characters of a group of regular expressions.

    Represent the set of characters that is the union of the sets of characters of a group of regular expressions. Regex must belong to the same Universe to be able to make operations between them.

  7. class UnsupportedException extends Exception

Value Members

  1. object Regex

Inherited from AnyRef

Inherited from Any

Ungrouped