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.  def all(name: String, s: ⇒ Strategy): Strategy

   As for the version without the name argument but specifies the name for the constructed strategy.

5.  macro def all(s: Strategy): Strategy

   Traversal to all children.

   Traversal to all children. Construct a strategy that applies s to all term children of the subject term. If s succeeds on all of the children, then succeed, forming a new term from the constructor of the original term and the result of s for each child. If s fails on any child, fail. If there are no children, succeed. If s succeeds on all children producing the same terms (by eq for references and by == for other values), then the overall strategy returns the subject term. This operation works on finite Rewritable, Product, Map and Traversable values, checked for in that order. Children of a Rewritable (resp. Product, collection) value are processed in the order returned by the value's deconstruct (resp. productElement, foreach) method. s is evaluated at most once.

6.  def allMap[CC[V, W] <: Map[V, W]](s: Strategy, t: CC[Any, Any])(implicit cbf: CanBuildFrom[CC[Any, Any], (Any, Any), CC[Any, Any]]): Option[CC[Any, Any]]

   Implementation of all for Map values.

7.  def allProduct(s: Strategy, p: Product): Option[Any]

   Implementation of all for Product values.

8.  def allRewritable(s: Strategy, r: Rewritable): Option[Any]

   Implementation of all for Rewritable values.

9.  def allTraversable[CC[U] <: Traversable[U]](s: Strategy, t: CC[Any])(implicit cbf: CanBuildFrom[CC[Any], Any, CC[Any]]): Option[CC[Any]]

   Implementation of all for Traversable values.

10.  macro def allbu(s: Strategy): Strategy

    Construct a strategy that applies s in a bottom-up fashion to all subterms at each level, stopping at a frontier where s succeeds.

11.  macro def alldownup2(s1: Strategy, s2: Strategy): Strategy

    Construct a strategy that applies s1 in a top-down, prefix fashion stopping at a frontier where s1 succeeds.

    Construct a strategy that applies s1 in a top-down, prefix fashion stopping at a frontier where s1 succeeds. s2 is applied in a bottom-up, postfix fashion to the result.

12.  macro def alltd(s: Strategy): Strategy

    Construct a strategy that applies s in a top-down fashion, stopping at a frontier where s succeeds.

13.  macro def alltdfold(s1: Strategy, s2: Strategy): Strategy

    Construct a strategy that applies s1 in a top-down, prefix fashion stopping at a frontier where s1 succeeds.

    Construct a strategy that applies s1 in a top-down, prefix fashion stopping at a frontier where s1 succeeds. s2 is applied in a bottom-up, postfix fashion to the results of the recursive calls.

14.  macro def and(s1: Strategy, s2: Strategy): Strategy

    and(s1, s2) applies s1 and s2 to the subject term and succeeds if both succeed.

    and(s1, s2) applies s1 and s2 to the subject term and succeeds if both succeed. s2 will always be applied, i.e., and is not a short-circuit operator

15.  final def asInstanceOf[T0]: T0

    Definition Classes

    Any

16.  macro def attempt(s: Strategy): Strategy

    Construct a strategy that applies s, yielding the result of s if it succeeds, otherwise leave the original subject term unchanged.

    Construct a strategy that applies s, yielding the result of s if it succeeds, otherwise leave the original subject term unchanged. In Stratego library this strategy is called try.

17.  macro def bottomup(s: Strategy): Strategy

    Construct a strategy that applies s in a bottom-up, postfix fashion to the subject term.

18.  macro def bottomupS(s: Strategy, stop: (⇒ Strategy) ⇒ Strategy): Strategy

    Construct a strategy that applies s in a bottom-up, postfix fashion to the subject term but stops when the strategy produced by stop succeeds.

    Construct a strategy that applies s in a bottom-up, postfix fashion to the subject term but stops when the strategy produced by stop succeeds. stop is given the whole strategy itself as its argument.

19.  macro def breadthfirst(s: Strategy): Strategy

    Construct a strategy that applies s in breadth first order.

    Construct a strategy that applies s in breadth first order. This strategy does not apply s to the root of the subject term.

    It is called breadthfirst to follow Stratego's library, but is not really conducting a breadth-first traversal since all of the descendants of the first child of a term are visited before any of the descendants of the second child of a term.

