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
|
/*
* prime: get the n-th prime number
*
* (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"
static t_class *prime_class;
typedef struct _prime {
t_object x_obj;
} t_prime;
static void prime_float(t_prime *x, t_float f)
{
unsigned int i=f;
unsigned int max_divisor;
unsigned int divisor=1;
if (f<2){
outlet_float(x->x_obj.ob_outlet, 0.0);
return;
}
if (!(i%2)){
outlet_float(x->x_obj.ob_outlet, (t_float)(i==2));
return;
}
max_divisor = sqrt(f)+1;
while ((divisor+=2)<max_divisor)
if (!(i%divisor)) {
outlet_float(x->x_obj.ob_outlet, 0.0);
return;
}
outlet_float(x->x_obj.ob_outlet, 1.0);
}
static void *prime_new(void)
{
t_prime *x = (t_prime *)pd_new(prime_class);
outlet_new(&x->x_obj, gensym("float"));
return (x);
}
static void prime_help(t_prime*x)
{
post("\n"HEARTSYMBOL" prime\t\t:: test whether a given number is prime");
}
void prime_setup(void) {
prime_class = class_new(gensym("prime"),
(t_newmethod)prime_new,
0, sizeof(t_prime),
CLASS_DEFAULT, 0);
class_addfloat(prime_class, prime_float);
class_addmethod(prime_class, (t_method)prime_help, gensym("help"), A_NULL);
zexy_register("prime");
}
|
