Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  def &(r: Rule[_, _]): Rule0

   Runs its inner rule but resets the parser (cursor and value stack) afterwards, succeeds only if its inner rule succeeded.

   Runs its inner rule but resets the parser (cursor and value stack) afterwards, succeeds only if its inner rule succeeded.

   Annotations

   @compileTimeOnly( ... )

4.  def +(other: String): String

   Implicit

   This member is added by an implicit conversion from RuleDSLCombinators to any2stringadd[RuleDSLCombinators] performed by method any2stringadd in scala.Predef.

   Definition Classes

   any2stringadd

5.  def ->[B](y: B): (RuleDSLCombinators, B)

   Implicit

   This member is added by an implicit conversion from RuleDSLCombinators to ArrowAssoc[RuleDSLCombinators] performed by method ArrowAssoc in scala.Predef.

   Definition Classes

   ArrowAssoc

   Annotations

   @inline()

6.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

7.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8.  def atomic[I <: HList, O <: HList](r: Rule[I, O]): Rule[I, O]

   Marks a rule as "undividable" from an error reporting perspective.

   Marks a rule as "undividable" from an error reporting perspective. The parser will never report errors *inside* of the marked rule. Rather, if the rule mismatches, the error will be reported at the very beginning of the attempted rule match.

   Annotations

   @compileTimeOnly( ... )

9.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... ) @native()

10.  def ensuring(cond: (RuleDSLCombinators) ⇒ Boolean, msg: ⇒ Any): RuleDSLCombinators

    Implicit

    This member is added by an implicit conversion from RuleDSLCombinators to Ensuring[RuleDSLCombinators] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

11.  def ensuring(cond: (RuleDSLCombinators) ⇒ Boolean): RuleDSLCombinators

    Implicit

    This member is added by an implicit conversion from RuleDSLCombinators to Ensuring[RuleDSLCombinators] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

12.  def ensuring(cond: Boolean, msg: ⇒ Any): RuleDSLCombinators

    Implicit

    This member is added by an implicit conversion from RuleDSLCombinators to Ensuring[RuleDSLCombinators] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

13.  def ensuring(cond: Boolean): RuleDSLCombinators

    Implicit

    This member is added by an implicit conversion from RuleDSLCombinators to Ensuring[RuleDSLCombinators] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

14.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

15.  def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

16.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

17.  def formatted(fmtstr: String): String

    Implicit

    This member is added by an implicit conversion from RuleDSLCombinators to StringFormat[RuleDSLCombinators] performed by method StringFormat in scala.Predef.

    Definition Classes

    StringFormat

    Annotations

    @inline()

18.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

19.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

20.  implicit def int2NTimes(i: Int): NTimes

    Annotations

    @compileTimeOnly( ... )

21.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

22.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

23.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

24.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

25.  def oneOrMore[I <: HList, O <: HList](r: Rule[I, O])(implicit l: Lifter[Seq, I, O]): Rule[In, StrictOut] with Repeated

    Runs its inner rule until it fails, succeeds if its inner rule succeeded at least once.

    Runs its inner rule until it fails, succeeds if its inner rule succeeded at least once. Resulting rule type is Rule0 if r == Rule0 Rule1[Seq[T]] if r == Rule1[T] Rule[I, O] if r == Rule[I, O <: I] // so called "reduction", which leaves the value stack unchanged on a type level

    Annotations

    @compileTimeOnly( ... )

26.  def optional[I <: HList, O <: HList](r: Rule[I, O])(implicit l: Lifter[Option, I, O]): Rule[In, OptionalOut]

    Runs its inner rule and succeeds even if the inner rule doesn't.

    Runs its inner rule and succeeds even if the inner rule doesn't. Resulting rule type is Rule0 if r == Rule0 Rule1[Option[T]] if r == Rule1[T] Rule[I, O] if r == Rule[I, O <: I] // so called "reduction", which leaves the value stack unchanged on a type level

    Annotations

    @compileTimeOnly( ... )

27.  def quiet[I <: HList, O <: HList](r: Rule[I, O]): Rule[I, O]

    Marks a rule as "quiet" from an error reporting perspective.

    Marks a rule as "quiet" from an error reporting perspective. Quiet rules only show up in error rule traces if no "unquiet" rules match up to the error location. This marker frequently used for low-level syntax rules (like whitespace or comments) that might be matched essentially everywhere and are therefore not helpful when appearing in the "expected" set of an error report.

    Annotations

    @compileTimeOnly( ... )

28.  implicit def range2NTimes(range: Range): NTimes

    Annotations

    @compileTimeOnly( ... )

29.  implicit def rule2WithSeparatedBy[I <: HList, O <: HList](r: Rule[I, O] with Repeated): WithSeparatedBy[I, O]

    Annotations

    @compileTimeOnly( ... )

30.  def runSubParser[I <: HList, O <: HList](f: (ParserInput) ⇒ Rule[I, O]): Rule[I, O]

    Allows creation of a sub parser and running of one of its rules as part of the current parsing process.

    Allows creation of a sub parser and running of one of its rules as part of the current parsing process. The subparser will start parsing at the current input position and the outer parser (this parser) will continue where the sub-parser stopped.

    Annotations

    @compileTimeOnly( ... )

31.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

32.  def toString(): String

    Definition Classes

    AnyRef → Any

33.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

35.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()

36.  def zeroOrMore[I <: HList, O <: HList](r: Rule[I, O])(implicit l: Lifter[Seq, I, O]): Rule[In, OptionalOut] with Repeated

    Runs its inner rule until it fails, always succeeds.

    Runs its inner rule until it fails, always succeeds. Resulting rule type is Rule0 if r == Rule0 Rule1[Seq[T]] if r == Rule1[T] Rule[I, O] if r == Rule[I, O <: I] // so called "reduction", which leaves the value stack unchanged on a type level

    Annotations

    @compileTimeOnly( ... )

37.  def →[B](y: B): (RuleDSLCombinators, B)

    Implicit

    This member is added by an implicit conversion from RuleDSLCombinators to ArrowAssoc[RuleDSLCombinators] performed by method ArrowAssoc in scala.Predef.

    Definition Classes

    ArrowAssoc