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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
|
package tui
import "testing"
func TestFocusGroup_NextCyclesForward(t *testing.T) {
type tc struct {
numMembers int
nextCalls int
wantIndex int
}
tests := map[string]tc{
"next from first to second": {
numMembers: 3,
nextCalls: 1,
wantIndex: 1,
},
"next from second to third": {
numMembers: 3,
nextCalls: 2,
wantIndex: 2,
},
"next wraps to beginning": {
numMembers: 3,
nextCalls: 3,
wantIndex: 0,
},
"next wraps with two members": {
numMembers: 2,
nextCalls: 2,
wantIndex: 0,
},
"multiple full cycles": {
numMembers: 3,
nextCalls: 7,
wantIndex: 1,
},
}
for name, tt := range tests {
t.Run(name, func(t *testing.T) {
members := make([]*State[bool], tt.numMembers)
for i := range members {
s := NewState(false)
s.BindApp(testApp)
members[i] = s
}
fg, err := NewFocusGroup(members...)
if err != nil {
t.Fatalf("NewFocusGroup: %v", err)
}
for i := 0; i < tt.nextCalls; i++ {
fg.Next()
}
if fg.Current() != tt.wantIndex {
t.Errorf("Current() = %d, want %d", fg.Current(), tt.wantIndex)
}
})
}
}
func TestFocusGroup_PrevCyclesBackward(t *testing.T) {
type tc struct {
numMembers int
prevCalls int
wantIndex int
}
tests := map[string]tc{
"prev from first wraps to last": {
numMembers: 3,
prevCalls: 1,
wantIndex: 2,
},
"prev from last to second": {
numMembers: 3,
prevCalls: 2,
wantIndex: 1,
},
"prev full cycle": {
numMembers: 3,
prevCalls: 3,
wantIndex: 0,
},
"prev with two members": {
numMembers: 2,
prevCalls: 1,
wantIndex: 1,
},
}
for name, tt := range tests {
t.Run(name, func(t *testing.T) {
members := make([]*State[bool], tt.numMembers)
for i := range members {
s := NewState(false)
s.BindApp(testApp)
members[i] = s
}
fg, err := NewFocusGroup(members...)
if err != nil {
t.Fatalf("NewFocusGroup: %v", err)
}
for i := 0; i < tt.prevCalls; i++ {
fg.Prev()
}
if fg.Current() != tt.wantIndex {
t.Errorf("Current() = %d, want %d", fg.Current(), tt.wantIndex)
}
})
}
}
func TestFocusGroup_MutualExclusion(t *testing.T) {
m0 := NewState(false)
m0.BindApp(testApp)
m1 := NewState(false)
m1.BindApp(testApp)
m2 := NewState(false)
m2.BindApp(testApp)
fg, err := NewFocusGroup(m0, m1, m2)
if err != nil {
t.Fatalf("NewFocusGroup: %v", err)
}
assertMemberStates(t, "initial", []*State[bool]{m0, m1, m2}, 0)
fg.Next()
assertMemberStates(t, "after Next()", []*State[bool]{m0, m1, m2}, 1)
fg.Next()
assertMemberStates(t, "after 2x Next()", []*State[bool]{m0, m1, m2}, 2)
fg.Prev()
assertMemberStates(t, "after Prev()", []*State[bool]{m0, m1, m2}, 1)
}
func TestFocusGroup_InitialState(t *testing.T) {
m0 := NewState(false)
m1 := NewState(false)
m2 := NewState(false)
_, err := NewFocusGroup(m0, m1, m2)
if err != nil {
t.Fatalf("NewFocusGroup: %v", err)
}
if !m0.Get() {
t.Error("first member should be active after construction")
}
if m1.Get() {
t.Error("second member should be inactive after construction")
}
if m2.Get() {
t.Error("third member should be inactive after construction")
}
}
func TestFocusGroup_KeyMap(t *testing.T) {
m0 := NewState(false)
m1 := NewState(false)
fg, err := NewFocusGroup(m0, m1)
if err != nil {
t.Fatalf("NewFocusGroup: %v", err)
}
km := fg.KeyMap()
if km == nil {
t.Fatal("KeyMap() returned nil")
}
if len(km) != 2 {
t.Fatalf("KeyMap() returned %d bindings, want 2", len(km))
}
if km[0].Pattern.Key != KeyTab {
t.Errorf("first binding key = %v, want KeyTab", km[0].Pattern.Key)
}
if km[0].Pattern.ExcludeMods != ModCtrl|ModAlt|ModShift {
t.Errorf("first binding ExcludeMods = %v, want all", km[0].Pattern.ExcludeMods)
}
if km[0].Stop {
t.Error("Tab binding should be broadcast (Stop=false)")
}
if km[1].Pattern.Key != KeyTab {
t.Errorf("second binding key = %v, want KeyTab", km[1].Pattern.Key)
}
if km[1].Pattern.Mod != ModShift {
t.Errorf("second binding mod = %v, want ModShift", km[1].Pattern.Mod)
}
if km[1].Stop {
t.Error("Shift+Tab binding should be broadcast (Stop=false)")
}
}
func TestFocusGroup_KeyMapHandlersWork(t *testing.T) {
m0 := NewState(false)
m0.BindApp(testApp)
m1 := NewState(false)
m1.BindApp(testApp)
m2 := NewState(false)
m2.BindApp(testApp)
fg, err := NewFocusGroup(m0, m1, m2)
if err != nil {
t.Fatalf("NewFocusGroup: %v", err)
}
km := fg.KeyMap()
km[0].Handler(KeyEvent{Key: KeyTab})
assertMemberStates(t, "after Tab", []*State[bool]{m0, m1, m2}, 1)
km[1].Handler(KeyEvent{Key: KeyTab, Mod: ModShift})
assertMemberStates(t, "after Shift+Tab", []*State[bool]{m0, m1, m2}, 0)
}
func TestFocusGroup_ErrorWithFewerThanTwoMembers(t *testing.T) {
t.Run("zero members", func(t *testing.T) {
if _, err := NewFocusGroup(); err == nil {
t.Error("expected error with 0 members")
}
})
t.Run("one member", func(t *testing.T) {
if _, err := NewFocusGroup(NewState(false)); err == nil {
t.Error("expected error with 1 member")
}
})
}
func TestFocusGroup_ShiftTabDoesNotTriggerNext(t *testing.T) {
m0 := NewState(false)
m0.BindApp(testApp)
m1 := NewState(false)
m1.BindApp(testApp)
m2 := NewState(false)
m2.BindApp(testApp)
fg, err := NewFocusGroup(m0, m1, m2)
if err != nil {
t.Fatalf("NewFocusGroup: %v", err)
}
km := fg.KeyMap()
event := KeyEvent{Key: KeyTab, Mod: ModShift}
matched := 0
for _, binding := range km {
entry := dispatchEntry{pattern: binding.Pattern, handler: binding.Handler, stop: binding.Stop}
if entry.matches(event) {
entry.handler(event)
matched++
}
}
if matched != 1 {
t.Errorf("Shift+Tab matched %d bindings, want 1", matched)
}
assertMemberStates(t, "after Shift+Tab", []*State[bool]{m0, m1, m2}, 2)
}
func assertMemberStates(t *testing.T, context string, members []*State[bool], expectedActive int) {
t.Helper()
for i, m := range members {
if i == expectedActive {
if !m.Get() {
t.Errorf("%s: member[%d] should be active (true), got false", context, i)
}
} else {
if m.Get() {
t.Errorf("%s: member[%d] should be inactive (false), got true", context, i)
}
}
}
}
|