blob: 0ac00a7657698436885ee2798f55cca499409fdf (
plain)
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
|
#include <atari.h>
#include <string.h>
#include <ctype.h>
#include "addrs.h"
#include "edbox.h"
#include "screen.h"
#include "irc.h"
#define COMP_S1 1
#define COMP_PM 2
#define COMP_CHAN 3
#define MAX_PM_NICKS 10
static char search_pos = 0, in_progress = 0;
static char prefix[33];
char comp_pm_nicks[MAX_PM_NICKS][25];
char (*list)[25] = comp_pm_nicks;
static char pm_nick_pos = 0; /* insertion point for _add() */
void comp_add_pm_nick(const char *n) {
int i;
for(i = 0; i < 25; i++)
if(strncmp(n, comp_pm_nicks[i], 24) == 0)
return;
strncpy(comp_pm_nicks[pm_nick_pos], n, 24);
pm_nick_pos++;
pm_nick_pos %= MAX_PM_NICKS;
}
char match(const char *p, const char *q) {
int len;
len = strlen(prefix);
if(!len) return 0;
while(len--) {
if(tolower(*p) != tolower(*q))
return 0;
p++, q++;
}
return 1;
}
void comp_complete_done(void) {
in_progress = 0;
}
void comp_continue(void) {
search_pos %= MAX_PM_NICKS;
while(search_pos < MAX_PM_NICKS) {
if(match(prefix, list[search_pos])) {
edbox_set(list[search_pos]);
search_pos++;
return;
}
search_pos++;
}
edbox_set(prefix);
comp_complete_done();
}
void comp_start(void) {
if(scr_current != SCR_PRIV)
return;
/* just insert the last nick if there's nothing to search for */
if(!edbox_len) {
if(*last_pm_nick) edbox_set(last_pm_nick);
} else {
in_progress = COMP_PM;
search_pos = 0;
strncpy(prefix, edit_box, 24);
list = comp_pm_nicks;
comp_continue();
}
}
void comp_complete(void) {
if(in_progress)
comp_continue();
else
comp_start();
}
|
