[
https://issues.apache.org/jira/browse/ARROW-14290?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17428090#comment-17428090
]
Antoine Pitrou commented on ARROW-14290:
----------------------------------------
bq. An interface that allows returning of a comparison may allow flexibility to
adapt for different circumstances. Arrow allows for flexible schema, so
optimizations may be possible which are not possible with a regular column.
Which optimizations do you have in mind? I'm not sure that calling a function
pointer O(n log n) times is generally better than computing an additional
column in O(n) time.
Also, the function pointer has to be "dynamically typed" since its exact
signature will depend on the datatype being sorted. Perhaps this is solvable
using a base class and some virtual methods...
> [C++] String comparison in between ternary kernel
> -------------------------------------------------
>
> Key: ARROW-14290
> URL: https://issues.apache.org/jira/browse/ARROW-14290
> Project: Apache Arrow
> Issue Type: Improvement
> Components: C++
> Reporter: Benson Muite
> Assignee: Benson Muite
> Priority: Minor
>
> String comparisons in C++ will use order by unicode. This may not be suitable
> in many language applications, for example when using characters from
> languages that use more than ASCII. Sorting algorithms can often allow for
> the use of custom comparison functions. It would be helpful to allow for
> this for the between kernel as well. Initial work on the between kernel is
> being tracked in https://issues.apache.org/jira/browse/ARROW-9843
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
