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
|
/* list_sum - total sum of list values, with setting on each element independently
* Copyright (C) 2007 Edward Kelly <morph_2016@yahoo.co.uk>
*
* This program 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 of the License, or
* (at your option) any later version.
*
* This program 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 program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "m_pd.h"
static t_class *list_sum_class;
typedef struct _contents
{
t_atom list[1024];
} t_contents;
typedef struct _list_sum
{
t_object x_obj;
t_contents contents;
t_float total, highest, maxlen, wrap, reset, accum, remainder, firsttime;
t_outlet *sum, *length; /*, *remains, *diff;*/
} t_list_sum;
void list_sum_all(t_list_sum *x, t_symbol *s, int argc, t_atom *argv)
{
argc = argc < 1024 ? argc : 1024;
int i, j, maxindex;
float current;
x->total = 0;
maxindex = argc > x->maxlen ? x->maxlen-1 : argc-1;
for(i=0;i<argc;i++)
{
current = atom_getfloat(argv+i);
SETFLOAT(&x->contents.list[i], current);
if(i<=maxindex)
{
x->total += current;
}
else if (i > maxindex && x->wrap > x->maxlen && i < x->wrap)
{
j = i % (int)x->maxlen;
current = atom_getfloat(argv+j);
x->total += current;
}
}
x->highest = (float)argc-1;
outlet_float(x->length, (float)argc);
outlet_float(x->sum, x->total);
}
void list_sum_set(t_list_sum *x, t_floatarg element, t_floatarg value)
{
int i, j, indx, top;
float current;
if(element < 1024)
{
x->total = 0;
float f_indx = element-1;
indx = (int)f_indx;
x->highest = f_indx > x->highest ? f_indx : x->highest;
if(x->wrap <= x->maxlen)
{
top = x->highest >= x->maxlen ? x->maxlen : x->highest + 1;
}
else
{
top = x->highest >= x->wrap ? x->wrap : x->highest + 1;
}
SETFLOAT(&x->contents.list[indx], value);
for(i=0;i<top;i++)
{
if(i<x->maxlen)
{
current = atom_getfloatarg(i, 1024, x->contents.list);
x->total += current;
}
else
{
j = i % (int)x->maxlen;
current = atom_getfloatarg(j, 1024, x->contents.list);
x->total += current;
}
}
outlet_float(x->length, x->highest+1);
outlet_float(x->sum, x->total);
}
}
//next: list_sum_follow - clock based?
//void list_sum_follow(t_list_sum *x, t_symbol *s, t_floatarg index, t_floatarg value)
//{
// int i = (int) index;
// if(index == (int)x->reset || x->firsttime == 1)
// {
// x->accum = 0;
// x->remainder = x->total;
// x->firsttime = 0;
// }
// float current = atom_getfloatarg(i, 1024, x->contents.list);
// float diff = value - current;
// x->accum += diff;
// outlet_float(x->diff, x->accum);
// x->remainder -=current;
// outlet_float(x->remains, x->remainder);
//}
void list_sum_clear(t_list_sum *x)
{
int i;
for(i=0;i<1024;i++)
{
SETFLOAT(&x->contents.list[i], 0);
}
x->highest=0;
x->total=0;
}
void list_sum_print(t_list_sum *x)
{
int i;
float element;
for(i=0;i<=x->highest;i++)
{
element = atom_getfloatarg(i, 1024, x->contents.list);
post("%d ", element);
}
}
void *list_sum_new(t_symbol *s, int argc, t_atom *argv)
{
int i;
t_list_sum *x = (t_list_sum *)pd_new(list_sum_class);
x->total = 0;
x->highest = 0;
x->maxlen = 1024;
x->wrap = 1024;
x->reset = 16;
x->firsttime = 1;
for(i=0;i<1024;i++)
{
SETFLOAT(&x->contents.list[i], 0);
}
floatinlet_new(&x->x_obj, &x->maxlen);
floatinlet_new(&x->x_obj, &x->wrap);
// floatinlet_new(&x->x_obj, &x->reset);
x->sum = outlet_new(&x->x_obj, &s_float);
x->length = outlet_new(&x->x_obj, &s_float);
// x->remains = outlet_new(&x->x_obj, &s_float);
// x->diff = outlet_new(&x->x_obj, &s_float);
return (void *)x;
}
void list_sum_setup(void) {
list_sum_class = class_new(gensym("list_sum"),
(t_newmethod)list_sum_new,
0, sizeof(t_list_sum),
0, A_DEFFLOAT, 0);
post("|<<<<<<<<<<<<<<<<<<<<list_sum>>>>>>>>>>>>>>>>>>>>|");
post("|<<<calculate the sum of a list, with wrapping>>>|");
post("|<<<<<<<<<edward-------kelly-------2007>>>>>>>>>>|");
// class_addmethod(list_sum_class, (t_method)list_sum_follow, gensym("follow"), A_DEFFLOAT, A_DEFFLOAT, 0);
class_addmethod(list_sum_class, (t_method)list_sum_all, gensym("all"), A_GIMME, 0);
class_addmethod(list_sum_class, (t_method)list_sum_clear, gensym("clear"), A_DEFFLOAT, 0);
class_addmethod(list_sum_class, (t_method)list_sum_print, gensym("print"), A_DEFFLOAT, 0);
class_addmethod(list_sum_class, (t_method)list_sum_set, gensym("set"), A_DEFFLOAT, A_DEFFLOAT, 0);
}
|