20.  def build(name: String, t: ⇒ Any): Strategy

    As for the version without the name argument but specifies the name for the constructed strategy.

21.  macro def build(t: Any): Strategy

    Construct a strategy that always succeeds, changing the subject term to the given term t.

    Construct a strategy that always succeeds, changing the subject term to the given term t. The term t is evaluated at most once.

22.  def child(name: String, i: Int, s: ⇒ Strategy): Strategy

    As for the version without the name argument but specifies the name for the constructed strategy.

23.  macro def child(i: Int, s: Strategy): Strategy

    Traversal to a single child.

    Traversal to a single child. Construct a strategy that applies s to the ith child of the subject term (counting from one). If s succeeds on the ith child producing t, then succeed, forming a new term that is the same as the original term except that the ith child is now t. If s fails on the ith child or the subject term does not have an ith child, then fail. child(i, s) is equivalent to Stratego's i(s) operator. If s succeeds on the ith child producing the same term (by eq for references and by == for other values), then the overall strategy returns the subject term. This operation works for instances of Product or finite Seq values. s is evaluated at most once.

24.  def childProduct(s: Strategy, i: Int, p: Product): Option[Any]

    Implementation of child for Product values.

25.  def childSeq[CC[U] <: Seq[U]](s: Strategy, i: Int, t: CC[Any])(implicit cbf: CanBuildFrom[CC[Any], Any, CC[Any]]): Option[CC[Any]]

    Implementation of child for Seq values.

26.  def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27.  macro def collect[CC[X] <: Traversable[X], U](f: ==>[Any, U])(implicit cbf: CanBuildFrom[CC[Any], U, CC[U]]): (Any) ⇒ CC[U]

    Collect query results in a traversable collection.

    Collect query results in a traversable collection. Run the function f as a top-down left-to-right query on the subject term. Each application of f returns a single value. All of these values are accumulated in the collection.

28.  macro def collectall[CC[X] <: Traversable[X], U](f: ==>[Any, CC[U]])(implicit cbf: CanBuildFrom[CC[Any], U, CC[U]]): (Any) ⇒ CC[U]

    Collect query results in a traversable collection.

    Collect query results in a traversable collection. Run the function f as a top-down left-to-right query on the subject term. Each application of f returns a collection of values. All of these values are accumulated in the collection.

29.  def congruence(name: String, ss: Strategy*): Strategy

    As for the version without the name argument but specifies the name for the constructed strategy.

30.  macro def congruence(ss: Strategy*): Strategy

    Make a strategy that applies the elements of ss pairwise to the children of the subject term, returning a new term if all of the strategies succeed, otherwise failing.

    Make a strategy that applies the elements of ss pairwise to the children of the subject term, returning a new term if all of the strategies succeed, otherwise failing. The constructor of the new term is the same as that of the original term and the children are the results of the strategies. If the length of ss is not the same as the number of children, then congruence(ss) fails. If the argument strategies succeed on children producing the same terms (by eq for references and by == for other values), then the overall strategy returns the subject term. This operation works on instances of Product values.

31.  def congruenceProduct(p: Product, ss: Strategy*): Option[Any]

    Implementation of congruence for Product values.

32.  macro def count(f: ==>[Any, Int]): (Any) ⇒ Int

    Count function results.

    Count function results. Run the function f as a top-down query on the subject term. Sum the integer values returned by f from all applications.

33.  def debug(name: String, msg: String, emitter: Emitter): Strategy

    As for the version without the name argument but specifies the name for the constructed strategy.

34.  macro def debug(msg: String, emitter: Emitter = new OutputEmitter): Strategy

    A strategy that always succeeds with the subject term unchanged (i.e., this is the identity strategy) with the side-effect that the subject term is printed to the given emitter, prefixed by the string s.

    A strategy that always succeeds with the subject term unchanged (i.e., this is the identity strategy) with the side-effect that the subject term is printed to the given emitter, prefixed by the string s. The emitter defaults to one that writes to standard output.

35.  macro def doloop(s: Strategy, r: Strategy): Strategy

    Construct a strategy that applies s at least once and then repeats s while r succeeds.

    Construct a strategy that applies s at least once and then repeats s while r succeeds. This operator is called do-while in the Stratego library.

36.  macro def downup(s1: Strategy, s2: Strategy): Strategy

    Construct a strategy that applies s1 in a top-down, prefix fashion and s2 in a bottom-up, postfix fashion to the subject term.

