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 EndOfFirstCall

   

5. object MaybeTopLevelStat

   

6. object SplitCallIntoParts

   

7. object SplitDefnIntoParts

   

8. final def asInfixApp(tree: Tree, flag: Boolean = true): Option[InfixApp]

   

   Annotations

   @inline()

9. final def asInfixApp(tree: Tree): Option[InfixApp]

   

10. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

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

    

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

    

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

    

    Annotations

    @tailrec()

14. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

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

    

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

    

    Definition Classes

    AnyRef

18. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

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

    

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

20. def existsParentOfType[A <: Tree](tree: Tree)(implicit classifier: Classifier[Tree, A]): Boolean

    

    Returns true if a matching ancestor of a given type exists.

    Returns true if a matching ancestor of a given type exists.

    Annotations

    @inline()

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

    

22. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

23. def findFirstTreeBetween(tree: Tree, beg: Token, end: Token): Option[Tree]

    

    Annotations

    @tailrec()

24. def findInterpolate(tree: Tree, res: Option[Interpolate] = None): Option[Interpolate]

    

    Annotations

    @tailrec()

25. def findNextInfixInParent(tree: Tree, scope: Tree): Option[Name]

    

    Annotations

    @tailrec()

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

    

27. def findTreeWithParent(tree: Tree)(pred: (Tree) ⇒ Option[Boolean]): Option[Tree]

    

    Returns first ancestor whose parent matches the given predicate.

    Returns first ancestor whose parent matches the given predicate.

    Annotations

    @tailrec()

28. def findTreeWithParentOfType[A <: Tree](tree: Tree)(implicit classifier: Classifier[Tree, A]): Option[Tree]

    

    Returns first ancestor with a parent of a given type.

29. def findTreeWithParentSimple(tree: Tree)(pred: (Tree) ⇒ Boolean): Option[Tree]

    

30. def getAssignAtSingleArgCallSite(tree: Tree): Option[Assign]

    

31. def getBlockSingleStat(b: Block): Option[Stat]

    

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

    

    Definition Classes

    AnyRef → Any

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

    

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

    

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

    

    Finds matching parens [({})].

    Finds matching parens [({})].

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

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

    

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

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

    

    Annotations

    @tailrec()

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

    

39. def getStripMarginChar(ft: FormatToken): Option[Char]

    

40. def getStripMarginChar(t: Tree): Option[Char]

    

41. def getTermLineSpan(b: Tree): Int

    

42. def getTermSingleStat(t: Term): Option[Tree]

    

43. def hasExplicitImplicit(param: Param): Boolean

    

44. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

45. def infixSequenceLength(app: InfixApp): Int

    

46. def isBlockFunction(fun: Function): Boolean

    

    Annotations

    @tailrec()

47. def isCallSite(tree: Tree)(implicit style: ScalafmtConfig): Boolean

    

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

    

49. def isChildOfCaseClause(tree: Tree): Boolean

    

50. def isDefDef(tree: Tree): Boolean

    

51. def isDefnOrCallSite(tree: Tree)(implicit style: ScalafmtConfig): Boolean

    

52. def isDefnSite(tree: Tree): Boolean

    

    Returns true if the scala.meta.Tree is a definition site

    Returns true if the scala.meta.Tree is a definition site

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

53. def isDefnSiteWithParams(tree: Tree): Boolean

    

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

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

    For classes this includes primary and secondary Ctors.

54. def isExplicitImplicit(m: Mod): Boolean

    

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

    

56. def isFunctionWithBraces(fun: Function): Boolean

    

57. def isHiddenImplicit(m: Mod): Boolean

    

    In cases like:

    In cases like:

      class X(
        implicit
        private[this] val i1: Int,
        private[this] var i2: String
    )

    val i1, and var i2 have a Mod.Implicit with empty tokens.

58. final def isInfixApp(tree: Tree): Boolean

    

    Annotations

    @inline()

59. final def isInfixOp(tree: Tree): Boolean

    

60. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

61. def isModPrivateProtected(tree: Tree): Boolean

    

62. def isProcedureSyntax(defn: Def): Boolean

    

63. def isSingleElement(elements: List[Tree], value: Tree): Boolean

    

64. def isSuperfluousParenthesis(open: LeftParen, owner: Tree): Boolean

    

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

66. def isTopLevel(tree: Tree): Boolean

    

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

    

    Annotations

    @tailrec()

68. def isTripleQuote(token: Token): Boolean

    

69. def isTuple(tree: Tree): Boolean

    

70. def isTypeVariant(tree: Tree): Boolean

    

71. def isXmlBrace(owner: Tree): Boolean

    

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

    

    Annotations

    @tailrec()

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

    

    Definition Classes

    AnyRef

74. def nestedApplies(tree: Tree): Int

    

    How many parents of tree are Term.Apply?

75. def nestedSelect(tree: Tree): Int

    

76. def noSpaceBeforeOpeningParen(tree: Tree)(implicit style: ScalafmtConfig): Boolean

    

77. final def notify(): Unit

    

    Definition Classes

    AnyRef

78. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

79. final def numParents(tree: Tree, cnt: Int = 0)(f: (Tree) ⇒ Boolean): Int

    

    Annotations

    @tailrec()

80. def shouldNotDangleAtDefnSite(tree: Tree, isVerticalMultiline: Boolean)(implicit style: ScalafmtConfig): Boolean

    

81. val splitCallIntoParts: PartialFunction[Tree, CallParts]

    

82. val splitDefnIntoParts: PartialFunction[Tree, DefnParts]

    

83. def startsSelectChain(tree: Tree): Boolean

    

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

    

    Definition Classes

    AnyRef

85. def toString(): String

    

    Definition Classes

    AnyRef → Any

86. def topTypeWith(typeWith: With): With

    

    Annotations

    @tailrec()

87. def treeDepth(tree: Tree): Int

    

    Calculates depth to deepest child in tree.

88. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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