type currying

I hacked on the parser just a very little bit to make this possible.  The changes are little more than stopping it from gratuitously failing on back-to-back bracketed lists.

import scala.collection.{ mutable, immutable, generic } import generic.CanBuildFrom
object Partial {  type KnownContainer[CC[K, V] <: collection.Map[K, V]] = {    def values[V] : KnownValues[CC, V]    def apply[K] : KnownKeys[CC, K]   }  type KnownKeys[CC[K, V] <: collection.Map[K, V], K] = {    def apply[V](implicit cbf: CanBuildFrom[_, (K, V), CC[K, V]]): CC[K, V]  }  type KnownValues[CC[K, V] <: collection.Map[K, V], V] = {     def apply[K](implicit cbf: CanBuildFrom[_, (K, V), CC[K, V]]): CC[K, V]  }
  def apply[CC[K, V] <: collection.Map[K, V]] : KnownContainer[CC] = new {    def values[V] : KnownValues[CC, V] = new {       def apply[K](implicit cbf: CanBuildFrom[_, (K, V), CC[K, V]]) = cbf().result    }    def apply[K] = new {      def apply[V](implicit cbf: CanBuildFrom[_, (K, V), CC[K, V]]) = cbf().result     }  }}
scala> val m = Partial[immutable.TreeMap]m: Partial.KnownContainer[scala.collection.immutable.TreeMap] = Partial$$anon$1@20beaacc
scala> val m1 = m[String]m1: Partial.KnownKeys[scala.collection.immutable.TreeMap,String] = Partial$$anon$1$$anon$2@13979163
scala> val m2 = m[Int][Int] m2: scala.collection.immutable.TreeMap[Int,Int] = Map()
scala> val mutableBippy = Partial[mutable.HashMap][String][Int]mutableBippy: scala.collection.mutable.HashMap[String,Int] = Map()
scala> mutableBippy("abc") = 55
scala> println(mutableBippy)Map(abc -> 55)
scala> val immutableBippy = Partial[immutable.HashMap].values[Int] immutableBippy: Partial.KnownValues[scala.collection.immutable.HashMap,Int] = Partial$$anon$1$$anon$3@6d02f1ee
scala> def make[T](xs: T*) = immutableBippy[T] ++ xs.zipWithIndex make: [T](xs: T*)scala.collection.immutable.Map[T,Int]
scala> make('a' to 'z': _*)res7: scala.collection.immutable.Map[Char,Int] = Map(e -> 4, s -> 18, x -> 23, n -> 13, j -> 9, y -> 24, t -> 19, u -> 20, f -> 5, a -> 0, m -> 12, i -> 8, v -> 21, q -> 16, b -> 1, g -> 6, l -> 11, p -> 15, c -> 2, h -> 7, r -> 17, w -> 22, k -> 10, o -> 14, z -> 25, d -> 3)

On Tue, Dec 27, 2011 at 1:48 AM, Paul Phillips wrote:
> I hacked on the parser just a very little bit to make this possible.  The
> changes are little more than stopping it from gratuitously failing on
> back-to-back bracketed lists.

Is the patch available anywhere?

Cheers,

Miles