-
Notifications
You must be signed in to change notification settings - Fork 0
/
itemset.c
176 lines (155 loc) · 3.24 KB
/
itemset.c
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
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "itemset.h"
#define IS_NEWLINE(c) ((c)=='\n' || (c)=='\r')
#define IS_SEP(c) ((c)==' ' || (c)==',' || c=='\t')
#define IS_NUM(c) ((c)>='0' && (c)<='9')
#define IS_VALID(c) (IS_NEWLINE(c) || IS_SEP(c) || IS_NUM(c))
itemset_bag_t *itemset_bag_create(char *path)
{
long i, j;
FILE *fp;
char *buf;
itemset_bag_t *bag;
bag = (itemset_bag_t *)malloc(sizeof(itemset_bag_t));
if (!bag)
goto e1;
fp = fopen(path, "rb");
if (!fp)
goto e2;
long size; // length of input in bytes
fseek(fp , 0L , SEEK_END);
size = ftell(fp);
rewind(fp);
buf = malloc(size+1);
if(!buf)
goto e3;
if(fread(buf, size, 1, fp) != 1)
goto e4;
if (buf[size-1] != '\n')
{
buf[size] = '\n';
size++;
}
long ntran; // numebr of transactions
long l; // line number
for (l=0, i=0, ntran=0; i<size;)
{
while (!IS_NEWLINE(buf[i]) && i<size)
{
if (!IS_VALID(buf[i]))
{
printf("invalid character %02x at line %ld\n", buf[i], l);
goto e4;
}
i++;
}
ntran++;
while (IS_NEWLINE(buf[i]) && i<size)
{
if (!IS_VALID(buf[i]))
{
printf("invalid character %02x at line %ld\n", buf[i], l);
goto e4;
}
i++;
l++;
}
}
long nmax = ntran;
bag->itemsets = (itemset_t *)malloc((nmax)*sizeof(itemset_t));
if (!bag->itemsets)
goto e4;
bag->len = nmax;
bag->item_max = 0;
bag->lensum = 0;
long start, end; // start and end of current line
int nitem;
for (i=0, start=0, end=0, ntran=0; ntran<nmax && i<size;)
{
while (!IS_NEWLINE(buf[i]) && i<size)
i++;
end = i;
for (j=start, nitem=0; j<end;)
{
while (!IS_SEP(buf[j]) && j<end)
j++;
nitem++;
while (IS_SEP(buf[j]) && j<size)
j++;
}
bag->itemsets[ntran].items = (int*)malloc((nitem)*sizeof(int));
if (!bag->itemsets[ntran].items)
goto e5;
bag->itemsets[ntran].len = nitem;
bag->lensum += nitem;
long istart, iend; // start and end of current item
for (j=start, nitem=0, istart=start, iend=start; j<end;)
{
while (!IS_SEP(buf[j]) && j<end)
j++;
iend = j;
char tmp = buf[end];
buf[iend] = '\0';
int item = atoi(buf+istart);
bag->itemsets[ntran].items[nitem] = item;
if (item>bag->item_max)
bag->item_max = item;
buf[iend] = tmp;
nitem++;
while (IS_SEP(buf[j]) && j<size)
j++;
istart = j;
}
ntran++;
while (IS_NEWLINE(buf[i]) && i<size)
i++;
start = i;
}
fclose(fp);
free(buf);
return bag;
e5:
itemset_bag_free(bag);
e4:
free(buf);
e3:
fclose(fp);
e2:
free(bag);
e1:
return NULL;
}
void itemset_free(itemset_t *itemset)
{
free(itemset->items);
}
void itemset_bag_free(itemset_bag_t *bag)
{
long i;
if (bag->itemsets)
{
for (i=0; i<bag->len; i++)
itemset_free(bag->itemsets+i);
free(bag->itemsets);
}
free(bag);
}
void itemset_bag_free_keep_stats(itemset_bag_t *bag)
{
long i;
if (bag->itemsets)
{
for (i=0; i<bag->len; i++)
itemset_free(bag->itemsets+i);
free(bag->itemsets);
}
bag->itemsets = NULL;
}
void itemset_bag_free_keep_itemsets(itemset_bag_t *bag)
{
if (bag->itemsets)
free(bag->itemsets);
free(bag);
}