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
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
|
/*
* ========================
* ===== ===============
* ====== ================
* ====== ================
* ====== ==== ==== ==
* ====== === == = =
* ====== === = == =
* = === === = == ====
* = === === = == = =
* == ===== ==== ==
* ========================
*
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2023-2024, Joe
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 3. Neither the name of the organization nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ''AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
* hardflip: src/i_events.go
* Mon Jan 15 11:40:10 2024
* Joe
*
* events in the code
*/
package main
import (
// "fmt"
"fmt"
"os"
"github.com/gdamore/tcell/v2"
"golang.org/x/term"
)
func i_list_follow_cursor(litems *ItemsList, ui *HardUI) {
if litems.draw_start == nil || litems.curr == nil {
return
}
virt_id := litems.curr.ID - (ui.dim[H] - 4) + 4
for litems.draw_start.ID < virt_id &&
litems.draw_start.next != nil {
litems.draw_start = litems.draw_start.next
}
for litems.draw_start.ID > litems.curr.ID - 4 &&
litems.draw_start.prev != nil {
litems.draw_start = litems.draw_start.prev
}
}
func i_set_unfold(data *HardData, item *ItemsNode) {
delete(data.folds, item.Dirs)
for ptr := data.litems.head; ptr.next != nil; ptr = ptr.next {
ptr.next.ID = ptr.ID + 1
}
}
func i_unfold_dir(data *HardData, item *ItemsNode) {
if item == nil || item.Dirs == nil {
return
}
fold := data.folds[item.Dirs]
if fold == nil {
return
}
// after := item.next
start, end := fold.head, fold.last
// last empty dir
if start == nil && end == nil {
i_set_unfold(data, item)
return
}
// single empty dir
if start == item && end == end {
i_set_unfold(data, item)
return
}
// item.next = fold.head
// if fold.head != nil {
// fold.head.prev = item
// }
// if fold.last != nil {
// fold.last.next = after
// }
// if after != nil {
// after.prev = fold.last
// } else {
// data.litems.last = fold.last
// }
}
func i_set_fold(data *HardData, curr, start, end *ItemsNode) {
folds := data.folds
tmp := ItemsList{
start,
end,
nil,
nil,
}
folds[curr.Dirs] = &tmp
for ptr := data.litems.head; ptr.next != nil; ptr = ptr.next {
ptr.next.ID = ptr.ID + 1
}
}
func i_fold_dir(data *HardData, item *ItemsNode) {
if item == nil || item.Dirs == nil {
return
}
// var start, end, after *ItemsNode
var start, end *ItemsNode
start = item.next
// last dir + empty
if start == nil {
i_set_fold(data, item, nil, nil)
return
}
// empty dir
if start.Dirs != nil && start.Dirs.Depth <= item.Dirs.Depth {
i_set_fold(data, item, item, item)
return
}
// non-empty dir
start.prev = nil
end = start
next_dir := item.get_next_level()
data.ui.s.Fini()
fmt.Println("qwe")
os.Exit(0)
// this is the end
if next_dir == nil {
return
}
// this is not the end
end = next_dir.prev
item.next = next_dir
i_set_fold(data, item, start, end)
// item.next = after
// if after != nil {
// after.prev = item
// } else {
// data.litems.last = item
// }
// folds := data.folds
// folded_start = item.next
// if folded_start != nil {
// folded_start.prev = nil
// folded_end = item
// } else {
// folded_end = nil
// }
// next_dir := item.Dirs.get_next_level(data.folds)
// ptr := item
// for next_dir != nil && ptr != nil && ptr.Dirs != next_dir {
// ptr = ptr.next
// }
// if ptr == item && ptr.next != nil {
// ptr = ptr.next
// // FIX: fix your crap
// }
// if ptr == nil {
// folded_end = nil
// after = nil
// data.ui.s.Fini()
// fmt.Println("ptr:", ptr)
// os.Exit(0)
// } else if ptr == item {
// folded_end = nil
// after = nil
// data.ui.s.Fini()
// fmt.Println("this is the end")
// os.Exit(0)
// } else {
// folded_end = ptr.prev
// // data.ui.s.Fini()
// // fmt.Println("ptr.Dirs.Name:", ptr.Host.Name, "\nfolded_end:", folded_end)
// // os.Exit(0)
// after = folded_end.next
// folded_end.next = nil
// }
// tmp := ItemsList{
// folded_start,
// folded_end,
// nil,
// nil,
// }
// item.next = after
// if after != nil {
// after.prev = item
// } else {
// data.litems.last = item
// }
}
func i_reload_data(data *HardData) {
data.data_dir = c_get_data_dir()
data.ldirs = c_load_data_dir(data.data_dir, data.opts)
data.litems = c_load_litems(data.ldirs)
data.ui.sel_max = data.litems.last.ID
}
func i_delete_dir(data *HardData) {
dir := data.litems.curr.Dirs
if dir == nil {
return
}
// dir_path := data.data_dir + dir.path()
// if err := os.RemoveAll(dir_path); err != nil {
// data.ui.s.Fini()
// c_die("can't remove " + dir_path, err)
// }
tmp := data.litems.curr.prev
// count := data.litems.curr.Dirs.count_elements(false, data.folds) + 1
count := 0
data.ldirs.del(data.litems.curr.Dirs)
for i := 0; data.litems.curr != nil && i < count; i++ {
data.litems.del(data.litems.curr)
data.litems.curr = data.litems.curr.next
}
if tmp == nil {
tmp = data.litems.head
}
data.litems.curr = tmp
if data.litems.last != nil {
data.ui.sel_max = data.litems.last.ID
} else {
data.ui.sel_max = 0
}
// TODO: delete folds map reference if folded
// TEST: single empty dir
// TEST: single non-empty dir
// TEST: first dir
// TEST: last dir
// TEST: last dir 4m+
// TEST: folded
}
func i_delete_host(data *HardData) {
if data.litems.curr == nil {
return
}
if data.litems.curr.is_dir() == true {
i_delete_dir(data)
return
}
host := data.litems.curr.Host
if host == nil {
return
}
file_path := data.data_dir + host.Parent.path() + host.Filename
if err := os.Remove(file_path); err != nil {
data.ui.s.Fini()
c_die("can't remove " + file_path, err)
}
tmp := data.litems.curr.prev
host.Parent.lhost.del(host)
data.litems.del(data.litems.curr)
if tmp == nil {
tmp = data.litems.head
}
data.litems.curr = tmp
if data.litems.last != nil {
data.ui.sel_max = data.litems.last.ID
} else {
data.ui.sel_max = 0
}
}
// screen events such as keypresses
func i_events(data *HardData) {
var err error
ui := &data.ui
event := ui.s.PollEvent()
switch event := event.(type) {
case *tcell.EventResize:
ui.dim[W], ui.dim[H], _ = term.GetSize(0)
i_list_follow_cursor(data.litems, ui)
ui.s.Sync()
case *tcell.EventKey:
switch ui.mode {
case NORMAL_MODE:
if event.Key() == tcell.KeyCtrlC ||
event.Rune() == 'q' {
ui.s.Fini()
os.Exit(0)
} else if event.Rune() == 'j' ||
event.Key() == tcell.KeyDown {
data.litems.inc(+1)
} else if event.Rune() == 'k' ||
event.Key() == tcell.KeyUp {
data.litems.inc(-1)
} else if event.Key() == tcell.KeyCtrlD {
data.litems.inc(+(ui.dim[H] / 3))
} else if event.Key() == tcell.KeyCtrlU {
data.litems.inc(-(ui.dim[H] / 3))
} else if event.Rune() == 'g' {
data.litems.curr = data.litems.head
data.litems.draw_start = data.litems.head
} else if event.Rune() == 'G' {
data.litems.curr = data.litems.last
} else if event.Rune() == 'D' &&
data.ldirs.head != nil &&
ui.sel_max != 0 {
ui.mode = DELETE_MODE
} else if event.Key() == tcell.KeyEnter {
if data.litems.curr == nil {
break
} else if data.litems.curr.is_dir() == false {
ui.s.Fini()
c_exec(data.litems.curr.Host)
if data.opts.Loop == false {
os.Exit(0)
} else {
if ui.s, err = tcell.NewScreen(); err != nil {
c_die("view", err)
}
if err := ui.s.Init(); err != nil {
c_die("view", err)
}
ui.s.SetStyle(ui.def_style)
}
} else if data.litems.curr.Dirs != nil &&
data.folds[data.litems.curr.Dirs] == nil {
i_fold_dir(data, data.litems.curr)
} else {
i_unfold_dir(data, data.litems.curr)
}
} else if event.Rune() == ' ' {
if data.litems.curr == nil ||
data.litems.curr.is_dir() == false {
break
}
if data.litems.curr.Dirs != nil &&
data.folds[data.litems.curr.Dirs] == nil {
i_fold_dir(data, data.litems.curr)
} else {
i_unfold_dir(data, data.litems.curr)
}
} else if event.Key() == tcell.KeyCtrlR {
i_reload_data(data)
}
i_list_follow_cursor(data.litems, ui)
case DELETE_MODE:
if event.Key() == tcell.KeyEscape ||
event.Key() == tcell.KeyCtrlC ||
event.Rune() == 'q' ||
event.Rune() == 'n' {
ui.mode = NORMAL_MODE
} else if event.Rune() == 'y' {
i_delete_host(data)
ui.mode = NORMAL_MODE
}
}
}
}
|