You could map each to an RDD[(String,None)] and do a join.
On Thu, Jan 23, 2014 at 5:18 PM, Andrew Ash <[email protected]> wrote: > Hi spark users, > > I recently wanted to calculate the set intersection of two RDDs of > Strings. I couldn't find a .intersection() method in the autocomplete or > in the Scala API docs, so used a little set theory to end up with this: > > lazy val A = ... > lazy val B = ... > A.union(B).subtract(A.subtract(B)).subtract(B.subtract(A)) > > Which feels very cumbersome. > > Does anyone have a more idiomatic way to calculate intersection? > > Thanks! > Andrew >
