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
|
/*
* pfxtree-test - Delwink prefix tree library unit test
* Copyright (C) 2017, 2020 Delwink, LLC
*
* Redistributions, modified or unmodified, in whole or in part, must retain
* applicable notices of copyright or other legal privilege, these conditions,
* and the following license terms and disclaimer. Subject to these
* conditions, each holder of copyright or other legal privileges, author or
* assembler, and contributor of this work, henceforth "licensor", hereby
* grants to any person who obtains a copy of this work in any form:
*
* 1. Permission to reproduce, modify, distribute, publish, sell, sublicense,
* use, and/or otherwise deal in the licensed material without restriction.
*
* 2. A perpetual, worldwide, non-exclusive, royalty-free, gratis, irrevocable
* patent license to make, have made, provide, transfer, import, use, and/or
* otherwise deal in the licensed material without restriction, for any and
* all patents held by such licensor and necessarily infringed by the form of
* the work upon distribution of that licensor's contribution to the work
* under the terms of this license.
*
* NO WARRANTY OF ANY KIND IS IMPLIED BY, OR SHOULD BE INFERRED FROM, THIS
* LICENSE OR THE ACT OF DISTRIBUTION UNDER THE TERMS OF THIS LICENSE,
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR
* A PARTICULAR PURPOSE, AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS,
* ASSEMBLERS, OR HOLDERS OF COPYRIGHT OR OTHER LEGAL PRIVILEGE BE LIABLE FOR
* ANY CLAIM, DAMAGES, OR OTHER LIABILITY, WHETHER IN ACTION OF CONTRACT,
* TORT, OR OTHERWISE ARISING FROM, OUT OF, OR IN CONNECTION WITH THE WORK OR
* THE USE OF OR OTHER DEALINGS IN THE WORK.
*/
#include <assert.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include "pfxtree.h"
static int
check_entry(const struct pt_entry *entry, void *data)
{
if (PT_TYPE_PTR == entry->type)
assert(entry->data.p == data);
return 0;
}
int
main(void)
{
PrefixTree *p = pt_new(), *p2;
void *dummy;
assert(p != NULL);
assert(0 == pt_add(p, "hello", 1));
assert(0 == pt_add(p, "world", 2));
assert(0 == pt_add(p, "henlo", 3));
assert(0 == pt_add(p, "hell", -1));
assert(PT_TYPE_INT == pt_data_type(pt_search(p, "hell")));
assert(-1 == pt_data(pt_search(p, "hell")));
assert(0 == pt_del(p, "hello"));
assert(NULL == pt_search(p, "hello"));
assert(pt_search(p, "hell") != NULL);
dummy = malloc(16);
assert(dummy != NULL);
assert(0 == pt_add_p(p, "hello", dummy));
assert(PT_TYPE_PTR == pt_data_type(pt_search(p, "hello")));
assert(PT_ENOWORD == pt_del(p, "asdf"));
pt_foreach(p, check_entry, dummy);
p2 = pt_copy(p);
assert(p2 != NULL);
assert(pt_data_p(pt_search(p2, "hello")) == dummy);
pt_deep_free(p, true);
pt_deep_free(p2, false);
return 0;
}
|
