1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
use std::collections::{VecDeque,BinaryHeap};
pub trait Seq<T> where Self:Sized {
fn fun<'a>(&'a self) -> Box<Fn(usize) -> Option<&'a T> + 'a>;
fn inc(self, i:T) -> Self;
fn dec(self) -> Self;
fn plus<I>(self, coll:I) -> Self where I:IntoIterator<Item = T>
{coll.into_iter().fold(self, Seq::inc)}
fn zero(self) -> Self;
fn shrink(self) -> Self;
}
impl<T> Seq<T> for Vec<T> {
fn fun<'a>(&'a self) -> Box<Fn(usize) -> Option<&'a T> + 'a>
{Box::new(move |i| self.get(i))}
fn inc(mut self, i:T) -> Self
{self.push(i); self}
fn dec(mut self) -> Self
{self.pop(); self}
fn zero(mut self) -> Self
{self.clear(); self}
fn shrink(mut self) -> Self
{self.shrink_to_fit(); self}
}
impl<T> Seq<T> for VecDeque<T> {
fn fun<'a>(&'a self) -> Box<Fn(usize) -> Option<&'a T> + 'a>
{Box::new(move |i| self.get(i))}
fn inc(mut self, i:T) -> Self
{self.push_back(i); self}
fn dec(mut self) -> Self
{self.pop_front(); self}
fn zero(mut self) -> Self
{self.clear(); self}
fn shrink(mut self) -> Self
{self.shrink_to_fit(); self}
}
impl<T> Seq<T> for BinaryHeap<T> where T:Ord {
fn fun<'a>(&'a self) -> Box<Fn(usize) -> Option<&'a T> + 'a>
{Box::new(move |i| self.iter().skip(i).next())}
fn inc(mut self, i:T) -> Self
{self.push(i); self}
fn dec(mut self) -> Self
{self.pop(); self}
fn zero(mut self) -> Self
{self.clear(); self}
fn shrink(mut self) -> Self
{self.shrink_to_fit(); self}
}