WillAyd commented on code in PR #45272:
URL: https://github.com/apache/arrow/pull/45272#discussion_r2231475751
##########
cpp/src/arrow/compute/kernels/scalar_compare.cc:
##########
@@ -54,6 +55,39 @@ struct NotEqual {
}
};
+struct ListEqual {
+ template <typename T, typename Arg0, typename Arg1>
+ static T Call(KernelContext*, const Arg0& left, const Arg1& right, Status*) {
+ static_assert(std::is_same<T, bool>::value && std::is_same<Arg0,
Arg1>::value, "");
+
+ if (left.length != right.length) {
+ return false;
+ } else {
+ RangeDataEqualsImpl range_comparer{
+ EqualOptions::Defaults(), false, left, right, 0, 0, 1,
Review Comment:
After some more debugging I think this is OK, since the scalar unboxing will
also set the child ArraySpan that is returned to already have the appropriate
offsets. From that perspective, the ArrayIterator and scalar unboxing work the
same way.
I've added a comment to clarify, but of course let me know of any feedback
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: github-unsubscr...@arrow.apache.org
For queries about this service, please contact Infrastructure at:
us...@infra.apache.org
