Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | More uniformity for the parser. | Paul Phillips | 2011-12-31 | 1 | -0/+13 |
| | | | | | | | | | | Fixing consecutive type application made it more obvious there was another missing bit of the parser, type application following function application. This should (and now does) work: object F { def apply[T] = List[T]() } def g() = F g()[String] | ||||
* | Consecutive type application. | Paul Phillips | 2011-12-27 | 1 | -0/+45 |
The parser through I think a quirk of history would not allow back to back type applications, like expr[T1, T2][T3, T4] Now it does, meaning the only thing it can: val n0 = Partial[immutable.HashMap][String][Int] ++ Seq(("a", 1)) val n1 = Partial.apply[immutable.HashMap].apply[String].apply[Int] ++ Seq(("a", 1)) assert(n0 == n1) |