int-interval-set 0.3.4

Integer half-open interval set structures built on top of int-interval.
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155

use criterion::{BenchmarkId, Criterion, Throughput, black_box, criterion_group, criterion_main};
use int_interval::I32CO;
use int_interval_set::I32COSet;
use range_collections::{RangeSet, RangeSet2};
use range_set_blaze::RangeSetBlaze;

type Bounds = (i32, i32);

const N: usize = 64;

/// Canonical left-hand set:
///
/// ```text
/// [0, 8), [16, 24), ..., [1008, 1016)
/// ```
fn lhs_bounds() -> Vec<Bounds> {
    (0..N)
        .map(|i| {
            let start = i as i32 * 16;
            (start, start + 8)
        })
        .collect()
}

/// Right-hand intervals lie in the gaps between left-hand intervals.
/// The result is identical to `lhs`, but both sets must be scanned.
fn interleaved_disjoint() -> Vec<Bounds> {
    (0..N)
        .map(|i| {
            let start = i as i32 * 16 + 10;
            (start, start + 4)
        })
        .collect()
}

/// Removing an equal set produces an empty result.
fn equal() -> Vec<Bounds> {
    lhs_bounds()
}

/// Removes the right half of each left-hand interval:
///
/// ```text
/// [0, 8) - [4, 12) = [0, 4)
/// ```
fn trim_right() -> Vec<Bounds> {
    (0..N)
        .map(|i| {
            let start = i as i32 * 16 + 4;
            (start, start + 8)
        })
        .collect()
}

/// Punches a hole inside every left-hand interval:
///
/// ```text
/// [0, 8) - [2, 6) = [0, 2), [6, 8)
/// ```
///
/// This doubles the output interval count.
fn punch_middle() -> Vec<Bounds> {
    (0..N)
        .map(|i| {
            let start = i as i32 * 16 + 2;
            (start, start + 4)
        })
        .collect()
}

#[inline]
fn int_interval_set(bounds: &[Bounds]) -> I32COSet {
    bounds
        .iter()
        .map(|&(start, end_excl)| I32CO::try_new(start, end_excl).unwrap())
        .collect()
}

#[inline]
fn range_set_blaze(bounds: &[Bounds]) -> RangeSetBlaze<i32> {
    bounds
        .iter()
        .map(|&(start, end_excl)| start..=(end_excl - 1))
        .collect()
}

#[inline]
fn range_collections(bounds: &[Bounds]) -> RangeSet2<i32> {
    let mut set = RangeSet2::empty();

    for &(start, end_excl) in bounds {
        set |= RangeSet::from(start..end_excl);
    }

    set
}

fn bench_case(c: &mut Criterion, case: &str, rhs_bounds: &[Bounds]) {
    let lhs_bounds = lhs_bounds();

    let int_lhs = int_interval_set(&lhs_bounds);
    let int_rhs = int_interval_set(rhs_bounds);

    let blaze_lhs = range_set_blaze(&lhs_bounds);
    let blaze_rhs = range_set_blaze(rhs_bounds);

    let collections_lhs = range_collections(&lhs_bounds);
    let collections_rhs = range_collections(rhs_bounds);

    let mut group = c.benchmark_group("difference_with_set");

    group.throughput(Throughput::Elements(
        (lhs_bounds.len() + rhs_bounds.len()) as u64,
    ));

    group.bench_function(BenchmarkId::new("int_interval_set", case), |b| {
        b.iter(|| black_box(black_box(&int_lhs).difference_with_set(black_box(&int_rhs))));
    });

    group.bench_function(BenchmarkId::new("range_set_blaze", case), |b| {
        b.iter(|| black_box(black_box(&blaze_lhs) - black_box(&blaze_rhs)));
    });

    group.bench_function(BenchmarkId::new("range_collections", case), |b| {
        b.iter(|| {
            black_box(
                black_box(&collections_lhs).difference::<[i32; 2]>(black_box(&collections_rhs)),
            )
        });
    });

    group.finish();
}

fn bench_difference_with_set(c: &mut Criterion) {
    let interleaved_disjoint = interleaved_disjoint();
    let equal = equal();
    let trim_right = trim_right();
    let punch_middle = punch_middle();

    bench_case(c, "interleaved_disjoint_64", &interleaved_disjoint);
    bench_case(c, "equal_64", &equal);
    bench_case(c, "trim_right_64", &trim_right);
    bench_case(c, "punch_middle_64", &punch_middle);
}

mod support;

criterion_group! {
    name = benches;
    config = support::config();
    targets = bench_difference_with_set
}

criterion_main!(benches);