在Scala中将Set [Set [String]]展开为Cartesian Product

huy*_*hjl 10 scala scala-2.8

我有以下几套.我提前知道它会持续多长时间.

val sets = Set(Set("a","b","c"), Set("1","2"), Set("S","T"))
Run Code Online (Sandbox Code Playgroud)

我想将它扩展为笛卡尔积:

Set("a&1&S", "a&1&T", "a&2&S", ..., "c&2&T")
Run Code Online (Sandbox Code Playgroud)

你会怎么做?

huy*_*hjl 17

我想我想出了怎么做.

def combine(acc:Set[String], set:Set[String]) = for (a <- acc; s <- set) yield {
  a + "&" + s 
}

val expanded = sets.reduceLeft(combine)

expanded: scala.collection.immutable.Set[java.lang.String] = Set(b&2&T, a&1&S, 
  a&1&T, b&1&S, b&1&T, c&1&T, a&2&T, c&1&S, c&2&T, a&2&S, c&2&S, b&2&S)
Run Code Online (Sandbox Code Playgroud)


ret*_*nym 12

好问题.这是一种方式:

scala> val seqs = Seq(Seq("a","b","c"), Seq("1","2"), Seq("S","T"))                  
seqs: Seq[Seq[java.lang.String]] = List(List(a, b, c), List(1, 2), List(S, T))

scala> val seqs2 = seqs.map(_.map(Seq(_)))
seqs2: Seq[Seq[Seq[java.lang.String]]] = List(List(List(a), List(b), List(c)), List(List(1), List(2)), List(List(S), List(T)))

scala> val combined = seqs2.reduceLeft((xs, ys) => for {x <- xs; y <- ys} yield x ++ y)
combined: Seq[Seq[java.lang.String]] = List(List(a, 1, S), List(a, 1, T), List(a, 2, S), List(a, 2, T), List(b, 1, S), List(b, 1, T), List(b, 2, S), List(b, 2, T), List(c, 1, S), List(c, 1, T), List(c, 2, S), List(c, 2, T))

scala> combined.map(_.mkString("&"))             
res11: Seq[String] = List(a&1&S, a&1&T, a&2&S, a&2&T, b&1&S, b&1&T, b&2&S, b&2&T, c&1&S, c&1&T, c&2&S, c&2&T)
Run Code Online (Sandbox Code Playgroud)


Pat*_*ick 6

击球后来了;)但另一个:

sets.reduceLeft((s0,s1)=>s0.flatMap(a=>s1.map(a+"&"+_)))
Run Code Online (Sandbox Code Playgroud)