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
use smallvec::SmallVec;
use crate::data_structures::BitIter;
use crate::graph::*;
fn mkname(name: String) -> String {
format!("WI:{}", name)
}
pub struct WordInput {
levers: Vec<LeverHandle>,
}
impl WordInput {
pub fn new<S: Into<String>>(g: &mut GateGraphBuilder, width: usize, name: S) -> Self {
let name = mkname(name.into());
Self {
levers: (0..width).map(|_| g.lever(name.clone())).collect(),
}
}
pub fn update_bit(&self, g: &mut InitializedGateGraph, bit: usize, value: bool) -> Option<()> {
let lever = self.levers.get(bit)?;
g.update_lever(*lever, value);
Some(())
}
pub fn flip_bit(&self, g: &mut InitializedGateGraph, bit: usize) -> Option<()> {
let lever = self.levers.get(bit)?;
g.flip_lever(*lever);
Some(())
}
pub fn set_bit(&self, g: &mut InitializedGateGraph, bit: usize) -> Option<()> {
self.update_bit(g, bit, true)
}
pub fn reset_bit(&self, g: &mut InitializedGateGraph, bit: usize) -> Option<()> {
self.update_bit(g, bit, true)
}
pub fn set_to<T: Copy + Sized + 'static>(&self, g: &mut InitializedGateGraph, value: T) {
g.update_levers(&self.levers, BitIter::new(value));
}
pub fn set(&self, g: &mut InitializedGateGraph) {
g.update_levers(&self.levers, (0..self.levers.len()).map(|_| false));
}
pub fn reset(&self, g: &mut InitializedGateGraph) {
g.update_levers(&self.levers, (0..self.levers.len()).map(|_| false));
}
pub fn bits(&self) -> SmallVec<[GateIndex; 8]> {
self.levers.iter().map(|lever| lever.bit()).collect()
}
pub fn len(&self) -> usize {
self.levers.len()
}
pub fn is_empty(&self) -> bool {
self.levers.len() == 0
}
}