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

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

use vortex_error::VortexResult;

use crate::arrays::{ListViewArray, ListViewVTable};
use crate::compute::{IsConstantKernel, IsConstantKernelAdapter, IsConstantOpts};
use crate::register_kernel;

impl IsConstantKernel for ListViewVTable {
    fn is_constant(
        &self,
        array: &ListViewArray,
        opts: &IsConstantOpts,
    ) -> VortexResult<Option<bool>> {
        // At this point, we're guaranteed:
        // - Array has at least 2 elements
        // - All elements are valid (no nulls)

        // First check if all list sizes are constant.
        if !array.sizes().is_constant_opts(opts.cost) {
            return Ok(Some(false));
        }

        // If checking is too expensive, return None early.
        if opts.is_negligible_cost() {
            return Ok(None);
        }

        // Get the first scalar for comparison.
        debug_assert!(
            array.len() > 1,
            "precondition for `is_constant` is incorrect"
        );
        let first_scalar = array.scalar_at(0);

        // Compare all other scalars to the first.
        for i in 1..array.len() {
            if array.scalar_at(i) != first_scalar {
                return Ok(Some(false));
            }
        }

        Ok(Some(true))
    }
}

register_kernel!(IsConstantKernelAdapter(ListViewVTable).lift());