PlusStrategy

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def +(name: String, q: ⇒ Strategy): PlusStrategy

   

   As for the other + with the first argument specifying a name for the constructed strategy.

   As for the other + with the first argument specifying a name for the constructed strategy.

   Definition Classes

   Strategy

4. macro def +(q: Strategy): PlusStrategy

   

   Non-deterministic choice.

   Non-deterministic choice. Normally, construct a strategy that first applies either this strategy or the given strategy. If it succeeds, succeed with the resulting term. Otherwise, apply q. Currently implemented as deterministic choice, but this behaviour should not be relied upon. When used as the argument to the < conditional choice combinator, + just serves to hold the two strategies that are chosen between by the conditional choice. q is evaluated at most once.

   Definition Classes

   Strategy

5. def <(name: String, lr: ⇒ PlusStrategy): Strategy

   

   As for the other < with the first argument specifying a name for the constructed strategy.

   As for the other < with the first argument specifying a name for the constructed strategy.

   Definition Classes

   Strategy

6. macro def <(lr: PlusStrategy): Strategy

   

   Conditional choice: c < l + r.

   Conditional choice: c < l + r. Construct a strategy that first applies this strategy (c). If c succeeds, the strategy applies l to the resulting term, otherwise it applies r to the original subject term. lr is evaluated at most once.

   Definition Classes

   Strategy

7. def <*(name: String, q: ⇒ Strategy): Strategy

   

   As for the other <* with the first argument specifying a name for the constructed strategy.

   As for the other <* with the first argument specifying a name for the constructed strategy.

   Definition Classes

   Strategy

8. macro def <*(q: Strategy): Strategy

   

   Sequential composition.

   Sequential composition. Construct a strategy that first applies this strategy. If it succeeds, then apply q to the new subject term. Otherwise fail. q is evaluated at most once.

   Definition Classes

   Strategy

9. def <+(name: String, q: ⇒ Strategy): Strategy

   

   As for the other <+ with the first argument specifying a name for the constructed strategy.

   As for the other <+ with the first argument specifying a name for the constructed strategy.

   Definition Classes

   Strategy

10. macro def <+(q: Strategy): Strategy

    

    Deterministic choice.

    Deterministic choice. Construct a strategy that first applies this strategy. If it succeeds, succeed with the resulting term. Otherwise, apply q to the original subject term. q is evaluated at most once.

    Definition Classes

    Strategy

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

    

    Definition Classes

    AnyRef → Any

12. def andThen[A](g: (Option[Any]) ⇒ A): (Any) ⇒ A

    

    Definition Classes

    Function1

    Annotations

    @unspecialized()

13. def apply(r: Any): Option[Any]

    

    Apply this strategy to a term.

    Apply this strategy to a term. By default, just run the implementation body wrapped in profiling.

    Definition Classes

    Strategy → Function1

14. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

15. val body: (Any) ⇒ Option[Any]

    

    Implementation of this strategy.

    Implementation of this strategy. Just apply s.

    Definition Classes

    PlusStrategy → Strategy

16. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

17. def compose[A](g: (A) ⇒ Any): (A) ⇒ Option[Any]

    

    Definition Classes

    Function1

    Annotations

    @unspecialized()

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

    

    Definition Classes

    AnyRef

19. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

20. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

22. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

23. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

24. lazy val left: Strategy

    

    The left alternative of the choice.

25. def mkStrategy(name: String, f: (Any) ⇒ Option[Any]): Strategy

    

    Make one of these strategies with the given name and body f.

    Make one of these strategies with the given name and body f.

    Definition Classes

    Strategy

26. val name: String

    

    Definition Classes

    Strategy

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

    

    Definition Classes

    AnyRef

28. final def notify(): Unit

    

    Definition Classes

    AnyRef

29. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

30. lazy val right: Strategy

    

    The right alternative of the choice.

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

    

    Definition Classes

    AnyRef

32. def toString(): String

    

    Identify this strategy by its name.

    Identify this strategy by its name.

    Definition Classes

    Strategy → Function1 → 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( ... )