Github user aarondav commented on the pull request:
https://github.com/apache/spark/pull/2117#issuecomment-53325182
Why would this be OOM-prone? This would only cause us to run a longer job
than we need to if it turns out the first few partitions actually do contain
enough results.
Also, this sort of doubling seems like it'd be relatively slow in the case
where very few (possibly 0) elements exist, as you'd effectively search the
whole thing twice.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
