[ARROW-9067] [C++] Create reusable branchless / vectorized index boundschecking functions

• Type: Improvement
• Status: Resolved
• Priority: Major
• Resolution: Fixed
• Fix Version/s: 1.0.0
• Component/s: C++
• External issue URL: https://github.com/apache/arrow/issues/25182
• Assignee: Wes McKinney
• Reporter: Wes McKinney
• Created: 08/Jun/20 14:11
• Updated: 11/Jan/23 08:04
• Resolved: 15/Jun/20 16:24

Description

It is possible to do branch-free index boundschecking in batches for better performance.

I am implementing this as part of the Take/Filter optimization (so please wait until I have PRs up for this work), but these functions can be moved somewhere more general purpose and used in places where we are currently boundschecking inside inner loops.

Issue Links

• is related to: ARROW-6645 [Python] Faster boundschecking of dictionary indices when converting to Categorical