blob: 93bf88c136ba2d81029cb88b2dd9f5b96516f870 (
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
|
/* dctrl-tools - Debian control file inspection tools
Copyright (C) 2003 Antti-Juhani Kaijanaho
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef FIELDTRIE_H
#define FIELDTRIE_H
#include <limits.h>
#include <stddef.h>
struct field_bucket {
char const * name;
size_t namelen;
size_t inx;
struct field_bucket * next;
};
struct fieldtrie_private {
size_t nextfree;
/* A one-level trie listing all field names occurring in the
* atomic predicates. */
struct field_bucket * fields[UCHAR_MAX];
};
typedef struct fieldtrie_private fieldtrie_t;
void fieldtrie_init(fieldtrie_t *);
// case-insensitive
size_t fieldtrie_insert(fieldtrie_t *, char const *);
// case-insensitive
// (size_t)(-1) if failed
size_t fieldtrie_lookup(fieldtrie_t *, char const *, size_t n);
void fieldtrie_clear(fieldtrie_t *);
static inline
size_t fieldtrie_count(fieldtrie_t * ft) { return ft->nextfree; }
#endif /* FIELDTRIE_H */
|
