具有额外约束的Scala无形KList

时间:2012-08-21 00:24:41

标签: scala path-dependent-type shapeless klist

我想采取这种模式:

 def accept[T](a: RList[T]) = true
 def accept[T, V](a: RList[T], b: RList[V])(implicit ev: a.S =:= b.S) = true
 def accept[T, V, Q](a: RList[T], b: RList[V], c: RList[Q])(implicit ev: a.S =:= b.S, ev2: b.S =:= c.S) = true

但让它接受KList,而不是手动覆盖所有arities。基本上我想说,“取任意数量的RList s,具有相同的S成员类型”

RList是一个特征,包含S类型。 (有关RList的更多背景知识以及我为什么这样做,请参阅:Constrain function based on origin (Path Dependent type? Type Generation?)

1 个答案:

答案 0 :(得分:2)

看起来你正在做的只是试图让编译器检查类型是否一致,因为你的方法总是返回true。

你是否可以,而不是制作接受任意数量的这些方法,接受一个“RL列表”,保证S都匹配?

以下是如何构建这样的列表:

package rl {

// A simplified version of your RList:
trait RList[T] {
  type S
  def data: List[T]
}

// A list of RLists which have identical S
sealed trait RListList 

// RListNil is an empty list
trait RListNil extends RListList {
  def ::[H <: RList[_]](h: H) = rl.::[h.S,H,RListNil](h, this)
}
// there is exactly one RListNil
case object RListNil extends RListNil

// List can be a cons cell of lists sharing the same S
final case class ::[S, H <: RList[_], T <: RListList](head: H, tail: T) extends RListList {

  // We only allow you to cons another to this if we can find evidence that the S matches
  def ::[H2 <: RList[_]](h: H2)(implicit ev: =:=[h.S,S]) = rl.::[S,H2,::[S,H,T]](h, this)
}

现在,如果我们尝试构造一个没有所有S类型同意的RListList,编译器将会抓住我们:

object RListTest {

  val list1 = new RList[Int] { type S = String; def data = List(1,2,3,4) }
  val list2 = new RList[String] { type S = String; def data = List("1","2","3","4") }
  val list3 = new RList[Double] { type S = Float; def data = List(1.1,2.2,3.3,4.4) }

  val listOfLists1 = list1 :: RListNil // fine
  val listOfLists2 = list2 :: listOfLists1 // still fine, since list1 and list2 have the same S
  val listOfLists3 = list3 :: listOfLists2 // compiler error: Cannot prove that java.lang.String =:= Float

}

这是使用依赖方法类型,这意味着您需要使用scala 2.10或者需要使用2.9.x中的-Ydependent-method-types开关进行编译