High-level API
Arrow core trait the Array
, which you can think of as representing Arc<Vec<Option<T>>
with associated metadata (see metadata)).
Contrarily to Arc<Vec<Option<T>>
, arrays in this crate are represented in such a way
that they can be zero-copied to any other Arrow implementation via foreign interfaces (FFI).
Probably the simplest Array
in this crate is the PrimitiveArray<T>
. It can be
constructed from a slice of option values,
use arrow2::array::{Array, PrimitiveArray}; fn main() { let array = PrimitiveArray::<i32>::from([Some(1), None, Some(123)]); assert_eq!(array.len(), 3) }
from a slice of values,
use arrow2::array::{Array, PrimitiveArray}; fn main() { let array = PrimitiveArray::<f32>::from_slice([1.0, 0.0, 123.0]); assert_eq!(array.len(), 3) }
or from an iterator
use arrow2::array::{Array, PrimitiveArray}; fn main() { let array: PrimitiveArray<u64> = [Some(1), None, Some(123)].iter().collect(); assert_eq!(array.len(), 3) }
A PrimitiveArray
(and every Array
implemented in this crate) has 3 components:
- A physical type (e.g.
i32
) - A logical type (e.g.
DataType::Int32
) - Data
The main differences from a Arc<Vec<Option<T>>>
are:
- Its data is laid out in memory as a
Buffer<T>
and anOption<Bitmap>
(see [../low_level.md]) - It has an associated logical type (
DataType
).
The first allows interoperability with Arrow's ecosystem and efficient SIMD operations (we will re-visit this below); the second is that it gives semantic meaning to the array. In the example
use arrow2::array::PrimitiveArray; use arrow2::datatypes::DataType; fn main() { let ints = PrimitiveArray::<i32>::from([Some(1), None]); let dates = PrimitiveArray::<i32>::from([Some(1), None]).to(DataType::Date32); }
ints
and dates
have the same in-memory representation but different logic
representations (e.g. dates are usually printed to users as "yyyy-mm-dd").
All physical types (e.g. i32
) have a "natural" logical DataType
(e.g. DataType::Int32
)
which is assigned when allocating arrays from iterators, slices, etc.
use arrow2::array::{Array, Int32Array, PrimitiveArray}; use arrow2::datatypes::DataType; fn main() { let array = PrimitiveArray::<i32>::from_slice([1, 0, 123]); assert_eq!(array.data_type(), &DataType::Int32); }
they can be cheaply (O(1)
) converted to via .to(DataType)
.
The following arrays are supported:
NullArray
(just holds nulls)BooleanArray
(booleans)PrimitiveArray<T>
(for ints, floats)Utf8Array<i32>
andUtf8Array<i64>
(for strings)BinaryArray<i32>
andBinaryArray<i64>
(for opaque binaries)FixedSizeBinaryArray
(likeBinaryArray
, but fixed size)ListArray<i32>
andListArray<i64>
(array of arrays)FixedSizeListArray
(array of arrays of a fixed size)StructArray
(multiple named arrays where each row has one element from each array)UnionArray
(every row has a different logical type)DictionaryArray<K>
(nested array with encoded values)
Array as a trait object
Array
is object safe, and all implementations of Array
and can be casted
to &dyn Array
, which enables dynamic casting and run-time nesting.
use arrow2::array::{Array, PrimitiveArray}; fn main() { let a = PrimitiveArray::<i32>::from(&[Some(1), None]); let a: &dyn Array = &a; }
Downcast and as_any
Given a trait object array: &dyn Array
, we know its physical type via
PhysicalType: array.data_type().to_physical_type()
, which we use to downcast the array
to its concrete physical type:
use arrow2::array::{Array, PrimitiveArray}; use arrow2::datatypes::PhysicalType; fn main() { let array = PrimitiveArray::<i32>::from(&[Some(1), None]); let array = &array as &dyn Array; // ... let physical_type: PhysicalType = array.data_type().to_physical_type(); }
There is a one to one relationship between each variant of PhysicalType
(an enum) and
an each implementation of Array
(a struct):
PhysicalType | Array |
---|---|
Primitive(_) | PrimitiveArray<_> |
Binary | BinaryArray<i32> |
LargeBinary | BinaryArray<i64> |
Utf8 | Utf8Array<i32> |
LargeUtf8 | Utf8Array<i64> |
List | ListArray<i32> |
LargeList | ListArray<i64> |
FixedSizeBinary | FixedSizeBinaryArray |
FixedSizeList | FixedSizeListArray |
Struct | StructArray |
Union | UnionArray |
Map | MapArray |
Dictionary(_) | DictionaryArray<_> |
where _
represents each of the variants (e.g. PrimitiveType::Int32 <-> i32
).
In this context, a common idiom in using Array
as a trait object is as follows:
#![allow(unused)] fn main() { use arrow2::datatypes::{PhysicalType, PrimitiveType}; use arrow2::array::{Array, PrimitiveArray}; fn float_operator(array: &dyn Array) -> Result<Box<dyn Array>, String> { match array.data_type().to_physical_type() { PhysicalType::Primitive(PrimitiveType::Float32) => { let array = array.as_any().downcast_ref::<PrimitiveArray<f32>>().unwrap(); // let array = f32-specific operator let array = array.clone(); Ok(Box::new(array)) } PhysicalType::Primitive(PrimitiveType::Float64) => { let array = array.as_any().downcast_ref::<PrimitiveArray<f64>>().unwrap(); // let array = f64-specific operator let array = array.clone(); Ok(Box::new(array)) } _ => Err("This operator is only valid for float point arrays".to_string()), } } }
From Iterator
In the examples above, we've introduced how to create an array from an iterator. These APIs are available for all Arrays, and they are suitable to efficiently create them. In this section we will go a bit more in detail about these operations, and how to make them even more efficient.
This crate's APIs are generally split into two patterns: whether an operation leverages contiguous memory regions or whether it does not.
What this means is that certain operations can be performed irrespectively of whether a value
is "null" or not (e.g. PrimitiveArray<i32> + i32
can be applied to all values
via SIMD and only copy the validity bitmap independently).
When an operation benefits from such arrangement, it is advantageous to use Vec
and Into<Buffer>
If not, then use the MutableArray
API, such as
MutablePrimitiveArray<T>
, MutableUtf8Array<O>
or MutableListArray
.
We have seen examples where the latter API was used. In the last example of this page you will be introduced to an example of using the former for SIMD.
Into Iterator
We've already seen how to create an array from an iterator. Most arrays also implement
IntoIterator
:
use arrow2::array::{Array, Int32Array}; fn main() { let array = Int32Array::from(&[Some(1), None, Some(123)]); for item in array.iter() { if let Some(value) = item { println!("{}", value); } else { println!("NULL"); } } }
Like FromIterator
, this crate contains two sets of APIs to iterate over data. Given
an array array: &PrimitiveArray<T>
, the following applies:
- If you need to iterate over
Option<&T>
, usearray.iter()
- If you can operate over the values and validity independently,
use
array.values() -> &Buffer<T>
andarray.validity() -> Option<&Bitmap>
Note that case 1 is useful when e.g. you want to perform an operation that depends on both validity and values, while the latter is suitable for SIMD and copies, as they return contiguous memory regions (buffers and bitmaps). We will see below how to leverage these APIs.
This idea holds more generally in this crate's arrays: values()
returns something that has
a contiguous in-memory representation, while iter()
returns items taking validity into account.
To get an iterator over contiguous values, use array.values().iter()
.
There is one last API that is worth mentioning, and that is Bitmap::chunks
. When performing
bitwise operations, it is often more performant to operate on chunks of bits
instead of single bits. chunks
offers a TrustedLen
of u64
with the bits
- an extra
u64
remainder. We expose two functions,unary(Bitmap, Fn) -> Bitmap
andbinary(Bitmap, Bitmap, Fn) -> Bitmap
that use this API to efficiently perform bitmap operations.
Vectorized operations
One of the main advantages of the arrow format and its memory layout is that
it often enables SIMD. For example, an unary operation op
on a PrimitiveArray
likely emits SIMD instructions on the following code:
#![allow(unused)] fn main() { use arrow2::buffer::Buffer; use arrow2::{ array::{Array, PrimitiveArray}, types::NativeType, datatypes::DataType, }; pub fn unary<I, F, O>(array: &PrimitiveArray<I>, op: F, data_type: &DataType) -> PrimitiveArray<O> where I: NativeType, O: NativeType, F: Fn(I) -> O, { // apply F over _all_ values let values = array.values().iter().map(|v| op(*v)).collect::<Vec<_>>(); // create the new array, cloning its validity PrimitiveArray::<O>::new(data_type.clone(), values.into(), array.validity().cloned()) } }
Some notes:
-
We used
array.values()
, as described above: this operation leverages a contiguous memory region. -
We leveraged normal rust iterators for the operation.
-
We used
op
on the array's values irrespectively of their validity, and cloned its validity. This approach is suitable for operations whose branching off is more expensive than operating over all values. If the operation is expensive, then usingPrimitiveArray::<O>::from_trusted_len_iter
is likely faster.
Clone on write semantics
We support the mutation of arrays in-place via clone-on-write semantics.
Essentially, all data is under an Arc
, but it can be taken via Arc::get_mut
and operated in place.
Below is a complete example of how to operate on a Box<dyn Array>
without
extra allocations.
// This example demos how to operate on arrays in-place.
use arrow2::array::{Array, PrimitiveArray};
use arrow2::compute::arity_assign;
fn main() {
// say we have have received an `Array`
let mut array: Box<dyn Array> = PrimitiveArray::from_vec(vec![1i32, 2]).boxed();
// we can apply a transformation to its values without allocating a new array as follows:
// 1. downcast it to the correct type (known via `array.data_type().to_physical_type()`)
let array = array
.as_any_mut()
.downcast_mut::<PrimitiveArray<i32>>()
.unwrap();
// 2. call `unary` with the function to apply to each value
arity_assign::unary(array, |x| x * 10);
// confirm that it gives the right result :)
assert_eq!(array, &PrimitiveArray::from_vec(vec![10i32, 20]));
// alternatively, you can use `get_mut_values`. Unwrap works because it is single owned
let values = array.get_mut_values().unwrap();
values[0] = 0;
assert_eq!(array, &PrimitiveArray::from_vec(vec![0, 20]));
// you can also modify the validity:
array.set_validity(Some([true, false].into()));
array.apply_validity(|bitmap| {
let mut mut_bitmap = bitmap.into_mut().right().unwrap();
mut_bitmap.set(1, true);
mut_bitmap.into()
});
assert_eq!(array, &PrimitiveArray::from_vec(vec![0, 20]));
}