Skip to content

Commit

Permalink
split into two functions
Browse files Browse the repository at this point in the history
Signed-off-by: jayzhan211 <[email protected]>
  • Loading branch information
jayzhan211 committed Nov 23, 2023
1 parent 4f9968e commit 2ee3ed5
Show file tree
Hide file tree
Showing 2 changed files with 47 additions and 21 deletions.
58 changes: 47 additions & 11 deletions datafusion/common/src/scalar.rs
Original file line number Diff line number Diff line change
Expand Up @@ -317,29 +317,65 @@ impl PartialOrd for ScalarValue {
(FixedSizeBinary(_, _), _) => None,
(LargeBinary(v1), LargeBinary(v2)) => v1.partial_cmp(v2),
(LargeBinary(_), _) => None,
(List(list_arr1), List(list_arr2))
| (FixedSizeList(list_arr1), FixedSizeList(list_arr2)) => {
if list_arr1.data_type() == list_arr2.data_type() {
if list_arr1.len() != list_arr2.len() {
(List(arr1), List(arr2)) => {
if arr1.data_type() == arr2.data_type() {
if arr1.len() != arr2.len() {
return None;
}

// ScalarValue::List / ScalarValue::FixedSizeList should have only one list.
assert_eq!(arr1.len(), 1);
assert_eq!(arr2.len(), 1);

let list_arr1 = arr1.as_list::<i32>();
let list_arr2 = arr2.as_list::<i32>();

// Single child data
assert_eq!(list_arr1.len(), 1);
assert_eq!(list_arr2.len(), 1);

let arr1 = array_into_children_array_vec(list_arr1);
let arr2 = array_into_children_array_vec(list_arr2);
let arr1 = list_arr1.value(0);
let arr2 = list_arr2.value(0);

// Single child data
let lt_res = arrow::compute::kernels::cmp::lt(&arr1, &arr2).ok()?;
let eq_res = arrow::compute::kernels::cmp::eq(&arr1, &arr2).ok()?;

for j in 0..lt_res.len() {
if lt_res.is_valid(j) && lt_res.value(j) {
return Some(Ordering::Less);
}
if eq_res.is_valid(j) && !eq_res.value(j) {
return Some(Ordering::Greater);
}
}

Some(Ordering::Equal)
} else {
None
}
}
(FixedSizeList(arr1), FixedSizeList(arr2)) => {
if arr1.data_type() == arr2.data_type() {
if arr1.len() != arr2.len() {
return None;
}

// ScalarValue::List / ScalarValue::FixedSizeList should have only one list.
assert_eq!(arr1.len(), 1);
assert_eq!(arr2.len(), 1);

let arr1 = &arr1[0];
let arr2 = &arr2[0];
let list_arr1 = arr1.as_fixed_size_list();
let list_arr2 = arr2.as_fixed_size_list();

// Single child data
assert_eq!(list_arr1.len(), 1);
assert_eq!(list_arr2.len(), 1);

let arr1 = list_arr1.value(0);
let arr2 = list_arr2.value(0);

let lt_res = arrow::compute::kernels::cmp::lt(arr1, arr2).ok()?;
let eq_res = arrow::compute::kernels::cmp::eq(arr1, arr2).ok()?;
let lt_res = arrow::compute::kernels::cmp::lt(&arr1, &arr2).ok()?;
let eq_res = arrow::compute::kernels::cmp::eq(&arr1, &arr2).ok()?;

for j in 0..lt_res.len() {
if lt_res.is_valid(j) && lt_res.value(j) {
Expand Down
10 changes: 0 additions & 10 deletions datafusion/common/src/utils.rs
Original file line number Diff line number Diff line change
Expand Up @@ -402,16 +402,6 @@ pub fn arrays_into_list_array(
))
}

/// Get the child arrays from a `ArrayRef`.
pub fn array_into_children_array_vec(list_arr: &ArrayRef) -> Vec<ArrayRef> {
let data = list_arr.to_data();
let children = data.child_data();
children
.iter()
.map(|x| arrow_array::make_array(x.to_owned()))
.collect::<Vec<_>>()
}

/// An extension trait for smart pointers. Provides an interface to get a
/// raw pointer to the data (with metadata stripped away).
///
Expand Down

0 comments on commit 2ee3ed5

Please sign in to comment.