[ARROW-1900] [C++] Add kernel functions for determining value range (maximum and minimum) of integer arrays

• Type: New Feature
• Status: Resolved
• Priority: Major
• Resolution: Fixed
• Fix Version/s: 0.16.0
• Component/s: C++
• Labels: Analytics pull-request-available
• External issue URL: https://github.com/apache/arrow/issues/17892
• Assignee: Joris Van den Bossche
• Reporter: Wes McKinney
• Created: 07/Dec/17 17:21
• Updated: 11/Jan/23 07:17
• Resolved: 18/Nov/19 17:18

Description

These functions can be useful internally for determining when a "small range" alternative to a hash table can be used for integer arrays. The maximum and minimum is determined in a single scan.

We already have infrastructure for aggregate kernels, so this would be an easy addition.

Issue Links

• is depended upon by: ARROW-1571 [C++] Implement argsort kernels (sort indices) for integers using O(n) counting sort
• is duplicated by: ARROW-1564 [C++] Kernel functions for computing minimum and maximum of an array in one pass
• links to: GitHub Pull Request #5697