Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | blackbox restriction #3: can't affect implicit search | Eugene Burmako | 2013-11-12 | 1 | -5/+1 |
| | | | | | | | | | When an application of a blackbox macro is used as an implicit candidate, no expansion is performed until the macro is selected as the result of the implicit search. This makes it impossible to dynamically calculate availability of implicit macros. | ||||
* | blackbox restriction #2: can't guide type inference | Eugene Burmako | 2013-11-12 | 1 | -0/+12 |
When an application of a blackbox macro still has undetermined type parameters after Scala’s type inference algorithm has finished working, these type parameters are inferred forcedly, in exactly the same manner as type inference happens for normal methods. This makes it impossible for blackbox macros to influence type inference, prohibiting fundep materialization. |