scala.tools.refactoring.common

InsertionPositions

trait InsertionPositions extends Selections with TreeTransformations

Self Type
InsertionPositions with CompilerAccess
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. InsertionPositions
  2. TreeTransformations
  3. TreeFactory
  4. Transformations
  5. Selections
  6. PimpedTrees
  7. TreeTraverser
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. implicit class AdditionalListMethods[T] extends AnyRef

    Replace the first sequence of elements with another sequence.

  2. implicit class AdditionalTreeListMethods extends AnyRef

    Definition Classes
    TreeTransformations
  3. implicit class CopyTypeFromOtherTree extends AnyRef

    Definition Classes
    TreeFactory
  4. implicit class DefDefMethods extends AnyRef

    Definition Classes
    PimpedTrees
  5. case class FileSelection(file: AbstractFile, root: nsc.Global.Tree, from: Int, to: Int) extends (Selections.this)#Selection with Product with Serializable

    Definition Classes
    Selections
  6. class FilterTreeTraverser extends nsc.Global.FilterTreeTraverser with (TreeTraverser.this)#Traverser

    Definition Classes
    TreeTraverser
  7. case class ImportSelectorTree(name: (PimpedTrees.this)#NameTree, rename: nsc.Global.Tree) extends nsc.Global.Tree with Product with Serializable

    Represent an import selector as a tree, including both names as trees.

  8. implicit class ImportSelectorTreeExtractor extends AnyRef

    Import selectors are not trees, but we can provide an extractor that converts the ImportSelectors into our own ImportSelectorTrees.

  9. case class InsertionPoint(enclosing: nsc.Global.Tree, mkEnclosing: (nsc.Global.Tree) ⇒ nsc.Global.Tree, pos: nsc.Global.Position) extends (nsc.Global.Tree) ⇒ nsc.Global.Tree with Product with Serializable

    A concrete position for tree insertions.

  10. type InsertionPosition = PartialFunction[nsc.Global.Tree, (InsertionPositions.this)#InsertionPoint]

    An insertion position is a function that may be defined for an enclosing tree.

    An insertion position is a function that may be defined for an enclosing tree. When defined, it returns an instance of an InsertionPoint.

  11. case class ModifierTree(flag: Long) extends nsc.Global.Tree with Product with Serializable

    Represent a modifier as a tree, including its position.

  12. case class MultipleAssignment(extractor: nsc.Global.Tree, names: List[nsc.Global.ValDef], rhs: nsc.Global.Tree) extends nsc.Global.Tree with Product with Serializable

    Definition Classes
    PimpedTrees
  13. case class NameTree(name: nsc.Global.Name) extends nsc.Global.Tree with Product with Serializable

    Represent a Name as a tree, including its position.

  14. case class NamedArgument(nameTree: (PimpedTrees.this)#NameTree, rhs: nsc.Global.Tree) extends nsc.Global.SymTree with nsc.Global.RefTree with Product with Serializable

    Definition Classes
    PimpedTrees
  15. class NotInstanceOf[T] extends AnyRef

    Definition Classes
    PimpedTrees
  16. abstract class PlainText extends nsc.Global.Tree

    The PlainText "tree" provides a hook into the source code generation.

  17. trait Selection extends AnyRef

    Definition Classes
    Selections
  18. implicit class SelectionDependentInsertionPoints extends AnyRef

  19. case class SelfTypeTree(name: (PimpedTrees.this)#NameTree, tpt: nsc.Global.Tree) extends nsc.Global.Tree with Product with Serializable

    Representation of self type annotations: self: A with B => ^^^^^^^^^^^^^^

  20. case class SuperConstructorCall(clazz: nsc.Global.Tree, args: List[nsc.Global.Tree]) extends nsc.Global.Tree with Product with Serializable

    The call to the super constructor in a class: class A(i: Int) extends B(i) ^^^^

  21. class TemplateMethods extends AnyRef

    Definition Classes
    PimpedTrees
  22. abstract class Transformation[X, Y] extends (X) ⇒ Option[Y]

    Definition Classes
    Transformations
  23. trait Traverser extends nsc.Global.Traverser

    A traverser that also traverses a TypeTree's original type.

  24. trait TraverserWithFakedTrees extends nsc.Global.Traverser

    A traverser that creates fake trees for various type trees so they can be treated as if they were regular trees.

  25. class TreeMethodsForPositions extends AnyRef

    Add some methods to Tree that make it easier to compare Trees by position and to extract the position of a tree's name, which is tricky for Selects.

  26. implicit class TreeReplacesOtherTreeViaPosition[T <: nsc.Global.Tree] extends AnyRef

    Definition Classes
    TreeTransformations
  27. case class TreeSelection(root: nsc.Global.Tree) extends (Selections.this)#Selection with Product with Serializable

    Definition Classes
    Selections
  28. class TreeWithSymbolTraverser extends nsc.Global.Traverser with (TreeTraverser.this)#Traverser

    Definition Classes
    TreeTraverser
  29. type X = nsc.Global.Tree

    Definition Classes
    Transformations
  30. case class SourceLayoutTree(kind: Kinds) extends nsc.Global.Tree with Product with Serializable

    A SourceLayoutTree can be used to insert arbitrary text into the code, for example, blank lines.

Value Members

  1. def ![X](t: ⇒ (InsertionPositions.this)#T[X, X]): (InsertionPositions.this)#Transformation[X, X]

    Definition Classes
    Transformations
  2. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  3. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  4. final def ##(): Int

    Definition Classes
    AnyRef → Any
  5. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  6. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  7. object ApplyExtractor

    Definition Classes
    PimpedTrees
  8. object BlockExtractor

    Unify the children of a Block tree and sort them in the same order they appear in the source code.

  9. object FileSelection extends Serializable

    Definition Classes
    Selections
  10. object Invisible extends nsc.Global.Position

    Definition Classes
    TreeFactory
  11. object ModifierTree extends Serializable

    Extract the modifiers with their position from a Modifiers object.

  12. object NameTree extends Serializable

    Definition Classes
    PimpedTrees
  13. object NoBlock extends (PimpedTrees.this)#NotInstanceOf[nsc.Global.Block]

    Definition Classes
    PimpedTrees
  14. object NoFunction extends (PimpedTrees.this)#NotInstanceOf[nsc.Global.Function]

    Definition Classes
    PimpedTrees
  15. object NoImportSelectorTree extends (PimpedTrees.this)#NotInstanceOf[(PimpedTrees.this)#ImportSelectorTree]

    Definition Classes
    PimpedTrees
  16. object NoPackageDef extends (PimpedTrees.this)#NotInstanceOf[nsc.Global.PackageDef]

    Definition Classes
    PimpedTrees
  17. object PlainText

    Definition Classes
    PimpedTrees
  18. object TemplateExtractor

    Provides a finer-grained extractor for Template that distinguishes between class constructor parameters, early definitions, parents, self type annotation and the real body.

  19. def abstractFileToTree(file: AbstractFile): nsc.Global.Tree

    Definition Classes
    TreeTransformations
  20. def addImportTransformation(importsToAdd: Iterable[String]): (InsertionPositions.this)#Transformation[nsc.Global.Tree, nsc.Global.Tree]

    Definition Classes
    TreeTransformations
  21. implicit def additionalTemplateMethods(t: nsc.Global.Template): (InsertionPositions.this)#TemplateMethods

    Definition Classes
    PimpedTrees
  22. implicit def additionalTreeMethodsForPositions(t: nsc.Global.Tree): (InsertionPositions.this)#TreeMethodsForPositions

    Definition Classes
    PimpedTrees
  23. def allChildren(t: ⇒ (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]): (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]

    Applies a transformation to all subtrees of a tree T, returning a new tree,typically of the same kind as T.

    Applies a transformation to all subtrees of a tree T, returning a new tree,typically of the same kind as T.

    If the transformation fails on one child, abort and fail the whole application.

    Definition Classes
    Transformations
  24. def ancestorSymbols(t: nsc.Global.Tree): List[nsc.Global.Symbol]

    returns

    Returns the (symbol) ancestors of the tree excluding the ROOT in descending order. Also filters the symbols for package objects!

    Definition Classes
    PimpedTrees
  25. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  26. def asSelectorString(t: nsc.Global.Tree): String

    Converts a tree containing Idents and Selects to a . separated string.

    Converts a tree containing Idents and Selects to a . separated string.

    Definition Classes
    PimpedTrees
  27. lazy val atBeginningOfCaseBody: (InsertionPositions.this)#InsertionPosition

    Inserts trees as the first statement in a case body (rhs).

  28. lazy val atBeginningOfNewBlockInRhsOfVal: (InsertionPositions.this)#InsertionPosition

    Inserts trees in a new block at the right hand side of a ValDef.

    Inserts trees in a new block at the right hand side of a ValDef. val a = 1 becomes val a = { inserted; 1 }

  29. lazy val atBeginningOfNewDefBody: (InsertionPositions.this)#InsertionPosition

    Inserts trees as the first statement in a method body.

  30. lazy val atBeginningOfNewFunctionBody: (InsertionPositions.this)#InsertionPosition

    Inserts trees as the first statement in a function body.

    Inserts trees as the first statement in a function body. Note: Functions of the form _ + 1 are not treated as insertion positions.

  31. lazy val atEndOfArgumentList: (InsertionPositions.this)#InsertionPosition

    Inserts a tree at the end of an argument list.

  32. lazy val atEndOfValueParameterList: (InsertionPositions.this)#InsertionPosition

    Inserts ValDef trees at the end of a parameter list.

  33. def bottomup(t: ⇒ (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]): (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]

    Definition Classes
    Transformations
  34. def children: (nsc.Global.Tree) ⇒ List[nsc.Global.Tree]

    Returns all children that have a representation in the source code.

    Returns all children that have a representation in the source code. This includes Name and Modifier trees and excludes everything that has no Position or is an EmptyTree.

    Definition Classes
    PimpedTrees
  35. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. def constant(y: (InsertionPositions.this)#X): (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]

    Creates a transformation that always returns the value x.

    Creates a transformation that always returns the value x.

    Definition Classes
    Transformations
  37. def endPositionAtEndOfSourceFile(pos: nsc.Global.Position, otherWise: Option[Int] = None): Int

    Trees that reach the end of the file don't seem to have the correct end position, except if there's a newline at the end.

    Trees that reach the end of the file don't seem to have the correct end position, except if there's a newline at the end.

    Definition Classes
    PimpedTrees
  38. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  39. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  40. def escapeScalaKeywordsForImport(n: String): String

    Definition Classes
    PimpedTrees
  41. def escapeScalaKeywordsForImport(n: nsc.Global.Name): String

    Takes a name and wraps it in if the name corresponds to a Scala keyword.

    Takes a name and wraps it in if the name corresponds to a Scala keyword.

    Definition Classes
    PimpedTrees
  42. def fail[X]: (InsertionPositions.this)#T[X, X]

    Always fails, independent of the input.

    Always fails, independent of the input.

    Definition Classes
    Transformations
  43. def filter(f: PartialFunction[nsc.Global.Tree, Boolean]): (InsertionPositions.this)#T[nsc.Global.Tree, nsc.Global.Tree]

    Definition Classes
    TreeTransformations
  44. def filterTree(t: nsc.Global.Tree, traverser: nsc.Global.FilterTreeTraverser): collection.immutable.List[nsc.Global.Tree]

    Definition Classes
    TreeTraverser
  45. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  46. val findAllTreesWithTheSamePosition: (nsc.Global.Tree) ⇒ Iterable[nsc.Global.Tree]

    Definition Classes
    PimpedTrees
  47. def findOriginalTree: (nsc.Global.Tree) ⇒ Option[nsc.Global.Tree]

    Finds a tree by its position, can be used to find the original tree from a transformed tree.

    Finds a tree by its position, can be used to find the original tree from a transformed tree.

    If multiple trees are candidates, then take the last one, because it is likely more specific.

    Definition Classes
    PimpedTrees
  48. def findSymbolForImportSelector(expr: nsc.Global.Tree, name: nsc.Global.Name): Option[nsc.Global.Symbol]

    Searches for a Symbol of a name in the type members of a tree.

    Searches for a Symbol of a name in the type members of a tree.

    This is mainly used for ImportSelectors, which don't carry any symbol information with them.

    expr

    The expr of an Import tree.

    name

    The name of an ImportSelector of the import.

    Definition Classes
    PimpedTrees
  49. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  50. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  51. def id[X]: (InsertionPositions.this)#T[X, X]

    Definition Classes
    Transformations
  52. def isClassTag(c: nsc.Global.Constant): Boolean

    Definition Classes
    PimpedTrees
  53. def isEmptyTree(t: nsc.Global.Tree): Boolean

    Returns whether the tree is considered empty.

    Returns whether the tree is considered empty.

    Prior to Scala 2.10.1 it was sufficient to check Tree#isEmpty, but now we also need to check if the tree is equal to emptyValDef.

    Definition Classes
    PimpedTrees
  54. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  55. def isSyntheticBlock(t: nsc.Global.Tree): Boolean

  56. def keepTree(t: nsc.Global.Tree): Boolean

    Definition Classes
    PimpedTrees
  57. val locatePackageLevelImports: (InsertionPositions.this)#T[nsc.Global.Tree, (nsc.Global.PackageDef, List[nsc.Global.Import], List[nsc.Global.Tree])]

    Locates the imports in a PackageDef.

    Locates the imports in a PackageDef. If we have nested packages, it will only match in the innermost.

    Definition Classes
    TreeTransformations
  58. def matchingChildren(t: (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]): (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]

    Applies a transformation to all subtrees of a tree T, returning a new tree,typically of the same kind as T.

    Applies a transformation to all subtrees of a tree T, returning a new tree,typically of the same kind as T.

    If the transformation fails on one child, apply the identity transformation id and don't fail, unlike allChildren.

    Definition Classes
    Transformations
  59. def mkApply(mods: nsc.Global.Modifiers = NoMods, parameters: List[List[nsc.Global.Symbol]] = Nil :: Nil, body: List[nsc.Global.Tree], typeParameters: List[nsc.Global.TypeDef] = Nil): nsc.Global.DefDef

    Definition Classes
    TreeFactory
  60. def mkAssignmentToCall(call: nsc.Global.Tree, returns: List[nsc.Global.Symbol]): nsc.Global.Tree

    Definition Classes
    TreeFactory
  61. def mkBlock(trees: List[nsc.Global.Tree]): nsc.Global.Block

    Definition Classes
    TreeFactory
  62. def mkCallDefDef(name: String, arguments: List[List[nsc.Global.Symbol]] = Nil :: Nil, returns: List[nsc.Global.Symbol] = Nil): nsc.Global.Tree

    Definition Classes
    TreeFactory
  63. def mkCallValDef(name: String, returns: List[nsc.Global.Symbol] = Nil): nsc.Global.Tree

    Definition Classes
    TreeFactory
  64. def mkCanEqual(classSymbol: nsc.Global.Symbol): nsc.Global.DefDef

    Definition Classes
    TreeFactory
  65. def mkCaseClass(mods: nsc.Global.Modifiers = NoMods, name: String, tparams: List[nsc.Global.TypeDef] = Nil, argss: List[List[(nsc.Global.Modifiers, String, nsc.Global.Tree)]] = Nil, body: List[nsc.Global.Tree] = Nil, parents: List[nsc.Global.Tree] = Nil, superArgs: List[nsc.Global.Tree] = Nil): nsc.Global.ClassDef

    Definition Classes
    TreeFactory
  66. def mkClass(mods: nsc.Global.Modifiers = NoMods, name: String, tparams: List[nsc.Global.TypeDef] = Nil, argss: List[List[(nsc.Global.Modifiers, String, nsc.Global.Tree)]] = Nil, body: List[nsc.Global.Tree] = Nil, parents: List[nsc.Global.Tree] = Nil, superArgs: List[nsc.Global.Tree] = Nil): nsc.Global.ClassDef

    Definition Classes
    TreeFactory
  67. def mkDefDef(mods: nsc.Global.Modifiers = NoMods, name: String, parameters: List[List[nsc.Global.Symbol]] = Nil :: Nil, body: List[nsc.Global.Tree], typeParameters: List[nsc.Global.TypeDef] = Nil, returnTypeOpt: Option[nsc.Global.TypeTree] = None): nsc.Global.DefDef

    Definition Classes
    TreeFactory
  68. def mkEquals(classSymbol: nsc.Global.Symbol, classParamsForEqual: List[nsc.Global.ValDef], callSuper: Boolean): nsc.Global.DefDef

    Definition Classes
    TreeFactory
  69. def mkFunctionCallWithFunctionArgument(selector: nsc.Global.Tree, fun: String, param: nsc.Global.TermName, body: nsc.Global.Tree): nsc.Global.Tree

    Creates a function call fun on the selector and passes a function with a single parameter param and the body body.

    Creates a function call fun on the selector and passes a function with a single parameter param and the body body.

    Example:

    someExpr becomes someExpr fun (param => body)

    Definition Classes
    TreeFactory
  70. def mkFunctionCallWithZeroArgFunctionArgument(selector: nsc.Global.Tree, fun: String, body: nsc.Global.Tree): nsc.Global.Tree

    Creates a function call fun on the selector and passes a function with no parameter and the body body.

    Creates a function call fun on the selector and passes a function with no parameter and the body body.

    Example:

    someExpr becomes someExpr fun (body)

    Definition Classes
    TreeFactory
  71. def mkHashcode(classSymbol: nsc.Global.Symbol, classParamsForHashcode: List[nsc.Global.ValDef], callSuper: Boolean, prime: Int = 41): nsc.Global.DefDef

    Definition Classes
    TreeFactory
  72. def mkImportFromStrings(qualifier: String, name: String): nsc.Global.Import

    Definition Classes
    TreeFactory
  73. def mkImportTrees(trees: List[nsc.Global.Select], enclosingPackage: String): collection.immutable.List[nsc.Global.Import]

    Definition Classes
    TreeFactory
  74. def mkModule(mods: nsc.Global.Modifiers = NoMods, name: String, body: List[nsc.Global.Tree] = Nil, parents: List[nsc.Global.Tree] = Nil): nsc.Global.ModuleDef

    Definition Classes
    TreeFactory
  75. def mkParam(name: String, tpe: nsc.Global.Type, defaultVal: nsc.Global.Tree = EmptyTree): nsc.Global.ValDef

    Definition Classes
    TreeFactory
  76. def mkRenamedImportTree(t: (InsertionPositions.this)#ImportSelectorTree, name: String): (InsertionPositions.this)#ImportSelectorTree

    Definition Classes
    TreeFactory
  77. def mkRenamedSymTree(t: nsc.Global.SymTree, nameString: String): nsc.Global.SymTree

    Definition Classes
    TreeFactory
  78. def mkRenamedTypeTree(t: nsc.Global.TypeTree, name: String, originalSymbol: nsc.Global.Symbol): nsc.Global.TypeTree

    Definition Classes
    TreeFactory
  79. def mkReturn(s: List[nsc.Global.Symbol]): nsc.Global.Tree

    Definition Classes
    TreeFactory
  80. def mkValDef(name: String, rhs: nsc.Global.Tree, tpt: nsc.Global.TypeTree = new TypeTree): nsc.Global.ValDef

    Definition Classes
    TreeFactory
  81. def mkValOrVarDef(mods: nsc.Global.Modifiers, name: String, rhs: nsc.Global.Tree, tpt: nsc.Global.TypeTree = new TypeTree): nsc.Global.ValDef

    Definition Classes
    TreeFactory
  82. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  83. def not[X](t: ⇒ (InsertionPositions.this)#T[X, X]): (InsertionPositions.this)#Transformation[X, X]

    Definition Classes
    Transformations
  84. final def notify(): Unit

    Definition Classes
    AnyRef
  85. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  86. def once[X <: AnyRef](t: (InsertionPositions.this)#T[X, X]): (InsertionPositions.this)#T[X, X]

    Do a transformation until it succeeded once, then just fail.

    Do a transformation until it succeeded once, then just fail.

    Note that because of the statefulness of once, you need to make sure that it isn't accidentally passed as a by-name parameter to another transformation and instantiated multiple times.

    Definition Classes
    Transformations
  87. val originalLeftSibling: (nsc.Global.Tree) ⇒ Option[nsc.Global.Tree]

    Definition Classes
    PimpedTrees
  88. val originalParentOf: (nsc.Global.Tree) ⇒ Option[nsc.Global.Tree]

    Definition Classes
    PimpedTrees
  89. val originalRightSibling: (nsc.Global.Tree) ⇒ Option[nsc.Global.Tree]

    Definition Classes
    PimpedTrees
  90. def postorder(t: ⇒ (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]): (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]

    Definition Classes
    Transformations
  91. def predicate[X](f: (X) ⇒ Boolean): (InsertionPositions.this)#T[X, X]

    Definition Classes
    Transformations
  92. def predicate[X](f: PartialFunction[X, Boolean]): (InsertionPositions.this)#T[X, X]

    We often want to use transformations as predicates, which execute the next transformations if the result is true.

    We often want to use transformations as predicates, which execute the next transformations if the result is true. For example:

    val tree_with_range_pos = filter[Tree] { case t: Tree => t.pos.isRange }

    We can then use the predicate like this: tree_with_range_pos andThen do_something_with_the_tree orElse nothing

    Definition Classes
    Transformations
  93. def preorder(t: ⇒ (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]): (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]

    Definition Classes
    Transformations
  94. def replaceTree(from: nsc.Global.Tree, to: nsc.Global.Tree): (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]

    Definition Classes
    TreeTransformations
  95. val setNoPosition: (InsertionPositions.this)#T[nsc.Global.Tree, nsc.Global.Tree]

    Definition Classes
    TreeTransformations
  96. def shallowDuplicate[T <: nsc.Global.Tree](orig: T): T

    Definition Classes
    TreeTransformations
  97. def skipForExpressionTrees(t: nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    Selections
  98. def succeed[X]: (InsertionPositions.this)#T[X, X]

    Always succeeds and returns the input unchanged.

    Always succeeds and returns the input unchanged.

    Definition Classes
    Transformations
  99. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  100. def toString(): String

    Definition Classes
    AnyRef → Any
  101. def topPackageDef(t: nsc.Global.PackageDef): nsc.Global.PackageDef

    returns

    Returns the most specific package declaration in the compilation unit. For example, given the following declaration:

    package a package b

    class C

    it returns b. If there are further nested packages, they are ignored:

    package a class C package b

    returns a.

    Definition Classes
    PimpedTrees
  102. def topdown(t: ⇒ (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]): (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]

    Definition Classes
    Transformations
  103. def transform(f: PartialFunction[nsc.Global.Tree, nsc.Global.Tree]): (InsertionPositions.this)#T[nsc.Global.Tree, nsc.Global.Tree]

    Definition Classes
    TreeTransformations
  104. def transformation[X, Y](f: PartialFunction[X, Y]): (InsertionPositions.this)#T[X, Y]

    Construct a transformation from a partial function; this is the most commonly used way to create new transformations, for example like:

    Construct a transformation from a partial function; this is the most commonly used way to create new transformations, for example like:

    val reverse_all_class_members = transformation[Tree, Tree] { case t: Template => t.copy(body = t.body.reverse) }

    Definition Classes
    Transformations
  105. def traverse(tree: nsc.Global.Tree, f: (nsc.Global.Tree) ⇒ nsc.Global.Tree): nsc.Global.Tree

    Definition Classes
    TreeTransformationsTransformations
  106. def traverseAndTransformAll(t: ⇒ (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]): (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]

    Definition Classes
    Transformations
  107. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  108. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  109. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  110. def (t: ⇒ (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]): (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]

    Applies a transformation bottom-up, that is, it applies the transformation to the children of the tree first and then to their parent.

    Applies a transformation bottom-up, that is, it applies the transformation to the children of the tree first and then to their parent. The consequence is that the parent "sees" its transformed children.

    Definition Classes
    Transformations
  111. def (t: ⇒ (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]): (InsertionPositions.this)#T[(InsertionPositions.this)#X, (InsertionPositions.this)#X]

    Applies a transformation top-down, that is, it applies the transformation to the tree T and then passes the transformed T to all children.

    Applies a transformation top-down, that is, it applies the transformation to the tree T and then passes the transformed T to all children. The consequence is that the children "see" their new parent.

    Definition Classes
    Transformations

Deprecated Value Members

  1. object SourceLayouts

    Definition Classes
    PimpedTrees
    Annotations
    @deprecated
    Deprecated

    (Since version 0.5.0) Use PlainText objects and its components

Inherited from TreeTransformations

Inherited from TreeFactory

Inherited from Transformations

Inherited from Selections

Inherited from PimpedTrees

Inherited from TreeTraverser

Inherited from AnyRef

Inherited from Any

Ungrouped