Regex

halotukozak.regex.Regex
See theRegex companion enum
object Regex

Attributes

Companion
enum
Graph
Supertypes
trait Sum
trait Mirror
class Object
trait Matchable
class Any
Self type
Regex.type

Members list

Type members

Classlikes

object given_ToExpr_Regex extends ToExpr[Regex]

Attributes

Supertypes
trait ToExpr[Regex]
class Object
trait Matchable
class Any
Self type

Inherited and Abstract types

type MirroredElemLabels <: Tuple

The names of the product elements.

The names of the product elements.

Attributes

Inherited from:
Mirror
type MirroredLabel <: String

The name of the type.

The name of the type.

Attributes

Inherited from:
Mirror

Value members

Concrete methods

def alt(parts: Iterable[Regex]): Regex

Alternation of a collection.

Alternation of a collection.

Attributes

def apply(set: CharSet): Regex
def inter(parts: Iterable[Regex]): Regex

Intersection of a collection.

Intersection of a collection.

Attributes

def lit(c: Char): Regex

Convenience: literal char.

Convenience: literal char.

Attributes

def literal(s: String): Regex

Convenience: literal string.

Convenience: literal string.

Attributes

def range(lo: Char, hi: Char): Regex

Convenience: char range.

Convenience: char range.

Attributes

Concrete fields

val all: Regex

All-strings regex Σ*.

All-strings regex Σ*.

Attributes

val maxRepeatBound: Int

Upper bound on quantifier bounds accepted by repeat. {n,m} is unfolded into an n- (or m-) sized chain of Concat nodes, so unbounded values would let a single malformed pattern build an unbounded/exponential AST. Real-world token patterns never need bounds anywhere near this size.

Upper bound on quantifier bounds accepted by repeat. {n,m} is unfolded into an n- (or m-) sized chain of Concat nodes, so unbounded values would let a single malformed pattern build an unbounded/exponential AST. Real-world token patterns never need bounds anywhere near this size.

Attributes

Givens