vortex-array 0.54.0

Vortex in memory columnar data format
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

// SPDX-License-Identifier: Apache-2.0
// SPDX-FileCopyrightText: Copyright the Vortex contributors

use vortex_error::VortexResult;

use crate::arrays::{ChunkedArray, ChunkedVTable};
use crate::builders::{ArrayBuilder, BoolBuilder};
use crate::compute::{CompareKernel, CompareKernelAdapter, Operator, compare};
use crate::{Array, ArrayRef, register_kernel};

impl CompareKernel for ChunkedVTable {
    fn compare(
        &self,
        lhs: &ChunkedArray,
        rhs: &dyn Array,
        operator: Operator,
    ) -> VortexResult<Option<ArrayRef>> {
        let mut idx = 0;

        let mut bool_builder = BoolBuilder::with_capacity(
            // nullable <= non-nullable
            (lhs.dtype().is_nullable() || rhs.dtype().is_nullable()).into(),
            lhs.len(),
        );

        for chunk in lhs.non_empty_chunks() {
            let sliced = rhs.slice(idx..idx + chunk.len());
            let cmp_result = compare(chunk, &sliced, operator)?;

            bool_builder.extend_from_array(&cmp_result);
            idx += chunk.len();
        }

        Ok(Some(bool_builder.finish()))
    }
}

register_kernel!(CompareKernelAdapter(ChunkedVTable).lift());

#[cfg(test)]
mod tests {
    use vortex_buffer::Buffer;

    use super::*;
    use crate::IntoArray;

    #[test]
    fn empty_compare() {
        let base = Buffer::<u32>::empty().into_array();
        let chunked =
            ChunkedArray::try_new(vec![base.clone(), base.clone()], base.dtype().clone()).unwrap();
        let chunked_empty = ChunkedArray::try_new(vec![], base.dtype().clone()).unwrap();

        let r = compare(chunked.as_ref(), chunked_empty.as_ref(), Operator::Eq).unwrap();

        assert!(r.is_empty());
    }
}