[ create a new paste ] login | about

Link: http://codepad.org/k8tw70k0    [ raw code | fork ]

C, pasted on Apr 25:
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
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
#include <sys/types.h>
#include <sys/stat.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>

#define MAXLINE 1024

typedef struct FieldNode
{
	int					field;
	struct FieldNode*	right;
}field_node;

typedef struct AttributeNode
{
	int						key;
	struct FieldNode*		right;
	struct AttributeNode*	down;
}attr;

/* buffer for first file */
static char buffer1[MAXLINE];
static int occupied1 = 0;

/* buffer for second file */
static char buffer2[MAXLINE];
static int occupied2 = 0;

static int read_line(char *s, int lim, FILE *fp);
static field_node* create_field_node(int field);
static attr* create_attribute_node(int key);
static attr* create_head_node();
static int read_key(char *s);
static attr* read_group(attr *head, FILE *fp);
static void free_group_memory(attr **headp);
static void join_lines(char *s, attr *group, FILE *fp);
static FILE* open_file(char *filename);
static int getline(char *s, int lim, FILE *fp);
static char* getword(char *s, const char *sep);


/* join to files according to matching keys assuming that both files are sorted */
int natural_join(char *inputfile1, char *inputfile2, char *output)
{
	FILE *fp1, *fp2, *fp_out;
	attr *head;
	char line[MAXLINE];

	/* open files */
	if((fp1 = open_file(inputfile1)) == NULL)
		return 0;

	if((fp2 = open_file(inputfile2)) == NULL)
		return 0;

	if((fp_out = fopen(output, "w")) == NULL)
		return 0;

	head = create_head_node();

	/* join files*/
	for(;;)
	{
		int key;
		char *bufp;
		/* read a group of lines with equal keys from second file */
		head->down = read_group(head, fp2);

		if(head->down == NULL)		/* EOF for second file */
			break;

		/* read line from first file until an equal key or greater key than the group is found */
		for(;;)
		{
			/* read a line from first file */
			if(occupied1)
			{
				bufp = &buffer1[0];
				occupied1 = 0;
			}
			else
			{
				if(read_line(line, sizeof(line), fp1) == EOF)		/* end of first file, join completed */
					break;

				bufp = &line[0];
			}

			/* read key */
			key = read_key(bufp);

			if(key > head->down->key)
			{
				/* free memory for the group of records with equal keys and 
					save the line from first file file in static buffer */
				free_group_memory(&head);
				strcpy(buffer1, bufp);
				occupied1 = 1;
				break;
			}

			if(key == head->down->key)
				join_lines(bufp, head->down, fp_out);
		}

	}

	/* free memory */
	free_group_memory(&head);
	/* free head node */
	free(head);

	/* close open files */
	fclose(fp1);
	fclose(fp2);
	fclose(fp_out);

	return 1;
}

static void join_lines(char *s, attr *group, FILE *fp)
{
	char copy[MAXLINE];
	char *sep = "\t ";
	char *p;

	while(group != NULL)
	{
		field_node *f;

		strcpy(copy, s);
		for(p = getword(copy, sep); p; p = getword(NULL, sep))
			fprintf(fp, "%s	", p);

		for(f = group->right; f != NULL; f = f->right)
			fprintf(fp, "%d	", f->field);

		fprintf(fp, "\n");

		group = group->down;
	}
}

static attr* read_group(attr *head, FILE *fp)
{
	char line[MAXLINE];
	attr *group;

	line[0] = '\0';
	group = head;

	for(;;)
	{
		char *bufp, *sep, *p;
		int new_key;
		field_node *fieldp;

		sep = "\t ";
		/* read line */
		if(occupied2)			/* buffer is occupied, read line from buffer */
		{
			bufp = &buffer2[0];
			occupied2 = 0;
		}
		else					/* read line from file */
		{
			if(read_line(line, sizeof(line), fp) == EOF)
				break;

			bufp = &line[0];
		}

		/* read key */
		new_key = read_key(bufp);

		/* compare new key with previous key */
		if(new_key > group->key)					/* this condition will always be false for the first line as initially key is INT_MAX */
		{
			strcpy(buffer2, bufp);
			occupied2 = 1;
			break;
		}

		/* read key into memory */
		group->down = create_attribute_node(atoi(getword(bufp, sep)));
		if(group->down == NULL)
			return NULL;

		/* read fields into memory */
		if((p = getword(NULL, sep)) != NULL)
		{
			fieldp = create_field_node(atoi(p));
			if(fieldp == NULL)
				return NULL;

			group->down->right = fieldp;
		}

		while((p = getword(NULL, sep)) != NULL)
		{
			fieldp->right = create_field_node(atoi(p));
			if(fieldp->right == NULL)
				return NULL;

			fieldp = fieldp->right;
		}
		/* move down one level */
		group = group->down;
	}

	return head->down;
}

