blob: c58da5372bc663248cf121ebf6e81db5425de28f (
plain) (
blame)
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
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <error.h>
#include <errno.h>
#include "tree.h"
struct tnode *talloc(void);
struct tnode *addtree(struct tnode *p, char *w, int line)
{
int cond;
if (p == NULL) {
p = talloc();
p->word = strdup(w);
p->lc = 0;
p->lines[p->lc++] = line;
p->left = p->right = NULL;
} else if (!(cond = strcasecmp(w, p->word))) {
if (p->lc < MAXLINES)
p->lines[p->lc++] = line;
else
error(EXIT_FAILURE, ENOBUFS, "addtree");
} else if (cond < 0) {
p->left = addtree(p->left, w, line);
} else if (cond > 0) {
p->right = addtree(p->right, w, line);
}
return p;
}
void tprint(struct tnode *p)
{
int lc;
if (p != NULL) {
tprint(p->left);
printf("---> %s\n", p->word);
for (lc = 0; lc < p->lc; ++lc)
printf((lc == p->lc-1) ? "%d" : "%d, ", p->lines[lc]);
putchar('\n');
tprint(p->right);
}
}
void tfree(struct tnode *p)
{
if (p != NULL) {
tfree(p->left);
tfree(p->right);
free(p->word);
free(p);
}
}
struct tnode *talloc(void)
{
return (struct tnode *) malloc(sizeof(struct tnode));
}
|
