-
Notifications
You must be signed in to change notification settings - Fork 1.1k
Remove magic in exhaustivity check #3015
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.
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
Comments
liufengyun
added a commit
to dotty-staging/dotty
that referenced
this issue
Aug 25, 2017
liufengyun
added a commit
to dotty-staging/dotty
that referenced
this issue
Sep 4, 2017
liufengyun
added a commit
to dotty-staging/dotty
that referenced
this issue
Sep 4, 2017
liufengyun
added a commit
to dotty-staging/dotty
that referenced
this issue
Sep 5, 2017
liufengyun
added a commit
to dotty-staging/dotty
that referenced
this issue
Sep 6, 2017
liufengyun
added a commit
to dotty-staging/dotty
that referenced
this issue
Sep 7, 2017
liufengyun
added a commit
to dotty-staging/dotty
that referenced
this issue
Sep 8, 2017
odersky
pushed a commit
to dotty-staging/dotty
that referenced
this issue
Sep 14, 2017
odersky
pushed a commit
to dotty-staging/dotty
that referenced
this issue
Sep 17, 2017
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
In the exhaustivity check, when decomposing a type
path.B[Int, String]
, we get two child classesC1
andC1
. The problem is how to turn the two classes into proper types related topath
,Int
andString
?Current implementation resorts to some ad-hoc hack which is not well-grounded. The correct way to solve the problem is to use type inference, as suggested by Martin.
The text was updated successfully, but these errors were encountered: