oss/lseq
1
1
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

feat: experiment with different implementations of LSEQ

Browse source
This commit is contained in:
nobody 2025-07-08 16:49:52 -07:00
commit 1e45ef9314
Signed by: GrocerPublishAgent
GPG key ID: D460CD54A9E3AB86
23 changed files with 3578 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

176
research/benches/lseq_benchmarks.rs Normal file
View file

@ -0,0 +1,176 @@
use criterion::{black_box, criterion_group, criterion_main, Criterion, BenchmarkId};
use peoplesgrocers_lseq_research::ReferenceLSEQ;
use peoplesgrocers_lseq::{SortKey, LSEQ};
use peoplesgrocers_lseq_research::algorithms::lseq_base64::{LSEQBase64, SortKeyBase64};
use rand::{Rng, rngs::StdRng, SeedableRng};
use std::collections::VecDeque;
fn benchmark_sequential_insertions(c: &mut Criterion) {
let mut group = c.benchmark_group("sequential_insertions");
for size in [100, 1000, 5000].iter() {
// Benchmark original paper reference implementation
group.bench_with_input(
BenchmarkId::new("original", size),
size,
|b, &size| {
b.iter(|| {
let mut lseq = ReferenceLSEQ::new(StdRng::seed_from_u64(42));
let mut keys = Vec::new();
for _ in 0..size {
let before = keys.last();
let key = lseq.allocate(before, None).unwrap();
keys.push(key);
}
black_box(keys);
});
},
);
// Benchmark published implementation
group.bench_with_input(
BenchmarkId::new("published", size),
size,
|b, &size| {
b.iter(|| {
let mut lseq = LSEQ::new(StdRng::seed_from_u64(42));
let mut keys = Vec::new();
for _ in 0..size {
let before = keys.last();
let key = lseq.alloc(before, None);
keys.push(key);
}
black_box(keys);
});
},
);
// Benchmark Base64 implementation
group.bench_with_input(
BenchmarkId::new("base64", size),
size,
|b, &size| {
b.iter(|| {
let mut lseq = LSEQBase64::new(StdRng::seed_from_u64(42));
let mut keys = Vec::new();
for _ in 0..size {
let before = keys.last();
let key = lseq.allocate(before, None).unwrap();
keys.push(key);
}
black_box(keys);
});
},
);
}
group.finish();
}
fn benchmark_random_insertions(c: &mut Criterion) {
let mut group = c.benchmark_group("random_insertions");
for size in [100, 1000, 5000].iter() {
// Benchmark original paper reference implementation
group.bench_with_input(
BenchmarkId::new("original", size),
size,
|b, &size| {
b.iter(|| {
let mut lseq = ReferenceLSEQ::new(StdRng::seed_from_u64(42));
let mut keys = Vec::new();
let mut rng = StdRng::seed_from_u64(123);
for _ in 0..size {
if keys.is_empty() {
let key = lseq.allocate(None, None).unwrap();
keys.push(key);
} else {
let idx = rng.gen_range(0..keys.len());
let before = if idx == 0 { None } else { Some(&keys[idx - 1]) };
let after = if idx == keys.len() { None } else { Some(&keys[idx]) };
let key = lseq.allocate(before, after).unwrap();
keys.insert(idx, key);
}
}
black_box(keys);
});
},
);
// Benchmark published implementation
group.bench_with_input(
BenchmarkId::new("published", size),
size,
|b, &size| {
b.iter(|| {
let mut lseq = LSEQ::new(StdRng::seed_from_u64(42));
let mut keys = Vec::new();
let mut rng = StdRng::seed_from_u64(123);
for _ in 0..size {
if keys.is_empty() {
let key = lseq.alloc(None, None);
keys.push(key);
} else {
let idx = rng.gen_range(0..keys.len());
let before = if idx == 0 { None } else { Some(&keys[idx - 1]) };
let after = if idx == keys.len() { None } else { Some(&keys[idx]) };
let key = lseq.alloc(before, after);
keys.insert(idx, key);
}
}
black_box(keys);
});
},
);
// Benchmark Base64 implementation
group.bench_with_input(
BenchmarkId::new("base64", size),
size,
|b, &size| {
b.iter(|| {
let mut lseq = LSEQBase64::new(StdRng::seed_from_u64(42));
let mut keys = Vec::new();
let mut rng = StdRng::seed_from_u64(123);
for _ in 0..size {
if keys.is_empty() {
let key = lseq.allocate(None, None).unwrap();
keys.push(key);
} else {
let idx = rng.gen_range(0..keys.len());
let before = if idx == 0 { None } else { Some(&keys[idx - 1]) };
let after = if idx == keys.len() { None } else { Some(&keys[idx]) };
let key = lseq.allocate(before, after).unwrap();
keys.insert(idx, key);
}
}
black_box(keys);
});
},
);
}
group.finish();
}
criterion_group!(
benches,
benchmark_sequential_insertions,
benchmark_random_insertions,
);
criterion_main!(benches);