37.  macro def downup(s: Strategy): Strategy

    Construct a strategy that applies s in a combined top-down and bottom-up fashion (i.e., both prefix and postfix) to the subject term.

38.  macro def downupS(s1: Strategy, s2: Strategy, stop: (⇒ Strategy) ⇒ Strategy): Strategy

    Construct a strategy that applies s1 in a top-down, prefix fashion and s2 in a bottom-up, postfix fashion to the subject term but stops when the strategy produced by stop succeeds.

    Construct a strategy that applies s1 in a top-down, prefix fashion and s2 in a bottom-up, postfix fashion to the subject term but stops when the strategy produced by stop succeeds. stop is given the whole strategy itself as its argument.

39.  macro def downupS(s: Strategy, stop: (⇒ Strategy) ⇒ Strategy): Strategy

    Construct a strategy that applies s in a combined top-down and bottom-up fashion (i.e., both prefix and postfix) to the subject but stops when the strategy produced by stop succeeds.

    Construct a strategy that applies s in a combined top-down and bottom-up fashion (i.e., both prefix and postfix) to the subject but stops when the strategy produced by stop succeeds. stop is given the whole strategy itself as its argument.

40.  def dup[T <: Product](t: T, children: Seq[AnyRef]): T

    The duplicator used by the generic traversals.

    The duplicator used by the generic traversals. Needs to be defined as a method so we can override it in other rewriting modules.

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

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef → Any

43.  macro def everything[T](v: T)(f: (T, T) ⇒ T)(g: ==>[Any, T])(t: Any): T

    Apply the function at every term in t in a top-down, left-to-right order.

    Apply the function at every term in t in a top-down, left-to-right order. Collect the resulting T values by accumulating them using f with initial left value v. Return the final value of the accumulation.

44.  macro def everywhere(s: Strategy): Strategy

    Same as everywheretd.

45.  macro def everywherebu(s: Strategy): Strategy

    Construct a strategy that applies s at all terms in a bottom-up fashion regardless of failure.

    Construct a strategy that applies s at all terms in a bottom-up fashion regardless of failure. Terms for which the strategy fails are left unchanged.

46.  macro def everywheretd(s: Strategy): Strategy

    Construct a strategy that applies s at all terms in a top-down fashion regardless of failure.

    Construct a strategy that applies s at all terms in a top-down fashion regardless of failure. Terms for which the strategy fails are left unchanged.

47.  val fail: Strategy

    A strategy that always fails.

48.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef → Any

50.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

51.  val id: Strategy

    A strategy that always succeeds.

52.  macro def innermost(s: Strategy): Strategy

    Construct a strategy that applies s repeatedly to the innermost (i.e., lowest and left-most) (sub-)term to which it applies.

    Construct a strategy that applies s repeatedly to the innermost (i.e., lowest and left-most) (sub-)term to which it applies. Stop with the subject term if s doesn't apply anywhere.

53.  macro def innermost2(s: Strategy): Strategy

    An alternative version of innermost.

54.  macro def ior(s1: Strategy, s2: Strategy): Strategy

    ior(s1, s2) implements inclusive OR, that is, the inclusive choice of s1 and s2.

    ior(s1, s2) implements inclusive OR, that is, the inclusive choice of s1 and s2. It first tries s1. If that fails it applies s2 (just like s1 <+ s2). However, when s1 succeeds it also tries to apply s2.

55.  def isDefinedAtArg[T](anyf: ==>[Any, T], t: Any): Boolean

    Is the function anyf defined at the domain value t? Allows for case that anyf may actually have a more specific domain and t may not be of the domain type.

    Is the function anyf defined at the domain value t? Allows for case that anyf may actually have a more specific domain and t may not be of the domain type. Relies on implementation that does a cast at the beginning of the apply for a partial function literal.

56.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

57.  macro def lastly(s: Strategy, f: Strategy): Strategy

    Applies s followed by f whether s failed or not.

    Applies s followed by f whether s failed or not. This operator is called finally in the Stratego library.

58.  macro def leaves(s: Strategy, isleaf: Strategy, skip: (Strategy) ⇒ Strategy): Strategy

    Construct a strategy that applies to all of the leaves of the subject term, using isleaf as the leaf predicate, skipping subterms for which skip when applied to the result succeeds.

