Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Improve CKMS performance #21

Merged
merged 12 commits into from
Dec 11, 2017
Merged
Show file tree
Hide file tree
Changes from 10 commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 3 additions & 2 deletions Cargo.toml
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
[package]
name = "quantiles"
version = "0.6.3"
version = "0.7.0-pre"
authors = ["Brian L. Troutwine <[email protected]>"]

description = "a collection of approximate quantile algorithms"
Expand All @@ -15,7 +15,8 @@ keywords = ["statistics", "histogram", "quantiles", "percentiles", "approximatio
lto = true

[dev-dependencies]
quickcheck = "0.4"
criterion = "0.1"
quickcheck = "0.5"

[dependencies]
serde = { version = "1.0", optional = true }
Expand Down
90 changes: 46 additions & 44 deletions benches/ckms.rs
Original file line number Diff line number Diff line change
@@ -1,5 +1,6 @@
#![feature(test)]

extern crate criterion;
extern crate quantiles;
extern crate test;

Expand Down Expand Up @@ -29,69 +30,70 @@ mod ckms {
}

use quantiles::ckms::CKMS;
use test::Bencher;

macro_rules! generate_tests {
($t:ty, $fn:ident, $s:expr) => {
#[bench]
fn $fn(b: &mut Bencher) {
let mut xshft = Xorshift::new(1972);
b.iter(|| {
($t:ty, $fn:ident, $s:expr, $name:expr) => {
#[test]
fn $fn() {
Criterion::default().bench_function($name, |b| b.iter(|| {
let mut xshft = Xorshift::new(1972);
let mut ckms = CKMS::<$t>::new(0.001);
for _ in 0..$s {
let val = xshft.next_val();
ckms.insert(val as $t);
}
});
}));
}
}
}

macro_rules! generate_primed_tests {
($t:ty, $fn:ident, $s:expr) => {
#[bench]
fn $fn(b: &mut Bencher) {
let mut xshft = Xorshift::new(1972);
let mut ckms = CKMS::<$t>::new(0.001);
for _ in 0..1_000_000 {
let elem = xshft.next_val() as $t;
ckms.insert(elem);
}

b.iter(|| {
let elem = xshft.next_val() as $t;
ckms.insert(elem);
});
}
}
}
// macro_rules! generate_primed_tests {
// ($t:ty, $fn:ident, $s:expr, $name:expr) => {
// #[test]
// fn $fn() {
// let mut xshft = Xorshift::new(1972);
// let mut ckms = CKMS::<$t>::new(0.001);
// for _ in 0..1_000_000 {
// let elem = xshft.next_val() as $t;
// ckms.insert(elem);
// }

// Criterion::default().bench_function($name, |b| b.iter(|| {
// let elem = xshft.next_val() as $t;
// ckms.insert(elem);
// }));
// }
// }
// }

mod u16 {
use super::*;
use criterion::Criterion;

generate_tests!(u16, bench_insert_100, 100);
generate_tests!(u16, bench_insert_1000, 1000);
generate_tests!(u16, bench_insert_10000, 10_000);
generate_tests!(u16, bench_insert_65535, 65_535);
// generate_tests!(u16, bench_insert_100, 100, "bench_insert_100");
// generate_tests!(u16, bench_insert_1000, 1000, "bench_insert_1000");
// generate_tests!(u16, bench_insert_10000, 10_000, "bench_insert_10000");
generate_tests!(u16, bench_insert_65535, 65_535, "bench_insert_65535");

generate_primed_tests!(u16, bench_primed_100, 100);
generate_primed_tests!(u16, bench_primed_1000, 1000);
generate_primed_tests!(u16, bench_primed_10000, 10_000);
generate_primed_tests!(u16, bench_primed_65535, 65_535);
// generate_primed_tests!(u16, bench_primed_100, 100, "bench_primed_100");
// generate_primed_tests!(u16, bench_primed_1000, 1000, "bench_primed_1000");
// generate_primed_tests!(u16, bench_primed_10000, 10_000, "bench_primed_10000");
// generate_primed_tests!(u16, bench_primed_65535, 65_535, "bench_primed_65535");
}

mod u32 {
use super::*;
// mod u32 {
// use super::*;
// use criterion::Criterion;

generate_tests!(u32, bench_insert_100, 100);
generate_tests!(u32, bench_insert_1000, 1000);
generate_tests!(u32, bench_insert_10000, 10_000);
generate_tests!(u32, bench_insert_100000, 100_000);
// generate_tests!(u32, bench_insert_100, 100, "bench_insert_100");
// generate_tests!(u32, bench_insert_1000, 1000, "bench_insert_1000");
// generate_tests!(u32, bench_insert_10000, 10_000, "bench_insert_10000");
// generate_tests!(u32, bench_insert_100000, 100_000, "bench_insert_100000");

generate_primed_tests!(u32, bench_primed_100, 100);
generate_primed_tests!(u32, bench_primed_1000, 1000);
generate_primed_tests!(u32, bench_primed_10000, 10_000);
generate_primed_tests!(u32, bench_primed_65535, 65_535);
}
// generate_primed_tests!(u32, bench_primed_100, 100, "bench_primed_100");
// generate_primed_tests!(u32, bench_primed_1000, 1000, "bench_primed_1000");
// generate_primed_tests!(u32, bench_primed_10000, 10_000, "bench_primed_10000");
// generate_primed_tests!(u32, bench_primed_65535, 65_535, "bench_primed_65535");
// }

}
32 changes: 32 additions & 0 deletions src/ckms/entry.rs
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
use std::cmp;

#[derive(Debug, Clone)]
#[cfg_attr(feature = "serde_support", derive(Serialize, Deserialize))]
pub struct Entry<T>
where
T: PartialEq,
{
pub g: u32,
pub delta: u32,
pub v: T,
}

// The derivation of PartialEq for Entry is not appropriate. The sole ordering
// value in an Entry is the value 'v'.
impl<T> PartialEq for Entry<T>
where
T: PartialEq,
{
fn eq(&self, other: &Entry<T>) -> bool {
self.v == other.v
}
}

impl<T> PartialOrd for Entry<T>
where
T: PartialOrd,
{
fn partial_cmp(&self, other: &Entry<T>) -> Option<cmp::Ordering> {
self.v.partial_cmp(&other.v)
}
}
Loading