-
Notifications
You must be signed in to change notification settings - Fork 39
/
venn.c
75 lines (67 loc) · 1.49 KB
/
venn.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
struct varray {
size_t cnt;
char **vals;
};
typedef struct varray varray;
static void varray_copy_shallow(vararray *dst, const varray *src)
{
size_t valbytes = src->cnt * sizeof *src->vals;
dst->cnt = src->cnt;
dst->vals = malloc(valbytes);
memcpy(dst->vals, src->vals, valbytes);
}
static int cmp(const char *a, const char *b)
{
return strcmp(a, b);
}
static void varray_sort(varray *a)
{
qsort(a, a->cnt, sizeof *a->vals, cmp);
}
static void until_equal(
const varray *a,
const varray *b,
varray *a_only,
size_t *ai)
{
int cmp;
while (*ai < a->cnt)
{
cmp = strcmp(a->vals[ai], b->vals[bi]);
if (cmp >= 0)
return;
(*ai)++;
}
}
static void intersection(const varray *a, const varray *b,
varray *ab,
varray *only_a,
varray *only_b)
{
vararray a_copy, b_copy;
varray_copy_shallow(&a_copy, a);
varray_copy_shallow(&b_copy, b);
varray_sort(&a_copy);
varray_sort(&b_copy);
{
size_t ai = 0,
bi = 0;
while (ai < a_copy.cnt && bi < b_copy.cnt)
{
int cmp;
cmp = strcmp(a_copy->vals[ai], b_copy->vals[bi]);
if (cmp == 0)
ab
else if (cmp < 0)
a_only
else
b_only
}
}
free(a_copy.vals);
free(b_copy.vals);
}
int main(void)
{
return 0;
}