Struct FoRVTable 

pub struct FoRVTable;

Trait Implementations

impl BaseArrayVTable<FoRVTable> for FoRVTable

fn len(array: &FoRArray) -> usize

fn dtype(array: &FoRArray) -> &DType

fn stats(array: &FoRArray) -> StatsSetRef<'_>

fn array_hash<H: Hasher>(array: &FoRArray, state: &mut H, precision: Precision)

fn array_eq(array: &FoRArray, other: &FoRArray, precision: Precision) -> bool

impl CanonicalVTable<FoRVTable> for FoRVTable

fn canonicalize(array: &FoRArray) -> Canonical

Returns the canonical representation of the array.

fn append_to_builder( array: &<V as VTable>::Array, builder: &mut dyn ArrayBuilder, )

Writes the array into a canonical builder.

impl CastKernel for FoRVTable

fn cast( &self, array: &FoRArray, dtype: &DType, ) -> VortexResult<Option<ArrayRef>>

impl CompareKernel for FoRVTable

fn compare( &self, lhs: &FoRArray, rhs: &dyn Array, operator: Operator, ) -> VortexResult<Option<ArrayRef>>

impl Debug for FoRVTable

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl EncodeVTable<FoRVTable> for FoRVTable

fn encode( _vtable: &FoRVTable, canonical: &Canonical, _like: Option<&FoRArray>, ) -> VortexResult<Option<FoRArray>>

Try to encode a canonical array into this encoding.

impl FilterKernel for FoRVTable

fn filter(&self, array: &FoRArray, mask: &Mask) -> VortexResult<ArrayRef>

Filter an array by the provided predicate.

impl IsConstantKernel for FoRVTable

fn is_constant( &self, array: &FoRArray, opts: &IsConstantOpts, ) -> VortexResult<Option<bool>>

Preconditions

impl IsSortedKernel for FoRVTable

FoR can express sortedness directly on its encoded form.

If the minimum is greater than or equal to zero, subtracting it from the other values does not wrap (the value always decreases and the smallest value is zero because min - min = 0).

Subtraction without wrapping is order-preserving, so we only need to consider what happens to wrapped numbers.

Non-negative minimum values can’t wrap. For a negative minimum value, wrapping means that

a + abs(min) > 127

There’s some residue r,

r < 128

such that

a + abs(min) mod 128 = r

For example,

min = -128
a = 1

1 - -128 = 129

And 129’s residue is 1. 129 is represented as

-128 + 1 = -127

The unsigned representation is

2^8 - 127

More directly, for some residue r:

2^8 + (-128 + r)
  = 2^8 - 128 + r
  = 128 + r

Addition is order-preserving, so all the wrapped values preserve their order and they’re all represented as unsigned values larger than 127 so they also preserve their order with the unwrapped values.

fn is_sorted(&self, array: &FoRArray) -> VortexResult<Option<bool>>

Preconditions

fn is_strict_sorted(&self, array: &FoRArray) -> VortexResult<Option<bool>>

impl OperationsVTable<FoRVTable> for FoRVTable

fn slice(array: &FoRArray, range: Range<usize>) -> ArrayRef

Perform a constant-time slice of the array.

fn scalar_at(array: &FoRArray, index: usize) -> Scalar

Fetch the scalar at the given index.

impl TakeKernel for FoRVTable

fn take(&self, array: &FoRArray, indices: &dyn Array) -> VortexResult<ArrayRef>

Create a new array by taking the values from the array at the given indices.

impl VTable for FoRVTable

type Array = FoRArray

type Metadata = ScalarValueMetadata

type ArrayVTable = FoRVTable

type CanonicalVTable = FoRVTable

type OperationsVTable = FoRVTable

type ValidityVTable = ValidityVTableFromChild

type VisitorVTable = FoRVTable

type ComputeVTable = NotSupported

Optionally enable implementing dynamic compute dispatch for this encoding. Can be disabled by assigning to the NotSupported type.

type EncodeVTable = FoRVTable

Optionally enable the EncodeVTable for this encoding. This allows it to partake in compression. Can be disabled by assigning to the NotSupported type.

fn id(&self) -> ArrayId

Returns the ID of the encoding.

fn encoding(_array: &Self::Array) -> ArrayVTable

Returns the encoding for the array.

fn with_children( array: &mut Self::Array, children: Vec<ArrayRef>, ) -> VortexResult<()>

Replaces the children in array with children. The count must be the same and types of children must be expected.

fn metadata(array: &FoRArray) -> VortexResult<Self::Metadata>

Exports metadata for an array.

fn serialize(metadata: Self::Metadata) -> VortexResult<Option<Vec<u8>>>

Serialize metadata into a byte buffer for IPC or file storage. Return None if the array cannot be serialized.

fn deserialize(buffer: &[u8]) -> VortexResult<Self::Metadata>

Deserialize metadata from a byte buffer.

fn build( &self, dtype: &DType, len: usize, metadata: &Self::Metadata, _buffers: &[BufferHandle], children: &dyn ArrayChildren, ) -> VortexResult<FoRArray>

Build an array from components.

fn reduce_parent( array: &Self::Array, parent: &ArrayRef, child_idx: usize, ) -> VortexResult<Option<ArrayRef>>

Attempt to perform a reduction of the parent of this array.

fn execute( array: &Self::Array, ctx: &mut ExecutionCtx, ) -> Result<Vector, VortexError>

Execute this array to produce a Vector.

fn execute_parent( array: &Self::Array, parent: &Arc<dyn Array>, child_idx: usize, ctx: &mut ExecutionCtx, ) -> Result<Option<Vector>, VortexError>

Attempt to execute the parent of this array to produce a Vector.

fn reduce(array: &Self::Array) -> Result<Option<Arc<dyn Array>>, VortexError>

Attempt to reduce the array to a more simple representation.

impl ValidityChild<FoRVTable> for FoRVTable

fn validity_child(array: &FoRArray) -> &ArrayRef

impl VisitorVTable<FoRVTable> for FoRVTable

fn visit_buffers(_array: &FoRArray, _visitor: &mut dyn ArrayBufferVisitor)

Visit the buffers of the array.

fn visit_children(array: &FoRArray, visitor: &mut dyn ArrayChildVisitor)

Visit the children of the array.

fn nbuffers(array: &<V as VTable>::Array) -> usize

Count the number of buffers in the array.

fn nchildren(array: &<V as VTable>::Array) -> usize

Count the number of children in the array.