Skip to content

Various refactorings #12938

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 12 commits into from
Jul 5, 2021
Merged

Various refactorings #12938

Changes from 1 commit
Commits
Show all changes
12 commits
Select commit Hold shift + click to select a range
32b8d51
Rename TypeVarBinder --> InferredTypeTree
odersky May 22, 2021
1ee3c51
Pull out inferredResultType into separate method
odersky May 25, 2021
2f4a3d4
Re-infer inferred types of ValDefs and DefDefs
odersky Jun 25, 2021
1ceafdf
Improve expected types for dependent functions
odersky Jun 25, 2021
5893a72
Add InferredTypeTree to Trees.Instance
odersky Jun 25, 2021
85b331d
Mark inferred closure parameters as InferredTypeTrees
odersky Jun 25, 2021
ea4e06a
Mark type ascriptions added in ensureNoLocalRefs as inferred
odersky Jun 25, 2021
82a2898
Add functionality to SimpleIdentitySet
odersky Jun 5, 2021
ddb9c01
Make Dependency collection work for lazy vals
odersky Jun 25, 2021
e8bc462
Fix printing of function type trees
odersky Jun 26, 2021
5688adc
Typer refactorings
odersky Jun 27, 2021
350cfa2
Apply suggestions from code review
odersky Jul 5, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Improve expected types for dependent functions
  • Loading branch information
@odersky
odersky committed Jun 25, 2021
commit 1ceafdf13d9f1bc168c1bb7cea1b67fb806c6008
13 changes: 8 additions & 5 deletions compiler/src/dotty/tools/dotc/typer/Typer.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1146,12 +1146,15 @@ class Typer extends Namer
// if expected result type is a wildcard, approximate from above.
// this can type the greatest set of admissible closures.
(pt1.argTypesLo.init, typeTree(interpolateWildcards(pt1.argTypesHi.last)))
case SAMType(sam @ MethodTpe(_, formals, restpe)) =>
case RefinedType(parent, nme.apply, mt @ MethodTpe(_, formals, restpe))
if defn.isNonRefinedFunction(parent) && formals.length == defaultArity =>
(formals, untpd.DependentTypeTree(syms => restpe.substParams(mt, syms.map(_.termRef))))
case SAMType(mt @ MethodTpe(_, formals, restpe)) =>
(formals,
if sam.isResultDependent then
untpd.DependentTypeTree(syms => restpe.substParams(sam, syms.map(_.termRef)))
else
typeTree(restpe))
if (mt.isResultDependent)
untpd.DependentTypeTree(syms => restpe.substParams(mt, syms.map(_.termRef)))
else
typeTree(restpe))
case _ =>
(List.tabulate(defaultArity)(alwaysWildcardType), untpd.TypeTree())
}
Expand Down