59.  macro def leaves(s: Strategy, isleaf: Strategy): Strategy

    Construct a strategy that applies to all of the leaves of the subject term, using isleaf as the leaf predicate.

60.  def log(name: String, s: ⇒ Strategy, msg: String, emitter: Emitter): Strategy

    As for the version without the name argument but specifies the name for the constructed strategy.

61.  macro def log(s: Strategy, msg: String, emitter: Emitter = new ErrorEmitter): Strategy

    Create a logging strategy based on a strategy s.

    Create a logging strategy based on a strategy s. The returned strategy succeeds or fails exactly as s does, but also prints the provided message, the subject term, the success or failure status, and on success, the result term, to the provided emitter (default: standard error). s is evaluated at most once.

62.  def logfail[T](name: String, s: ⇒ Strategy, msg: String, emitter: Emitter): Strategy

    As for the version without the name argument but specifies the name for the constructed strategy.

63.  macro def logfail[T](s: Strategy, msg: String, emitter: Emitter = new ErrorEmitter): Strategy

    Create a logging strategy based on a strategy s.

    Create a logging strategy based on a strategy s. The returned strategy succeeds or fails exactly as s does, but if s fails, also prints the provided message and the subject term to the provided emitter (default: standard error). s is evaluated at most once.

64.  macro def loop(r: Strategy, s: Strategy): Strategy

    Construct a strategy that while r succeeds applies s.

    Construct a strategy that while r succeeds applies s. This operator is called while in the Stratego library.

65.  macro def loopiter(s: (Int) ⇒ Strategy, low: Int, high: Int): Strategy

    Construct a strategy that applies s(i) for each integer i from low to high (inclusive).

    Construct a strategy that applies s(i) for each integer i from low to high (inclusive). This operator is called for in the Stratego library.

66.  macro def loopiter(i: Strategy, r: Strategy, s: Strategy): Strategy

    Construct a strategy that repeats application of s while r fails, after initialization with i.

    Construct a strategy that repeats application of s while r fails, after initialization with i. This operator is called for in the Stratego library.

67.  macro def loopnot(r: Strategy, s: Strategy): Strategy

    Construct a strategy that while r does not succeed applies s.

    Construct a strategy that while r does not succeed applies s. This operator is called while-not in the Stratego library.

68.  def makechild(c: Any): AnyRef

    Make an arbitrary value c into a term child, checking that it worked properly.

    Make an arbitrary value c into a term child, checking that it worked properly. Object references will be returned unchanged; other values will be boxed.

    Attributes

    protected

69.  macro def manybu(s: Strategy): Strategy

    Construct a strategy that applies s as many times as possible, but at least once, in bottom up order.

70.  macro def manytd(s: Strategy): Strategy

    Construct a strategy that applies s as many times as possible, but at least once, in top down order.

71.  macro def map(s: Strategy): Strategy

    Construct a strategy that applies s to each element of a sequence, returning a new sequence of the results if all of the applications succeed, otherwise fail.

    Construct a strategy that applies s to each element of a sequence, returning a new sequence of the results if all of the applications succeed, otherwise fail. If all of the applications succeed without change, return the input sequence.

72.  def memo(name: String, s: ⇒ Strategy): Strategy

    As for the version without the name argument but specifies the name for the constructed strategy.

73.  macro def memo(s: Strategy): Strategy

    Return a strategy that behaves as s does, but memoises its arguments and results.

    Return a strategy that behaves as s does, but memoises its arguments and results. In other words, if memo(s) is called on a term t twice, the second time will return the same result as the first, without having to invoke s. For best results, it is important that s should have no side effects. s is evaluated at most once.

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

    Make a strategy with the given name and body f.

    Make a strategy with the given name and body f. By default, make a basic strategy.

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

    Definition Classes

    AnyRef

76.  macro def not(s: Strategy): Strategy

    Construct a strategy that applies s, then fails if s succeeded or, if s failed, succeeds with the subject term unchanged, I.e., it tests if s applies, but has no effect on the subject term.

77.  final def notify(): Unit

    Definition Classes

    AnyRef

78.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

79.  macro def oncebu(s: Strategy): Strategy

    Construct a strategy that applies s in a bottom-up fashion to one subterm at each level, stopping as soon as it succeeds once (at any level).

