Matei Zaharia

If your use case is paging with small values of "drop" and "take", then consider just calling take() on the first few thousand elements and paging through that as a...

Hey Mark, I made a few comments on the PR. Is this still a work in progress on your side as you said in the original message, or is it...

Cool, that looks good! I'd like to wait until 0.8.0 is out to merge this but it's definitely appreciated.

Mark, this seems inconsistent with Scala Collections' `aggregate`. When you call their `aggregate` on an empty list, you still get the `zeroValue`, whereas with this, wouldn't you get a NoSuchElementException?...

Just to show what I mean: ``` scala> List(1,2,3).aggregate(new ArrayBuffer[Int])(_ += _, _ ++= _) res1: scala.collection.mutable.ArrayBuffer[Int] = ArrayBuffer(1, 2, 3) scala> List().aggregate(new ArrayBuffer[Int])(_ += _, _ ++= _) res2:...

But I don't understand why we'd want to support a combOp that's incompatible with the seqOp. Why should the user have to worry about the number of partitions? If you...

Yeah, good point. In that case I'd vote to just update the docs for this but leave it the way it was. One other difference I noticed with fold vs....

In this mode, Mesos itself should send back offers when our refusals time out after 1 second. Also, we call reviveOffers when a TaskSetManager is submitted. What kind of performance...

OK, I'd like to ask the Mesos guys about this, because I think calling reviveOffers on every task-finished will be very expensive on a larger cluster. In older versions of...

Jenkins, this is ok to test