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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
use std::ops::Index;
use std::ops::Range;
pub struct Point<T> {
index: T,
size: usize,
}
impl<T: PartialEq + Clone> Point<T> {
pub fn new(index: T, size: usize) -> Self {
Self { index, size }
}
pub fn len(&self) -> usize {
self.size
}
pub fn is_full<L>(list: L) -> bool
where
L: IntoIterator<Item = T, IntoIter: ExactSizeIterator>,
{
let mut iter = list.into_iter();
assert!(
iter.len() >= 2,
"cannot determine link's pointless using only its identifier"
);
if let Some(first) = iter.next() {
iter.all(|item| item == first)
} else {
false
}
}
pub fn is_partial<L>(list: L) -> bool
where
L: IntoIterator<Item = T, IntoIter: ExactSizeIterator>,
{
let mut iter = list.into_iter();
assert!(
iter.len() >= 2,
"cannot determine link's pointless using only its identifier"
);
if let Some(first) = iter.next() {
iter.any(|item| item == first)
} else {
false
}
}
}
impl<T: PartialEq> Index<usize> for Point<T> {
type Output = T;
fn index(&self, index: usize) -> &Self::Output {
if index < self.size {
&self.index
} else {
panic!("TODO: POINT")
}
}
}
pub struct Iter<T: PartialEq + Copy> {
range: Range<usize>,
index: T,
}
impl<T: PartialEq + Copy> Iterator for Iter<T> {
type Item = T;
fn next(&mut self) -> Option<Self::Item> {
let next = self.range.next();
if next.is_some() {
Some(self.index)
} else {
None
}
}
}
impl<T: PartialEq + Copy> ExactSizeIterator for Iter<T> {
fn len(&self) -> usize {
self.range.end
}
}
impl<T: PartialEq + Copy> IntoIterator for Point<T> {
type Item = T;
type IntoIter = Iter<T>;
fn into_iter(self) -> Self::IntoIter {
Iter {
range: 0..self.len(),
index: self.index,
}
}
}