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
#[derive(Debug)]
pub struct BitIteratorBE<Slice: AsRef<[u64]>> {
s: Slice,
n: usize,
}
impl<Slice: AsRef<[u64]>> BitIteratorBE<Slice> {
pub fn new(s: Slice) -> Self {
let n = s.as_ref().len() * 64;
BitIteratorBE { s, n }
}
pub fn without_leading_zeros(s: Slice) -> impl Iterator<Item = bool> {
Self::new(s).skip_while(|b| !b)
}
}
impl<Slice: AsRef<[u64]>> Iterator for BitIteratorBE<Slice> {
type Item = bool;
fn next(&mut self) -> Option<bool> {
if self.n == 0 {
None
} else {
self.n -= 1;
let part = self.n / 64;
let bit = self.n - (64 * part);
Some(self.s.as_ref()[part] & (1 << bit) > 0)
}
}
}
#[derive(Debug)]
pub struct BitIteratorLE<Slice: AsRef<[u64]>> {
s: Slice,
n: usize,
max_len: usize,
}
impl<Slice: AsRef<[u64]>> BitIteratorLE<Slice> {
pub fn new(s: Slice) -> Self {
let n = 0;
let max_len = s.as_ref().len() * 64;
BitIteratorLE { s, n, max_len }
}
pub fn without_trailing_zeros(s: Slice) -> impl Iterator<Item = bool> {
let mut first_trailing_zero = 0;
for (i, limb) in s.as_ref().iter().enumerate().rev() {
first_trailing_zero = i * 64 + (64 - limb.leading_zeros()) as usize;
if *limb != 0 {
break;
}
}
let mut iter = Self::new(s);
iter.max_len = first_trailing_zero;
iter
}
}
impl<Slice: AsRef<[u64]>> Iterator for BitIteratorLE<Slice> {
type Item = bool;
fn next(&mut self) -> Option<bool> {
if self.n == self.max_len {
None
} else {
let part = self.n / 64;
let bit = self.n - (64 * part);
self.n += 1;
Some(self.s.as_ref()[part] & (1 << bit) > 0)
}
}
}