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
|
/******************************************************
*
* zexy - implementation file
*
* copyleft (c) IOhannes m zmölnig
*
* 1999:forum::für::umläute:2004
*
* institute of electronic music and acoustics (iem)
*
******************************************************
*
* license: GNU General Public License v.2
*
******************************************************/
/*
(c) 2005:forum::für::umläute:2000
"index" simulates an associative index :: that is : convert a symbol to an index
*/
#include "zexy.h"
#include <string.h>
#include <stdio.h>
#define MAXKEYLEN 16
/* ----------------------- index --------------------- */
static t_class *index_class;
typedef struct _index
{
t_object x_obj;
int entries, maxentries;
int auto_mode; /* 1--add if key doesn't already exist; 0--do not add; */
char **names;
} t_index;
static int find_last(char **names, int maxentries)
{ /* returns the index of the last entry (0..(maxentries-1)) */
while (maxentries--) if (names[maxentries]) return maxentries;
return 0;
}
static int find_item(const char *key, char **names, int maxentries)
{ /* returns index (0..[maxentries-1?]) on success; -1 if the item could not be found */
int i=-1;
int max = find_last(names, maxentries);
while (++i<=max)
if (names[i])
if (!strcmp(key, names[i])) return i;
return -1;
}
static int find_free(char **names, int maxentries)
{
int i=0;
while (i<maxentries) {
if (!names[i]) return i;
i++;
}
return -1;
}
static void index_float(t_index *x, t_float findex)
{
int iindex = (int)findex;
if ((iindex > 0) && (iindex <= x->maxentries) && (x->names[iindex-1]))
{
/* TB: output symbol to outlet */
t_symbol * s = gensym (x->names[iindex-1]);
outlet_symbol (x->x_obj.ob_outlet,s);
// post("iindex[%d] = %s", iindex, x->names[iindex-1]);
}
}
static void index_auto(t_index *x, t_float automod)
{
x->auto_mode = !(!automod);
}
static void index_add(t_index *x, t_symbol *s)
{
int newentry;
int ok = 0;
if (! (find_item(s->s_name, x->names, x->maxentries)+1) ) {
if ( x->entries < x->maxentries ) {
newentry=find_free(x->names, x->maxentries);
if (newentry + 1) {
char *buf = (char *)getbytes(sizeof(char) * MAXKEYLEN);
x->entries++;
strcpy(buf, s->s_name);
x->names[newentry]=buf;
ok=1;
outlet_float(x->x_obj.ob_outlet, (t_float)newentry+1);
} else post("index :: couldn't find any place for new entry");
} else post("index :: max number of elements (%d) reached !", x->maxentries);
} else post("index :: element already exists");
if (!ok) outlet_float(x->x_obj.ob_outlet, -1.f);
}
static void index_delete(t_index *x, t_symbol *s)
{
int element;
t_float r = -1.f;
if ( (element = find_item(s->s_name,x->names, x->maxentries))+1 ) {
freebytes(x->names[element], sizeof(char) * MAXKEYLEN);
x->names[element]=0;
r = 0.f;
x->entries--;
} else post("index :: couldn't find element");
outlet_float(x->x_obj.ob_outlet, r);
}
static void index_reset(t_index *x)
{
int i=x->maxentries;
while (i--)
if (x->names[i]) {
freebytes(x->names[i], sizeof(char) * MAXKEYLEN);
x->names[i]=0;
}
x->entries=0;
outlet_float(x->x_obj.ob_outlet, 0.f);
}
static void index_symbol(t_index *x, t_symbol *s)
{
int element;
if ( (element = find_item(s->s_name, x->names, x->maxentries)+1) )
outlet_float(x->x_obj.ob_outlet, (t_float)element);
else if (x->auto_mode)
index_add(x, s);
else outlet_float(x->x_obj.ob_outlet, 0.f);
}
static void *index_new(t_symbol *s, int argc, t_atom *argv)
{
t_index *x = (t_index *)pd_new(index_class);
char** buf;
int maxentries = 0, automod=0;
int i;
if (argc--) {
maxentries = (int)atom_getfloat(argv++);
if (argc) automod = (int)atom_getfloat(argv++);
}
if (!maxentries) maxentries=128;
buf = (char **)getbytes(sizeof(char *) * maxentries);
i = maxentries;
while (i--) buf[i]=0;
x->entries = 0;
x->maxentries = maxentries;
x->names = buf;
x->auto_mode = !(!automod);
outlet_new(&x->x_obj, &s_float);
return (x);
}
static void index_free(t_index *x)
{
index_reset(x);
freebytes(x->names, sizeof(char *) * x->maxentries);
}
static void helper(t_index *x)
{
post("\n%c index :: index symbols to indices", HEARTSYMBOL);
post("<symbol>\t : look up the <symbol> in the index and return it's index\n"
"'add <symbol>'\t: add a new symbol to the index\n"
"'delete <symbol>' : delete a symbol from the index\n"
"'reset'\t\t : delete the whole index\n"
"'auto <1/0>\t : if auto is 1 and a yet unknown symbol is looked up it is\n\t\t\t automatically added to the index\n"
"'help'\t\t : view this"
"\noutlet : <n>\t : index of the <symbol>");
post("\ncreation:\"index [<maxelements> [<auto>]]\": creates a <maxelements> sized index");
}
void index_setup(void)
{
index_class = class_new(gensym("index"),
(t_newmethod)index_new, (t_method)index_free,
sizeof(t_index), 0, A_GIMME, 0);
class_addsymbol(index_class, index_symbol);
class_addmethod(index_class, (t_method)index_reset, gensym("reset"), 0);
class_addmethod(index_class, (t_method)index_delete, gensym("delete"), A_SYMBOL, 0);
class_addmethod(index_class, (t_method)index_add, gensym("add"), A_SYMBOL, 0);
class_addmethod(index_class, (t_method)index_auto, gensym("auto"), A_FLOAT, 0);
class_addfloat(index_class, (t_method)index_float);
class_addmethod(index_class, (t_method)helper, gensym("help"), 0);
class_sethelpsymbol(index_class, gensym("zexy/index"));
zexy_register("index");
}
|
