blob: 33176b304e8522b9fb5534f773db322b904addf7 (
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
|
#include "config.h"
#include <stdio.h>
#include <string.h>
/**
* strmap - an ordered map of strings to values
*
* This code implements an ordered map of strings as a critbit tree. See:
*
* http://cr.yp.to/critbit.html
* http://github.com/agl/critbit (which this code is based on)
*
* License: CC0 (but some dependencies are LGPL!)
* Author: Rusty Russell <rusty@rustcorp.com.au>
* Ccanlint:
* license_depends_compat FAIL
*
* Example:
* #include <ccan/strmap/strmap.h>
* #include <stdio.h>
*
* static bool dump(const char *member, size_t value, void *unused)
* {
* printf("%s at %zu. ", member, value);
* // true means keep going with iteration.
* return true;
* }
*
* int main(int argc, char *argv[])
* {
* size_t i;
* struct { STRMAP_MEMBERS(size_t); } map;
*
* strmap_init(&map);
* for (i = 1; i < argc; i++)
* // This only adds the first time for this arg.
* strmap_add(&map, argv[i], i);
*
* strmap_iterate(&map, dump, NULL);
* printf("\n");
* return 0;
* }
* // Given 'foo' outputs 'foo at 1. '
* // Given 'foo bar' outputs 'bar at 2. foo at 1. '
* // Given 'foo foo bar zebra' outputs 'bar at 3. foo at 1. zebra at 4. '
*/
int main(int argc, char *argv[])
{
/* Expect exactly one argument */
if (argc != 2)
return 1;
if (strcmp(argv[1], "depends") == 0) {
printf("ccan/ilog\n"
"ccan/short_types\n"
"ccan/str\n"
"ccan/tcon\n"
"ccan/typesafe_cb\n");
return 0;
}
return 1;
}
|
