Rule

Value Members

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

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

7. def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

8. def finalize(): Unit

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

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

9. final def getClass(): Class[_]

   Definition Classes

   AnyRef → Any

10. def hashCode(): Int

    Definition Classes

    AnyRef → Any

11. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

12. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

13. final def notify(): Unit

    Definition Classes

    AnyRef

14. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef

16. def toString(): String

    Definition Classes

    AnyRef → Any

17. def unary_!(): Rule0

    Creates a "negative syntactic predicate", i.

    Creates a "negative syntactic predicate", i.e. a rule that matches only if this rule mismatches and vice versa. The resulting rule doesn't cause the parser to make any progress (i.e. match any input) and also clears out all effects that the underlying rule might have had on the value stack.

    Definition Classes

    Rule

    Annotations

    @compileTimeOnly( ... )

18. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

20. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

21. def |[I2 <: HNil, O2 >: HNil <: HList](that: Rule[I2, O2]): Rule[I2, O2]

    Combines this rule with the given other one in a way that the resulting rule matches if this rule matches or the other one matches.

    Combines this rule with the given other one in a way that the resulting rule matches if this rule matches or the other one matches. If this rule doesn't match the parser is reset and the given alternative tried. This operators therefore implements the "ordered choice' PEG combinator.

    Definition Classes

    Rule

    Annotations

    @compileTimeOnly( ... )

22. def ~[I2 <: HList, O2 <: HList](that: Rule[I2, O2])(implicit i: TailSwitch[I2, HNil, HNil], o: TailSwitch[HNil, I2, O2]): Rule[Out, Out]

    Concatenates this rule with the given other one.

    Concatenates this rule with the given other one. The resulting rule type is computed on a type-level. Here is an illustration (using an abbreviated HList notation): Rule[, A] ~ Rule[, B] = Rule[, A:B] Rule[A:B:C, D:E:F] ~ Rule[F, G:H] = Rule[A:B:C, D:E:G:H] Rule[A, B:C] ~ Rule[D:B:C, E:F] = Rule[D:A, E:F]

    Definition Classes

    Rule

    Annotations

    @compileTimeOnly( ... )