Files
2026-08-01 16:11:49 +03:00

131 lines
4.0 KiB
Rust

// 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.
#[macro_use]
extern crate criterion;
use criterion::Criterion;
use std::sync::Arc;
extern crate arrow;
use arrow::compute::kernels::sort::{SortColumn, lexsort};
use arrow::util::bench_util::*;
use arrow::{
array::*,
datatypes::{Float64Type, UInt8Type},
};
use arrow_ord::partition::partition;
use rand::distr::{Distribution, StandardUniform};
use std::hint;
fn create_array<T: ArrowPrimitiveType>(size: usize, with_nulls: bool) -> ArrayRef
where
StandardUniform: Distribution<T::Native>,
{
let null_density = if with_nulls { 0.5 } else { 0.0 };
let array = create_primitive_array::<T>(size, null_density);
Arc::new(array)
}
fn bench_partition(sorted_columns: &[ArrayRef]) {
hint::black_box(partition(sorted_columns).unwrap().ranges());
}
fn create_sorted_low_cardinality_data(length: usize) -> Vec<ArrayRef> {
let arr = Int64Array::from_iter_values(
std::iter::repeat_n(1, length / 4)
.chain(std::iter::repeat_n(2, length / 4))
.chain(std::iter::repeat_n(3, length / 4))
.chain(std::iter::repeat_n(4, length / 4)),
);
lexsort(
&[SortColumn {
values: Arc::new(arr),
options: None,
}],
None,
)
.unwrap()
}
fn create_sorted_float_data(pow: u32, with_nulls: bool) -> Vec<ArrayRef> {
lexsort(
&[
SortColumn {
values: create_array::<Float64Type>(2u64.pow(pow) as usize, with_nulls),
options: None,
},
SortColumn {
values: create_array::<Float64Type>(2u64.pow(pow) as usize, with_nulls),
options: None,
},
],
None,
)
.unwrap()
}
fn create_sorted_data(pow: u32, with_nulls: bool) -> Vec<ArrayRef> {
lexsort(
&[
SortColumn {
values: create_array::<UInt8Type>(2u64.pow(pow) as usize, with_nulls),
options: None,
},
SortColumn {
values: create_array::<UInt8Type>(2u64.pow(pow) as usize, with_nulls),
options: None,
},
],
None,
)
.unwrap()
}
fn add_benchmark(c: &mut Criterion) {
let sorted_columns = create_sorted_data(10, false);
c.bench_function("partition(u8) 2^10", |b| {
b.iter(|| bench_partition(&sorted_columns))
});
let sorted_columns = create_sorted_data(12, false);
c.bench_function("partition(u8) 2^12", |b| {
b.iter(|| bench_partition(&sorted_columns))
});
let sorted_columns = create_sorted_data(10, true);
c.bench_function("partition(u8) 2^10 with nulls", |b| {
b.iter(|| bench_partition(&sorted_columns))
});
let sorted_columns = create_sorted_data(12, true);
c.bench_function("partition(u8) 2^12 with nulls", |b| {
b.iter(|| bench_partition(&sorted_columns))
});
let sorted_columns = create_sorted_float_data(10, false);
c.bench_function("partition(f64) 2^10", |b| {
b.iter(|| bench_partition(&sorted_columns))
});
let sorted_columns = create_sorted_low_cardinality_data(1024);
c.bench_function("partition(low cardinality) 1024", |b| {
b.iter(|| bench_partition(&sorted_columns))
});
}
criterion_group!(benches, add_benchmark);
criterion_main!(benches);