80.  macro def oncetd(s: Strategy): Strategy

    Construct a strategy that applies s in a top-down fashion to one subterm at each level, stopping as soon as it succeeds once (at any level).

81.  def one(name: String, s: ⇒ Strategy): Strategy

    As for the version without the name argument but specifies the name for the constructed strategy.

82.  macro def one(s: Strategy): Strategy

    Traversal to one child.

    Traversal to one child. Construct a strategy that applies s to the term children of the subject term. Assume that c is the first child on which s succeeds. Then stop applying s to the children and succeed, forming a new term from the constructor of the original term and the original children, except that c is replaced by the result of applying s to c. In the event that the strategy fails on all children, then fail. If there are no children, fail. If s succeeds on the one child producing the same term (by eq for references and by == for other values), then the overall strategy returns the subject term. This operation works on instances of finite Rewritable, Product, Map and Traversable values, checked for in that order. Children of a Rewritable (resp. Product, collection) value are processed in the order returned by the value's deconstruct (resp. productElement, foreach) method. s is evaluated at most once.

83.  def oneMap[CC[V, W] <: Map[V, W]](s: Strategy, t: CC[Any, Any])(implicit cbf: CanBuildFrom[CC[Any, Any], (Any, Any), CC[Any, Any]]): Option[CC[Any, Any]]

    Implementation of one for Map values.

84.  def oneProduct(s: Strategy, p: Product): Option[Any]

    Implementation of one for Product values.

85.  def oneRewritable(s: Strategy, r: Rewritable): Option[Any]

    Implementation of one for Rewritable values.

86.  def oneTraversable[CC[U] <: Traversable[U]](s: Strategy, t: CC[Any])(implicit cbf: CanBuildFrom[CC[Any], Any, CC[Any]]): Option[CC[Any]]

    Implementation of one for Traversable values.

87.  def option(name: String, o: ⇒ Option[Any]): Strategy

    As for the version without the name argument but specifies the name for the constructed strategy.

88.  macro def option(o: Option[Any]): Strategy

    Construct a strategy from an option value o.

    Construct a strategy from an option value o. The strategy succeeds or fails depending on whether o is a Some or None, respectively. If o is a Some, then the subject term is changed to the term that is wrapped by the Some. o is evaluated at most once.

89.  macro def or(s1: Strategy, s2: Strategy): Strategy

    or(s1, s2) is similar to ior(s1, s2), but the application of the strategies is only tested.

90.  macro def outermost(s: Strategy): Strategy

    Construct a strategy that applies s repeatedly in a top-down fashion stopping each time as soon as it succeeds once (at any level).

    Construct a strategy that applies s repeatedly in a top-down fashion stopping each time as soon as it succeeds once (at any level). The outermost fails when s fails to apply to any (sub-)term.

91.  def para[T](f: (Any, Seq[T]) ⇒ T): (Any) ⇒ T

    Perform a paramorphism over a value.

    Perform a paramorphism over a value. This is a fold in which the recursive step may refer to the recursive component of the value and the results of folding over the children. When the function f is called, the first parameter is the value and the second is a sequence of the values that f has returned for the children. his will work on any value, but will only decompose values that are supported by the Term generic term deconstruction. This operation is similar to that used in the Uniplate library.

92.  macro def query[T](f: ==>[T, Unit]): Strategy

    Define a term query by a partial function f.

    Define a term query by a partial function f. The query always succeeds with no effect on the subject term but applies the given partial function f to the subject term. In other words, the strategy runs f for its side-effects. If the subject term is not a T or the function is not defined at the subject term, the strategy fails.

    Due to the type erasure performed on Scala programs the type test will be imprecise for some types. E.g., it is not possible to tell the difference between List[Int] and List[String].

93.  def queryWithName[T](name: String, f: ==>[T, Unit]): Strategy

    As for the version without the name argument but specifies the name for the constructed strategy.

94.  def queryf(name: String, f: (Any) ⇒ Unit): Strategy

    As for the version without the name argument but specifies the name for the constructed strategy.

95.  macro def queryf(f: (Any) ⇒ Unit): Strategy

    Define a term query by a function f.

    Define a term query by a function f. The query always succeeds with no effect on the subject term but applies the given (possibly partial) function f to the subject term. In other words, the strategy runs f for its side-effects.

