QuasiquoteCompatV2

abstract val u: Universe

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

lazy val ANON_CLASS_NAME: Universe.TypeName

lazy val ANYREF: Universe.TypeName

def ApplyConstructor(tpt: Universe.Tree, args: List[Universe.Tree]): Universe.Apply

val CASEACCESSOR: Universe.FlagSet

object EmptyValDefLike

lazy val FALSE: Universe.TermName

object FlagsRepr

val JAVA: Universe.FlagSet

lazy val MIXIN_CONSTRUCTOR: Universe.TermName

val MaxFunctionArity: Int

val MaxTupleArity: Int

object Modifiers

lazy val NULL: Universe.TermName

def New(tpt: Universe.Tree, argss: List[List[Universe.Tree]]): Universe.Tree

Factory method for object creation new tpt(args_1)...(args_n) A New(t, as) is expanded to: (new t).<init>(as)

val PARAMACCESSOR: Universe.FlagSet

lazy val PRODUCT: Universe.TypeName

object RefTree

lazy val SCALA: Universe.TermName

lazy val SERIALIZABLE: Universe.TypeName

object ScalaDot

object SyntacticApplied

object SyntacticAssign

object SyntacticBlock

object SyntacticClassDef

object SyntacticDefDef

object SyntacticFunction

object SyntacticFunctionType

object SyntacticModuleDef

object SyntacticNew

object SyntacticTraitDef

object SyntacticTuple

object SyntacticTupleType

object SyntacticTypeApplied

object SyntacticValDef extends SyntacticValDefBase

object SyntacticVarDef extends SyntacticValDefBase

lazy val TRUE: Universe.TermName

object TermName

object TypeName

lazy val UNIT: Universe.TypeName

lazy val UPDATE: Universe.TermName

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def copyTypeDef(tree: Universe.Tree)(mods: Universe.Modifiers = null, name: Universe.Name = null, tparams: List[Universe.TypeDef] = null, rhs: Universe.Tree = null): Universe.TypeDef

def copyValDef(tree: Universe.Tree)(mods: Universe.Modifiers = null, name: Universe.Name = null, tpt: Universe.Tree = null, rhs: Universe.Tree = null): Universe.ValDef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

object gen

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def mkAnnotation(trees: List[Universe.Tree]): List[Universe.Tree]

def mkAnnotation(tree: Universe.Tree): Universe.Tree

def mkEarlyDef(defns: List[Universe.Tree]): List[Universe.Tree]

def mkEarlyDef(defn: Universe.Tree): Universe.Tree

def mkParam(vd: Universe.ValDef): Universe.ValDef

def mkRefineStat(stats: List[Universe.Tree]): List[Universe.Tree]

def mkRefineStat(stat: Universe.Tree): Universe.Tree

def mkTparams(tparams: List[Universe.Tree]): List[Universe.TypeDef]

def mkVparamss(argss: List[List[Universe.ValDef]]): List[List[Universe.ValDef]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

object patvarTransformer extends Universe.Transformer

Convert all occurrences of (lower-case) variables in a pattern as follows: x becomes x @ _ x: T becomes x @ (_: T)

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

def toString(): String

object treeInfo

final def wait(): Unit

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

final def wait(arg0: Long): Unit