[
https://issues.apache.org/jira/browse/ARROW-18098?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17624063#comment-17624063
]
Will Ayd edited comment on ARROW-18098 at 10/25/22 9:51 PM:
------------------------------------------------------------
I can take a look at this. My initial thought is we can just treat the two
arrays as a chunked array, apply the sort against that then proceed
element-wise to compare values and keep those that are repeated (essentially
what NumPy does). Will explore some more
was (Author: willayd):
I can take a look at this. My initial thought is we can just treat the two
arrays as a chunked array, apply the sort against that then proceed
element-wise to compare values and keep those that are repeated. Will explore
some more
> [C++] Vector kernel for "intersecting" two arrays (all common elements)
> -----------------------------------------------------------------------
>
> Key: ARROW-18098
> URL: https://issues.apache.org/jira/browse/ARROW-18098
> Project: Apache Arrow
> Issue Type: New Feature
> Components: C++
> Reporter: Joris Van den Bossche
> Priority: Major
> Labels: compute, kernel
>
> This would be similar to numpy's {{intersect1d}}
> (https://numpy.org/doc/stable/reference/generated/numpy.intersect1d.html)
--
This message was sent by Atlassian Jira
(v8.20.10#820010)
