[jira] [Commented] (ARROW-18098) [C++] Vector kernel for "intersecting" two arrays (all common elements)

["Will Ayd (Jira)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/ARROW-18098?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17624063#comment-17624063 ] 

Will Ayd commented on ARROW-18098:
----------------------------------

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)