org.bitbucket.inkytonik.kiama.rewriting

Cloner

trait Cloner extends AnyRef

Implementation of cloning operations. These operations must be mixed in to an instance of the rewriting library which will then be used as the underlying rewriting behaviour.

Self Type
Cloner with Rewriter
Source
Cloner.scala
Linear Supertypes
AnyRef, Any
Known Subclasses
Cloner
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Cloner
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. def deepclone[T <: Product](t: T): T

    Deep clone the term t.

    Deep clone the term t. Only applicable if the base type of the tree is a Product.

  9. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  12. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  15. def lazyclone[T <: Product](t: T, bu: (Strategy) ⇒ Strategy = everywherebu("everywherebu", _)): T

    Lazily deep clone the term t; i.

    Lazily deep clone the term t; i.e., only clone sub-trees if they occur elsewhere in the tree. Only applicable if the base type of the tree is a Product. The bu argument specifies the strategy to use when traversing the term. It should be a bottom-up traversal, but can be tailored to skip some sub-trees if desired. bu defaults to everywherebu.

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

    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  20. def toString(): String

    Definition Classes
    AnyRef → Any

  21. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  23. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped