-
Notifications
You must be signed in to change notification settings - Fork 33
/
Copy pathkeyboard.c
269 lines (260 loc) · 7.46 KB
/
keyboard.c
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
#include <stdlib.h>
#include <ncurses.h>
#include <assert.h>
#include "keyboard.h"
#include "card.h"
#include "stack.h"
#include "game.h"
#include "cursor.h"
#include "gui.h"
#include "common.h"
static void handle_term_resize() {
clear();
refresh();
if (term_size_ok()) {
draw_deck(deck);
draw_cursor(cursor);
} else {
mvprintw(1, 1, SMALL_TERM_MSG);
}
}
/* FIXME: this function does not work on stacks with no marked cards.
* In that case it returns the stack's length. */
static int marked_cards_count(struct stack *stack) {
if (stack_length(stack) == 1) {
if (stack->card->frame->begin_y > MANEUVRE_BEGIN_Y) {
return(1);
}
} else if (stack_length(stack) > 1) {
for (int marked_cards_count = 0; stack; stack = stack->next) {
marked_cards_count++;
if (!stack->next || (stack->card->frame->begin_y - stack->next->card->frame->begin_y) > 1) {
return(marked_cards_count);
}
}
}
return(0);
}
static void unmark_cards(struct stack *stack) {
int _marked_cards_count = marked_cards_count(stack);
for (int i = 0; i < _marked_cards_count; stack = stack->next, i++) {
card_unmark(stack->card);
}
}
static void handle_card_movement(struct cursor *cursor) {
struct stack **origin = cursor_stack(cursor);
int key;
if (cursor_on_invalid_spot(cursor) || stack_empty(*origin)) {
return;
}
if (maneuvre_stack(*origin)) {
erase_stack(*origin);
card_mark((*origin)->card);
draw_stack(*origin);
cursor->y++;
}
erase_cursor(cursor);
cursor_mark(cursor);
draw_cursor(cursor);
for (;;) {
if ((key = getch()) == 'q' || key == 'Q') {
endwin();
game_end();
exit(0);
}
if (term_size_ok()) {
switch (key) {
case 'h':
case 'j':
case 'k':
case 'l':
case KEY_LEFT:
case KEY_DOWN:
case KEY_UP:
case KEY_RIGHT:
erase_cursor(cursor);
cursor_move(cursor, cursor_direction(key));
draw_cursor(cursor);
break;
case 'm':
if (origin == cursor_stack(cursor) && maneuvre_stack(*origin)) {
for (struct stack *i = *origin; i && i->next; i = i->next) {
if (i->next->card->face == EXPOSED &&
(i->card->frame->begin_y - i->next->card->frame->begin_y) > 1) {
erase_stack(*origin);
card_mark(i->next->card);
draw_stack(*origin);
break;
}
}
}
break;
case 'M':
if (origin == cursor_stack(cursor) && maneuvre_stack(*origin)) {
for (struct stack *i = *origin; i && i->next; i = i->next) {
if (i->next->card->face == EXPOSED &&
(i->card->frame->begin_y - i->next->card->frame->begin_y) > 1) {
erase_stack(*origin);
card_mark(i->next->card);
draw_stack(*origin);
}
}
}
break;
case 'n':
if (origin == cursor_stack(cursor) && maneuvre_stack(*origin)) {
for (struct stack *i = (*origin)->next; i; i = i->next) {
if (i->next) {
if ((i->card->frame->begin_y - i->next->card->frame->begin_y) > 1) {
erase_stack(*origin);
card_unmark(i->card);
draw_stack(*origin);
break;
}
} else {
if (i->card->frame->begin_y == (MANEUVRE_BEGIN_Y + 1)) {
erase_stack(*origin);
card_unmark(i->card);
draw_stack(*origin);
break;
}
}
}
}
break;
case 'N':
if (origin == cursor_stack(cursor) && maneuvre_stack(*origin)) {
erase_stack(*origin);
unmark_cards(*origin);
card_mark((*origin)->card);
draw_stack(*origin);
}
break;
case KEY_SPACEBAR:;
/* http://www.mail-archive.com/[email protected]/msg259382.html */
struct stack **destination = cursor_stack(cursor);
int _marked_cards_count = marked_cards_count(*origin);
if (maneuvre_stack(*origin) && _marked_cards_count > 0) {
erase_stack(*origin);
unmark_cards(*origin);
draw_stack(*origin);
}
if (destination) {
erase_stack(*origin);
erase_cursor(cursor);
if (_marked_cards_count > 1 &&
maneuvre_stack(*origin) &&
maneuvre_stack(*destination)) {
struct stack *block = *origin;
for (int i = 1; i < _marked_cards_count; block = block->next, i++)
;
if (valid_move(block, *destination)) {
move_block(origin, destination, _marked_cards_count);
}
} else {
if (valid_move(*origin, *destination)) {
if (maneuvre_stack(*destination)) {
cursor->y++;
}
move_card(origin, destination);
}
}
draw_stack(*origin);
draw_stack(*destination);
if (maneuvre_stack(*origin) && *origin == *destination) {
erase_cursor(cursor);
cursor->y--;
}
}
cursor_unmark(cursor);
draw_cursor(cursor);
return;
case KEY_ESCAPE:
if (cursor_stack(cursor) == origin && maneuvre_stack(*origin)) {
erase_cursor(cursor);
cursor->y--;
}
if (marked_cards_count(*origin) > 0 && maneuvre_stack(*origin)) {
erase_stack(*origin);
unmark_cards(*origin);
draw_stack(*origin);
}
if (cursor->marked) {
cursor_unmark(cursor);
draw_cursor(cursor);
}
return;
case KEY_RESIZE:
handle_term_resize();
break;
case 'q':
case 'Q':
endwin();
game_end();
exit(0);
}
} else if (key == KEY_RESIZE) {
handle_term_resize();
}
}
}
void keyboard_event(int key) {
if (key == 'q' || key == 'Q') {
endwin();
game_end();
exit(0);
}
if (term_size_ok()) {
switch (key) {
case 'h':
case 'j':
case 'k':
case 'l':
case KEY_LEFT:
case KEY_DOWN:
case KEY_UP:
case KEY_RIGHT:
erase_cursor(cursor);
cursor_move(cursor, cursor_direction(key));
draw_cursor(cursor);
break;
case KEY_SPACEBAR:
if (cursor_on_stock(cursor)) {
if (stack_empty(deck->stock)) {
if (game.passes_through_deck_left >= 1) {
while (!stack_empty(deck->waste_pile)) {
move_card(&(deck->waste_pile), &(deck->stock));
card_cover(deck->stock->card);
}
draw_stack(deck->stock);
draw_stack(deck->waste_pile);
}
} else {
move_card(&(deck->stock), &(deck->waste_pile));
if (stack_empty(deck->stock)) {
game.passes_through_deck_left--;
}
card_expose(deck->waste_pile->card);
erase_stack(deck->waste_pile);
draw_stack(deck->stock);
draw_stack(deck->waste_pile);
}
} else {
struct card *card;
if (cursor_stack(cursor) &&
(card = (*cursor_stack(cursor))->card)->face == COVERED) {
card_expose(card);
draw_card(card);
} else {
handle_card_movement(cursor);
}
}
break;
case KEY_RESIZE:
handle_term_resize();
break;
}
} else if (key == KEY_RESIZE) {
handle_term_resize();
}
}