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
|
/* Aplwc - A Programming Language With Constraints
*
* Copyright (C) 2026 Peter Mikkelsen <petermikkelsen10@gmail.com>
*
* This file is part of aplwc.
*
* Aplwc is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Aplwc is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with aplwc. If not, see <https://www.gnu.org/licenses/>.
*/
#include <config.h>
#include <stdlib.h>
#include "readline.h"
static struct aplwc *aplwc;
static char **completions;
static int completion_index;
static char **complete(const char *, int, int);
static char *get_completion(const char *, int);
void
init_readline(struct aplwc *_aplwc)
{
aplwc = _aplwc;
rl_readline_name = "aplwc";
rl_attempted_completion_function = complete;
}
static char **
complete(const char *text, int start, int end)
{
rl_attempted_completion_over = 1;
completions = aplwc_autocomplete(aplwc, rl_line_buffer, start, end);
char **result = NULL;
if(completions)
result = rl_completion_matches(text, get_completion);
free(completions);
return result;
}
static char *
get_completion(const char *text, int state)
{
return completions[state];
}
|