Also for alignment requirements in C++ we sometimes process unaligned
leading/trailing data to reach the required alignment.
On Monday, August 3, 2020, Wes McKinney wrote:
> We handle arbitrary slices in C++ and it hasn't seemed especially
> burdensome. We have some utilities (e.g. see
> arrow/
We handle arbitrary slices in C++ and it hasn't seemed especially
burdensome. We have some utilities (e.g. see
arrow/util/bit_block_counter.h) to facilitate efficiently iterating
through bitmaps 64 bits at a time (even when slices on an unaligned
offset) and associated bit-by-bit iterators (e.g. Bi
While investigating an issue regarding offset handling in the rust
arithmetic kernels (https://issues.apache.org/jira/browse/ARROW-9583),
I started to wonder how the other implementations are handling compute
on buffer slices.
The rust implementation currently allows creating slices of arrays
star
