fr.splayce.rel

RECst

class RECst extends REStr with Wrapped

Abstract standalone raw regex expression that don't need non-capturing group protection.

Attributes
abstract
Linear Supertypes
Wrapped, REStr, RE0, RE, AnyRef, Any
Known Subclasses
Alpha, AlphaLower, AlphaUpper, Digit, DigitCst, Dot, Epsilon, InputBegin, InputEnd, Letter, LetterLower, LetterUpper, LineBegin, LineEnd, LineTerminator, MLDot, NotAlpha, NotDigit, NotLetter, NotWhiteSpace, NotWord, NotWordBoundary, TranslatedRECst, WhiteSpace, Word, WordBoundary
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. RECst
  2. Wrapped
  3. REStr
  4. RE0
  5. RE
  6. AnyRef
  7. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RECst (reCst: String)

Value Members

  1. def != (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  2. def != (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  3. def ## (): Int

    Attributes
    final
    Definition Classes
    AnyRef → Any

  4. lazy val % : Wrapped

    Non-capturing group

    Non-capturing group

    Definition Classes
    RE

  5. lazy val * : KStar

    Zero-or-more quantifier, greedy

    Zero-or-more quantifier, greedy

    Definition Classes
    RE

  6. lazy val *+ : KStar

    Zero-or-more quantifier, possessive

    Zero-or-more quantifier, possessive

    Definition Classes
    RE

  7. lazy val *? : KStar

    Zero-or-more quantifier, reluctant

    Zero-or-more quantifier, reluctant

    Definition Classes
    RE

  8. lazy val + : KCross

    One-or-more quantifier, greedy

    One-or-more quantifier, greedy

    Definition Classes
    RE

  9. lazy val ++ : KCross

    One-or-more quantifier, possessive

    One-or-more quantifier, possessive

    Definition Classes
    RE

  10. lazy val +? : KCross

    One-or-more quantifier, reluctant

    One-or-more quantifier, reluctant

    Definition Classes
    RE

  11. def - (that: RE): RE

    Unprotected concatenation

    Unprotected concatenation

    Definition Classes
    RE

  12. def /: [A] (z: A)(op: OpRewriter[A], order: TraversalOrder): (RE, A)

    Recursively apply an (RE, A) => (RE, A) operation, going left to right.

    Recursively apply an (RE, A) => (RE, A) operation, going left to right.

    In Prefixed and InfixedPre traversals, automatic recursion will only occur on RE2 and RE1 if the result of the operation remains of the same class.

    Definition Classes
    RE0 → RE

  13. def < (n: Int): RE

    At-most-N quantifier, greedy

    At-most-N quantifier, greedy

    Definition Classes
    RE

  14. def <+ (n: Int): RE

    At-most-N quantifier, possessive

    At-most-N quantifier, possessive

    Definition Classes
    RE

  15. def << [A] (extractor: MatchExtractor[A]): Extractor[A]

    Generate an Extractor for this extracting MatchExtractor

    Generate an Extractor for this extracting MatchExtractor

    Definition Classes
    RE

  16. def << [A] (extractor: (MatchGroup) ⇒ Option[A])(implicit d: DummyImplicit): Extractor[A]

    Generate an Extractor for this extracting function

    Generate an Extractor for this extracting function

    Definition Classes
    RE

  17. def << [A] (extractor: (Match) ⇒ Option[A]): Extractor[A]

    Generate an Extractor for this extracting function

    Generate an Extractor for this extracting function

    Definition Classes
    RE

  18. def <? (n: Int): RE

    At-most-N quantifier, reluctant

    At-most-N quantifier, reluctant

    Dotted form expr.<?(n) is mandatory, standalone <? being syntactically significant in Scala (XMLSTART)

    Definition Classes
    RE

  19. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  20. def == (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  21. def > (n: Int): RE

    At-least-N quantifier, greedy

    At-least-N quantifier, greedy

    Definition Classes
    RE

  22. def >+ (n: Int): RE

    At-least-N quantifier, possessive

    At-least-N quantifier, possessive

    Definition Classes
    RE

  23. def >? (n: Int): RE

    At-least-N quantifier, reluctant

    At-least-N quantifier, reluctant

    Definition Classes
    RE

  24. lazy val ? : Opt

    Zero-or-one quantifier, greedy

    Zero-or-one quantifier, greedy

    Definition Classes
    RE

  25. lazy val ?! : RE

    Negative look-ahead

    Negative look-ahead

    Definition Classes
    RE

  26. lazy val ?+ : Opt

    Zero-or-one quantifier, possessive

    Zero-or-one quantifier, possessive

    Definition Classes
    RE

  27. def ?: (flags: String): Wrapped

    Non-capturing group with flags (local mode modifiers), infix operator "i" ?: re

    Non-capturing group with flags (local mode modifiers), infix operator "i" ?: re

    Definition Classes
    RE

  28. lazy val ?<! : RE

    Negative look-behind

    Negative look-behind

    Definition Classes
    RE

  29. lazy val ?<= : RE

    Positive look-behind

    Positive look-behind

    Definition Classes
    RE

  30. lazy val ?= : RE

    Positive look-ahead

    Positive look-ahead

    Definition Classes
    RE

  31. lazy val ?> : RE

    Atomic group

    Atomic group

    Definition Classes
    RE

  32. lazy val ?? : Opt

    Zero-or-one quantifier, reluctant

    Zero-or-one quantifier, reluctant

    Definition Classes
    RE

  33. def \ (name: String): Group

    Named capturing group

    Named capturing group

    Definition Classes
    RE

  34. lazy val ag : RE

    Atomic group

    Atomic group

    Definition Classes
    RE

  35. def apply (): Group

    Unnamed capturing group (actual unique name is generated)

    Unnamed capturing group (actual unique name is generated)

    Definition Classes
    RE

  36. def apply (n: Int): RE

    Exactely-N quantifier

    Exactely-N quantifier

    Definition Classes
    RE

  37. def apply (rg: (Int, Int)): RE

    N-to-M quantifier

    N-to-M quantifier

    Definition Classes
    RE

  38. def apply (rg: Range): RE

    N-to-M quantifier

    N-to-M quantifier

    Definition Classes
    RE

  39. def apply (lb: Int, ub: Int, mode: RepMode = Greedy): RepNToM

    N-to-M quantifier

    N-to-M quantifier

    Definition Classes
    RE

  40. def asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any

  41. def clone (): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  42. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  43. def equals (arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  44. def finalize (): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  45. def foreach [U] (order: TraversalOrder)(f: (RE) ⇒ U): Unit

    Definition Classes
    RE0 → RE

  46. def g (): Group

    Unnamed capturing group (actual unique name is generated)

    Unnamed capturing group (actual unique name is generated)

    Definition Classes
    RE

  47. def g (name: String): Group

    Named capturing group

    Named capturing group

    Definition Classes
    RE

  48. def getClass (): java.lang.Class[_]

    Attributes
    final
    Definition Classes
    AnyRef → Any

  49. lazy val groups : scala.collection.immutable.Nil.type

    Definition Classes
    RE0 → RE

  50. def hashCode (): Int

    Definition Classes
    AnyRef → Any

  51. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any

  52. lazy val lin : (String, List[String])

    Combined linearization: first term is String representation, second is the List of capturing group names

    Combined linearization: first term is String representation, second is the List of capturing group names

    Definition Classes
    RE

  53. def linear (groupNames: List[String]): (String, List[String])

    Definition Classes
    RE0 → RE

  54. def map (tr: Rewriter, order: TraversalOrder = TraversalOrder.Postfixed): RE

    Recursively replace matching terms in the RE subtree

    Recursively replace matching terms in the RE subtree

    Definition Classes
    RE

  55. lazy val matchGroup : MatchGroup

    Corresponding MatchGroup tree, with containing unnamed $0 MatchGroup

    Corresponding MatchGroup tree, with containing unnamed $0 MatchGroup

    Definition Classes
    RE

  56. def ncg (flags: String): Wrapped

    Non-capturing group with flags (local mode modifiers)

    Non-capturing group with flags (local mode modifiers)

    Definition Classes
    RE

  57. lazy val ncg : Wrapped

    Non-capturing group

    Non-capturing group

    Definition Classes
    RE

  58. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  59. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  60. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  61. lazy val r : Regex

    Scala Regex linearization

    Scala Regex linearization

    Definition Classes
    RE

  62. val reCst : String

  63. val reStr : String

    Definition Classes
    REStr

  64. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef

  65. def toString (): String

    String linearization

    String linearization

    Definition Classes
    REStr → RE → AnyRef → Any

  66. def traverse (order: TraversalOrder = TraversalOrder.Postfixed): Traversable[RE]

    Return a Traversable for this order

    Return a Traversable for this order

    Definition Classes
    RE

  67. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  68. def wait (arg0: Long, arg1: Int): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  69. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  70. def | (that: RE): Alt

    Alternative

    Alternative

    Definition Classes
    RE

  71. def ~ (that: RE): RE

    Protected concatenation, both operands are wrapped in non-capturing groups if needed

    Protected concatenation, both operands are wrapped in non-capturing groups if needed

    Definition Classes
    RE

Inherited from Wrapped

Inherited from REStr

Inherited from RE0

Inherited from RE

Inherited from AnyRef

Inherited from Any