Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[C++] Implement kernels for in-place sorting of fixed-width contiguous arrays #19076

Closed
asfimport opened this issue Jun 8, 2018 · 1 comment

Comments

@asfimport
Copy link
Collaborator

asfimport commented Jun 8, 2018

See discussion in #2112. A kernel may want to throw if the memory being sorted is shared (in which case the user should copy, then sort)

Sorting of chunked data is a more complex topic so that's out of scope for this task

Reporter: Wes McKinney / @wesm

Related issues:

Note: This issue was originally created as ARROW-2685. Please see the migration documentation for further details.

@asfimport
Copy link
Collaborator Author

Wes McKinney / @wesm:
Since we have SortToIndices and Arrow arrays have immutable semantics, this should be solved a different way

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant