class
Universe extends AnyRef
Instance Constructors
-
new
Universe(parsedTrees: Seq[Node], normalization: Normalization)
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
val
normalization: Normalization
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
wait(): Unit
Deprecated Value Members
-
def
finalize(): Unit
The purpose of this class is to enforce that set operation between regular expressions are only done when it is legal to do so, that is, when the regex are compatible.
The way this is enforced is that every compiled regular expression contains a reference to a Universe, and only expressions with the same universe are allowed to mix in set operation.
The same Universe ensures the same "alphabet" and normalization rules. Regular expressions compiled as a group will always have the same universe.
In general, dealing with this class or calling the constructor is not necessary; a call to one of the
compile
methods is simpler and more direct. However, there are cases in which the intermediate ParsedRegexs are needed. Most notably, when caching CompiledRegex instances (which are in general more expensive to create).