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. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

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

   

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

   

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

   

   Annotations

   @tailrec()

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

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

    

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

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

    

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

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

    

14. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

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

    

    Definition Classes

    AnyRef → Any

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

    

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

    

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

    

    Finds matching parens [({})].

    Finds matching parens [({})].

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

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

    

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

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

    

    Annotations

    @tailrec()

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

    

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

    

24. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

25. def isCallSite(tree: Tree): Boolean

    

26. def isDefDef(tree: Tree): Boolean

    

27. def isDefnSite(tree: Tree): Boolean

    

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

    

29. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

30. def isModPrivateProtected(tree: Tree): Boolean

    

31. 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).

32. def isTopLevel(tree: Tree): Boolean

    

33. def isTuple(tree: Tree): Boolean

    

34. def isTypeVariant(tree: Tree): Boolean

    

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

    

    Annotations

    @tailrec()

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

    

    Definition Classes

    AnyRef

37. def nestedApplies(tree: Tree): Int

    

    How many parents of tree are Term.Apply?

38. def nestedSelect(tree: Tree): Int

    

39. def noSpaceBeforeOpeningParen(tree: Tree): Boolean

    

40. final def notify(): Unit

    

    Definition Classes

    AnyRef

41. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Annotations

    @tailrec()

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

    

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

    

45. def startsSelectChain(tree: Tree): Boolean

    

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

    

    Definition Classes

    AnyRef

47. def toString(): String

    

    Definition Classes

    AnyRef → Any

48. def treeDepth(tree: Tree): Int

    

    Calculates depth to deepest child in tree.

49. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )