Expand description
Compute kernels on top of Vortex Arrays.
We aim to provide a basic set of compute kernels that can be used to efficiently index, slice, and filter Vortex Arrays in their encoded forms.
Every array variant has the ability to implement their own efficient implementations of these operators, else we will decode, and perform the equivalent operator from Arrow.
Modules§
Structs§
- Wrapper around Arrow’s BitIndexIterator that knows its total length.
- Represents the mask argument to a filter function. Internally this will cache the canonical representation of the mask if it is ever used.
Enums§
- Result of performing search_sorted on an Array
Traits§
- VTable for dispatching compute functions to Vortex encodings.
- Searches for value assuming the array is sorted.
- Limit array to start…stop range
Functions§
- Point-wise logical and between two Boolean arrays.
- Point-wise Kleene logical and between two Boolean arrays.
- Return a new array by applying a boolean predicate to select items from a base Array.
- Point-wise logical or between two Boolean arrays.
- Point-wise Kleene logical or between two Boolean arrays.
- Search for many elements in the array.
- Return a zero-copy slice of an array, between
start(inclusive) andend(exclusive).