Github user rxin commented on the pull request:
https://github.com/apache/spark/pull/8068#issuecomment-129605412
I think the problem here is that TimSort does allocations under the hood,
and it doesn't support any explicit freeing. The proper solutions is probably
to create a specialized version of TimSort that works against long arrays (in
which each entry takes two longs). We also get rid of a bunch of function call
overheads there.
---
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]
