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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
use bevy_utils::HashSet;
use std::hash::Hash;
#[allow(unused_imports)]
use bevy_ecs::schedule::State;
#[derive(Debug)]
pub struct Input<T> {
pressed: HashSet<T>,
just_pressed: HashSet<T>,
just_released: HashSet<T>,
}
impl<T> Default for Input<T> {
fn default() -> Self {
Self {
pressed: Default::default(),
just_pressed: Default::default(),
just_released: Default::default(),
}
}
}
impl<T> Input<T>
where
T: Copy + Eq + Hash,
{
pub fn press(&mut self, input: T) {
if !self.pressed(input) {
self.just_pressed.insert(input);
}
self.pressed.insert(input);
}
pub fn pressed(&self, input: T) -> bool {
self.pressed.contains(&input)
}
pub fn any_pressed(&self, inputs: impl IntoIterator<Item = T>) -> bool {
inputs.into_iter().any(|it| self.pressed(it))
}
pub fn release(&mut self, input: T) {
self.pressed.remove(&input);
self.just_released.insert(input);
}
pub fn just_pressed(&self, input: T) -> bool {
self.just_pressed.contains(&input)
}
pub fn any_just_pressed(&self, inputs: impl IntoIterator<Item = T>) -> bool {
inputs.into_iter().any(|it| self.just_pressed(it))
}
pub fn clear_just_pressed(&mut self, input: T) -> bool {
self.just_pressed.remove(&input)
}
pub fn just_released(&self, input: T) -> bool {
self.just_released.contains(&input)
}
pub fn any_just_released(&self, inputs: impl IntoIterator<Item = T>) -> bool {
inputs.into_iter().any(|it| self.just_released(it))
}
pub fn clear_just_released(&mut self, input: T) -> bool {
self.just_released.remove(&input)
}
pub fn reset(&mut self, input: T) {
self.pressed.remove(&input);
self.just_pressed.remove(&input);
self.just_released.remove(&input);
}
pub fn clear(&mut self) {
self.just_pressed.clear();
self.just_released.clear();
}
pub fn get_pressed(&self) -> impl ExactSizeIterator<Item = &T> {
self.pressed.iter()
}
pub fn get_just_pressed(&self) -> impl ExactSizeIterator<Item = &T> {
self.just_pressed.iter()
}
pub fn get_just_released(&self) -> impl ExactSizeIterator<Item = &T> {
self.just_released.iter()
}
}
#[cfg(test)]
mod test {
#[test]
fn input_test() {
use crate::Input;
#[derive(Copy, Clone, Eq, PartialEq, Hash)]
enum DummyInput {
Input1,
Input2,
}
let mut input = Input::default();
input.press(DummyInput::Input1);
input.press(DummyInput::Input2);
assert!(input.just_pressed(DummyInput::Input1));
assert!(input.just_pressed(DummyInput::Input2));
assert!(input.pressed(DummyInput::Input1));
assert!(input.pressed(DummyInput::Input2));
input.clear();
assert!(!input.just_pressed(DummyInput::Input1));
assert!(!input.just_pressed(DummyInput::Input2));
assert!(input.pressed(DummyInput::Input1));
assert!(input.pressed(DummyInput::Input2));
input.release(DummyInput::Input1);
input.release(DummyInput::Input2);
assert!(input.just_released(DummyInput::Input1));
assert!(input.just_released(DummyInput::Input2));
assert!(!input.pressed(DummyInput::Input1));
assert!(!input.pressed(DummyInput::Input2));
input.clear();
assert!(!input.just_released(DummyInput::Input1));
assert!(!input.just_released(DummyInput::Input2));
let mut input = Input::default();
input.press(DummyInput::Input1);
input.release(DummyInput::Input2);
input.reset(DummyInput::Input1);
input.reset(DummyInput::Input2);
assert!(!input.just_pressed(DummyInput::Input1));
assert!(!input.pressed(DummyInput::Input1));
assert!(!input.just_released(DummyInput::Input2));
}
}