use eyros::{DB,Tree3,Coord,Scalar,Row,Setup,Error};
use random::{Source,default as rand};
use tempfile::Builder as Tmpfile;
use std::time;
use std::cmp::Ordering;
use async_std::prelude::*;
type P = (Coord<f32>,Coord<f32>,Coord<f32>);
type V = u32;
#[async_std::test]
async fn multi_batch() -> Result<(),Error> {
let dir = Tmpfile::new().prefix("eyros").tempdir()?;
let mut db: DB<_,Tree3<f32,f32,f32,V>,P,V> = Setup::from_path(dir.path())
.branch_factor(5)
.max_records(3_000)
.build()
.await?;
let mut r = rand().seed([13,12]);
let size = 1_000_000;
let inserts: Vec<Row<P,V>> = (0..size).map(|_| {
let xmin: f32 = r.read::<f32>()*2.0-1.0;
let xmax: f32 = xmin + r.read::<f32>().powf(64.0)*(1.0-xmin);
let ymin: f32 = r.read::<f32>()*2.0-1.0;
let ymax: f32 = ymin + r.read::<f32>().powf(64.0)*(1.0-ymin);
let time: f32 = r.read::<f32>()*1000.0;
let value: u32 = r.read();
let point = (
Coord::Interval(xmin,xmax),
Coord::Interval(ymin,ymax),
Coord::Scalar(time)
);
Row::Insert(point, value)
}).collect();
let mut count = 0u64;
let mut total = 0f64;
let n = 100;
let batches: Vec<Vec<Row<P,V>>> = (0..n).map(|i| {
inserts[size/n*i..size/n*(i+1)].to_vec()
}).collect();
for batch in batches {
let batch_start = time::Instant::now();
db.batch(&batch).await?;
let batch_elapsed = batch_start.elapsed().as_secs_f64();
count += batch.len() as u64;
total += batch_elapsed;
eprintln!["{}: batch for {} records in {} seconds",
count, batch.len(), batch_elapsed];
}
eprintln!["# wrote {} records in {} seconds\n# {} records / second",
count, total, (count as f64) / total];
{
let bbox = ((-1.0,-1.0,0.0),(1.0,1.0,1000.0));
let mut results = vec![];
let mut stream = db.query(&bbox).await?;
while let Some(result) = stream.next().await {
let r = result?;
results.push((r.0,r.1));
}
assert_eq!(results.len(), size, "incorrect length for full region");
let mut expected: Vec<(P,V)>
= inserts.iter().map(|r| {
match r {
Row::Insert(point,value) => (point.clone(),value.clone()),
_ => panic!["unexpected row type"]
}
}).collect();
results.sort_unstable_by(cmp);
expected.sort_unstable_by(cmp);
assert_eq!(results, expected, "incorrect results for full region");
}
{
let bbox = ((-0.8,0.1,0.0),(0.2,0.5,500.0));
let mut results = vec![];
let mut stream = db.query(&bbox).await?;
while let Some(result) = stream.next().await {
let r = result?;
results.push((r.0,r.1));
}
let mut expected: Vec<(P,V)> = inserts.iter()
.map(|r| {
match r {
Row::Insert(point,value) => (point.clone(),value.clone()),
_ => panic!["unexpected row type"]
}
})
.filter(|r| {
contains(&(bbox.0).0,&(bbox.1).0,&(r.0).0)
&& contains(&(bbox.0).1,&(bbox.1).1,&(r.0).1)
&& contains(&(bbox.0).2,&(bbox.1).2,&(r.0).2)
})
.collect();
results.sort_unstable_by(cmp);
expected.sort_unstable_by(cmp);
assert_eq!(results.len(), expected.len(),
"incorrect length for partial region");
assert_eq!(results, expected, "incorrect results for partial region");
}
Ok(())
}
fn cmp<T> (a: &T, b: &T) -> Ordering where T: PartialOrd {
match a.partial_cmp(b) {
Some(o) => o,
None => panic!["comparison failed"]
}
}
fn contains<T> (min: &T, max: &T, c: &Coord<T>) -> bool where T: Scalar {
match c {
Coord::Interval(x0,x1) => min <= x1 && x0 <= max,
Coord::Scalar(x) => min <= x && x <= max
}
}