A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.scala-lang.org/api/2.11.12/scala-compiler/scala/tools/nsc/Global$typer$.html below:

typer - Scala Compiler 2.11.12

  • final def !=(arg0: Any): Boolean
  • final def ##(): Int
  • final def ==(arg0: Any): Boolean
  • object TyperErrorGen
  • def adapt(tree: Global.Tree, mode: Mode, pt: Global.Type, original: Global.Tree = EmptyTree): Global.Tree
  • def adaptAfterOverloadResolution(tree: Global.Tree, mode: Mode, pt: Global.Type = WildcardType, original: Global.Tree = EmptyTree): Global.Tree
  • def adaptCase(cdef: Global.CaseDef, mode: Mode, tpe: Global.Type): Global.CaseDef
  • def adaptToArguments(qual: Global.Tree, name: Global.Name, args: List[Global.Tree], pt: Global.Type, reportAmbiguous: Boolean, saveErrors: Boolean): Global.Tree
  • def adaptToMember(qual: Global.Tree, searchTemplate: Global.Type, reportAmbiguous: Boolean = true, saveErrors: Boolean = true): Global.Tree
  • def adaptToMemberWithArgs(tree: Global.Tree, qual: Global.Tree, name: Global.Name, mode: Mode, reportAmbiguous: Boolean, saveErrors: Boolean): Global.Tree
  • def adaptToName(qual: Global.Tree, name: Global.Name): Global.Tree
  • def applyImplicitArgs(fun: Global.Tree): Global.Tree
  • final def asInstanceOf[T0]: T0
  • def atOwner(tree: Global.Tree, owner: Global.Symbol): (analyzer)#Typer
  • def atOwner(owner: Global.Symbol): (analyzer)#Typer
  • def callToCompanionConstr(context: (analyzer)#Context, calledFun: Global.Symbol): Boolean
  • def canAdaptConstantTypeToLiteral: Boolean
  • def canTranslateEmptyListToNil: Boolean
  • def checkClassType(tpt: Global.Tree): Boolean
  • object checkDead
  • def checkExistentialsFeature(pos: Global.Position, tpe: Global.Type, prefix: String): AnyVal
  • def checkFeature(pos: Global.Position, featureTrait: Global.Symbol, construct: ⇒ String = "", immediate: Boolean = false): Boolean
  • def checkFinitary(classinfo: Global.ClassInfoType): Unit
  • def checkMethodStructuralCompatible(ddef: Global.DefDef): Unit
  • object checkNoEscaping extends Global.TypeMap
  • def checkNonCyclic(defn: Global.Tree, tpt: Global.Tree): Unit
  • def checkNonCyclic(sym: Global.Symbol): Unit
  • def checkNonCyclic(pos: Global.Position, tp: Global.Type, lockedSym: Global.Symbol): Boolean
  • def checkNonCyclic(pos: Global.Position, tp: Global.Type): Boolean
  • def checkParamsConvertible(tree: Global.Tree, tpe0: Global.Type): Unit
  • def checkStablePrefixClassType(tpt: Global.Tree): Boolean
  • object checkUnused
  • def checkValidAdaptation(t: Global.Tree, args: List[Global.Tree]): Boolean
  • def clone(): AnyRef
  • def computeMacroDefType(ddef: Global.DefDef, pt: Global.Type): Global.Type
  • def computeParamAliases(clazz: Global.Symbol, vparamss: List[List[Global.ValDef]], rhs: Global.Tree): Unit
  • def computeType(tree: Global.Tree, pt: Global.Type): Global.Type
  • final def constrTyperIf(inConstr: Boolean): (analyzer)#Typer
  • var context: (analyzer)#Context
  • def context1: (analyzer)#Context
  • def cyclicReferenceMessage(sym: Global.Symbol, tree: Global.Tree): Option[String]
  • def doTypedApply(tree: Global.Tree, fun0: Global.Tree, args: List[Global.Tree], mode: Mode, pt: Global.Type): Global.Tree
  • def doTypedUnapply(tree: Global.Tree, fun0: Global.Tree, fun: Global.Tree, args: List[Global.Tree], mode: Mode, pt: Global.Type): Global.Tree
  • def dropExistential(tp: Global.Type): Global.Type
  • object dyna
  • def enterSym(txt: (analyzer)#Context, tree: Global.Tree): (analyzer)#Context
  • def enterSyms(txt: (analyzer)#Context, trees: List[Global.Tree]): Unit
  • final def eq(arg0: AnyRef): Boolean
  • def equals(arg0: Any): Boolean
  • def extractorForUncheckedType(pos: Global.Position, pt: Global.Type): Global.Tree
  • def finalize(): Unit
  • def finishMethodSynthesis(templ: Global.Template, clazz: Global.Symbol, context: (analyzer)#Context): Global.Template
  • final def getClass(): Class[_]
  • def hashCode(): Int
  • val infer: (analyzer)#Inferencer
  • def inferView(tree: Global.Tree, from: Global.Type, to: Global.Type, reportAmbiguous: Boolean, saveErrors: Boolean): Global.Tree
  • def inferView(tree: Global.Tree, from: Global.Type, to: Global.Type, reportAmbiguous: Boolean): Global.Tree
  • def instantiate(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
  • def instantiateExpectingUnit(tree: Global.Tree, mode: Mode): Global.Tree
  • def instantiatePossiblyExpectingUnit(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
  • def isCapturedExistential(sym: Global.Symbol): Boolean
  • final def isInstanceOf[T0]: Boolean
  • def isNamedApplyBlock(tree: Global.Tree): Boolean
  • def isReferencedFrom(ctx: (analyzer)#Context, sym: Global.Symbol): Boolean
  • def isStale(sym: Global.Symbol): Boolean
  • def labelTyper(ldef: Global.LabelDef): (analyzer)#Typer
  • def macroImplementationNotFoundMessage(name: Global.Name): String
  • def member(qual: Global.Tree, name: Global.Name): Global.Symbol
  • def missingSelectErrorTree(tree: Global.Tree, qual: Global.Tree, name: Global.Name): Global.Tree
  • def namer: (analyzer)#Namer
  • final def ne(arg0: AnyRef): Boolean
  • def needsInstantiation(tparams: List[Global.Symbol], formals: List[Global.Type], args: List[Global.Tree]): Boolean
  • final def notify(): Unit
  • final def notifyAll(): Unit
  • def packCaptured(tpe: Global.Type): Global.Type
  • def packSymbols(hidden: List[Global.Symbol], tp: Global.Type): Global.Type
  • def packedType(tree: Global.Tree, owner: Global.Symbol): Global.Type
  • def packedTypes(trees: List[Global.Tree]): List[Global.Type]
  • def permanentlyHiddenWarning(pos: Global.Position, hidden: Global.Name, defn: Global.Symbol): Unit
  • def qualifyingClass(tree: Global.Tree, qual: Global.Name, packageOK: Boolean): Global.Symbol
  • def reallyExists(sym: Global.Symbol): Boolean
  • def reenterTypeParams(tparams: List[Global.TypeDef]): List[Global.Symbol]
  • def reenterValueParams(vparamss: List[List[Global.ValDef]]): Unit
  • def reportTypeError(context0: (analyzer)#Context, pos: Global.Position, ex: Global.TypeError): Unit
  • def resolveClassTag(pos: Global.Position, tp: Global.Type, allowMaterialization: Boolean = true): Global.Tree
  • def resolveTypeTag(pos: Global.Position, pre: Global.Type, tp: Global.Type, concrete: Boolean, allowMaterialization: Boolean = true): Global.Tree
  • def rewrappingWrapperTrees(f: (Global.Tree) ⇒ List[Global.Tree]): (Global.Tree) ⇒ List[Global.Tree]
  • val runDefinitions: reflect.internal.Definitions.definitions.RunDefinitions
  • def samToFunctionType(tp: Global.Type, sam: Global.Symbol = NoSymbol): Global.Type
  • def silent[T](op: ((analyzer)#Typer) ⇒ T, reportAmbiguousErrors: Boolean = context.ambiguousErrors, newtree: Global.Tree = context.tree): (analyzer)#SilentResult[T]
  • def stabilize(tree: Global.Tree, pre: Global.Type, mode: Mode, pt: Global.Type): Global.Tree
  • def stabilizeFun(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
  • final def synchronized[T0](arg0: ⇒ T0): T0
  • def synthesizePartialFunction(paramName: Global.TermName, paramPos: Global.Position, paramSynthetic: Boolean, tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
  • def synthesizeSAMFunction(sam: Global.Symbol, fun: Global.Function, resPt: Global.Type, samClassTp: Global.Type, mode: Mode): Global.Tree
  • def toString(): String
  • def transformedOr(tree: Global.Tree, op: ⇒ Global.Tree): Global.Tree
  • def transformedOrTyped(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
  • def typed(tree: Global.Tree, mode: Mode): Global.Tree
  • def typed(tree: Global.Tree, pt: Global.Type): Global.Tree
  • def typed(tree: Global.Tree): Global.Tree
  • def typed(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
  • def typed1(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
  • def typedAnnotation(ann: Global.Tree, mode: Mode = EXPRmode): Global.AnnotationInfo
  • def typedArg(arg: Global.Tree, mode: Mode, newmode: Mode, pt: Global.Type): Global.Tree
  • def typedArgs(args: List[Global.Tree], mode: Mode): collection.immutable.List[Global.Tree]
  • def typedArgsForFormals(args: List[Global.Tree], formals: List[Global.Type], mode: Mode): List[Global.Tree]
  • def typedBlock(block0: Global.Block, mode: Mode, pt: Global.Type): Global.Block
  • def typedByValueExpr(tree: Global.Tree, pt: Global.Type = WildcardType): Global.Tree
  • def typedCase(cdef: Global.CaseDef, pattpe: Global.Type, pt: Global.Type): Global.CaseDef
  • def typedCases(cases: List[Global.CaseDef], pattp: Global.Type, pt: Global.Type): List[Global.CaseDef]
  • def typedClassDef(cdef: Global.ClassDef): Global.Tree
  • def typedClassOf(tree: Global.Tree, tpt: Global.Tree, noGen: Boolean = false): Global.Tree
  • def typedConstructorPattern(fun0: Global.Tree, pt: Global.Type): Global.Tree
  • def typedDefDef(ddef: Global.DefDef): Global.DefDef
  • def typedDocDef(docDef: Global.DocDef, mode: Mode, pt: Global.Type): Global.Tree
  • def typedExistentialTypeTree(tree: Global.ExistentialTypeTree, mode: Mode): Global.Tree
  • def typedHigherKindedType(tree: Global.Tree, mode: Mode): Global.Tree
  • def typedHigherKindedType(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
  • def typedImport(imp: Global.Import): Global.Import
  • def typedInPattern(tree: Global.Typed, mode: Mode, pt: Global.Type): Global.Tree
  • def typedLabelDef(ldef: Global.LabelDef): Global.LabelDef
  • def typedMatch(selector: Global.Tree, cases: List[Global.CaseDef], mode: Mode, pt: Global.Type, tree: Global.Tree = EmptyTree): Global.Match
  • def typedModifiers(mods: Global.Modifiers): Global.Modifiers
  • def typedModuleDef(mdef: Global.ModuleDef): Global.Tree
  • def typedOperator(tree: Global.Tree): Global.Tree
  • def typedParentTypes(templ: Global.Template): List[Global.Tree]
  • def typedPattern(tree: Global.Tree, pt: Global.Type): Global.Tree
  • def typedPos(pos: Global.Position)(tree: Global.Tree): Global.Tree
  • def typedPos(pos: Global.Position, mode: Mode, pt: Global.Type)(tree: Global.Tree): Global.Tree
  • def typedQualifier(tree: Global.Tree): Global.Tree
  • def typedQualifier(tree: Global.Tree, mode: Mode): Global.Tree
  • def typedQualifier(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
  • def typedRefinement(templ: Global.Template): Unit
  • def typedStarInPattern(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
  • def typedStats(stats: List[Global.Tree], exprOwner: Global.Symbol): List[Global.Tree]
  • def typedTemplate(templ0: Global.Template, parents1: List[Global.Tree]): Global.Template
  • def typedType(tree: Global.Tree): Global.Tree
  • def typedType(tree: Global.Tree, mode: Mode): Global.Tree
  • def typedTypeApply(tree: Global.Tree, mode: Mode, fun: Global.Tree, args: List[Global.Tree]): Global.Tree
  • def typedTypeConstructor(tree: Global.Tree): Global.Tree
  • def typedTypeConstructor(tree: Global.Tree, mode: Mode): Global.Tree
  • def typedTypeDef(tdef: Global.TypeDef): Global.TypeDef
  • def typedValDef(vdef: Global.ValDef): Global.ValDef
  • final def typerWithCondLocalContext[T](c: ⇒ (analyzer)#Context)(cond: Boolean)(f: ((analyzer)#Typer) ⇒ T): T
  • final def typerWithLocalContext[T](c: (analyzer)#Context)(f: ((analyzer)#Typer) ⇒ T): T
  • def validateParentClasses(parents: List[Global.Tree], selfType: Global.Type): Unit
  • def viewExists(from: Global.Type, to: Global.Type): Boolean
  • def virtualizedMatch(match_: Global.Match, mode: Mode, pt: Global.Type): Global.Tree
  • final def wait(): Unit
  • final def wait(arg0: Long, arg1: Int): Unit
  • final def wait(arg0: Long): Unit
  • def warnTypeParameterShadow(tparams: List[Global.TypeDef], sym: Global.Symbol): Unit
  • final def withCondConstrTyper[T](inConstr: Boolean)(f: ((analyzer)#Typer) ⇒ T): T
  • def wrapClassTagUnapply(uncheckedPattern: Global.Tree, classTagExtractor: Global.Tree, pt: Global.Type): Global.Tree

  • RetroSearch is an open source project built by @garambo | Open a GitHub Issue

    Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

    HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4