-
Notifications
You must be signed in to change notification settings - Fork 0
/
ftrie.h
66 lines (51 loc) · 2.08 KB
/
ftrie.h
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
/*
ftrie.h
a new variant of a RADIX trie that uses multiple levels at each node
each node can have a 4-bit match, a 3-bit match, 2, or 1-bit
may seem awkward but wins due to cache effects :-)
send comments to vivek@unleashnetworks.com
*/
/*
The MIT License
Copyright (c) 2019 Unleash Networks. Trisul Network Analytics https://trisul.org
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#pragma once
#include <cinttypes>
#include "bitstring.h"
#include <vector>
#include <bitset>
#include <cassert>
template<std::size_t Nbits> struct bitlevel_t;
struct ptreearray_node_4_t
{
enum { NO_VALUE=0xffffffff } ;
ptreearray_node_4_t();
~ptreearray_node_4_t();
uint32_t node_value;
bitlevel_t<4> * bl4;
bitlevel_t<3> * bl3;
bitlevel_t<2> * bl2;
bitlevel_t<1> * bl1;
void insert(bits32_t::iterator &iter, uint32_t value);
uint32_t longest_match(const char * ipstr);
uint32_t longest_match(bits32_t::iterator &iter, uint32_t parentval);
void debugdump(int level);
void cleanup( std::vector<ptreearray_node_4_t*> * p);
bool isemptynode();
void collapse_leaves();
};