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
|
/* choice -- match incoming list against a collection of stored templates. */
/* Copyright 1999 Miller Puckette.
Permission is granted to use this software for any purpose provided you
keep this copyright notice intact.
THE AUTHOR AND HIS EMPLOYERS MAKE NO WARRANTY, EXPRESS OR IMPLIED,
IN CONNECTION WITH THIS SOFTWARE.
This file is downloadable from http://www.crca.ucsd.edu/~msp .
*/
#include "m_pd.h"
#include <math.h>
static t_class *choice_class;
#define DIMENSION 10
typedef struct _elem
{
float e_age;
float e_weight[DIMENSION];
} t_elem;
typedef struct _choice
{
t_object x_obj;
t_elem *x_vec;
int x_n;
int x_nonrepeat;
} t_choice;
static void *choice_new(t_float fnonrepeat)
{
t_choice *x = (t_choice *)pd_new(choice_class);
outlet_new(&x->x_obj, gensym("float"));
x->x_vec = (t_elem *)getbytes(0);
x->x_n = 0;
x->x_nonrepeat = (fnonrepeat != 0);
return (x);
}
static void choice_clear(t_choice *x)
{
x->x_vec = (t_elem *)resizebytes(x->x_vec, x->x_n * sizeof(t_elem), 0);
x->x_n = 0;
}
static void choice_print(t_choice *x)
{
int j;
for (j = 0; j < x->x_n; j++)
{
t_elem *e = x->x_vec + j;
t_float *w = e->e_weight;
post("%2d age %2d \
w %5.2f %5.2f %5.2f %5.2f %5.2f %5.2f %5.2f %5.2f %5.2f %5.2f",
j, (int)(e->e_age), w[0], w[1], w[2], w[3], w[4], w[5],
w[6], w[7], w[8], w[9]);
}
}
static void choice_add(t_choice *x, t_symbol *s, int argc, t_atom *argv)
{
int oldn = x->x_n, newn = oldn + 1, i;
t_elem *e;
float sum, normal;
x->x_vec = (t_elem *)resizebytes(x->x_vec, oldn * sizeof(t_elem),
newn * sizeof(t_elem));
x->x_n = newn;
e = x->x_vec + oldn;
e->e_age = 2;
for (i = 0, sum = 0; i < DIMENSION; i++)
{
float f = atom_getfloatarg(i, argc, argv);
e->e_weight[i] = f;
sum += f*f;
}
normal = (float)(sum > 0 ? 1./sqrt(sum) : 1);
for (i = 0; i < DIMENSION; i++)
e->e_weight[i] *= normal;
}
static void choice_list(t_choice *x, t_symbol *s, int argc, t_atom *argv)
{
int i, j;
float bestsum = 0;
int bestindex = -1;
t_float invec[DIMENSION];
for (i = 0; i < DIMENSION; i++)
invec[i] = atom_getfloatarg(i, argc, argv);
for (j = 0; j < x->x_n; j++)
{
t_elem *e = x->x_vec + j;
float sum;
for (i = 0, sum = 0; i < DIMENSION; i++)
sum += e->e_weight[i] * invec[i];
if (x->x_nonrepeat) sum *= (float)(log(e->e_age));
if (sum > bestsum)
{
bestsum = sum;
sum = 1;
bestindex = j;
}
}
if (bestindex >= 0)
{
for (j = 0; j < x->x_n; j++)
x->x_vec[j].e_age += 1.;
x->x_vec[bestindex].e_age = 1;
}
outlet_float(x->x_obj.ob_outlet, (float)bestindex);
}
static void choice_free(t_choice *x)
{
freebytes(x->x_vec, x->x_n * sizeof(t_elem));
}
void choice_setup(void)
{
choice_class = class_new(gensym("choice"), (t_newmethod)choice_new,
(t_method)choice_free, sizeof(t_choice), 0, A_DEFFLOAT, 0);
class_addmethod(choice_class, (t_method)choice_add, gensym("add"), A_GIMME, 0);
class_addmethod(choice_class, (t_method)choice_clear, gensym("clear"), 0);
class_addmethod(choice_class, (t_method)choice_print, gensym("print"), 0);
class_addlist(choice_class, choice_list);
}
|
