arrow 58.2.0

Rust implementation of Apache Arrow
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83

// 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 arrow::util::bench_util::create_boolean_array;

extern crate arrow;

use arrow::array::*;
use arrow::compute::kernels::boolean as boolean_kernels;
use std::hint;

fn bench_and(lhs: &BooleanArray, rhs: &BooleanArray) {
    hint::black_box(boolean_kernels::and(lhs, rhs).unwrap());
}

fn bench_or(lhs: &BooleanArray, rhs: &BooleanArray) {
    hint::black_box(boolean_kernels::or(lhs, rhs).unwrap());
}

fn bench_not(array: &BooleanArray) {
    hint::black_box(boolean_kernels::not(array).unwrap());
}

fn add_benchmark(c: &mut Criterion) {
    // allocate arrays of 32K elements
    let size = 2usize.pow(15);

    // Note we allocate all arrays before the benchmark to ensure the allocation of the arrays
    // is not affected by allocations that happen during the benchmarked operation.
    let array1 = create_boolean_array(size, 0.0, 0.5);
    let array2 = create_boolean_array(size, 0.0, 0.5);

    // Slice by 1 (not aligned to byte (8 bit) or word (64 bit) boundaries)
    let offset = 1;
    let array1_sliced_1 = array1.slice(offset, size - offset);
    let array2_sliced_1 = array2.slice(offset, size - offset);

    // Slice by 24 (aligned on byte (8 bit) but not word (64 bit) boundaries)
    let offset = 24;
    let array1_sliced_24 = array1.slice(offset, size - offset);
    let array2_sliced_24 = array2.slice(offset, size - offset);

    c.bench_function("and", |b| b.iter(|| bench_and(&array1, &array2)));
    c.bench_function("or", |b| b.iter(|| bench_or(&array1, &array2)));
    c.bench_function("not", |b| b.iter(|| bench_not(&array1)));

    c.bench_function("and_sliced_1", |b| {
        b.iter(|| bench_and(&array1_sliced_1, &array2_sliced_1))
    });
    c.bench_function("or_sliced_1", |b| {
        b.iter(|| bench_or(&array1_sliced_1, &array2_sliced_1))
    });
    c.bench_function("not_sliced_1", |b| b.iter(|| bench_not(&array1_sliced_1)));

    c.bench_function("and_sliced_24", |b| {
        b.iter(|| bench_and(&array1_sliced_24, &array2_sliced_24))
    });
    c.bench_function("or_sliced_24", |b| {
        b.iter(|| bench_or(&array1_sliced_24, &array2_sliced_24))
    });
    c.bench_function("not_slice_24", |b| b.iter(|| bench_not(&array1_sliced_24)));
}

criterion_group!(benches, add_benchmark);
criterion_main!(benches);