In Scala, is it possible to "subtract" a type from a composed type like this one: "A with B with C" ?
Show this thread
-
I don't think it will change anything for intersection types, but it might for union types. The mechanism, if it gets implemented, would be to pattern match some cases against a union type, and the catchall's type would be the Union of the unmatched types from the original union.
This code exists already in the compiler for doing exhaustivity checking. But that currently happens post-typer, and it would need to be promoted to the typer in order to make use of the newly-formed union type it calculates. It might happen.
-
-
I make myself sound more authoritative on this issue than I really should; I learned this from a couple of conversations with Guillaume Martres.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
This Tweet is unavailable.
-
No, I think that given a type A with B, and a type A (maybe both inferred from value parameters), he would like to have the compiler infer B.
- Show replies
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.