This file is indexed.

/usr/include/claw/impl/trie.tpp is in libclaw-dev 1.7.4-2.

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
/*
  CLAW - a C++ Library Absolutely Wonderful

  CLAW is a free library without any particular aim but being useful to 
  anyone.

  Copyright (C) 2005-2011 Julien Jorge

  This library is free software; you can redistribute it and/or
  modify it under the terms of the GNU Lesser General Public
  License as published by the Free Software Foundation; either
  version 2.1 of the License, or (at your option) any later version.

  This library 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
  Lesser General Public License for more details.

  You should have received a copy of the GNU Lesser General Public
  License along with this library; if not, write to the Free Software
  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

  contact: julien.jorge@gamned.org
*/
/**
 * \file trie.tpp
 * \brief Implementation of the trie structure.
 * \author Julien Jorge
 */
#include <iostream>
#include <cassert>

//*************************** trie::trie_node *********************************


/*---------------------------------------------------------------------------*/
/**
 * \brief Trie node constructor.
 * \param val Value of the node.
 * \param c Count for the node.
 * \post (value==val) && (count==c) 
 */
template<class T, class Comp>
claw::trie<T, Comp>::trie_node::trie_node( const T& val,
                                           unsigned int c /*= 0*/ ) 
  : claw::binary_node< typename claw::trie<T, Comp>::trie_node >(), value(val),
    count(0)
{

} // trie_node() [constructor]

/*---------------------------------------------------------------------------*/
/**
 * \brief Trie node copy constructor.
 * \param that Node to copy from.
 */
template<class T, class Comp>
claw::trie<T, Comp>::trie_node::trie_node( const trie_node& that )
  : claw::binary_node< typename claw::trie<T, Comp>::trie_node >(that), 
    value(that.value), count(that.count)
{ 

} // trie_node [copy constructor]

//********************************* trie **************************************

/*---------------------------------------------------------------------------*/
template<class T, class Comp>
typename claw::trie<T, Comp>::value_equal_to 
claw::trie<T, Comp>::s_value_equal_to;

/*---------------------------------------------------------------------------*/
/**
 * \brief Trie constructor.
 * \post empty()
 */
template<class T, class Comp>
claw::trie<T, Comp>::trie()
{
  m_size = 0;
  m_tree = NULL;

  assert(empty());
} // trie() [constructor]

/*---------------------------------------------------------------------------*/
/*
 * \brief Trie copy constructor.
 */
template<class T, class Comp>
claw::trie<T, Comp>::trie( const claw::trie<T, Comp>& that )
{
  if (that.m_tree)
    m_tree = new trie_node( *that.m_tree );
  else
    m_tree = NULL;

  m_size = that.m_size;
} // trie() [copy constructor]

/*---------------------------------------------------------------------------*/
/**
 * \brief Trie destructor.
 */
template<class T, class Comp>
claw::trie<T, Comp>::~trie()
{
  if (m_tree)
    delete m_tree;
} // ~trie() [destructor]

/*---------------------------------------------------------------------------*/
/**
 * \brief Gets size (words count) of the structure.
 */
template<class T, class Comp>
unsigned int claw::trie<T, Comp>::size() const 
{
  return m_size;
} // size()

/*---------------------------------------------------------------------------*/
/**
 * \brief Tell if the structure is empty or not.
 */
template<class T, class Comp>
bool claw::trie<T, Comp>::empty() const 
{
  return m_tree==NULL;
} // empty()

/*---------------------------------------------------------------------------*/
/**
 * \brief Clear the trie.
 * \post this->empty() == true
 */
template<class T, class Comp>
void claw::trie<T, Comp>::clear()
{
  if (m_tree)
    {
      delete m_tree;
      m_tree = NULL;
      m_size = 0;
    }
} // clear()

/*---------------------------------------------------------------------------*/
/**
 * \brief Add a word to the structure.
 * \remark Type requirements :
 *  - *InputIterator is T.
 * \param first First item of the word.
 * \param last Item just after the last to add.
 * \pre first != last
 * \post !empty() && count(first, last) == old(count(first, last)) + 1
 */
template<class T, class Comp>
template<class InputIterator>
void claw::trie<T, Comp>::insert(InputIterator first, InputIterator last)
{
  assert( first != last );

  trie_node_ptr* p = &m_tree;       // for tree search
  trie_node_ptr last_node = NULL;   // last node of the inserted word

  // Try to insert a maximum of items
  while ( *p && (first!=last) )
    if ( s_value_equal_to((*p)->value, *first) )
      {
        last_node = *p;
        p = & (*p)->right;
        ++first;
      }
    else
      p = & (*p)->left;
                
  // If we haven't inserted the full word, 
  // create the whole subtree.
  while (first != last)
    {
      *p = new trie_node(*first);
      last_node = *p;

      ++first;
      p = & (*p)->right;
    }

  ++(last_node->count);

  // Don't forget to increase words count.
  ++m_size;
} // insert()

/*---------------------------------------------------------------------------*/
/**
 * \brief Gets a word count.
 * \remark Type requirements :
 *  - *InputIterator is T.
 * \param first First item of the word.
 * \param last Item just after the last to find.
 * \pre first != last
 */
template<class T, class Comp>
template <class InputIterator>
unsigned int claw::trie<T, Comp>::count(InputIterator first,
                                        InputIterator last)
{
  assert( first != last );

  trie_node_ptr* p = & m_tree;      // for tree search
  trie_node_ptr last_node = NULL;   // last node of the word

  // Try to find the word
  while ( *p && (first!=last) )
    if ( s_value_equal_to((*p)->value, *first) )
      {
        last_node = *p;
        p = & (*p)->right;
        ++first;
      }
    else
      p = & (*p)->left;

  // found ?
  if (first==last)
    return last_node->count;
  else
    return 0;
} // count()