void request_move_inc_down(void) {
if (x == NAMES_PER_LINE(page) - 1) {
if (y == NAMES_PER_COL(page) - 1) request_move_to_eof();
else request_next_page();
}
else request_move_to_eol();
}
int request_strings(req_list *rlp0, int n) {
assert(rlp0->cur_entries > 0);
int ne_lines0 = 0, ne_columns0 = 0;
bool reordered = false;
max_names_per_line = max_names_per_col = x = y = page = fuzz_len = 0;
if ( ! request_strings_init(rlp0) ) return ERROR;
const int dx = rl.max_entry_len + 1 + (rl.suffix ? 1 : 0);
while(true) {
if (ne_lines0 != ne_lines || ne_columns0 != ne_columns) {
if (ne_lines0 && ne_columns0 ) n = PXY2N(page,x,y);
if (!(max_names_per_line = ne_columns / dx)) max_names_per_line = 1;
max_names_per_col = ne_lines - 1;
names_per_page = max_names_per_line * max_names_per_col;
ne_lines0 = ne_lines;
ne_columns0 = ne_columns;
page = N2P(n);
x = N2X(n);
y = N2Y(n);
print_strings();
print_message(NULL);
}
n = PXY2N(page,x,y);
assert(fuzz_len >= 0);
fuzz_len = min(fuzz_len, strlen(rl.entries[n]));
move_cursor(y, x * dx + fuzz_len);
int c;
input_class ic;
do c = get_key_code(); while((ic = CHAR_CLASS(c)) == IGNORE || ic == INVALID);
switch(ic) {
case ALPHA:
if (n >= rl.cur_entries) n = rl.cur_entries - 1;
c = localised_up_case[(unsigned char)c];
fuzz_forward( c );
break;
case TAB:
if (! rlp0->ignore_tab) {
n = request_strings_cleanup(reordered);
if (n >= rlp0->cur_entries) return ERROR;
else return -n - 2;
}
break;
case RETURN:
n = request_strings_cleanup(reordered);
if (n >= rlp0->cur_entries) return ERROR;
else return n;
case COMMAND:
if (c < 0) c = -c - 1;
const int a = parse_command_line(key_binding[c], NULL, NULL, false);
if (a >= 0) {
switch(a) {
case BACKSPACE_A:
fuzz_back();
break;
case MOVERIGHT_A:
request_move_right();
break;
case MOVELEFT_A:
request_move_left();
break;
case MOVESOL_A:
request_move_to_sol();
break;
case MOVEEOL_A:
request_move_to_eol();
break;
case TOGGLESEOL_A:
if (x != 0) x = 0;
else request_move_to_eol();
break;
case LINEUP_A:
request_move_up();
break;
case LINEDOWN_A:
request_move_down();
break;
case MOVEINCUP_A:
request_move_inc_up();
break;
case MOVEINCDOWN_A:
request_move_inc_down();
break;
case PAGEUP_A:
case PREVPAGE_A:
request_prev_page();
break;
case PAGEDOWN_A:
case NEXTPAGE_A:
request_next_page();
break;
case MOVESOF_A:
request_move_to_sof();
break;
case MOVEEOF_A:
request_move_to_eof();
break;
case TOGGLESEOF_A:
request_toggle_seof();
break;
case NEXTWORD_A:
request_move_next();
break;
case PREVWORD_A:
request_move_previous();
break;
case NEXTDOC_A:
reordered |= request_reorder(1);
break;
case PREVDOC_A:
reordered |= request_reorder(-1);
break;
case INSERT_A:
case DELETECHAR_A:
prune = !prune;
break;
case CLOSEDOC_A:
case ESCAPE_A:
case QUIT_A:
case SELECTDOC_A:
request_strings_cleanup(reordered);
return -1;
}
}
break;
default:
break;
}
}
}
static void request_toggle_seof(void) {
if (x + y+page == 0) request_move_to_eof();
else request_move_to_sof();
}
/* If mark_char is not '\0', we bold names ending with it. */
int request_strings(const char * const * const _entries, const int _num_entries, int n, const int _max_name_len, int _mark_char) {
action a;
input_class ic;
int c, i, ne_lines0, ne_columns0;
assert(_num_entries > 0);
ne_lines0 = ne_columns0 = max_names_per_line = max_names_per_col = x = y = page = 0;
entries = _entries;
num_entries = _num_entries;
max_name_len = _max_name_len + 1;
mark_char = _mark_char;
while(TRUE) {
if (ne_lines0 != ne_lines || ne_columns0 != ne_columns) {
if (ne_lines0 && ne_columns0 ) n = PXY2N(page,x,y);
if (!(max_names_per_line = ne_columns / (max_name_len))) max_names_per_line = 1;
max_names_per_col = ne_lines - 1;
names_per_page = max_names_per_line * max_names_per_col;
ne_lines0 = ne_lines;
ne_columns0 = ne_columns;
page = N2P(n);
x = N2X(n);
y = N2Y(n);
print_strings();
print_message(NULL);
}
move_cursor(y, x * max_name_len);
do c = get_key_code(); while((ic = CHAR_CLASS(c)) == IGNORE || ic == INVALID);
n = PXY2N(page,x,y);
switch(ic) {
case ALPHA:
if (n >= num_entries) n = num_entries - 1;
c = localised_up_case[(unsigned char)c];
for(i = 1; i < num_entries; i++)
if (localised_up_case[(unsigned char)entries[(n + i) % num_entries][0]] == c) {
normalize((n + i) % num_entries);
break;
}
break;
case TAB:
if (n >= num_entries) return ERROR;
else return -n - 2;
case RETURN:
if (n >= num_entries) return ERROR;
else return n;
case COMMAND:
if (c < 0) c = -c - 1;
if ((a = parse_command_line(key_binding[c], NULL, NULL, FALSE))>=0) {
switch(a) {
case MOVERIGHT_A:
request_move_right();
break;
case MOVELEFT_A:
request_move_left();
break;
case MOVESOL_A:
request_move_to_sol();
break;
case MOVEEOL_A:
request_move_to_eol();
break;
case TOGGLESEOL_A:
if (x != 0) x = 0;
else request_move_to_eol();
break;
case LINEUP_A:
request_move_up();
break;
case LINEDOWN_A:
request_move_down();
break;
case MOVEINCUP_A:
request_move_inc_up();
break;
case MOVEINCDOWN_A:
request_move_inc_down();
break;
case PAGEUP_A:
case PREVPAGE_A:
request_prev_page();
break;
case PAGEDOWN_A:
case NEXTPAGE_A:
request_next_page();
break;
case MOVESOF_A:
request_move_to_sof();
break;
case MOVEEOF_A:
request_move_to_eof();
break;
case TOGGLESEOF_A:
request_toggle_seof();
break;
case ESCAPE_A:
return -1;
}
}
break;
default:
break;
}
}
}