aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorIgor Pashev <pashev.igor@gmail.com>2020-11-25 21:22:36 +0200
committerIgor Pashev <pashev.igor@gmail.com>2020-11-25 21:22:36 +0200
commit8540aba497bca062df8577f7755ea75b44e90e7b (patch)
tree42b85607ad594e1036c82c1d186bb490124d0eed
parentc68c5e52ea6eae851ef0804d66f847f75a1cd0d4 (diff)
downloadfrotate.rs-8540aba497bca062df8577f7755ea75b44e90e7b.tar.gz
Add initial partition_datetime()HEADmaster
-rw-r--r--src/partition.rs59
1 files changed, 37 insertions, 22 deletions
diff --git a/src/partition.rs b/src/partition.rs
index b2305a1..936b3c0 100644
--- a/src/partition.rs
+++ b/src/partition.rs
@@ -1,9 +1,7 @@
-extern crate chrono;
-
use std::collections::LinkedList;
use chrono::Duration;
-use chrono::NaiveDate;
+use chrono::{NaiveDate, NaiveDateTime};
#[cfg(test)]
mod tests {
@@ -43,7 +41,7 @@ mod tests {
list![9]
];
- assert_eq!(partition(&|_n| 1, ins[0], &ins), outs);
+ assert_eq!(partition(&|_n| 1, ins[0], ins.into_iter()), outs);
}
#[test]
@@ -51,7 +49,7 @@ mod tests {
let ins = vec![1, 2, 3, 4, 5, 6, 7, 8, 9];
let outs = list![list![1, 2], list![3, 4], list![5, 6], list![7, 8], list![9]];
- assert_eq!(partition(&|_n| 2, ins[0], &ins), outs);
+ assert_eq!(partition(&|_n| 2, ins[0], ins.into_iter()), outs);
}
#[test]
@@ -75,7 +73,7 @@ mod tests {
list![15]
];
- assert_eq!(partition(&|_n| 1, ins[0], &ins), outs);
+ assert_eq!(partition(&|_n| 1, ins[0], ins.into_iter()), outs);
}
#[test]
@@ -92,7 +90,7 @@ mod tests {
list![15]
];
- assert_eq!(partition(&|_n| 2, ins[0], &ins), outs);
+ assert_eq!(partition(&|_n| 2, ins[0], ins.into_iter()), outs);
}
fn exp2(n: u32) -> i64 {
@@ -110,7 +108,7 @@ mod tests {
list![8, 9, 10, 11, 12, 13]
];
- assert_eq!(partition(&exp2, ins[0], &ins), outs);
+ assert_eq!(partition(&exp2, ins[0], ins.into_iter()), outs);
}
#[test]
@@ -133,14 +131,16 @@ mod tests {
assert_eq!(partition_days(&exp2, &ins), outs);
}
}
-
-pub fn partition(f: &dyn Fn(u32) -> i64, v0: i64, v: &[i64]) -> LinkedList<LinkedList<i64>> {
+fn partition<I>(f: &dyn Fn(u32) -> i64, v0: i64, v: I) -> LinkedList<LinkedList<i64>>
+where
+ I: IntoIterator<Item = i64>,
+{
let mut term: LinkedList<i64> = LinkedList::new();
let mut res: LinkedList<LinkedList<i64>> = LinkedList::new();
let mut n: u32 = 1;
let mut a: i64 = v0;
- for &i in v.iter() {
+ for i in v {
while i >= a + f(n) {
res.push_back(term);
term = LinkedList::new();
@@ -159,21 +159,36 @@ pub fn partition_days(
days: &[NaiveDate],
) -> LinkedList<LinkedList<NaiveDate>> {
let day1 = days[0];
- let part;
+ let mut v: Vec<i64> = days.into_iter().map(|&d| (day1 - d).num_days()).collect();
+ v.sort_unstable();
+ v.dedup();
- {
- let mut v: Vec<i64> = Vec::with_capacity(days.len());
+ let part = partition(f, v[0], v);
- for &d in days.iter() {
- v.push((day1 - d).num_days());
- }
- v.sort_unstable();
- v.dedup();
+ part.into_iter()
+ .map(|l| l.into_iter().map(|d| day1 - Duration::days(d)).collect())
+ .collect()
+}
- part = partition(f, v[0], &v);
- }
+pub fn partition_datetime(
+ f: &dyn Fn(u32) -> i64,
+ start: NaiveDateTime,
+ datetimes: &[NaiveDateTime],
+) -> LinkedList<LinkedList<NaiveDateTime>> {
+ let mut v: Vec<i64> = datetimes
+ .into_iter()
+ .map(|&d| (start - d).num_seconds())
+ .collect();
+ v.sort_unstable();
+ v.dedup();
+
+ let part = partition(f, 0, v);
part.into_iter()
- .map(|l| l.into_iter().map(|d| day1 - Duration::days(d)).collect())
+ .map(|l| {
+ l.into_iter()
+ .map(|d| start - Duration::seconds(d))
+ .collect()
+ })
.collect()
}