forked from apache/arrow-rs
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Implement ArrayEqual for UnionArray (apache#1469)
* init * more * Remove dense/sparse case * Fix clippy * For review * For review
- Loading branch information
Showing
4 changed files
with
281 additions
and
8 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,130 @@ | ||
| // Licensed to the Apache Software Foundation (ASF) under one | ||
| // or more contributor license agreements. See the NOTICE file | ||
| // distributed with this work for additional information | ||
| // regarding copyright ownership. The ASF licenses this file | ||
| // to you under the Apache License, Version 2.0 (the | ||
| // "License"); you may not use this file except in compliance | ||
| // with the License. You may obtain a copy of the License at | ||
| // | ||
| // http://www.apache.org/licenses/LICENSE-2.0 | ||
| // | ||
| // Unless required by applicable law or agreed to in writing, | ||
| // software distributed under the License is distributed on an | ||
| // "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY | ||
| // KIND, either express or implied. See the License for the | ||
| // specific language governing permissions and limitations | ||
| // under the License. | ||
|
|
||
| use crate::{ | ||
| array::ArrayData, buffer::Buffer, datatypes::DataType, datatypes::UnionMode, | ||
| }; | ||
|
|
||
| use super::{ | ||
| equal_range, equal_values, utils::child_logical_null_buffer, utils::equal_nulls, | ||
| }; | ||
|
|
||
| fn equal_dense( | ||
| lhs: &ArrayData, | ||
| rhs: &ArrayData, | ||
| lhs_type_ids: &[i8], | ||
| rhs_type_ids: &[i8], | ||
| lhs_offsets: &[i32], | ||
| rhs_offsets: &[i32], | ||
| ) -> bool { | ||
| let offsets = lhs_offsets.iter().zip(rhs_offsets.iter()); | ||
|
|
||
| lhs_type_ids | ||
| .iter() | ||
| .zip(rhs_type_ids.iter()) | ||
| .zip(offsets) | ||
| .all(|((l_type_id, r_type_id), (l_offset, r_offset))| { | ||
| let lhs_values = &lhs.child_data()[*l_type_id as usize]; | ||
| let rhs_values = &rhs.child_data()[*r_type_id as usize]; | ||
|
|
||
| equal_values( | ||
| lhs_values, | ||
| rhs_values, | ||
| None, | ||
| None, | ||
| *l_offset as usize, | ||
| *r_offset as usize, | ||
| 1, | ||
| ) | ||
| }) | ||
| } | ||
|
|
||
| fn equal_sparse( | ||
| lhs: &ArrayData, | ||
| rhs: &ArrayData, | ||
| lhs_nulls: Option<&Buffer>, | ||
| rhs_nulls: Option<&Buffer>, | ||
| lhs_start: usize, | ||
| rhs_start: usize, | ||
| len: usize, | ||
| ) -> bool { | ||
| lhs.child_data() | ||
| .iter() | ||
| .zip(rhs.child_data()) | ||
| .all(|(lhs_values, rhs_values)| { | ||
| // merge the null data | ||
| let lhs_merged_nulls = child_logical_null_buffer(lhs, lhs_nulls, lhs_values); | ||
| let rhs_merged_nulls = child_logical_null_buffer(rhs, rhs_nulls, rhs_values); | ||
| equal_range( | ||
| lhs_values, | ||
| rhs_values, | ||
| lhs_merged_nulls.as_ref(), | ||
| rhs_merged_nulls.as_ref(), | ||
| lhs_start, | ||
| rhs_start, | ||
| len, | ||
| ) | ||
| }) | ||
| } | ||
|
|
||
| pub(super) fn union_equal( | ||
| lhs: &ArrayData, | ||
| rhs: &ArrayData, | ||
| lhs_nulls: Option<&Buffer>, | ||
| rhs_nulls: Option<&Buffer>, | ||
| lhs_start: usize, | ||
| rhs_start: usize, | ||
| len: usize, | ||
| ) -> bool { | ||
| let lhs_type_ids = lhs.buffer::<i8>(0); | ||
| let rhs_type_ids = rhs.buffer::<i8>(0); | ||
|
|
||
| let lhs_type_id_range = &lhs_type_ids[lhs_start..lhs_start + len]; | ||
| let rhs_type_id_range = &rhs_type_ids[rhs_start..rhs_start + len]; | ||
|
|
||
| match (lhs.data_type(), rhs.data_type()) { | ||
| (DataType::Union(_, UnionMode::Dense), DataType::Union(_, UnionMode::Dense)) => { | ||
| let lhs_offsets = lhs.buffer::<i32>(1); | ||
| let rhs_offsets = rhs.buffer::<i32>(1); | ||
|
|
||
| let lhs_offsets_range = &lhs_offsets[lhs_start..lhs_start + len]; | ||
| let rhs_offsets_range = &rhs_offsets[rhs_start..rhs_start + len]; | ||
|
|
||
| // nullness is kept in the parent UnionArray, so we compare its nulls here | ||
| lhs_type_id_range == rhs_type_id_range | ||
| && equal_nulls(lhs, rhs, lhs_nulls, rhs_nulls, lhs_start, rhs_start, len) | ||
| && equal_dense( | ||
| lhs, | ||
| rhs, | ||
| lhs_type_id_range, | ||
| rhs_type_id_range, | ||
| lhs_offsets_range, | ||
| rhs_offsets_range, | ||
| ) | ||
| } | ||
| ( | ||
| DataType::Union(_, UnionMode::Sparse), | ||
| DataType::Union(_, UnionMode::Sparse), | ||
| ) => { | ||
| lhs_type_id_range == rhs_type_id_range | ||
| && equal_sparse(lhs, rhs, lhs_nulls, rhs_nulls, lhs_start, rhs_start, len) | ||
| } | ||
| _ => unimplemented!( | ||
| "Logical equality not yet implemented between dense and sparse union arrays" | ||
| ), | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters