scala.tools.nsc.ast.TreeDSL

CODE

object CODE extends AnyRef

Source
TreeDSL.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. CODE
  2. AnyRef
  3. Any
Visibility
  1. Public
  2. All

Type Members

  1. class CaseStart extends AnyRef

  2. trait DefCreator extends AnyRef

  3. class DefSymStart extends SymVODDStart with DefCreator

  4. class DefTreeStart extends TreeVODDStart with DefCreator

  5. class IfStart extends AnyRef

  6. case class SelectStart(tree: Select) extends Product with Serializable

  7. trait SymVODDStart extends VODDStart

  8. class SymbolMethods extends AnyRef

  9. class TreeMethods extends AnyRef

  10. trait TreeVODDStart extends VODDStart

  11. class TryStart extends AnyRef

  12. trait VODDStart extends AnyRef

    VODD, if it's not obvious, means ValOrDefDef.

  13. trait ValCreator extends AnyRef

  14. class ValSymStart extends SymVODDStart with ValCreator

  15. class ValTreeStart extends TreeVODDStart with ValCreator

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. def AND(guards: Tree*): Tree

  7. def BLOCK(xs: Tree*): Block

  8. def CASE(pat: Tree): CaseStart

  9. def DEF(sym: Symbol): DefSymStart

  10. def DEF(name: Name): DefTreeStart

  11. def DEF(name: Name, tp: Type): DefTreeStart

  12. def DEFAULT: CaseStart

  13. val FALSE: Literal

  14. def ID(sym: Symbol): Tree

  15. def IF(tree: Tree): IfStart

  16. def LAZYVAL(sym: Symbol): ValSymStart

  17. def LAZYVAL(name: Name): ValTreeStart

  18. def LAZYVAL(name: Name, tp: Type): ValTreeStart

  19. object LIT extends (Any) ⇒ Literal

  20. def MATCHERROR(arg: Tree): Throw

    Top level accessible.

  21. def NEW(sym: Symbol, args: Tree*): Tree

  22. def NEW(tpe: Tree, args: Tree*): Tree

  23. def NOT(tree: Tree): Select

  24. def NULL: Literal

  25. def OR(guards: Tree*): Tree

  26. def REF(pre: Type, sym: Symbol): Tree

  27. def REF(sym: Symbol): Tree

  28. def SOME(xs: Tree*): Apply

  29. def THIS(sym: Symbol): Tree

    Typed trees from symbols.

  30. def THROW(sym: Symbol, msg: Tree): Throw

  31. def THROW(sym: Symbol): Throw

    !!! should generalize null guard from match error here.

  32. val TRUE: Literal

  33. def TRY(tree: Tree): TryStart

  34. def UNIT: Literal

  35. def VAL(sym: Symbol): ValSymStart

  36. def VAL(name: Name): ValTreeStart

  37. def VAL(name: Name, tp: Type): ValTreeStart

  38. def VAR(sym: Symbol): ValSymStart

  39. def VAR(name: Name): ValTreeStart

  40. def VAR(name: Name, tp: Type): ValTreeStart

  41. object WILD extends AnyRef

  42. val ZERO: Literal

  43. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  44. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  46. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  47. def finalize(): Unit

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

  48. def fn(lhs: Tree, op: Symbol, args: Tree*): Apply

  49. def fn(lhs: Tree, op: Name, args: Tree*): Apply

  50. final def getClass(): java.lang.Class[_]

    Definition Classes
    AnyRef → Any

  51. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  52. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  53. def makeTupleTerm(trees: List[Tree], flattenUnary: Boolean): Tree

  54. def makeTupleType(trees: List[Tree], flattenUnary: Boolean): Tree

  55. implicit def mkSymbolMethodsFromSymbol(target: Symbol): SymbolMethods

  56. implicit def mkTreeFromSelectStart(ss: SelectStart): Select

    (foo DOT bar) might be simply a Select, but more likely it is to be immediately followed by an Apply.

    (foo DOT bar) might be simply a Select, but more likely it is to be immediately followed by an Apply. We don't want to add an actual apply method to arbitrary trees, so SelectStart is created with an apply - and if apply is not the next thing called, the implicit from SelectStart -> Tree will provide the tree.

  57. implicit def mkTreeMethods(target: Tree): TreeMethods

    Implicits - some of these should probably disappear *

  58. implicit def mkTreeMethodsFromSelectStart(ss: SelectStart): TreeMethods

  59. implicit def mkTreeMethodsFromSymbol(target: Symbol): TreeMethods

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

    Definition Classes
    AnyRef

  61. final def notify(): Unit

    Definition Classes
    AnyRef

  62. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  63. def nullSafe[T](f: (Tree) ⇒ Tree, ifNull: Tree): (Tree) ⇒ Tree

  64. def returning[T](x: T)(f: (T) ⇒ Unit): T

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

    Definition Classes
    AnyRef

  66. def toString(): String

    Definition Classes
    AnyRef → Any

  67. final def unbind(x: Tree): Tree

  68. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from AnyRef

Inherited from Any