trait Regex extends AnyRef
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).
- Alphabetic
- By Inheritance
- Regex
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def diff(other: Regex): Regex
Subtract other regular expression from this one.
Subtract other regular expression from this one. The resulting expression will match the strings that are matched this expression and are not matched by the other, and only those. Differences take O(n⋅m) time, where n and m are the number of states of the DFA of the operands.
- def doIntersect(other: Regex): Boolean
Return whether this expression matches at least one string in common with another.
Return whether this expression matches at least one string in common with another. Intersections take O(n⋅m) time, where n and m are the number of states of the DFA of the operands.
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def equiv(other: Regex): Boolean
Return whether this regular expression is equivalent to other.
Return whether this regular expression is equivalent to other. Two regular expressions are equivalent if they match exactly the same set of strings. This operation takes O(n⋅m) time, where n and m are the number of states of the DFA of the operands.
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def intersect(other: Regex): Regex
Intersect this regular expression with another.
Intersect this regular expression with another. The resulting expression will match the strings that are matched by the operands, and only those. Intersections take O(n⋅m) time, where n and m are the number of states of the DFA of the operands.
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isProperSubsetOf(other: Regex): Boolean
Return whether this expressions matches every expression that is matched by another, but the expressions are not equal.
Return whether this expressions matches every expression that is matched by another, but the expressions are not equal. Two diff between the two operands are done internally.
- def isSubsetOf(other: Regex): Boolean
Return whether this expressions matches every expression that is matched by another.
Return whether this expressions matches every expression that is matched by another. An diff between the two operands is done internally.
- def matchAndReport(string: CharSequence): (Boolean, Int)
Similar to method matches, except that also return how many characters were successfully matched in case of failure.
- def matches(string: CharSequence): Boolean
Return whether a string is matched by the regular expression (i.e.
Return whether a string is matched by the regular expression (i.e. whether the string is included in the language generated by the expression). As the match is done using a DFA, its complexity is O(n), where n is the length of the string. It is constant with respect to the length of the expression.
- def matchesAtLeastOne(): Boolean
Return whether this regular expression matches anything.
Return whether this regular expression matches anything. Note that the empty string is a valid match.
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def union(other: Regex): Regex
Unite this regular expression with another.
Unite this regular expression with another. The resulting expression will match the strings that are matched by either of the operands, and only those. Unions take O(n⋅m) time, where n and m are the number of states of the DFA of the operands.
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
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.