CompiledRegex

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[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val dfa: Dfa

Definition Classes
CompiledRegex → Regex
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.

Definition Classes
Regex
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.

Definition Classes
Regex
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): 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.

Definition Classes
Regex
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
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.

Definition Classes
Regex
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isProperSubsetOf(other: Regex): Boolean

Definition Classes
Regex
def isSubsetOf(other: Regex): Boolean

Definition Classes
Regex
val logger: Logger

Attributes
protected
Definition Classes
StrictLogging → Logging
def matchAndReport(string: String): (Boolean, Int)

Similar to method matches, except that also return how many characters were successfully matched in case of failure.
Similar to method matches, except that also return how many characters were successfully matched in case of failure.

Definition Classes
Regex
def matches(string: String): 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.

Definition Classes
Regex
def matchesAnything(): Boolean

Return whether this regular expression matches anything.
Return whether this regular expression matches anything. Note that the empty string is a valid match.

Definition Classes
Regex
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val parsedRegex: ParsedRegex
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
CompiledRegex → 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.

Definition Classes
Regex
val universe: Universe

Definition Classes
CompiledRegex → Regex
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package dregex

class CompiledRegex extends Regex with StrictLogging

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val dfa: Dfa

def diff(other: Regex): Regex

def doIntersect(other: Regex): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def equiv(other: Regex): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def intersect(other: Regex): Regex

final def isInstanceOf[T0]: Boolean

def isProperSubsetOf(other: Regex): Boolean

def isSubsetOf(other: Regex): Boolean

val logger: Logger

def matchAndReport(string: String): (Boolean, Int)

def matches(string: String): Boolean

def matchesAnything(): Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val parsedRegex: ParsedRegex

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

def toString(): String

def union(other: Regex): Regex

val universe: Universe

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Regex

Inherited from StrictLogging

Inherited from Logging

Inherited from AnyRef

Inherited from Any

Ungrouped