/usr/include/verbiste-0.1/verbiste/Trie.cpp is in libverbiste-dev 0.1.44-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 | /* $Id: Trie.cpp,v 1.16 2012/11/18 19:56:06 sarrazip Exp $
Trie.cpp - Tree structure for string storage
verbiste - French conjugation system
Copyright (C) 2003-2005 Pierre Sarrazin <http://sarrazip.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., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#include "Trie.h"
#include <assert.h>
#include <stdlib.h>
#include <list>
#include <iostream>
namespace verbiste {
///////////////////////////////////////////////////////////////////////////////
//
// Descriptor local class
//
//
template <class T>
Trie<T>::Descriptor::Descriptor(wchar_t u)
: unichar(u),
inferiorRow(NULL),
userData(NULL)
{
}
template <class T>
Trie<T>::Descriptor::~Descriptor()
{
assert(inferiorRow == NULL);
}
template <class T>
void
Trie<T>::Descriptor::recursiveDelete(bool deleteUserData)
{
if (deleteUserData)
{
delete userData;
userData = NULL;
}
if (inferiorRow != NULL)
{
inferiorRow->recursiveDelete(deleteUserData);
delete inferiorRow;
inferiorRow = NULL;
}
}
template <class T>
size_t
Trie<T>::Descriptor::computeMemoryConsumption() const
{
return sizeof(*this) + (inferiorRow != NULL ? inferiorRow->computeMemoryConsumption() : 0);
}
///////////////////////////////////////////////////////////////////////////////
//
// Row local class
//
//
template <class T>
Trie<T>::Row::~Row()
{
assert(elements.size() == 0); // recursiveDelete() should have been called
}
template <class T>
size_t
Trie<T>::Row::computeMemoryConsumption() const
{
size_t sum = 0;
for (typename DescVec::const_iterator it = elements.begin(); it != elements.end(); ++it)
sum += (*it)->computeMemoryConsumption();
return sizeof(*this) + sum;
}
template <class T>
void
Trie<T>::Row::recursiveDelete(bool deleteUserData)
{
for (typename DescVec::iterator it = elements.begin(); it != elements.end(); it++)
{
Descriptor *d = *it;
d->recursiveDelete(deleteUserData);
delete d;
}
elements.clear();
}
template <class T>
typename Trie<T>::Descriptor *
Trie<T>::Row::find(wchar_t unichar)
{
for (typename DescVec::iterator it = elements.begin(); it != elements.end(); it++)
{
assert(*it != NULL);
if ((*it)->unichar == unichar)
return *it;
}
return NULL;
}
template <class T>
typename Trie<T>::Descriptor &
Trie<T>::Row::operator [] (wchar_t unichar)
{
Descriptor *pd = find(unichar);
if (pd != NULL)
return *pd;
pd = new Descriptor(unichar);
elements.push_back(pd);
assert(pd->unichar == unichar);
return *pd;
}
///////////////////////////////////////////////////////////////////////////////
//
// Trie class
//
//
template <class T>
Trie<T>::Trie(bool _userDataFromNew)
: emptyKeyUserData(NULL),
firstRow(new Row()),
userDataFromNew(_userDataFromNew)
{
}
template <class T>
Trie<T>::~Trie()
{
if (userDataFromNew)
delete emptyKeyUserData;
firstRow->recursiveDelete(userDataFromNew);
delete firstRow;
}
template <class T>
T *
Trie<T>::get(const std::wstring &key) const
{
if (emptyKeyUserData != NULL)
onFoundPrefixWithUserData(key, 0, emptyKeyUserData);
if (key.empty())
return emptyKeyUserData;
Descriptor *d = const_cast<Trie<T> *>(this)->getDesc(firstRow, key, 0, false, true);
return (d != NULL ? d->userData : NULL);
}
template <class T>
T **
Trie<T>::getUserDataPointer(const std::wstring &key)
{
if (key.empty())
return &emptyKeyUserData;
// Get descriptor associated with 'key' (and create a new entry
// if the key is not known).
//
Descriptor *d = getDesc(firstRow, key, 0, true, false);
assert(d != NULL);
return &d->userData;
}
template <class T>
typename Trie<T>::Descriptor *
Trie<T>::getDesc(Row *row,
const std::wstring &key,
std::wstring::size_type index,
bool create,
bool callFoundPrefixCallback)
{
assert(row != NULL);
assert(index < key.length());
wchar_t unichar = key[index]; // the "expected" character
assert(unichar != '\0');
Descriptor *pd = row->find(unichar);
static bool trieTrace = getenv("TRACE") != NULL;
if (trieTrace)
std::wcout << "getDesc(row=" << row
<< ", key='" << key << "' (len=" << key.length()
<< "), index=" << index
<< ", create=" << create
<< ", call=" << callFoundPrefixCallback
<< "): unichar=" << unichar << ", pd=" << pd << "\n";
if (pd == NULL) // if expected character not found
{
if (!create)
return NULL;
Descriptor &newDesc = (*row)[unichar];
assert(row->find(unichar) != NULL);
assert(row->find(unichar) == &newDesc);
if (index + 1 == key.length()) // if last char of string
return &newDesc;
// Create new descriptor that points to a new inferior row:
newDesc.inferiorRow = new Row();
assert(row->find(unichar)->inferiorRow == newDesc.inferiorRow);
return getDesc(newDesc.inferiorRow,
key, index + 1, create, callFoundPrefixCallback);
}
if (trieTrace)
std::wcout << "getDesc: userData=" << pd->userData
<< ", inferiorRow=" << pd->inferiorRow
<< "\n";
if (callFoundPrefixCallback && pd->userData != NULL)
onFoundPrefixWithUserData(key, index + 1, pd->userData); // virtual call
if (index + 1 == key.length()) // if reached end of key
{
if (trieTrace)
std::wcout << "getDesc: reached end of key\n";
return pd;
}
if (pd->inferiorRow == NULL) // if pd is a leaf:
{
if (!create)
return NULL; // not found
pd->inferiorRow = new Row();
}
return getDesc(pd->inferiorRow,
key, index + 1, create, callFoundPrefixCallback);
}
template <class T>
size_t
Trie<T>::computeMemoryConsumption() const
{
return sizeof(*this) + (firstRow != NULL ? firstRow->computeMemoryConsumption() : 0);
}
} // namespace verbiste
|