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 84 85 86 87 88 89 90 91 92 93 94 95
|
/*
* Copyright (c) 2002,2003 Robert Collins <rbtcollins@hotmail.com>
*
* 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, USA.
*
*/
#ifndef LIBTRIE_TRIENODE_H
#define LIBTRIE_TRIENODE_H
/* This is an internal header for libTrie.
* libTrie provides both C and C++
* bindings.
* libTrie itself is written in C++.
* For C bindings see Trei.h
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
/* C bindings */
#ifndef __cplusplus
/* C++ bindings */
#else
#include <sys/types.h>
#include <utility>
/* MinGW needs NULL definition */
#ifndef NULL
#define NULL 0
#endif
/* TODO: parameterize this to be more generic -
* i.e. M-ary internal node sizes etc
*/
class TrieCharTransform;
class TrieNode
{
public:
TrieNode();
~TrieNode();
TrieNode(TrieNode const &);
TrieNode &operator= (TrieNode const &);
/* Find a string.
* If found, return the private data.
* If not found, return NULL.
*/
_SQUID_INLINE_ void *find (char const *, size_t, TrieCharTransform *, bool const prefix) const;
/* Add a string.
* returns false if the string is already
* present or can't be added.
*/
bool add
(char const *, size_t, void *, TrieCharTransform *);
private:
/* 256-way Trie */
/* The char index into internal is an
* 8-bit prefix to a string in the trie.
* internal[0] is the terminal node for
* a string and may not be used
*/
TrieNode * internal[256];
/* If a string ends here, non NULL */
void *_privateData;
};
#endif /* __cplusplus */
#ifdef _USE_INLINE_
#include "TrieNode.cci"
#endif
#endif /* LIBTRIE_TRIENODE_H */
|