-
Notifications
You must be signed in to change notification settings - Fork 0
/
dcou2.c
192 lines (170 loc) · 4.71 KB
/
dcou2.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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
/* size file read .... read a file with contig names and then sizez */
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define GBUF 2
#define CONDREALLOC(x, b, c, a, t); \
if((x)>=((b)-1)) { \
(b) += (c); \
(a)=realloc((a), (b)*sizeof(t)); \
memset(((a)+(b)-(c)), 0, (c)*sizeof(t)); \
}
typedef unsigned char boole;
typedef struct /* letcla_t, letters here are just names really */
{
char l; // a letter
int c; // a category
} letcla_t;
typedef struct /* dia_t */
{
unsigned **is /* indices */, bf, sz;
int lidx; // category label index
} dia_t; /* dupe index array */
typedef struct /* adia_t */
{
dia_t **d;
unsigned bf, sz;
} adia_t; /* dupe index array */
void prt_adia(adia_t *ad)
{
int i, j;
printf("What now follows is the arrangement of the elements into their corresponding categories\n\n");
for(i=0;i<ad->sz;++i) {
printf("%i: ", (*ad->d)[i].lidx);
printf("sz=%u: ", (*ad->d)[i].sz);
for(j=0;j<(*ad->d)[i].sz;++j)
printf("%u ", (*(*ad->d)[i].is)[j]);
printf("\n");
}
printf("\n");
return;
}
void assign_dia(dia_t *d, unsigned lidx)
{
int i;
d->bf=GBUF;
d->sz=0;
d->lidx=lidx;
d->is=malloc(sizeof(unsigned*));
(*d->is)=malloc(d->bf*sizeof(unsigned));
for(i=0;i<d->bf;++i)
(*d->is)[i]=9;
return;
}
void reall_dia(dia_t *d)
{
d->bf += GBUF;
(*d->is)=realloc((*d->is), d->bf*sizeof(unsigned));
return;
}
void reall_adia(adia_t *ad)
{
int i;
ad->bf += GBUF;
(*ad->d)=realloc((*ad->d), ad->bf*sizeof(dia_t));
for(i=ad->bf-GBUF;i<ad->bf;++i)
assign_dia((*ad->d)+i, 8);
return;
}
adia_t *crea_adia(void)
{
int i;
adia_t *ad=malloc(sizeof(adia_t));
ad->bf=GBUF;
ad->sz=0;
ad->d=malloc(sizeof(dia_t*));
(*ad->d)=malloc(ad->bf*sizeof(dia_t));
for(i=0;i<ad->bf;i++) {
assign_dia((*ad->d)+i, 7);
// assign_dia(add->d+i);
// td=(*ad->d)+i;
// td=crea_dia();
// // ((*add->d)+i)=crea_dia();
}
return ad;
}
void free_dia(dia_t *d)
{
free((*d->is));
free(d->is);
return;
}
void norm_dia(dia_t *d)
{
(*d->is)=realloc((*d->is), d->sz*sizeof(unsigned));
return;
}
void free_adia(adia_t *ad)
{
int i;
// for(i=0;i<add->sz;i++) // only if normalized.
for(i=0;i<ad->sz;i++)
free_dia((*ad->d)+i);
free((*ad->d));
free(ad->d);
free(ad);
return;
}
void norm_adia(adia_t *ad)
{
int i;
for(i=ad->sz;i<ad->bf;i++)
free_dia((*ad->d)+i);
(*ad->d)=realloc((*ad->d), ad->sz*sizeof(dia_t));
// then we want to shorten the individual arrays (dia_t) to their proper size
for(i=0;i<ad->sz;i++)
norm_dia((*ad->d)+i);
return;
}
int main(int argc, char *argv[])
{
/* argument accounting */
if(argc!=3) {
printf("Error. Pls supply 2 arguments 1) Size of letter array 2) Number of clusters to randomly assign.\n");
exit(EXIT_FAILURE);
}
int i, j;
int ne=atoi(argv[1]); /* num elements to be categorized, the elements will be letters */
letcla_t *la=malloc(ne*sizeof(letcla_t));
int nc=atoi(argv[2]); /* num clusters which will be randomly assigned: may not include all of them */
printf("What follows is a list of %i elements which are randomly assigned one\n", ne);
printf("of %i categories. The label is just a spurious marker, while the number is the assigned category.\n\n", nc);
for(i=0;i<ne;++i) {
la[i].l=(char)(65+26*((float)rand()/RAND_MAX)); // did have 65.5 here but [ kept coming up
la[i].c=(int)(1+nc*((float)rand()/RAND_MAX));
printf("(%c:%i) ", la[i].l, la[i].c);
}
printf("\n\n");
adia_t *ad = crea_adia();
boole seencatgry;
for(i=0;i<ne;++i) {
seencatgry=0;
for(j=0;j<ad->sz;++j) {
if(la[i].c == (*ad->d)[j].lidx) {
if((*ad->d)[j].sz == (*ad->d)[j].bf)
reall_dia((*ad->d)+j);
(*(*ad->d)[j].is)[(*ad->d)[j].sz] = i;
(*ad->d)[j].sz++;
seencatgry=1;
}
if(seencatgry)
break;
}
/* have gone through all the available clusters with no luck, time to create a new one.
* Note, you still need to check for seencatgry ...
* not immediately obvious why, given break statement */
if(!seencatgry) {
if(ad->sz == ad->bf)
reall_adia(ad);
(*ad->d)[ad->sz].lidx = la[i].c;
(*(*ad->d)[ad->sz].is)[(*ad->d)[ad->sz].sz] = i;
(*ad->d)[ad->sz].sz++;
ad->sz++;
}
}
norm_adia(ad);
prt_adia(ad);
free_adia(ad);
free(la);
return 0;
}