use eyros::{Coord,Scalar,Row,Error}; use random::{Source,default as rand}; use tempfile::Builder as Tmpfile; use async_std::prelude::*; use std::cmp::Ordering; use std::time; type P = (Coord,Coord,Coord); type V = u32; #[async_std::test] async fn mega_batch() -> Result<(),Error> { let dir = Tmpfile::new().prefix("eyros").tempdir()?; let mut db = eyros::open_from_path3(dir.path()).await?; let mut r = rand().seed([13,12]); let size = 4_000_000; let inserts: Vec> = (0..size).map(|_| { let xmin: f32 = r.read::()*2.0-1.0; let xmax: f32 = xmin + r.read::().powf(64.0)*(1.0-xmin); let ymin: f32 = r.read::()*2.0-1.0; let ymax: f32 = ymin + r.read::().powf(64.0)*(1.0-ymin); let time: f32 = r.read::()*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 batch_size = 10_000; let n = size / batch_size; let batches: Vec>> = (0..n).map(|i| { inserts[i*batch_size..(i+1)*batch_size].to_vec() }).collect(); { let mut total = 0f64; for batch in batches { let start = time::Instant::now(); db.batch(&batch).await?; db.sync().await?; let elapsed = start.elapsed().as_secs_f64(); total += elapsed; eprintln!["batch write for {} records in {} seconds", batch.len(), elapsed]; } eprintln!["total batch time: {}\nwrote {} records per second", total, (size as f64)/total]; } { let bbox = ((-1.0,-1.0,0.0),(1.0,1.0,1000.0)); let mut results = vec![]; let start = time::Instant::now(); let mut stream = db.query(&bbox).await?; while let Some(result) = stream.next().await { let r = result?; results.push((r.0,r.1)); } eprintln!["query for {} records in {} seconds", results.len(), start.elapsed().as_secs_f64()]; 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 start = time::Instant::now(); let mut stream = db.query(&bbox).await?; while let Some(result) = stream.next().await { let r = result?; results.push((r.0,r.1)); } eprintln!["query for {} records in {} seconds", results.len(), start.elapsed().as_secs_f64()]; 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"); } { let bbox = ((-0.500,0.800,200.0),(-0.495,0.805,300.0)); let mut results = vec![]; let start = time::Instant::now(); let mut stream = db.query(&bbox).await?; while let Some(result) = stream.next().await { let r = result?; results.push((r.0,r.1)); } eprintln!["query for {} records in {} seconds", results.len(), start.elapsed().as_secs_f64()]; 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 small region"); assert_eq!(results, expected, "incorrect results for small region"); } Ok(()) } fn cmp (a: &T, b: &T) -> Ordering where T: PartialOrd { match a.partial_cmp(b) { Some(o) => o, None => panic!["comparison failed"] } } fn contains (min: &T, max: &T, c: &Coord) -> bool where T: Scalar { match c { Coord::Interval(x0,x1) => min <= x1 && x0 <= max, Coord::Scalar(x) => min <= x && x <= max } }