Rewriter

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. def modify[G, T](f: (T) ⇒ T, graph: G)(implicit arg0: ClassTag[T]): G

    

    Modify with a given function

13. def modifyWith[G, T](f: PartialFunction[T, T], graph: G)(implicit arg0: ClassTag[T]): G

    

    Modify with a given Partial function

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

    

    Definition Classes

    AnyRef

15. final def notify(): Unit

    

    Definition Classes

    AnyRef

16. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

17. def replace[S, G](s: S, graph: G)(implicit arg0: ClassTag[S]): G

    

    Replace all values of type S, with the same value

18. def replaceFirst[S, G](s: S, graph: G)(implicit arg0: ClassTag[S]): G

    

    Replace the first value of type S (topdown, with another value

19. def replaceStrategy[S](s: S)(implicit arg0: ClassTag[S]): Strategy

    

20. def replaceWith[G, T](s: PartialFunction[T, Option[T]], graph: G): G

    

    Replace with a given partial function

21. def rewriteFirstWithStrategy[G](strategy: Strategy, graph: G): G

    

    Replace with a given strategy (breadth first)

22. def rewriteWithStrategy[G](strategy: Strategy, graph: G): G

    

    Replace with a given strategy (top down)

23. def singleton[S, G](graph: G)(implicit arg0: ClassTag[S]): G

    

    Take the first value of a given type (approximated with a ClassTag) and replace it everywhere in the graph

24. def singletonStrategy[S](implicit tag: ClassTag[S]): Strategy

    

25. def singletons[G](predicate: (Any) ⇒ Boolean)(graph: G): G

    

    Make singletons of all components

26. def singletons[G](graph: G): G

    

    Make singletons of all components

27. def singletonsStrategy(predicate: (Any) ⇒ Boolean): Strategy

    

28. def start[G](graph: G): Eval[List[StartResult]]

    

    start components from the bottom up

29. def stop[G](graph: G): Eval[List[StopResult]]

    

    stop components from the top down we try to stop components even if previous components fail to stop

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

    

    Definition Classes

    AnyRef

31. def toString(): String

    

    Definition Classes

    AnyRef → Any

32. def topBreadthfirst(s: Strategy): Strategy

    

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( ... )