/usr/include/crystalspace-2.0/csutil/scfstrset.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 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 | /*
Copyright (C) 2003 by Anders Stenberg
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.
*/
#ifndef __CS_SCFSTRSET_H__
#define __CS_SCFSTRSET_H__
/**\file
* Implementation for iStringSet
*/
#include "csextern.h"
#include "csutil/scf_implementation.h"
#include "csutil/strset.h"
#include "iutil/strset.h"
// For Clear()
#include "csutil/deprecated_warn_off.h"
namespace CS
{
/**
* The string set is a collection of unique strings. Each string has an ID
* number. The most important operation is to request a string, which means to
* return the ID for the string, adding it to the collection if not already
* present. This is useful when you need to work with strings but want the
* performance characteristics of simple numeric comparisons. Rather than
* performing string comparisons, you instead compare the numeric string ID's.
*
* Instances of the set are locked are for concurrent accesses.
*/
template<typename IF>
class ScfStringSet : public scfImplementation1<ScfStringSet<IF>, IF>
{
private:
Utility::StringSet<typename IF::TagType, true> set;
typedef StringID<typename IF::TagType> StringIDType;
typedef scfImplementation1<ScfStringSet<IF>, IF> scfImplementationType_;
public:
/// Constructor.
ScfStringSet (size_t size = 23)
: scfImplementationType_ (this), set(size)
{ }
/// Destructor.
virtual ~ScfStringSet()
{ }
/**
* Request the numeric ID for the given string.
* \return The ID of the string.
* \remarks Creates a new ID if the string is not yet present in the set,
* else returns the previously assigned ID.
*/
virtual StringIDType Request(const char* s)
{ return set.Request(s); }
/**
* Request the string corresponding to the given ID.
* \return Null if the string has not been requested (yet), else the string
* corresponding to the ID.
*/
virtual const char* Request(StringIDType id) const
{ return set.Request(id); }
/**
* Check if the set contains a particular string.
*/
virtual bool Contains(char const* s) const
{ return set.Contains(s); }
/**
* Check if the set contains a string with a particular ID.
* \remarks This is rigidly equivalent to
* <tt>return Request(id) != NULL</tt>, but more idomatic.
*/
virtual bool Contains(StringIDType id) const
{ return set.Contains(id); }
/**
* Remove specified string.
* \return True if a matching string was in thet set; else false.
*/
virtual bool Delete(char const* s)
{ return set.Delete(s); }
/**
* Remove a string with the specified ID.
* \return True if a matching string was in thet set; else false.
*/
virtual bool Delete(StringIDType id)
{ return set.Delete(id); }
/**
* Remove all stored strings. When new strings are registered again, new
* ID values will be used; the old ID's will not be re-used.
*/
virtual void Empty()
{ set.Empty(); }
/**
* Remove all stored strings.
*/
virtual void Clear()
{ Empty(); }
/// Get the number of elements in the hash.
virtual size_t GetSize () const
{ return set.GetSize(); }
/**
* Return true if the hash is empty.
* \remarks Rigidly equivalent to <tt>return GetSize() == 0</tt>, but more
* idiomatic.
*/
virtual bool IsEmpty() const
{ return set.IsEmpty(); }
/**
* Return an iterator for the set which iterates over all strings.
* \warning Modifying the set while you have open iterators will result
* undefined behaviour.
* \warning The iterator will <b>not</b> respect locking of the string set!
*/
typename Utility::StringSet<typename IF::TagType, true>::GlobalIterator GetIterator () const
{ return set.GetIterator(); }
};
} // namespace CS
typedef CS::ScfStringSet<iStringSet> csScfStringSet;
#include "csutil/deprecated_warn_on.h"
#endif // __CS_SCFSTRSET_H__
|