summaryrefslogtreecommitdiff
path: root/lib/ccan/str/test/run.c
blob: a15654f8f32849831ae4814d39966970a26d8efc (plain)
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
#include <ccan/str/str.h>
#include <ccan/str/str.c>
#include <stdlib.h>
#include <stdio.h>
#include <ccan/tap/tap.h>

#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof(arr[0]))

static char *substrings[] = { "far", "bar", "baz", "b", "ba", "z", "ar", NULL };

#define NUM_SUBSTRINGS (ARRAY_SIZE(substrings) - 1)

static char *strdup_rev(const char *s)
{
	char *ret = strdup(s);
	unsigned int i;

	for (i = 0; i < strlen(s); i++)
		ret[i] = s[strlen(s) - i - 1];
	return ret;
}

int main(int argc, char *argv[])
{
	unsigned int i, j, n;
	char *strings[NUM_SUBSTRINGS * NUM_SUBSTRINGS];

	n = 0;
	for (i = 0; i < NUM_SUBSTRINGS; i++) {
		for (j = 0; j < NUM_SUBSTRINGS; j++) {
			strings[n] = malloc(strlen(substrings[i])
					    + strlen(substrings[j]) + 1);
			sprintf(strings[n++], "%s%s",
				substrings[i], substrings[j]);
		}
	}

	plan_tests(n * n * 5 + 16);
	for (i = 0; i < n; i++) {
		for (j = 0; j < n; j++) {
			unsigned int k, identical = 0;
			char *reva, *revb;

			/* Find first difference. */
			for (k = 0; strings[i][k]==strings[j][k]; k++) {
				if (k == strlen(strings[i])) {
					identical = 1;
					break;
				}
			}

			if (identical)
				ok1(streq(strings[i], strings[j]));
			else
				ok1(!streq(strings[i], strings[j]));

			/* Postfix test should be equivalent to prefix
			 * test on reversed string. */
			reva = strdup_rev(strings[i]);
			revb = strdup_rev(strings[j]);

			if (!strings[i][k]) {
				ok1(strstarts(strings[j], strings[i]));
				ok1(strends(revb, reva));
			} else {
				ok1(!strstarts(strings[j], strings[i]));
				ok1(!strends(revb, reva));
			}
			if (!strings[j][k]) {
				ok1(strstarts(strings[i], strings[j]));
				ok1(strends(reva, revb));
			} else {
				ok1(!strstarts(strings[i], strings[j]));
				ok1(!strends(reva, revb));
			}
			free(reva);
			free(revb);
		}
	}

	for (i = 0; i < n; i++)
		free(strings[i]);

	ok1(streq(stringify(NUM_SUBSTRINGS),
		  "((sizeof(substrings) / sizeof(substrings[0])) - 1)"));
	ok1(streq(stringify(ARRAY_SIZE(substrings)),
		  "(sizeof(substrings) / sizeof(substrings[0]))"));
	ok1(streq(stringify(i == 0), "i == 0"));

	ok1(strcount("aaaaaa", "b") == 0);
	ok1(strcount("aaaaaa", "a") == 6);
	ok1(strcount("aaaaaa", "aa") == 3);
	ok1(strcount("aaaaaa", "aaa") == 2);
	ok1(strcount("aaaaaa", "aaaa") == 1);
	ok1(strcount("aaaaaa", "aaaaa") == 1);
	ok1(strcount("aaaaaa", "aaaaaa") == 1);
	ok1(strcount("aaa aaa", "b") == 0);
	ok1(strcount("aaa aaa", "a") == 6);
	ok1(strcount("aaa aaa", "aa") == 2);
	ok1(strcount("aaa aaa", "aaa") == 2);
	ok1(strcount("aaa aaa", "aaaa") == 0);
	ok1(strcount("aaa aaa", "aaaaa") == 0);

	return exit_status();
}