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
|
#ifdef __cplusplus
extern "C" {
#endif
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"
#ifdef __cplusplus
}
#endif
typedef struct {
char *name;
int result;
int num_values;
int *values;
} Instance;
MODULE = AI::DecisionTree::Instance PACKAGE = AI::DecisionTree::Instance
PROTOTYPES: DISABLE
Instance *
new (class, values_ref, result, name)
char * class
SV * values_ref
int result
char * name
CODE:
{
int i;
Instance* instance;
AV* values = (AV*) SvRV(values_ref);
New(0, instance, 1, Instance);
instance->name = savepv(name);
instance->result = result;
instance->num_values = 1 + av_len(values);
New(0, instance->values, instance->num_values, int);
for(i=0; i<instance->num_values; i++) {
instance->values[i] = (int) SvIV( *av_fetch(values, i, 0) );
}
RETVAL = instance;
}
OUTPUT:
RETVAL
char *
name (instance)
Instance* instance
CODE:
{
RETVAL = instance->name;
}
OUTPUT:
RETVAL
void
set_result (instance, result)
Instance* instance
int result
CODE:
{
instance->result = result;
}
void
set_value (instance, attribute, value)
Instance* instance
int attribute
int value
PPCODE:
{
int *new_values;
int i;
if (attribute >= instance->num_values) {
if (!value) return; /* Nothing to do */
printf("Expanding from %d to %d places\n", instance->num_values, attribute);
Renew(instance->values, attribute, int);
if (!instance->values)
croak("Couldn't grab new memory to expand instance");
for (i=instance->num_values; i<attribute-1; i++)
instance->values[i] = 0;
instance->num_values = 1 + attribute;
}
instance->values[attribute] = value;
}
int
value_int (instance, attribute)
Instance * instance
int attribute
CODE:
{
if (attribute >= instance->num_values) {
RETVAL = 0;
}
else {
RETVAL = instance->values[attribute];
}
}
OUTPUT:
RETVAL
int
result_int (instance)
Instance * instance
CODE:
{
RETVAL = instance->result;
}
OUTPUT:
RETVAL
void
DESTROY (instance)
Instance * instance
PPCODE:
{
Safefree(instance->name);
Safefree(instance->values);
Safefree(instance);
}
int
tally (pkg, instances_r, tallies_r, totals_r, attr)
char * pkg
SV * instances_r
SV * tallies_r
SV * totals_r
int attr
CODE:
{
AV *instances = (AV*) SvRV(instances_r);
HV *tallies = (HV*) SvRV(tallies_r);
HV *totals = (HV*) SvRV(totals_r);
I32 top = av_len(instances);
int num_undef = 0;
I32 i, v;
SV **instance_r, **hash_entry, **sub_hash_entry;
Instance *instance;
for (i=0; i<=top; i++) {
instance_r = av_fetch(instances, i, 0);
instance = (Instance *) SvIV(SvRV(*instance_r));
v = attr < instance->num_values ? instance->values[attr] : 0;
/* if (!v) { num_undef++; continue; } */
/* $totals{$v}++ */
hash_entry = hv_fetch(totals, (char *)&v, sizeof(I32), 1);
if (!SvIOK(*hash_entry)) sv_setiv(*hash_entry, 0);
sv_setiv( *hash_entry, 1+SvIV(*hash_entry) );
/* $tallies{$v}{$_->result_int}++ */
hash_entry = hv_fetch(tallies, (char *)&v, sizeof(I32), 0);
if (!hash_entry) {
hash_entry = hv_store(tallies, (char *)&v, sizeof(I32), newRV_noinc((SV*) newHV()), 0);
}
sub_hash_entry = hv_fetch((HV*) SvRV(*hash_entry), (char *)&(instance->result), sizeof(int), 1);
if (!SvIOK(*sub_hash_entry)) sv_setiv(*sub_hash_entry, 0);
sv_setiv( *sub_hash_entry, 1+SvIV(*sub_hash_entry) );
}
RETVAL = num_undef;
/* Old code:
foreach (@$instances) {
my $v = $_->value_int($all_attr->{$attr});
next unless $v;
$totals{ $v }++;
$tallies{ $v }{ $_->result_int }++;
}
*/
}
OUTPUT:
RETVAL
|