static void free_group_memory(attr **headp)
{
	attr *d;


	if((*headp)->down != NULL)
	{
		field_node *r;

		for(d = (*headp)->down; d != NULL;)
		{
			attr *dd;
			for(r = d->right; r != NULL;)
			{
				field_node *rr;
				rr = r->right;
				free(r);
				r = rr;
			}
			dd = d->down;
			free(d);
			d = dd;
		}
	}

	(*headp)->down = NULL;
}

static int read_key(char *s)
{
	int i, j;
	char key[MAXLINE];

	/* by pass space and tab */
	for(i = 0; s[i] == '\t' || s[i] == ' '; i++);

	/* copy key until space or tab is encountered */
	for(j = 0; s[i] != '\t' && s[i] != ' '; i++, j++)
		key[j] = s[i];

	key[j] = '\0';
	return atoi(key);
}

static int read_line(char *s, int lim, FILE *fp)
{
	int len;

	while(1)
	{
		len = getline(s, lim, fp);

		if(len == 0)
			return EOF;

		/* skip empty lines */
		if(s[0] != '\n')
			break;
	}

	/* remove newline from line */
	s[len-1] = '\0';

	return (len-1);
}

static attr* create_attribute_node(int key)
{
	attr *p;

	if((p = (attr*)malloc(sizeof(*p))) == NULL)
		return NULL;

	p->key = key;
	p->down = NULL;
	p->right = NULL;

	return p;
}

static field_node* create_field_node(int field)
{
	field_node *p;

	if((p = (field_node*)malloc(sizeof(*p))) == NULL)
		return NULL;

	p->field = field;
	p->right = NULL;

	return p;
}

static attr* create_head_node()
{
	attr *p;

	if((p = (attr*)malloc(sizeof(*p))) == NULL)
		return NULL;

	p->key = INT_MAX;
	p->down = NULL;
	p->right = NULL;

	return p;
}

FILE* open_file(char *filename)
{
	struct _stat buffer;
	int status;
	FILE *fp;

	/* check file status */
	status = _stat(filename, &buffer);

	/* file doesn't exist */
	if(status != 0)
		return NULL;

	/* path specifies an ordinary file and the file has read permission */
	if((buffer.st_mode & _S_IFREG) && (buffer.st_mode & _S_IREAD))
	{
		/* file is empty */
		if(buffer.st_size == 0)
			return NULL;

		/* open file in read mode */
		fp = fopen(filename, "r");

		if(fp == NULL)
			return NULL;

		return fp;
	}

	return NULL;
}

int getline(char *s, int lim, FILE *fp)
{
	int i;
	char c;

	for(i = 0; i < (lim-1) && (c = getc(fp)) != EOF && c != '\n'; i++)
		s[i] = c;

	if(c == '\n')
		s[i++] = c;

	s[i] = '\0';

	return i;
}

char* getword(char *s, const char *sep)
{
	char *p, *tokenptr;

	/* static pointer pointing to the current position in s */
	static char *currentp = NULL;

	/* if s is not NULL, point currentp to starting of NULL */
	if(s != NULL)
		currentp = s;

	/* when the function is called for the first time and s is NULL, return NULL */
	if(s == NULL && currentp == NULL)
		return NULL;

	/* bypass the initial seperator characters */
	for(p = currentp; *p != '\0'; p++)
	{
		const char *sep_p;

		/* check if the character is seperator */
		for(sep_p = sep; *sep_p != '\0'; sep_p++)
		{
			if(*sep_p == *p)
				break;
		}

		if(*sep_p == '\0')
			break;						/* if character other then separator is found, break out of the loop */
	}

	/* end of string is reached */
	if(*p == '\0')
	{
		currentp = NULL;
		return NULL;
	}

	/* find the next seperator character */
	for(tokenptr = p; *p != '\0'; p++)
	{
		const char *sep_p;

		for(sep_p = sep; *sep_p != '\0'; sep_p++)
		{
			if(*sep_p == *p)
				break;
		}

		if(*sep_p != '\0')
			break;					/* if the character is separator then break out of loop */
	}

	if(*p == '\0')
		currentp = p;
	else
	{
		currentp = p+1;
		*p = '\0';
	}
	return tokenptr;
}


Create a new paste based on this one


Comments: