trait PlatedFunctions extends CommonPlatedFunctions
Ordering
- Alphabetic
- By Inheritance
Inherited
- PlatedFunctions
- CommonPlatedFunctions
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
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 children[A](a: A)(implicit arg0: Plated[A]): List[A]
get the immediate self-similar children of a target
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def plate[A](implicit P: Plated[A]): Traversal[A, A]
Traversal of immediate self-similar children
Traversal of immediate self-similar children
- Definition Classes
- CommonPlatedFunctions
- def rewrite[A](f: (A) => Option[A])(a: A)(implicit arg0: Plated[A]): A
rewrite a target by applying a rule as often as possible until it reaches a fixpoint (this is an infinite loop if there is no fixpoint)
- def rewriteOf[A](l: Setter[A, A])(f: (A) => Option[A])(a: A): A
rewrite a target by applying a rule within a Setter, as often as possible until it reaches a fixpoint (this is an infinite loop if there is no fixpoint)
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def transform[A](f: (A) => A)(a: A)(implicit arg0: Plated[A]): A
transform every element
- def transformCounting[A](f: (A) => Option[A])(a: A)(implicit arg0: Plated[A]): (Int, A)
transforming counting changes
- def transformM[A, M[_]](f: (A) => M[A])(a: A)(implicit arg0: Plated[A], arg1: Monad[M]): M[A]
transforming every element using monadic transformation
- def transformOf[A](l: Setter[A, A])(f: (A) => A)(a: A): A
transform every element by applying a Setter
- def universe[A](a: A)(implicit arg0: Plated[A]): LazyList[A]
get all transitive self-similar elements of a target, including itself
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()