96.  macro def reduce(s: Strategy): Strategy

    Construct a strategy that applies s repeatedly to subterms until it fails on all of them.

97.  macro def repeat(s: Strategy, n: Int): Strategy

    Construct a strategy that applies s repeatedly exactly n times.

    Construct a strategy that applies s repeatedly exactly n times. If s fails at some point during the n applications, the entire strategy fails. The result of the strategy is that of the nth application of s.

98.  macro def repeat(s: Strategy, r: Strategy): Strategy

    Construct a strategy that repeatedly applies s until it fails and then terminates with application of r.

99.  macro def repeat(s: Strategy): Strategy

    Construct a strategy that applies s repeatedly until it fails.

100.  macro def repeat1(s: Strategy, r: Strategy): Strategy

     Construct a strategy that repeatedly applies s (at least once) and terminates with application of c.

101.  macro def repeat1(s: Strategy): Strategy

     Construct a strategy that repeatedly applies s (at least once).

102.  macro def repeatuntil(s: Strategy, r: Strategy): Strategy

     Construct a strategy that repeatedly applies s until c succeeds.

103.  macro def restore(s: Strategy, rest: Strategy): Strategy

     Construct a strategy that applies s, then applies the restoring action rest if s fails (and then fail).

     Construct a strategy that applies s, then applies the restoring action rest if s fails (and then fail). Otherwise, let the result of s stand. Typically useful if s performs side effects that should be restored or undone when s fails.

104.  macro def restorealways(s: Strategy, rest: Strategy): Strategy

     Construct a strategy that applies s, then applies the restoring action rest regardless of the success or failure of s.

     Construct a strategy that applies s, then applies the restoring action rest regardless of the success or failure of s. The whole strategy preserves the success or failure of s. Typically useful if s performs side effects that should be restored always, e.g., when maintaining scope information.

105.  macro def rule[T](f: ==>[T, T]): Strategy

     Define a rewrite rule using a partial function f defined on the type T.

     Define a rewrite rule using a partial function f defined on the type T. If the subject term is a T and the function is defined at the subject term, then the strategy succeeds with the return value of the function applied to the subject term. Otherwise, the strategy fails.

     Due to the type erasure performed on Scala programs the type test will be imprecise for some types. E.g., it is not possible to tell the difference between List[Int] and List[String].

106.  def ruleWithName[T](name: String, f: ==>[T, T]): Strategy

     As for rule but specifies the name for the constructed strategy.

107.  def rulef(name: String, f: (Any) ⇒ Any): Strategy

     As for the version without the name argument but specifies the name for the constructed strategy.

108.  macro def rulef(f: (Any) ⇒ Any): Strategy

     Define a rewrite rule using a function f that returns a term.

     Define a rewrite rule using a function f that returns a term. The rule always succeeds with the return value of the function.

109.  macro def rulefs[T](f: ==>[T, Strategy]): Strategy

     Define a rewrite rule using a function f defined on type T that returns a strategy.

     Define a rewrite rule using a function f defined on type T that returns a strategy. If the subject term is a T and the function is defined at the subject term, the rule applies the function to the subject term to get a strategy which is then applied again to the subject term. In other words, the function is only used for effects such as pattern matching. The whole thing also fails if f is not defined at the term in the first place.

110.  def rulefsWithName[T](name: String, f: ==>[T, Strategy]): Strategy

     As for the version without the name argument but specifies the name for the constructed strategy.

111.  def some(name: String, s: ⇒ Strategy): Strategy

     As for the version without the name argument but specifies the name for the constructed strategy.

112.  macro def some(s: Strategy): Strategy

     Traversal to as many children as possible, but at least one.

     Traversal to as many children as possible, but at least one. Construct a strategy that applies s to the term children of the subject term. If s succeeds on any of the children, then succeed, forming a new term from the constructor of the original term and the result of s for each succeeding child, with other children unchanged. In the event that the strategy fails on all children, then fail. If there are no children, fail. If s succeeds on children producing the same terms (by eq for references and by == for other values), then the overall strategy returns the subject term. This operation works on instances of finite Rewritable, Product, Map and Traversable values, checked for in that order. Children of a Rewritable (resp. Product, collection) value are processed in the order returned by the value's deconstruct (resp. productElement, foreach) method. s is evaluated at most once.

113.  def someMap[CC[V, W] <: Map[V, W]](s: Strategy, t: CC[Any, Any])(implicit cbf: CanBuildFrom[CC[Any, Any], (Any, Any), CC[Any, Any]]): Option[CC[Any, Any]]

     Implementation of some for Map values.

114.  def someProduct(s: Strategy, p: Product): Option[Any]

     Implementation of some for Product values.

115.  def someRewritable(s: Strategy, r: Rewritable): Option[Any]

     Implementation of some for Rewritable values.

116.  def someTraversable[CC[U] <: Traversable[U]](s: Strategy, t: CC[Any])(implicit cbf: CanBuildFrom[CC[Any], Any, CC[Any]]): Option[CC[Any]]

     Implementation of some for Traversable values.

117.  macro def somebu(s: Strategy): Strategy

     Construct a strategy that applies s in a bottom-up fashion to some subterms at each level, stopping as soon as it succeeds once (at any level).

118.  macro def somedownup(s: Strategy): Strategy

     Construct a strategy that applies s in a top-down, prefix fashion stopping at a frontier where s succeeds on some children.

     Construct a strategy that applies s in a top-down, prefix fashion stopping at a frontier where s succeeds on some children. s is then applied in a bottom-up, postfix fashion to the result.

119.  macro def sometd(s: Strategy): Strategy

     Construct a strategy that applies s in a top-down fashion to some subterms at each level, stopping as soon as it succeeds once (at any level).

120.  macro def strategy[T](f: ==>[T, Option[T]]): Strategy

     Make a strategy from a partial function f defined on the type T.

     Make a strategy from a partial function f defined on the type T. If the subject term is a T and the function is defined at the subject term, then the function return value when applied to the subject term determines whether the strategy succeeds or fails. If the subject term is not a T or the function is not defined at the subject term, the strategy fails.

     Due to the type erasure performed on Scala programs the type test will be imprecise for some types. E.g., it is not possible to tell the difference between List[Int] and List[String].

121.  def strategyWithName[T](name: String, f: ==>[T, Option[T]]): Strategy

     As for the version without the name argument but specifies the name for the constructed strategy.

122.  def strategyf(name: String, f: (Any) ⇒ Option[Any]): Strategy

     As for the version without the name argument but specifies the name for the constructed strategy.

123.  macro def strategyf(f: (Any) ⇒ Option[Any]): Strategy

     Make a strategy from a function f.

     Make a strategy from a function f. The function return value determines whether the strategy succeeds or fails.

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

     Definition Classes

     AnyRef

125.  macro def term[T](t: T): Strategy

     Construct a strategy that succeeds only if the subject term matches the given term t.

126.  def termWithName[T](name: String, t: T): Strategy

     As for the version without the name argument but specifies the name for the constructed strategy.

127.  macro def test(s: Strategy): Strategy

     Construct a strategy that tests whether strategy s succeeds, restoring the original term on success.

     Construct a strategy that tests whether strategy s succeeds, restoring the original term on success. A synonym for where.

128.  def toString(): String

     Definition Classes

     AnyRef → Any

129.  macro def topdown(s: Strategy): Strategy

     Construct a strategy that applies s in a top-down, prefix fashion to the subject term.

130.  macro def topdownS(s: Strategy, stop: (⇒ Strategy) ⇒ Strategy): Strategy

     Construct a strategy that applies s in a top-down, prefix fashion to the subject term but stops when the strategy produced by stop succeeds.

     Construct a strategy that applies s in a top-down, prefix fashion to the subject term but stops when the strategy produced by stop succeeds. stop is given the whole strategy itself as its argument.

131.  final def wait(): Unit

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

134.  macro def where(s: Strategy): Strategy

     Construct a strategy that tests whether strategy s succeeds, restoring the original term on success.

     Construct a strategy that tests whether strategy s succeeds, restoring the original term on success. This is similar to Stratego's where, except that in this version any effects on bindings are not visible outside s.

135.  object Duplicator

     General product duplication functionality.

     General product duplication functionality. This object is a function that returns a product that applies the same constructor as the product t, but with the given children instead of t's children. The function fails if a constructor cannot be found, there are the wrong number of new children, or if one of the new children is not of the appropriate type.

136.  object Term

     Generic term deconstruction.