We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
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
type IsTypeInTuple[T, Tup <: Tuple] = Tup match { case EmptyTuple => false case T *: ts => true case _ *: ts => IsTypeInTuple[T, ts] } summon[(Int *: String *: EmptyTuple) =:= (Int, String)] //they are the same summon[IsTypeInTuple[String, Int *: String *: EmptyTuple] =:= true] //compiles summon[IsTypeInTuple[String, (Int, String)] =:= true] //doesn't compile summon[IsTypeInTuple[String, Tuple.Widen[Int *: String *: EmptyTuple]] =:= true] // doesn't compiles
the last two summon should compile, just like the other cases.
The text was updated successfully, but these errors were encountered:
This seems to be the root of a lot of problems I'm seeing as well. Arity abstraction doesn't really work without this equivalence.
Sorry, something went wrong.
Fix scala#9871: use toNestedPairs in provablyDisjoint
22d716d
558b045
10080b9
edbb815
Merge pull request #10560 from dotty-staging/fix-9871
4ab402c
Fix #9871: use toNestedPairs in provablyDisjoint
a5c5c7a
OlivierBlanvillain
No branches or pull requests
Minimized code
Expectation
the last two summon should compile, just like the other cases.
The text was updated successfully, but these errors were encountered: