Struct arrow2::array::PrimitiveArray

pub struct PrimitiveArray<T: NativeType> { /* private fields */ }

A PrimitiveArray is arrow’s equivalent to Vec<Option<T: NativeType>>, i.e. an array designed for highly performant operations on optionally nullable slots, backed by a physical type of a fixed byte-width, such as i32 or f64. The size of this struct is O(1) as all data is stored behind an std::sync::Arc.

Example

use arrow2::array::{PrimitiveArray, Array};
use arrow2::bitmap::Bitmap;
let array = PrimitiveArray::from([Some(1), None, Some(10)]);
assert_eq!(array.values().as_slice(), &[1, 0, 10]);
assert_eq!(array.validity(), Some(&Bitmap::from([true, false, true])));

Implementations

impl<T: NativeType> PrimitiveArray<T>

pub fn from_values<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a (non-null) PrimitiveArray from an iterator of values.

Implementation

This does not assume that the iterator has a known length.

pub fn from_slice<P: AsRef<[T]>>(slice: P) -> Self

Creates a (non-null) PrimitiveArray from a slice of values.

Implementation

This is essentially a memcopy

pub fn from_vec(array: Vec<T>) -> Self

Creates a (non-null) PrimitiveArray from a vector of values. This does not have memcopy and is the fastest way to create a PrimitiveArray.

impl<T: NativeType> PrimitiveArray<T>

pub fn from_trusted_len_values_iter<I: TrustedLen<Item = T>>(iter: I) -> Self

Creates a (non-null) PrimitiveArray from a TrustedLen of values.

Implementation

This does not assume that the iterator has a known length.

pub unsafe fn from_trusted_len_values_iter_unchecked<I: Iterator<Item = T>>(
    iter: I
) -> Self

Creates a new PrimitiveArray from an iterator over values

Safety

The iterator must be TrustedLen. I.e. that size_hint().1 correctly reports its length.

pub fn from_trusted_len_iter<I: TrustedLen<Item = Option<T>>>(iter: I) -> Self

Creates a PrimitiveArray from a TrustedLen of optional values.

pub unsafe fn from_trusted_len_iter_unchecked<I: Iterator<Item = Option<T>>>(
    iter: I
) -> Self

Creates a PrimitiveArray from an iterator of optional values.

Safety

The iterator must be TrustedLen. I.e. that size_hint().1 correctly reports its length.

impl<'a, T: NativeType> PrimitiveArray<T>

