trait Rewriter extends AnyRef
Functions for rewriting parts of an object graph representing services or configuration with different implementations.
This is used for "Dependency Injection" to replace some service implementations with other implementations.
- Alphabetic
- By Inheritance
- Rewriter
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
modify[G, T](f: (T) ⇒ T, graph: G)(implicit arg0: ClassTag[T]): G
Modify with a given function
-
def
modifyWith[G, T](f: PartialFunction[T, T], graph: G)(implicit arg0: ClassTag[T]): G
Modify with a given Partial function
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
replace[S, G](s: S, graph: G)(implicit arg0: ClassTag[S]): G
Replace all values of type S, with the same value
-
def
replaceFirst[S, G](s: S, graph: G)(implicit arg0: ClassTag[S]): G
Replace the first value of type S (topdown, with another value
- def replaceStrategy[S](s: S)(implicit arg0: ClassTag[S]): Strategy
-
def
replaceWith[G, T](s: PartialFunction[T, Option[T]], graph: G): G
Replace with a given partial function
-
def
rewriteFirstWithStrategy[G](strategy: Strategy, graph: G): G
Replace with a given strategy (breadth first)
-
def
rewriteWithStrategy[G](strategy: Strategy, graph: G): G
Replace with a given strategy (top down)
-
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
- def singletonStrategy[S](implicit tag: ClassTag[S]): Strategy
-
def
singletons[G](predicate: (Any) ⇒ Boolean)(graph: G): G
Make singletons of all components
-
def
singletons[G](graph: G): G
Make singletons of all components
- def singletonsStrategy(predicate: (Any) ⇒ Boolean): Strategy
-
def
start[G](graph: G): Eval[List[StartResult]]
start components from the bottom up
-
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
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def topBreadthfirst(s: Strategy): Strategy
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )