TreeOps

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. object MaybeTopLevelStat

   

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def assertValidParens(open: Token, close: Token): Unit

   

7. def childOf(tok: Token, tree: Tree, owners: Map[TokenHash, Tree]): Boolean

   

8. final def childOf(child: Tree, tree: Tree): Boolean

   

   Annotations

   @tailrec()

9. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. def defBody(tree: Tree): Option[Tree]

    

11. def defDefReturnType(tree: Tree): Option[Type]

    

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

    

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

14. def existsChild(f: (Tree) ⇒ Boolean)(tree: Tree): Boolean

    

    Returns true tree has a child for which f(child) is true.

15. def extractStatementsIfAny(tree: Tree): Seq[Tree]

    

16. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

17. def findSiblingGuard(generator: Generator): Option[Guard]

    

18. def getApplyArgs(formatToken: FormatToken, leftOwner: Tree): (Tree, Seq[Tree])

    

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

    

    Definition Classes

    AnyRef → Any

20. def getDequeueSpots(tree: Tree): Set[TokenHash]

    

21. def getEnumStatements(enums: Seq[Enumerator]): Seq[Enumerator]

    

22. def getMatchingParentheses(tokens: Tokens): Map[TokenHash, Token]

    

    Finds matching parens [({})].

    Finds matching parens [({})].

    Contains lookup keys in both directions, opening [({ and closing })].

23. def getOwners(tree: Tree): Map[TokenHash, Tree]

    

    Creates lookup table from token offset to its closest scala.meta tree.

24. final def getSelectChain(child: Tree, accum: Vector[Select]): Vector[Select]

    

    Annotations

    @tailrec()

25. final def getSelectChain(select: Select): Vector[Select]

    

26. def getStatementStarts(tree: Tree): Map[TokenHash, Tree]

    

27. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

28. final def isApplyInfix(op: Ident, owner: Tree): Boolean

    

29. def isBinPackDefnSite(tree: Tree): Boolean

    

30. def isBlockFunction(fun: Function): Boolean

    

31. def isCallSite(tree: Tree): Boolean

    

32. def isChainApplyParent(parent: Tree, child: Tree): Boolean

    

33. def isDefDef(tree: Tree): Boolean

    

34. def isDefnOrCallSite(tree: Tree): Boolean

    

35. def isDefnSite(tree: Tree): Boolean

    

    Returns true if the Tree is a definition site

    Returns true if the Tree is a definition site

    Currently, this includes everything from classes and defs to type applications

36. def isDefnSiteWithParams(tree: Tree): Boolean

    

    Returns true if the Tree is a class, trait or def

    Returns true if the Tree is a class, trait or def

    For classes this includes primary and secondary Ctors.

37. def isFirstOrLastToken(token: Token, owner: Tree): Boolean

    

38. def isImporterOrDefnOrCallSite(tree: Tree): Boolean

    

39. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

40. def isModPrivateProtected(tree: Tree): Boolean

    

41. def isProcedureSyntax(defn: Def): Boolean

    

42. def isSuperfluousParenthesis(open: Token, owner: Tree): Boolean

    

    Returns true if open is "unnecessary".

    Returns true if open is "unnecessary".

    An opening parenthesis is unnecessary if without it and its closing parenthesis can be removed without changing the AST. For example:

    (a(1)) will parse into the same tree as a(1).

43. def isTopLevel(tree: Tree): Boolean

    

44. final def isTopLevelInfixApplication(child: Tree): Boolean

    

    Annotations

    @tailrec()

45. def isTuple(tree: Tree): Boolean

    

46. def isTypeVariant(tree: Tree): Boolean

    

47. def isXmlBrace(owner: Tree): Boolean

    

48. final def lastLambda(first: Function): Function

    

    Annotations

    @tailrec()

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

    

    Definition Classes

    AnyRef

50. def nestedApplies(tree: Tree): Int

    

    How many parents of tree are Term.Apply?

51. def nestedSelect(tree: Tree): Int

    

52. def noSpaceBeforeOpeningParen(tree: Tree): Boolean

    

53. final def notify(): Unit

    

    Definition Classes

    AnyRef

54. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

55. final def parents(tree: Tree, accum: Seq[Tree] = Seq.empty[Tree]): Seq[Tree]

    

    Annotations

    @tailrec()

56. val splitApplyIntoLhsAndArgs: PartialFunction[Tree, (Tree, Seq[Tree])]

    

57. val splitApplyIntoLhsAndArgsLifted: (Tree) ⇒ Option[(Tree, Seq[Tree])]

    

58. def startsSelectChain(tree: Tree): Boolean

    

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

    

    Definition Classes

    AnyRef

60. def toString(): String

    

    Definition Classes

    AnyRef → Any

61. def topTypeWith(typeWith: With): With

    

    Annotations

    @tailrec()

62. def treeDepth(tree: Tree): Int

    

    Calculates depth to deepest child in tree.

63. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

66. def withChain(top: Tree): Seq[With]