/usr/include/crystalspace-2.0/csutil/hashr.h is in libcrystalspace-dev 2.0+dfsg-1build1.
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 | /*
Copyright (C) 2003 by Jorrit Tyberghein
(C) 2003 by Frank Richter
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; if not, write to the Free
Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/**\file
* Reversible hash.
*/
#ifndef __CS_UTIL_HASHR_H__
#define __CS_UTIL_HASHR_H__
#include "csutil/hash.h"
/**\addtogroup util_containers
* @{ */
/// A csHash<> that maintains a reverse hash for indexing keys by values.
template <class T, class K = unsigned int>
class csHashReversible : public csHash<T, K>
{
csHash<K, T> reverse;
public:
/**
* Construct a hash table with an array of the given size,
* which for optimisation reasons should be a prime number.
*
* Grow_rate is the rate at which the hash table grows:
* Size doubles once there are size/grow_rate collisions.
* It will not grow after it reaches max_size.
*
* Here are a few primes: 7, 11, 19, 29, 59, 79, 101, 127, 151, 199, 251,
* 307, 401, 503, 809, 1009, 1499, 2003, 3001, 5003, 12263, 25247, 36923,
* 50119, 70951, 90313, 104707.
* For a bigger list go to http://www.utm.edu/research/primes/
*/
csHashReversible (int size = 23, int grow_rate = 5, int max_size = 20000) :
csHash<T, K> (size, grow_rate, max_size),
reverse (size, grow_rate, max_size)
{
}
/**
* Add an element to the hash and reverse table.
*/
void Put (const K& key, const T &value)
{
csHash<T, K>::Put (key, value);
reverse.Put (value, key);
}
/**
* Add an element to the hash and to the reverse table.
* @remarks
*/
void PutUnique (const K& key, const T &value)
{
csHash<T, K>::PutUnique (key, value);
reverse.PutUnique (value, key);
}
/**
* Delete all the elements matching the given key and value.
*/
bool Delete (const K& key, const T &value)
{
bool ret = csHash<T, K>::Delete (key, value);
ret &= reverse.Delete (value, key);
return ret;
}
/**
* Delete all the elements matching the given key.
*/
bool DeleteAll (const K& key)
{
csArray<T> values = csHash<T,K>::GetAll (key);
bool ret = csHash<T,K>::DeleteAll (key);
for(size_t i=0; i<values.GetSize (); i++)
{
ret &= reverse.Delete (values[i], key);
}
return ret;
}
/// Delete all the elements.
void DeleteAll ()
{
csHash<T,K>::DeleteAll ();
reverse.DeleteAll ();
}
/**
* Get a pointer to the first key matching the given value,
* or 0 if there is none.
*/
const K* GetKeyPointer (const T& key) const
{
return reverse.GetElementPointer (key);
}
/**
* Get the first key matching the given value, or \p fallback if there is
* none.
*/
const K& GetKey (const T& key, const K& fallback) const
{
return reverse.Get (key, fallback);
}
};
/** @} */
#endif // __CS_UTIL_HASHR_H__
|