pub struct PrimitiveEncoding;
Trait Implementations§
Source§impl BetweenFn<&PrimitiveArray> for PrimitiveEncoding
impl BetweenFn<&PrimitiveArray> for PrimitiveEncoding
fn between( &self, arr: &PrimitiveArray, lower: &dyn Array, upper: &dyn Array, options: &BetweenOptions, ) -> VortexResult<Option<ArrayRef>>
Source§impl CastFn<&PrimitiveArray> for PrimitiveEncoding
impl CastFn<&PrimitiveArray> for PrimitiveEncoding
fn cast(&self, array: &PrimitiveArray, dtype: &DType) -> VortexResult<ArrayRef>
Source§impl ComputeVTable for PrimitiveEncoding
impl ComputeVTable for PrimitiveEncoding
Source§fn cast_fn(&self) -> Option<&dyn CastFn<&dyn Array>>
fn cast_fn(&self) -> Option<&dyn CastFn<&dyn Array>>
Implemented for arrays that can be casted to different types. Read more
Source§fn between_fn(&self) -> Option<&dyn BetweenFn<&dyn Array>>
fn between_fn(&self) -> Option<&dyn BetweenFn<&dyn Array>>
A ternary operator, returning bool if the values are between the other two given values. Read more
Source§fn fill_forward_fn(&self) -> Option<&dyn FillForwardFn<&dyn Array>>
fn fill_forward_fn(&self) -> Option<&dyn FillForwardFn<&dyn Array>>
Array function that returns new arrays a non-null value is repeated across runs of nulls. Read more
Source§fn fill_null_fn(&self) -> Option<&dyn FillNullFn<&dyn Array>>
fn fill_null_fn(&self) -> Option<&dyn FillNullFn<&dyn Array>>
Fill null values with given desired value. Resulting array is NonNullable Read more
Source§fn is_constant_fn(&self) -> Option<&dyn IsConstantFn<&dyn Array>>
fn is_constant_fn(&self) -> Option<&dyn IsConstantFn<&dyn Array>>
Checks if an array is constant. Read more
fn is_sorted_fn(&self) -> Option<&dyn IsSortedFn<&dyn Array>>
Source§fn mask_fn(&self) -> Option<&dyn MaskFn<&dyn Array>>
fn mask_fn(&self) -> Option<&dyn MaskFn<&dyn Array>>
Replace masked values with null. Read more
Source§fn scalar_at_fn(&self) -> Option<&dyn ScalarAtFn<&dyn Array>>
fn scalar_at_fn(&self) -> Option<&dyn ScalarAtFn<&dyn Array>>
Single item indexing on Vortex arrays. Read more
Source§fn search_sorted_fn(&self) -> Option<&dyn SearchSortedFn<&dyn Array>>
fn search_sorted_fn(&self) -> Option<&dyn SearchSortedFn<&dyn Array>>
Perform a search over an ordered array. Read more
Source§fn search_sorted_usize_fn(&self) -> Option<&dyn SearchSortedUsizeFn<&dyn Array>>
fn search_sorted_usize_fn(&self) -> Option<&dyn SearchSortedUsizeFn<&dyn Array>>
Perform a search over an ordered array. Read more
Source§fn slice_fn(&self) -> Option<&dyn SliceFn<&dyn Array>>
fn slice_fn(&self) -> Option<&dyn SliceFn<&dyn Array>>
Perform zero-copy slicing of an array. Read more
Source§fn take_fn(&self) -> Option<&dyn TakeFn<&dyn Array>>
fn take_fn(&self) -> Option<&dyn TakeFn<&dyn Array>>
Take a set of indices from an array. This often forces allocations and decoding of
the receiver. Read more
Source§fn to_arrow_fn(&self) -> Option<&dyn ToArrowFn<&dyn Array>>
fn to_arrow_fn(&self) -> Option<&dyn ToArrowFn<&dyn Array>>
Convert the array to an Arrow array of the given type. Read more
Source§fn min_max_fn(&self) -> Option<&dyn MinMaxFn<&dyn Array>>
fn min_max_fn(&self) -> Option<&dyn MinMaxFn<&dyn Array>>
Compute the min, max of an array. Read more
Source§fn uncompressed_size_fn(&self) -> Option<&dyn UncompressedSizeFn<&dyn Array>>
fn uncompressed_size_fn(&self) -> Option<&dyn UncompressedSizeFn<&dyn Array>>
Approximates the uncompressed size of the array. Read more
Source§fn binary_boolean_fn(&self) -> Option<&dyn BinaryBooleanFn<&dyn Array>>
fn binary_boolean_fn(&self) -> Option<&dyn BinaryBooleanFn<&dyn Array>>
Implementation of binary boolean logic operations. Read more
Source§fn binary_numeric_fn(&self) -> Option<&dyn BinaryNumericFn<&dyn Array>>
fn binary_numeric_fn(&self) -> Option<&dyn BinaryNumericFn<&dyn Array>>
Implementation of binary numeric operations. Read more
Source§fn compare_fn(&self) -> Option<&dyn CompareFn<&dyn Array>>
fn compare_fn(&self) -> Option<&dyn CompareFn<&dyn Array>>
Binary operator implementation for arrays against other arrays. Read more
Source§fn invert_fn(&self) -> Option<&dyn InvertFn<&dyn Array>>
fn invert_fn(&self) -> Option<&dyn InvertFn<&dyn Array>>
Invert a boolean array. Converts true -> false, false -> true, null -> null. Read more
Source§fn like_fn(&self) -> Option<&dyn LikeFn<&dyn Array>>
fn like_fn(&self) -> Option<&dyn LikeFn<&dyn Array>>
Perform a SQL LIKE operation on two arrays. Read more
Source§fn optimize_fn(&self) -> Option<&dyn OptimizeFn<&dyn Array>>
fn optimize_fn(&self) -> Option<&dyn OptimizeFn<&dyn Array>>
Try and optimize the layout of an array. Read more
fn take_from_fn(&self) -> Option<&dyn TakeFromFn<&dyn Array>>
Source§impl Encoding for PrimitiveEncoding
impl Encoding for PrimitiveEncoding
Source§impl EncodingVTable for PrimitiveEncoding
impl EncodingVTable for PrimitiveEncoding
Source§fn id(&self) -> EncodingId
fn id(&self) -> EncodingId
Return the ID for this encoding implementation.
fn decode( &self, parts: &ArrayParts, ctx: &ArrayContext, dtype: DType, len: usize, ) -> VortexResult<ArrayRef>
Source§impl FillForwardFn<&PrimitiveArray> for PrimitiveEncoding
impl FillForwardFn<&PrimitiveArray> for PrimitiveEncoding
fn fill_forward(&self, array: &PrimitiveArray) -> VortexResult<ArrayRef>
Source§impl FillNullFn<&PrimitiveArray> for PrimitiveEncoding
impl FillNullFn<&PrimitiveArray> for PrimitiveEncoding
fn fill_null( &self, array: &PrimitiveArray, fill_value: Scalar, ) -> VortexResult<ArrayRef>
Source§impl FilterKernel for PrimitiveEncoding
impl FilterKernel for PrimitiveEncoding
Source§fn filter(&self, array: &PrimitiveArray, mask: &Mask) -> VortexResult<ArrayRef>
fn filter(&self, array: &PrimitiveArray, mask: &Mask) -> VortexResult<ArrayRef>
Filter an array by the provided predicate. Read more
Source§impl IsConstantFn<&PrimitiveArray> for PrimitiveEncoding
impl IsConstantFn<&PrimitiveArray> for PrimitiveEncoding
Source§fn is_constant(
&self,
array: &PrimitiveArray,
_opts: &IsConstantOpts,
) -> VortexResult<Option<bool>>
fn is_constant( &self, array: &PrimitiveArray, _opts: &IsConstantOpts, ) -> VortexResult<Option<bool>>
Preconditions Read more
Source§impl IsSortedFn<&PrimitiveArray> for PrimitiveEncoding
impl IsSortedFn<&PrimitiveArray> for PrimitiveEncoding
Source§fn is_sorted(&self, array: &PrimitiveArray) -> VortexResult<bool>
fn is_sorted(&self, array: &PrimitiveArray) -> VortexResult<bool>
Preconditions Read more
fn is_strict_sorted(&self, array: &PrimitiveArray) -> VortexResult<bool>
Source§impl MaskFn<&PrimitiveArray> for PrimitiveEncoding
impl MaskFn<&PrimitiveArray> for PrimitiveEncoding
Source§fn mask(&self, array: &PrimitiveArray, mask: Mask) -> VortexResult<ArrayRef>
fn mask(&self, array: &PrimitiveArray, mask: Mask) -> VortexResult<ArrayRef>
Replace masked values with null in array.
Source§impl MinMaxFn<&PrimitiveArray> for PrimitiveEncoding
impl MinMaxFn<&PrimitiveArray> for PrimitiveEncoding
fn min_max(&self, array: &PrimitiveArray) -> VortexResult<Option<MinMaxResult>>
Source§impl ScalarAtFn<&PrimitiveArray> for PrimitiveEncoding
impl ScalarAtFn<&PrimitiveArray> for PrimitiveEncoding
fn scalar_at( &self, array: &PrimitiveArray, index: usize, ) -> VortexResult<Scalar>
Source§impl SearchSortedFn<&PrimitiveArray> for PrimitiveEncoding
impl SearchSortedFn<&PrimitiveArray> for PrimitiveEncoding
fn search_sorted( &self, array: &PrimitiveArray, value: &Scalar, side: SearchSortedSide, ) -> VortexResult<SearchResult>
Source§fn search_sorted_many(
&self,
array: A,
values: &[Scalar],
side: SearchSortedSide,
) -> VortexResult<Vec<SearchResult>>
fn search_sorted_many( &self, array: A, values: &[Scalar], side: SearchSortedSide, ) -> VortexResult<Vec<SearchResult>>
Bulk search for many values.
Source§impl SearchSortedUsizeFn<&PrimitiveArray> for PrimitiveEncoding
impl SearchSortedUsizeFn<&PrimitiveArray> for PrimitiveEncoding
fn search_sorted_usize( &self, array: &PrimitiveArray, value: usize, side: SearchSortedSide, ) -> VortexResult<SearchResult>
fn search_sorted_usize_many( &self, array: A, values: &[usize], side: SearchSortedSide, ) -> VortexResult<Vec<SearchResult>>
Source§impl SliceFn<&PrimitiveArray> for PrimitiveEncoding
impl SliceFn<&PrimitiveArray> for PrimitiveEncoding
Source§fn slice(
&self,
array: &PrimitiveArray,
start: usize,
stop: usize,
) -> VortexResult<ArrayRef>
fn slice( &self, array: &PrimitiveArray, start: usize, stop: usize, ) -> VortexResult<ArrayRef>
Return a zero-copy slice of an array, between
start
(inclusive) and end
(exclusive).
If start >= stop, returns an empty array of the same type as self
.
Assumes that start or stop are out of bounds, may panic otherwise.Source§impl SumFn<&PrimitiveArray> for PrimitiveEncoding
impl SumFn<&PrimitiveArray> for PrimitiveEncoding
Source§fn sum(&self, array: &PrimitiveArray) -> VortexResult<Scalar>
fn sum(&self, array: &PrimitiveArray) -> VortexResult<Scalar>
Preconditions Read more
Source§impl TakeFn<&PrimitiveArray> for PrimitiveEncoding
impl TakeFn<&PrimitiveArray> for PrimitiveEncoding
Source§fn take(
&self,
array: &PrimitiveArray,
indices: &dyn Array,
) -> VortexResult<ArrayRef>
fn take( &self, array: &PrimitiveArray, indices: &dyn Array, ) -> VortexResult<ArrayRef>
Source§fn take_into(
&self,
array: &PrimitiveArray,
indices: &dyn Array,
builder: &mut dyn ArrayBuilder,
) -> VortexResult<()>
fn take_into( &self, array: &PrimitiveArray, indices: &dyn Array, builder: &mut dyn ArrayBuilder, ) -> VortexResult<()>
Has the same semantics as
Self::take
but materializes the result into the provided
builder.Source§impl ToArrowFn<&PrimitiveArray> for PrimitiveEncoding
impl ToArrowFn<&PrimitiveArray> for PrimitiveEncoding
Source§fn to_arrow(
&self,
primitive_array: &PrimitiveArray,
data_type: &DataType,
) -> VortexResult<Option<ArrayRef>>
fn to_arrow( &self, primitive_array: &PrimitiveArray, data_type: &DataType, ) -> VortexResult<Option<ArrayRef>>
Convert the array to an Arrow array of the given type. Read more
Source§fn preferred_arrow_data_type(&self, _array: A) -> VortexResult<Option<DataType>>
fn preferred_arrow_data_type(&self, _array: A) -> VortexResult<Option<DataType>>
Return the preferred Arrow
DataType
of the encoding, or None of the canonical
DataType
for the array’s Vortex vortex_dtype::DType
should be used.Source§impl UncompressedSizeFn<&PrimitiveArray> for PrimitiveEncoding
impl UncompressedSizeFn<&PrimitiveArray> for PrimitiveEncoding
Source§fn uncompressed_size(&self, array: &PrimitiveArray) -> VortexResult<usize>
fn uncompressed_size(&self, array: &PrimitiveArray) -> VortexResult<usize>
Compute the approximated uncompressed size of the array, in bytes.
Auto Trait Implementations§
impl Freeze for PrimitiveEncoding
impl RefUnwindSafe for PrimitiveEncoding
impl Send for PrimitiveEncoding
impl Sync for PrimitiveEncoding
impl Unpin for PrimitiveEncoding
impl UnwindSafe for PrimitiveEncoding
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<E> FillForwardFn<&dyn Array> for E
impl<E> FillForwardFn<&dyn Array> for E
fn fill_forward(&self, array: &dyn Array) -> Result<Arc<dyn Array>, VortexError>
Source§impl<E> FillNullFn<&dyn Array> for E
impl<E> FillNullFn<&dyn Array> for E
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<E> IsConstantFn<&dyn Array> for E
impl<E> IsConstantFn<&dyn Array> for E
Source§fn is_constant(
&self,
array: &dyn Array,
opts: &IsConstantOpts,
) -> Result<Option<bool>, VortexError>
fn is_constant( &self, array: &dyn Array, opts: &IsConstantOpts, ) -> Result<Option<bool>, VortexError>
Preconditions Read more
Source§impl<E> IsSortedFn<&dyn Array> for E
impl<E> IsSortedFn<&dyn Array> for E
fn is_strict_sorted(&self, array: &dyn Array) -> Result<bool, VortexError>
Source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
Source§impl<E> MinMaxFn<&dyn Array> for E
impl<E> MinMaxFn<&dyn Array> for E
fn min_max( &self, array: &dyn Array, ) -> Result<Option<MinMaxResult>, VortexError>
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out
indicating that a T
is niched.Source§impl<E> ScalarAtFn<&dyn Array> for E
impl<E> ScalarAtFn<&dyn Array> for E
Source§impl<E> SearchSortedFn<&dyn Array> for E
impl<E> SearchSortedFn<&dyn Array> for E
fn search_sorted( &self, array: &dyn Array, value: &Scalar, side: SearchSortedSide, ) -> Result<SearchResult, VortexError>
Source§fn search_sorted_many(
&self,
array: &dyn Array,
values: &[Scalar],
side: SearchSortedSide,
) -> Result<Vec<SearchResult>, VortexError>
fn search_sorted_many( &self, array: &dyn Array, values: &[Scalar], side: SearchSortedSide, ) -> Result<Vec<SearchResult>, VortexError>
Bulk search for many values.
Source§impl<E> SearchSortedUsizeFn<&dyn Array> for E
impl<E> SearchSortedUsizeFn<&dyn Array> for E
fn search_sorted_usize( &self, array: &dyn Array, value: usize, side: SearchSortedSide, ) -> Result<SearchResult, VortexError>
fn search_sorted_usize_many( &self, array: &dyn Array, values: &[usize], side: SearchSortedSide, ) -> Result<Vec<SearchResult>, VortexError>
Source§impl<E> SliceFn<&dyn Array> for E
impl<E> SliceFn<&dyn Array> for E
Source§fn slice(
&self,
array: &dyn Array,
start: usize,
stop: usize,
) -> Result<Arc<dyn Array>, VortexError>
fn slice( &self, array: &dyn Array, start: usize, stop: usize, ) -> Result<Arc<dyn Array>, VortexError>
Return a zero-copy slice of an array, between
start
(inclusive) and end
(exclusive).
If start >= stop, returns an empty array of the same type as self
.
Assumes that start or stop are out of bounds, may panic otherwise.Source§impl<E> TakeFn<&dyn Array> for E
impl<E> TakeFn<&dyn Array> for E
Source§fn take(
&self,
array: &dyn Array,
indices: &dyn Array,
) -> Result<Arc<dyn Array>, VortexError>
fn take( &self, array: &dyn Array, indices: &dyn Array, ) -> Result<Arc<dyn Array>, VortexError>
Source§fn take_into(
&self,
array: &dyn Array,
indices: &dyn Array,
builder: &mut dyn ArrayBuilder,
) -> Result<(), VortexError>
fn take_into( &self, array: &dyn Array, indices: &dyn Array, builder: &mut dyn ArrayBuilder, ) -> Result<(), VortexError>
Has the same semantics as
Self::take
but materializes the result into the provided
builder.Source§impl<E> ToArrowFn<&dyn Array> for E
impl<E> ToArrowFn<&dyn Array> for E
Source§fn preferred_arrow_data_type(
&self,
array: &dyn Array,
) -> Result<Option<DataType>, VortexError>
fn preferred_arrow_data_type( &self, array: &dyn Array, ) -> Result<Option<DataType>, VortexError>
Return the preferred Arrow
DataType
of the encoding, or None of the canonical
DataType
for the array’s Vortex vortex_dtype::DType
should be used.Source§impl<E> UncompressedSizeFn<&dyn Array> for E
impl<E> UncompressedSizeFn<&dyn Array> for E
Source§fn uncompressed_size(&self, array: &dyn Array) -> Result<usize, VortexError>
fn uncompressed_size(&self, array: &dyn Array) -> Result<usize, VortexError>
Compute the approximated uncompressed size of the array, in bytes.