daqbuf/daqbuffer
0
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Find the next higher res binning

Browse Source
This commit is contained in:
Dominik Werder
2021-04-15 11:42:54 +02:00
parent 12fa9c2047
commit 50202c33c2
2 changed files with 80 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
netpod/src/lib.rs
View File

@@ -276,7 +276,7 @@ pub struct PreBinnedPatchRange {
impl PreBinnedPatchRange {
pub fn covering_range(range: NanoRange, min_bin_count: u64) -> Option<Self> {
pub fn covering_range(range: NanoRange, min_bin_count: u64, finer: u64) -> Option<Self> {
use timeunits::*;
assert!(min_bin_count >= 1);
assert!(min_bin_count <= 2000);
@@ -292,6 +292,7 @@ impl PreBinnedPatchRange {
DAY,
DAY * 4,
];
let mut found_count = 0;
let mut i1 = thresholds.len();
loop {
if i1 <= 0 {
@@ -302,25 +303,32 @@ impl PreBinnedPatchRange {
let t = thresholds[i1];
//info!("look at threshold {} bs {}", t, bs);
if t <= bs {
let bs = t;
let ts1 = range.beg / bs * bs;
let ts2 = (range.end + bs - 1) / bs * bs;
let count = range.delta() / bs;
let patch_t_len = if i1 >= thresholds.len() - 1 {
bs * 8
found_count += 1;
if found_count > finer {
let bs = t;
let ts1 = range.beg / bs * bs;
let ts2 = (range.end + bs - 1) / bs * bs;
let count = range.delta() / bs;
let patch_t_len = if i1 >= thresholds.len() - 1 {
bs * 8
}
else {
thresholds[i1 + 1] * 8
};
let offset = ts1 / bs;
break Some(Self {
grid_spec: PreBinnedPatchGridSpec {
bin_t_len: bs,
patch_t_len,
},
count,
offset,
});
}
else {
thresholds[i1 + 1] * 8
};
let offset = ts1 / bs;
break Some(Self {
grid_spec: PreBinnedPatchGridSpec {
bin_t_len: bs,
patch_t_len,
},
count,
offset,
});
}
}
else {
}
}
}