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
|
/*
* tabminmax: get minimum and maximum of a table
*
* (c) 1999-2011 IOhannes m zmölnig, forum::für::umläute, institute of electronic music and acoustics (iem)
*
* 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, see <http://www.gnu.org/licenses/>.
*/
#include "zexy.h"
/* =================== tabminmax ====================== */
static t_class *tabminmax_class;
typedef struct _tabminmax {
t_object x_obj;
t_outlet*min_out, *max_out;
t_symbol *x_arrayname;
t_int startindex, stopindex;
} t_tabminmax;
static void tabminmax_bang(t_tabminmax *x)
{
t_garray *A;
int npoints;
zarray_t *vec;
if (!(A = (t_garray *)pd_findbyclass(x->x_arrayname, garray_class))) {
error("%s: no such array", x->x_arrayname->s_name);
} else if (!zarray_getarray(A, &npoints, &vec)) {
error("%s: bad template for tabminmax", x->x_arrayname->s_name);
} else {
int n;
t_atom atombuf[2];
t_float min, max;
int mindex, maxdex;
int start=x->startindex;
int stop =x->stopindex;
if(start<0||start>stop) {
start=0;
}
if(stop<start||stop>npoints) {
stop=npoints;
}
npoints=stop-start;
min=zarray_getfloat(vec, start);
max=min;
mindex=start;
maxdex=start;
for (n = 1; n < npoints; n++) {
t_float val=zarray_getfloat(vec, start+n);
if(val<min) {
mindex=start+n;
min=val;
}
if(val>max) {
maxdex=start+n;
max=val;
}
}
SETFLOAT(atombuf, max);
SETFLOAT(atombuf+1, maxdex);
outlet_list(x->max_out, gensym("list"), 2, atombuf);
SETFLOAT(atombuf, min);
SETFLOAT(atombuf+1, mindex);
outlet_list(x->min_out, gensym("list"), 2, atombuf);
}
}
static void tabminmax_list(t_tabminmax *x, t_symbol* UNUSED(s),int argc,
t_atom*argv)
{
int a,b;
switch(argc) {
case 2:
a=atom_getint(argv);
b=atom_getint(argv+1);
x->startindex=(a<b)?a:b;
x->stopindex =(a>b)?a:b;
tabminmax_bang(x);
break;
default:
error("tabminmax: list must be 2 floats (is %d atoms)", argc);
}
}
static void tabminmax_set(t_tabminmax *x, t_symbol *s)
{
x->x_arrayname = s;
}
static void *tabminmax_new(t_symbol *s)
{
t_tabminmax *x = (t_tabminmax *)pd_new(tabminmax_class);
x->x_arrayname = s;
x->startindex=0;
x->stopindex=-1;
x->min_out=outlet_new(&x->x_obj, gensym("list"));
x->max_out=outlet_new(&x->x_obj, gensym("list"));
return (x);
}
static void tabminmax_helper(void)
{
post("\n"HEARTSYMBOL" tabminmax - object : dumps a table as a package of floats");
post("'set <table>'\t: read out another table\n"
"'bang'\t\t: get min and max of the table\n"
"outlet\t\t: table-data as package of floats");
post("creation\t: \"tabminmax <table>\"");
}
void tabminmax_setup(void)
{
tabminmax_class = class_new(gensym("tabminmax"),
(t_newmethod)tabminmax_new,
0, sizeof(t_tabminmax), 0, A_DEFSYM, 0);
class_addbang(tabminmax_class, (t_method)tabminmax_bang);
class_addlist(tabminmax_class, (t_method)tabminmax_list);
class_addmethod(tabminmax_class, (t_method)tabminmax_set, gensym("set"),
A_SYMBOL, 0);
class_addmethod(tabminmax_class, (t_method)tabminmax_helper,
gensym("help"), 0);
zexy_register("tabminmax");
}
|