pub fn iter(&'a self) -> ZipValidity<'a, &'a T, Iter<'a, T>>

constructs a new iterator

impl<T: NativeType> PrimitiveArray<T>

pub fn try_new(
    data_type: DataType,
    values: Buffer<T>,
    validity: Option<Bitmap>
) -> Result<Self, ArrowError>

The canonical method to create a PrimitiveArray.

Errors

This function errors iff:

• The validity is not None and its length is different from values’s length
• The data_type’s PhysicalType is not equal to PhysicalType::Primitive.

pub fn new(
    data_type: DataType,
    values: Buffer<T>,
    validity: Option<Bitmap>
) -> Self

The canonical method to create a PrimitiveArray

Panics

This function errors iff:

• The validity is not None and its length is different from values’s length
• The data_type’s PhysicalType is not equal to PhysicalType::Primitive.

pub fn from_data(
    data_type: DataType,
    values: Buffer<T>,
    validity: Option<Bitmap>
) -> Self

Alias for new

pub fn new_empty(data_type: DataType) -> Self

Returns a new empty PrimitiveArray.

pub fn new_null(data_type: DataType, length: usize) -> Self

Returns a new PrimitiveArray whose all slots are null / None.

impl<T: NativeType> PrimitiveArray<T>

pub fn slice(&self, offset: usize, length: usize) -> Self

Returns a slice of this PrimitiveArray.

Implementation

This operation is O(1) as it amounts to increase two ref counts.

Panic

This function panics iff offset + length >= self.len().

pub unsafe fn slice_unchecked(&self, offset: usize, length: usize) -> Self

Returns a slice of this PrimitiveArray.

Implementation

This operation is O(1) as it amounts to increase two ref counts.

Safety

The caller must ensure that offset + length <= self.len().

pub fn with_validity(&self, validity: Option<Bitmap>) -> Self

Sets the validity bitmap on this PrimitiveArray.

Panics

This function panics iff validity.len() != self.len().

impl<T: NativeType> PrimitiveArray<T>

pub fn len(&self) -> usize

Returns the length of this array

pub fn validity(&self) -> Option<&Bitmap>

The optional validity.

pub fn data_type(&self) -> &DataType

The arrays’ logical type

pub fn values(&self) -> &Buffer<T>

The values Buffer. Values on null slots are undetermined (they can be anything).

pub fn value(&self, i: usize) -> T

Returns the value at slot i. Equivalent to self.values()[i]. The value on null slots is undetermined (it can be anything).

pub unsafe fn value_unchecked(&self, i: usize) -> T

Returns the element at index i as T. The value on null slots is undetermined (it can be anything).

Safety

Caller must be sure that i < self.len()

pub fn to(self, data_type: DataType) -> Self

Returns a new PrimitiveArray with a different logical type. This is O(1).

Panics

Panics iff the data_type is not supported for the physical type.

pub fn into_mut(self) -> Either<Self, MutablePrimitiveArray<T>>

Try to convert this PrimitiveArray to a MutablePrimitiveArray

Trait Implementations

impl<T: NativeType> Array for PrimitiveArray<T>

fn as_any(&self) -> &dyn Any

Convert to trait object.

fn len(&self) -> usize

The length of the Array. Every array has a length corresponding to the number of elements (slots).

fn data_type(&self) -> &DataType

The DataType of the Array. In combination with Array::as_any, this can be used to downcast trait objects (dyn Array) to concrete arrays.

fn validity(&self) -> Option<&Bitmap>

The validity of the Array: every array has an optional Bitmap that, when available specifies whether the array slot is valid or not (null). When the validity is None, all slots are valid.

fn slice(&self, offset: usize, length: usize) -> Box<dyn Array>

Slices the Array, returning a new Box<dyn Array>.

unsafe fn slice_unchecked(&self, offset: usize, length: usize) -> Box<dyn Array>

Slices the Array, returning a new Box<dyn Array>.

fn with_validity(&self, validity: Option<Bitmap>) -> Box<dyn Array>

Sets the validity bitmap on this Array.

fn is_empty(&self) -> bool

whether the array is empty

fn null_count(&self) -> usize

The number of null slots on this Array.

fn is_null(&self, i: usize) -> bool

Returns whether slot i is null.

fn is_valid(&self, i: usize) -> bool

Returns whether slot i is valid.

impl<T> ArrayAdd<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + Add<Output = T>, 

fn add(&self, rhs: &PrimitiveArray<T>) -> Self

Adds itself to rhs

impl ArrayAdd<PrimitiveArray<i128>> for PrimitiveArray<i128>

fn add(&self, rhs: &PrimitiveArray<i128>) -> Self

Adds itself to rhs

impl<T> ArrayAdd<T> for PrimitiveArray<T> where
    T: NativeArithmetics + Add<Output = T>, 

fn add(&self, rhs: &T) -> Self

Adds itself to rhs

impl<T> ArrayCheckedAdd<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + CheckedAdd<Output = T>, 

fn checked_add(&self, rhs: &PrimitiveArray<T>) -> Self

Checked add

impl ArrayCheckedAdd<PrimitiveArray<i128>> for PrimitiveArray<i128>

fn checked_add(&self, rhs: &PrimitiveArray<i128>) -> Self

Checked add

impl<T> ArrayCheckedAdd<T> for PrimitiveArray<T> where
    T: NativeArithmetics + CheckedAdd<Output = T>, 

fn checked_add(&self, rhs: &T) -> Self

Checked add

impl<T> ArrayCheckedDiv<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + CheckedDiv<Output = T>, 

fn checked_div(&self, rhs: &PrimitiveArray<T>) -> Self

checked division

impl ArrayCheckedDiv<PrimitiveArray<i128>> for PrimitiveArray<i128>

fn checked_div(&self, rhs: &PrimitiveArray<i128>) -> Self

checked division

impl<T> ArrayCheckedDiv<T> for PrimitiveArray<T> where
    T: NativeArithmetics + CheckedDiv<Output = T>, 

fn checked_div(&self, rhs: &T) -> Self

checked division

impl<T> ArrayCheckedMul<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + CheckedMul<Output = T>, 

fn checked_mul(&self, rhs: &PrimitiveArray<T>) -> Self

checked multiplication

impl ArrayCheckedMul<PrimitiveArray<i128>> for PrimitiveArray<i128>

fn checked_mul(&self, rhs: &PrimitiveArray<i128>) -> Self

checked multiplication

impl<T> ArrayCheckedMul<T> for PrimitiveArray<T> where
    T: NativeArithmetics + CheckedMul<Output = T>, 

fn checked_mul(&self, rhs: &T) -> Self

checked multiplication

impl<T> ArrayCheckedRem<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + CheckedRem<Output = T>, 

fn checked_rem(&self, rhs: &PrimitiveArray<T>) -> Self

checked remainder

impl<T> ArrayCheckedRem<T> for PrimitiveArray<T> where
    T: NativeArithmetics + CheckedRem<Output = T>, 

fn checked_rem(&self, rhs: &T) -> Self

checked remainder

impl<T> ArrayCheckedSub<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + CheckedSub<Output = T>, 

fn checked_sub(&self, rhs: &PrimitiveArray<T>) -> Self

checked subtraction

impl ArrayCheckedSub<PrimitiveArray<i128>> for PrimitiveArray<i128>

fn checked_sub(&self, rhs: &PrimitiveArray<i128>) -> Self

checked subtraction

impl<T> ArrayCheckedSub<T> for PrimitiveArray<T> where
    T: NativeArithmetics + CheckedSub<Output = T>, 

fn checked_sub(&self, rhs: &T) -> Self

checked subtraction

impl<T> ArrayDiv<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + Div<Output = T>, 

fn div(&self, rhs: &PrimitiveArray<T>) -> Self

division

impl ArrayDiv<PrimitiveArray<i128>> for PrimitiveArray<i128>

fn div(&self, rhs: &PrimitiveArray<i128>) -> Self

division

impl<T> ArrayDiv<T> for PrimitiveArray<T> where
    T: NativeArithmetics + Div<Output = T> + NumCast, 

fn div(&self, rhs: &T) -> Self

division

impl<T> ArrayMul<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + Mul<Output = T>, 

fn mul(&self, rhs: &PrimitiveArray<T>) -> Self

multiplication

impl ArrayMul<PrimitiveArray<i128>> for PrimitiveArray<i128>

fn mul(&self, rhs: &PrimitiveArray<i128>) -> Self

multiplication

impl<T> ArrayMul<T> for PrimitiveArray<T> where
    T: NativeArithmetics + Mul<Output = T>, 

fn mul(&self, rhs: &T) -> Self

multiplication

impl<T> ArrayOverflowingAdd<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + OverflowingAdd<Output = T>, 

fn overflowing_add(&self, rhs: &PrimitiveArray<T>) -> (Self, Bitmap)

Overflowing add

impl<T> ArrayOverflowingAdd<T> for PrimitiveArray<T> where
    T: NativeArithmetics + OverflowingAdd<Output = T>, 

fn overflowing_add(&self, rhs: &T) -> (Self, Bitmap)

Overflowing add

impl<T> ArrayOverflowingMul<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + OverflowingMul<Output = T>, 

fn overflowing_mul(&self, rhs: &PrimitiveArray<T>) -> (Self, Bitmap)

overflowing multiplication

impl<T> ArrayOverflowingMul<T> for PrimitiveArray<T> where
    T: NativeArithmetics + OverflowingMul<Output = T>, 

fn overflowing_mul(&self, rhs: &T) -> (Self, Bitmap)

overflowing multiplication

impl<T> ArrayOverflowingSub<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + OverflowingSub<Output = T>, 

fn overflowing_sub(&self, rhs: &PrimitiveArray<T>) -> (Self, Bitmap)

overflowing subtraction

impl<T> ArrayOverflowingSub<T> for PrimitiveArray<T> where
    T: NativeArithmetics + OverflowingSub<Output = T>, 

fn overflowing_sub(&self, rhs: &T) -> (Self, Bitmap)

overflowing subtraction

impl<T> ArrayRem<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + Rem<Output = T>, 

fn rem(&self, rhs: &PrimitiveArray<T>) -> Self

remainder

impl<T> ArrayRem<T> for PrimitiveArray<T> where
    T: NativeArithmetics + Rem<Output = T> + NumCast, 

fn rem(&self, rhs: &T) -> Self

remainder

impl<T> ArraySaturatingAdd<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + SaturatingAdd<Output = T>, 

fn saturating_add(&self, rhs: &PrimitiveArray<T>) -> Self

Saturating add

impl ArraySaturatingAdd<PrimitiveArray<i128>> for PrimitiveArray<i128>

fn saturating_add(&self, rhs: &PrimitiveArray<i128>) -> Self

Saturating add

impl<T> ArraySaturatingAdd<T> for PrimitiveArray<T> where
    T: NativeArithmetics + SaturatingAdd<Output = T>, 

fn saturating_add(&self, rhs: &T) -> Self

Saturating add

impl<T> ArraySaturatingMul<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + SaturatingMul<Output = T>, 

fn saturating_mul(&self, rhs: &PrimitiveArray<T>) -> Self

saturating multiplication

impl ArraySaturatingMul<PrimitiveArray<i128>> for PrimitiveArray<i128>

fn saturating_mul(&self, rhs: &PrimitiveArray<i128>) -> Self

saturating multiplication

impl<T> ArraySaturatingMul<T> for PrimitiveArray<T> where
    T: NativeArithmetics + SaturatingMul<Output = T>, 

fn saturating_mul(&self, rhs: &T) -> Self

saturating multiplication

impl<T> ArraySaturatingSub<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + SaturatingSub<Output = T>, 

fn saturating_sub(&self, rhs: &PrimitiveArray<T>) -> Self

saturarting subtraction

impl ArraySaturatingSub<PrimitiveArray<i128>> for PrimitiveArray<i128>

fn saturating_sub(&self, rhs: &PrimitiveArray<i128>) -> Self

saturarting subtraction

impl<T> ArraySaturatingSub<T> for PrimitiveArray<T> where
    T: NativeArithmetics + SaturatingSub<Output = T>, 

fn saturating_sub(&self, rhs: &T) -> Self

saturarting subtraction

impl<T> ArraySub<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + Sub<Output = T>, 

fn sub(&self, rhs: &PrimitiveArray<T>) -> Self

subtraction

impl ArraySub<PrimitiveArray<i128>> for PrimitiveArray<i128>

fn sub(&self, rhs: &PrimitiveArray<i128>) -> Self

subtraction

impl<T> ArraySub<T> for PrimitiveArray<T> where
    T: NativeArithmetics + Sub<Output = T>, 

fn sub(&self, rhs: &T) -> Self

subtraction

impl<T> ArrayWrappingAdd<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + WrappingAdd<Output = T>, 

fn wrapping_add(&self, rhs: &PrimitiveArray<T>) -> Self

Adds itself to rhs using wrapping addition

impl<T> ArrayWrappingMul<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + WrappingMul<Output = T>, 

fn wrapping_mul(&self, rhs: &PrimitiveArray<T>) -> Self

wrapping multiplication

impl<T> ArrayWrappingSub<PrimitiveArray<T>> for PrimitiveArray<T> where
    T: NativeArithmetics + WrappingSub<Output = T>, 

fn wrapping_sub(&self, rhs: &PrimitiveArray<T>) -> Self

wrapping subtraction

impl<T: Clone + NativeType> Clone for PrimitiveArray<T>

fn clone(&self) -> PrimitiveArray<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: NativeType> Debug for PrimitiveArray<T>

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

Formats the value using the given formatter.

impl<'a, T: NativeType> From<GrowablePrimitive<'a, T>> for PrimitiveArray<T>

fn from(val: GrowablePrimitive<'a, T>) -> Self

Performs the conversion.

impl<T: NativeType> From<MutablePrimitiveArray<T>> for PrimitiveArray<T>

fn from(other: MutablePrimitiveArray<T>) -> Self

Performs the conversion.

impl<T: NativeType, P: AsRef<[Option<T>]>> From<P> for PrimitiveArray<T>

fn from(slice: P) -> Self

Performs the conversion.

impl<T: NativeType, Ptr: Borrow<Option<T>>> FromIterator<Ptr> for PrimitiveArray<T>

fn from_iter<I: IntoIterator<Item = Ptr>>(iter: I) -> Self

Creates a value from an iterator.

impl<'a, T: NativeType> IntoIterator for &'a PrimitiveArray<T>

type Item = Option<&'a T>

The type of the elements being iterated over.

type IntoIter = ZipValidity<'a, &'a T, Iter<'a, T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: NativeType> PartialEq<&'_ (dyn Array + '_)> for PrimitiveArray<T>

fn eq(&self, other: &&dyn Array) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<T: NativeType> PartialEq<PrimitiveArray<T>> for PrimitiveArray<T>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.