[
https://issues.apache.org/jira/browse/ARROW-1900?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Antoine Pitrou updated ARROW-1900:
----------------------------------
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.
was: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.
> [C++] Add kernel functions for determining value range (maximum and minimum)
> of integer arrays
> ----------------------------------------------------------------------------------------------
>
> Key: ARROW-1900
> URL: https://issues.apache.org/jira/browse/ARROW-1900
> Project: Apache Arrow
> Issue Type: New Feature
> Components: C++
> Reporter: Wes McKinney
> Priority: Major
> Fix For: 1.0.0
>
>
> 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.
--
This message was sent by Atlassian Jira
(v8.3.2#803003)
