This file is indexed.

/usr/include/KF5/wtf/HashSet.h is in libkf5kjs-dev 5.28.0-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
/*
 * Copyright (C) 2005, 2006, 2007, 2008 Apple Inc. All rights reserved.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 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
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public License
 * along with this library; see the file COPYING.LIB.  If not, write to
 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 * Boston, MA 02110-1301, USA.
 *
 */

#ifndef WTF_HashSet_h
#define WTF_HashSet_h

#include <wtf/HashTable.h>
#include <kjs/CommonIdentifiers.h>

namespace WTF
{

template<typename Value, typename HashFunctions, typename Traits> class HashSet;
template<typename Value, typename HashFunctions, typename Traits>
void deleteAllValues(const HashSet<Value, HashFunctions, Traits> &);

template<typename T> struct IdentityExtractor;

template<typename ValueArg, typename HashArg = typename DefaultHash<ValueArg>::Hash,
         typename TraitsArg = HashTraits<ValueArg> > class HashSet
{
private:
    typedef HashArg HashFunctions;
    typedef TraitsArg ValueTraits;

public:
    typedef typename ValueTraits::TraitType ValueType;

private:
    typedef HashTable<ValueType, ValueType, IdentityExtractor<ValueType>,
            HashFunctions, ValueTraits, ValueTraits> HashTableType;

public:
    typedef HashTableIteratorAdapter<HashTableType, ValueType> iterator;
    typedef HashTableConstIteratorAdapter<HashTableType, ValueType> const_iterator;

    void swap(HashSet &);

    int size() const;
    int capacity() const;
    bool isEmpty() const;

    iterator begin();
    iterator end();
    const_iterator begin() const;
    const_iterator end() const;

    iterator find(const ValueType &);
    const_iterator find(const ValueType &) const;
    bool contains(const ValueType &) const;

    // An alternate version of find() that finds the object by hashing and comparing
    // with some other type, to avoid the cost of type conversion. HashTranslator
    // must have the following function members:
    //   static unsigned hash(const T&);
    //   static bool equal(const ValueType&, const T&);
    template<typename T, typename HashTranslator> iterator find(const T &);
    template<typename T, typename HashTranslator> const_iterator find(const T &) const;
    template<typename T, typename HashTranslator> bool contains(const T &) const;

    // The return value is a pair of an interator to the new value's location,
    // and a bool that is true if an new entry was added.
    pair<iterator, bool> add(const ValueType &);

    // An alternate version of add() that finds the object by hashing and comparing
    // with some other type, to avoid the cost of type conversion if the object is already
    // in the table. HashTranslator must have the following methods:
    //   static unsigned hash(const T&);
    //   static bool equal(const ValueType&, const T&);
    //   static translate(ValueType&, const T&, unsigned hashCode);
    template<typename T, typename HashTranslator> pair<iterator, bool> add(const T &);

    void remove(const ValueType &);
    void remove(iterator);
    void clear();

private:
    friend void deleteAllValues<>(const HashSet &);

    HashTableType m_impl;
};

template<typename T> struct IdentityExtractor {
    static const T &extract(const T &t)
    {
        return t;
    }
};

template<typename ValueType, typename ValueTraits, typename T, typename Translator>
struct HashSetTranslatorAdapter {
    static unsigned hash(const T &key)
    {
        return Translator::hash(key);
    }
    static bool equal(const ValueType &a, const T &b)
    {
        return Translator::equal(a, b);
    }
    static void translate(ValueType &location, const T &key, const T &, unsigned hashCode)
    {
        Translator::translate(location, key, hashCode);
    }
};

template<typename T, typename U, typename V>
inline void HashSet<T, U, V>::swap(HashSet &other)
{
    m_impl.swap(other.m_impl);
}

template<typename T, typename U, typename V>
inline int HashSet<T, U, V>::size() const
{
    return m_impl.size();
}

template<typename T, typename U, typename V>
inline int HashSet<T, U, V>::capacity() const
{
    return m_impl.capacity();
}

template<typename T, typename U, typename V>
inline bool HashSet<T, U, V>::isEmpty() const
{
    return m_impl.isEmpty();
}

template<typename T, typename U, typename V>
inline typename HashSet<T, U, V>::iterator HashSet<T, U, V>::begin()
{
    return m_impl.begin();
}

template<typename T, typename U, typename V>
inline typename HashSet<T, U, V>::iterator HashSet<T, U, V>::end()
{
    return m_impl.end();
}

template<typename T, typename U, typename V>
inline typename HashSet<T, U, V>::const_iterator HashSet<T, U, V>::begin() const
{
    return m_impl.begin();
}

template<typename T, typename U, typename V>
inline typename HashSet<T, U, V>::const_iterator HashSet<T, U, V>::end() const
{
    return m_impl.end();
}

template<typename T, typename U, typename V>
inline typename HashSet<T, U, V>::iterator HashSet<T, U, V>::find(const ValueType &value)
{
    return m_impl.find(value);
}

template<typename T, typename U, typename V>
inline typename HashSet<T, U, V>::const_iterator HashSet<T, U, V>::find(const ValueType &value) const
{
    return m_impl.find(value);
}

template<typename T, typename U, typename V>
inline bool HashSet<T, U, V>::contains(const ValueType &value) const
{
    return m_impl.contains(value);
}

template<typename Value, typename HashFunctions, typename Traits>
template<typename T, typename Translator>
typename HashSet<Value, HashFunctions, Traits>::iterator
inline HashSet<Value, HashFunctions, Traits>::find(const T &value)
{
    typedef HashSetTranslatorAdapter<ValueType, ValueTraits, T, Translator> Adapter;
    return m_impl.template find<T, Adapter>(value);
}

template<typename Value, typename HashFunctions, typename Traits>
template<typename T, typename Translator>
typename HashSet<Value, HashFunctions, Traits>::const_iterator
inline HashSet<Value, HashFunctions, Traits>::find(const T &value) const
{
    typedef HashSetTranslatorAdapter<ValueType, ValueTraits, T, Translator> Adapter;
    return m_impl.template find<T, Adapter>(value);
}

template<typename Value, typename HashFunctions, typename Traits>
template<typename T, typename Translator>
inline bool HashSet<Value, HashFunctions, Traits>::contains(const T &value) const
{
    typedef HashSetTranslatorAdapter<ValueType, ValueTraits, T, Translator> Adapter;
    return m_impl.template contains<T, Adapter>(value);
}

template<typename T, typename U, typename V>
pair<typename HashSet<T, U, V>::iterator, bool> HashSet<T, U, V>::add(const ValueType &value)
{
    return m_impl.add(value);
}

template<typename Value, typename HashFunctions, typename Traits>
template<typename T, typename Translator>
pair<typename HashSet<Value, HashFunctions, Traits>::iterator, bool>
HashSet<Value, HashFunctions, Traits>::add(const T &value)
{
    typedef HashSetTranslatorAdapter<ValueType, ValueTraits, T, Translator> Adapter;
    return m_impl.template addPassingHashCode<T, T, Adapter>(value, value);
}

template<typename T, typename U, typename V>
inline void HashSet<T, U, V>::remove(iterator it)
{
    if (it.m_impl == m_impl.end()) {
        return;
    }
    m_impl.checkTableConsistency();
    m_impl.removeWithoutEntryConsistencyCheck(it.m_impl);
}

template<typename T, typename U, typename V>
inline void HashSet<T, U, V>::remove(const ValueType &value)
{
    remove(find(value));
}

template<typename T, typename U, typename V>
inline void HashSet<T, U, V>::clear()
{
    m_impl.clear();
}

template<typename ValueType, typename HashTableType>
void deleteAllValues(HashTableType &collection)
{
    typedef typename HashTableType::const_iterator iterator;
    iterator end = collection.end();
    for (iterator it = collection.begin(); it != end; ++it) {
        delete *it;
    }
}

template<typename T, typename U, typename V>
inline void deleteAllValues(const HashSet<T, U, V> &collection)
{
    deleteAllValues<typename HashSet<T, U, V>::ValueType>(collection.m_impl);
}

template<typename T, typename U, typename V, typename W>
inline void copyToVector(const HashSet<T, U, V> &collection, W &vector)
{
    typedef typename HashSet<T, U, V>::const_iterator iterator;

    vector.resize(collection.size());

    iterator it = collection.begin();
    iterator end = collection.end();
    for (unsigned i = 0; it != end; ++it, ++i) {
        vector[i] = *it;
    }
}

} // namespace WTF

using WTF::HashSet;

#endif /* WTF_HashSet_h */