Github user davies commented on the pull request:
https://github.com/apache/spark/pull/13107#issuecomment-221476424
TimSort require a temporary buffer to store the shorter part, which could
be half of the size of pointer array in worst case. This depends on the
original order of rows, it's pretty hard to reproduce. I hit that twice and
have a patch, but can't reproduce it anymore (without the patch).
The better solution should be only use 2/3 of the pointer array, left 1/3
as temporary buffer for TimSort.
---
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]
