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
|
/*
* pfxtree-test - Delwink prefix tree library unit test
* Copyright (C) 2017 Delwink, LLC
*
* Redistributions, modified or unmodified, in whole or in part, must retain
* applicable copyright or other legal privilege notices, these conditions, and
* the following license terms and disclaimer. Subject to these conditions,
* the holder(s) of copyright or other legal privileges, author(s) or
* assembler(s), and contributors of this work hereby grant 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, irrevocable patent
* license to reproduce, modify, distribute, publish, sell, use, and/or
* otherwise deal in the licensed material without restriction, for any and all
* patents:
*
* a. Held by each such holder of copyright or other legal privilege,
* author or assembler, or contributor, necessarily infringed by the
* contributions alone or by combination with the work, of that privilege
* holder, author or assembler, or contributor.
*
* b. Necessarily infringed by the work at the time that holder of
* copyright or other privilege, author or assembler, or contributor made
* any contribution to the work.
*
* 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 <stdlib.h>
#include "pfxtree.h"
int
main(void)
{
PrefixTree *p = pt_new();
assert(p != NULL);
assert(0 == pt_add(p, "hello", 1));
assert(0 == pt_add(p, "world", 2));
assert(0 == pt_add(p, "hell", -1));
assert('i' == 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);
void *dummy = malloc(0xDFDF);
assert(dummy != NULL);
assert(0 == pt_add_p(p, "hello", dummy));
assert('p' == pt_data_type(pt_search(p, "hello")));
assert(PT_ENOWORD == pt_del(p, "asdf"));
pt_deep_free(p, true);
return 0;
}
|