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
|
/* Copyright (C) 2000, 2001, 2002, 2003, 2004 Shawn Betts <sabetts@vcn.bc.ca>
*
* This file is part of ratpoison.
*
* ratpoison 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 2, or (at your option)
* any later version.
*
* ratpoison 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 this software; see the file COPYING. If not, write to
* the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
* Boston, MA 02111-1307 USA
*/
#include <string.h>
#include "ratpoison.h"
#include "completions.h"
rp_completions *
completions_new (completion_fn list_fn)
{
rp_completions *c;
c = (rp_completions *) xmalloc (sizeof(rp_completions));
INIT_LIST_HEAD (&c->completion_list);
c->complete_fn = list_fn;
c->last_match = NULL;
c->partial = NULL;
c->virgin = 1;
return c;
}
void
completions_free (rp_completions *c)
{
struct sbuf *cur;
struct list_head *tmp, *iter;
/* Clear our list */
list_for_each_safe_entry (cur, iter, tmp, &c->completion_list, node)
{
list_del (&cur->node);
sbuf_free (cur);
}
/* Free the partial string. */
free (c->partial);
free (c);
}
static void
completions_assign (rp_completions *c, struct list_head *new_list)
{
struct sbuf *cur;
struct list_head *tmp, *iter;
/* Clear our list */
list_for_each_safe_entry (cur, iter, tmp, &c->completion_list, node)
{
list_del (&cur->node);
sbuf_free (cur);
}
/* splice the list into completion_list. Note that we SHOULDN'T free
new_list, because they share the same memory. */
INIT_LIST_HEAD (&c->completion_list);
list_splice (new_list, &c->completion_list);
list_first (c->last_match, &c->completion_list, node);
}
static void
completions_update (rp_completions *c, char *partial)
{
struct list_head *new_list;
new_list = c->complete_fn (partial);
c->virgin = 0;
free (c->partial);
c->partial = xstrdup (partial);
completions_assign (c, new_list);
/* Free the head structure for our list. */
free (new_list);
}
static char *
completions_prev_match (rp_completions *c)
{
struct sbuf *cur;
/* search forward from our last match through the list looking for
another match. */
for (cur = list_prev_entry (c->last_match, &c->completion_list, node);
cur != c->last_match;
cur = list_prev_entry (cur, &c->completion_list, node))
{
if (str_comp (sbuf_get (cur), c->partial, strlen (c->partial)))
{
/* We found a match so update our last_match pointer and
return the string. */
c->last_match = cur;
return sbuf_get (cur);
}
}
return NULL;
}
static char *
completions_next_match (rp_completions *c)
{
struct sbuf *cur;
/* search forward from our last match through the list looking for
another match. */
for (cur = list_next_entry (c->last_match, &c->completion_list, node);
cur != c->last_match;
cur = list_next_entry (cur, &c->completion_list, node))
{
if (str_comp (sbuf_get (cur), c->partial, strlen (c->partial)))
{
/* We found a match so update our last_match pointer and
return the string. */
c->last_match = cur;
return sbuf_get (cur);
}
}
return NULL;
}
/* Return a completed string that starts with partial. */
char *
completions_complete (rp_completions *c, char *partial, int direction)
{
if (c->virgin)
{
completions_update (c, partial);
/* Since it's never been completed on and c->last_match points
to the first element of the list which may be a match. So
check it. FIXME: This is a bit of a hack. */
if (c->last_match == NULL)
return NULL;
/* c->last_match contains the first match in the forward
direction. So if we're looking for the previous match, then
check the previous element from last_match. */
if (direction == COMPLETION_PREVIOUS)
c->last_match = list_prev_entry (c->last_match, &c->completion_list, node);
/* Now check if last_match is a match for partial. */
if (str_comp (sbuf_get (c->last_match), c->partial, strlen (c->partial)))
return sbuf_get (c->last_match);
}
if (c->last_match == NULL)
return NULL;
/* Depending on the direction, find our "next" match. */
if (direction == COMPLETION_NEXT)
return completions_next_match (c);
/* Otherwise get the previous match */
return completions_prev_match (c);
}
|
