on could
> know
> its "neighbors".
>
>
>
>
> --
> View this message in context:
> http://apache-spark-user-list.1001560.n3.nabble.com/Finding-previous-and-next-element-in-a-sorted-RDD-tp12621p12664.html
> Sent from the Apache Sp
It would be nice if an RDD that was massaged by OrderedRDDFunction could know
its "neighbors".
--
View this message in context:
http://apache-spark-user-list.1001560.n3.nabble.com/Finding-previous-and-next-element-in-a-sorted-RDD-tp12621p12664.html
Sent from the Apache Spark User Li
._2-1, x._1))
>
> val joined = current leftOuterJoin previous leftOuterJoin next
>
> Code looks clean to me, but I feel uneasy about the performance of join.
>
>
>
> --
> View this message in context:
> http://apache-spark-user-list.1001560.n3.nabble.com/Finding-previous
l next = idx.map(x => (x._2-1, x._1))
val joined = current leftOuterJoin previous leftOuterJoin next
Code looks clean to me, but I feel uneasy about the performance of join.
--
View this message in context:
http://apache-spark-user-list.1001560.n3.nabble.com/Finding-previous-and-next-ele
ious-and-next-element-in-a-sorted-RDD-tp12621.html
Sent from the Apache Spark User List mailing list archive at Nabble.com.
-
To unsubscribe, e-mail: user-unsubscr...@spark.apache.org
For additional commands, e-mail: user-h...@spark.apache.org