## Coverage Report

#### Created: 2025-08-26 07:03

next uncovered line (L), next uncovered region (R), next uncovered branch (B)

    /Users/andrewlamb/Software/arrow-rs/arrow-data/src/equal/primitive.rs

    Line
    Count
    Source
    1
    // Licensed to the Apache Software Foundation (ASF) under one
    2
    // or more contributor license agreements.  See the NOTICE file
    3
    // distributed with this work for additional information
    4
    // regarding copyright ownership.  The ASF licenses this file
    5
    // to you under the Apache License, Version 2.0 (the
    6
    // "License"); you may not use this file except in compliance
    7
    // with the License.  You may obtain a copy of the License at
    8
    //
    9
    //   http://www.apache.org/licenses/LICENSE-2.0
    10
    //
    11
    // Unless required by applicable law or agreed to in writing,
    12
    // software distributed under the License is distributed on an
    13
    // "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
    14
    // KIND, either express or implied.  See the License for the
    15
    // specific language governing permissions and limitations
    16
    // under the License.
    17
    18
    use crate::bit_iterator::BitSliceIterator;
    19
    use crate::contains_nulls;
    20
    use std::mem::size_of;
    21
    22
    use crate::data::ArrayData;
    23
    24
    use super::utils::equal_len;
    25
    26
    pub(crate) const NULL_SLICES_SELECTIVITY_THRESHOLD: f64 = 0.4;
    27
    28
    358
    pub(super) fn primitive_equal<T>(
    29
    358
        lhs: &ArrayData,
    30
    358
        rhs: &ArrayData,
    31
    358
        lhs_start: usize,
    32
    358
        rhs_start: usize,
    33
    358
        len: usize,
    34
    358
    ) -> bool {
    35
    358
        let byte_width = size_of::<T>();
    36
    358
        let lhs_values = &lhs.buffers()[0].as_slice()[lhs.offset() * byte_width..];
    37
    358
        let rhs_values = &rhs.buffers()[0].as_slice()[rhs.offset() * byte_width..];
    38
    39
        // Only checking one null mask here because by the time the control flow reaches
    40
        // this point, the equality of the two masks would have already been verified.
    41
    358
        if !contains_nulls(lhs.nulls(), lhs_start, len) {
    42
            // without nulls, we just need to compare slices
    43
    331
            equal_len(
    44
    331
                lhs_values,
    45
    331
                rhs_values,
    46
    331
                lhs_start * byte_width,
    47
    331
                rhs_start * byte_width,
    48
    331
                len * byte_width,
    49
            )
    50
        } else {
    51
    27
            let selectivity_frac = lhs.null_count() as f64 / lhs.len() as f64;
    52
    53
    27
            if selectivity_frac >= NULL_SLICES_SELECTIVITY_THRESHOLD {
    54
                // get a ref of the null buffer bytes, to use in testing for nullness
    55
    19
                let lhs_nulls = lhs.nulls().unwrap();
    56
    19
                let rhs_nulls = rhs.nulls().unwrap();
    57
                // with nulls, we need to compare item by item whenever it is not null
    58
    27
                (0..len)19.all19(|i| {
    59
    27
                    let lhs_pos = lhs_start + i;
    60
    27
                    let rhs_pos = rhs_start + i;
    61
    27
                    let lhs_is_null = lhs_nulls.is_null(lhs_pos);
    62
    27
                    let rhs_is_null = rhs_nulls.is_null(rhs_pos);
    63
    64
    27
                    lhs_is_null
    65
    5
                        || (lhs_is_null == rhs_is_null)
    66
    5
                            && equal_len(
    67
    5
                                lhs_values,
    68
    5
                                rhs_values,
    69
    5
                                lhs_pos * byte_width,
    70
    5
                                rhs_pos * byte_width,
    71
    5
                                byte_width, // 1 * byte_width since we are comparing a single entry
    72
                            )
    73
    27
                })
    74
            } else {
    75
    8
                let lhs_nulls = lhs.nulls().unwrap();
    76
    8
                let lhs_slices_iter =
    77
    8
                    BitSliceIterator::new(lhs_nulls.validity(), lhs_start + lhs_nulls.offset(), len);
    78
    8
                let rhs_nulls = rhs.nulls().unwrap();
    79
    8
                let rhs_slices_iter =
    80
    8
                    BitSliceIterator::new(rhs_nulls.validity(), rhs_start + rhs_nulls.offset(), len);
    81
    82
    8
                lhs_slices_iter
    83
    8
                    .zip(rhs_slices_iter)
    84
    13
                    .all8(|((l_start, l_end), (r_start, r_end))| {
    85
    13
                        l_start == r_start
    86
    13
                            && l_end == r_end
    87
    13
                            && equal_len(
    88
    13
                                lhs_values,
    89
    13
                                rhs_values,
    90
    13
                                (lhs_start + l_start) * byte_width,
    91
    13
                                (rhs_start + r_start) * byte_width,
    92
    13
                                (l_end - l_start) * byte_width,
    93
                            )
    94
    13
                    })
    95
            }
    96
        }
    97
    358
    }