object Rewriter extends Rewriter with RewriterSyntax

Linear Supertypes
RewriterSyntax, Rewriter, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Rewriter
  2. RewriterSyntax
  3. Rewriter
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. implicit class Rewrite [G] extends AnyRef
    Definition Classes
    RewriterSyntax

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

    Modify with a given function

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

    Modify with a given Partial function

    Modify with a given Partial function

    Definition Classes
    Rewriter
  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

    Replace all values of type S with the same value

    Definition Classes
    Rewriter
  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

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

    Definition Classes
    Rewriter
  19. def replaceStrategy[S](s: S)(implicit arg0: ClassTag[S]): Strategy
    Definition Classes
    Rewriter
  20. def replaceWith[G, T](s: PartialFunction[T, Option[T]], graph: G): G

    Replace with a given partial function

    Replace with a given partial function

    Definition Classes
    Rewriter
  21. def replacedWith[S, G](s: S, graph: G)(implicit arg0: ClassTag[S]): Option[G]

    Replace all values of type S with the same value, returning None if nothing was replaced, or the rewritten graph otherwise.

    Replace all values of type S with the same value, returning None if nothing was replaced, or the rewritten graph otherwise.

    Definition Classes
    Rewriter
  22. def rewriteFirstWithStrategy[G](strategy: Strategy, graph: G): G

    Replace with a given strategy (breadth first)

    Replace with a given strategy (breadth first)

    Definition Classes
    Rewriter
  23. def rewriteWithStrategy[G](strategy: Strategy, graph: G): G

    Replace with a given strategy (top down)

    Replace with a given strategy (top down)

    Definition Classes
    Rewriter
  24. 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

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

    Definition Classes
    Rewriter
  25. def singletonStrategy[S](implicit tag: ClassTag[S]): Strategy
    Definition Classes
    Rewriter
  26. def singletons[G](predicate: (Any) ⇒ Boolean)(graph: G): G

    Make singletons of all components, except the ones not accepted by the predicate

    Make singletons of all components, except the ones not accepted by the predicate

    Definition Classes
    Rewriter
  27. def singletons[G](graph: G): G

    Make singletons of all components

    Make singletons of all components

    Definition Classes
    Rewriter
  28. def singletonsBy[G](by: PartialFunction[Any, Any], bys: PartialFunction[Any, Any]*)(graph: G): G

    Make singletons of all components, based on the class name of the component by default and on the class name + the result of the by function

    Make singletons of all components, based on the class name of the component by default and on the class name + the result of the by function

    Definition Classes
    Rewriter
  29. def singletonsByStrategy(by: PartialFunction[Any, Any], bys: PartialFunction[Any, Any]*): Strategy
    Definition Classes
    Rewriter
  30. def startAll[G](graph: G): Eval[List[StartResult]]

    start components from the bottom up

    start components from the bottom up

    Definition Classes
    Rewriter
  31. def stopAll[G](graph: G): Eval[List[StopResult]]

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

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

    Definition Classes
    Rewriter
  32. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  33. def toString(): String
    Definition Classes
    AnyRef → Any
  34. def topBreadthfirst(s: Strategy): Strategy
    Definition Classes
    Rewriter
  35. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  37. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from RewriterSyntax

Inherited from Rewriter

Inherited from AnyRef

Inherited from Any

Ungrouped