/usr/include/crystalspace-2.0/csutil/scfstringarray.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 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 | /*
Crystal Space String Array SCF interface
Copyright (C) 2003 by Jorrit Tyberghein
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_SCFSTRINGARRAY_H__
#define __CS_SCFSTRINGARRAY_H__
/**\file
* Implementation for iStringArray
*/
#include "csextern.h"
#include "csutil/scf_implementation.h"
#include "csutil/stringarray.h"
#include "iutil/stringarray.h"
/// This class is a thin wrapper around csStringArray with SCF capability
class scfStringArray : public scfImplementation1<scfStringArray,
iStringArray>
{
csStringArray v;
public:
/// Create a iStringArray from scratch.
scfStringArray (int limit = 16, int delta = 16)
: scfImplementationType (this), v (limit, delta)
{ }
/// Create a string array by copying from a csStringArray
scfStringArray (const csStringArray& other)
: scfImplementationType (this), v (other)
{ }
/// Destructor - nothing to do.
virtual ~scfStringArray ()
{ }
/// Get array length.
virtual size_t GetSize () const
{
return v.GetSize ();
}
/// Push a string onto the stack.
virtual void Push (char const *value)
{
v.Push ((char*)value);
}
/**
* Pop an element from tail end of array.
* \remarks Caller is responsible for invoking delete[] on the returned
* string when no longer needed.
*/
virtual char *Pop ()
{
return v.Pop ();
}
/// Get a particular string from the array.
virtual char const *Get (size_t n) const
{
return v.Get (n);
}
/**
* Find a string, case-sensitive.
* \return csArrayItemNotFound if not found, else item index.
* \remarks Works with sorted and unsorted arrays, but FindSortedKey() is
* faster on sorted arrays.
*/
virtual size_t Find (const char *value) const
{
return v.Find (value);
}
/**
* Find a string, case-insensitive.
* \return csArrayItemNotFound if not found, else item index.
* \remarks Works with sorted and unsorted arrays, but FindSortedKey() is
* faster on sorted arrays.
*/
virtual size_t FindCaseInsensitive (const char *value) const
{
return v.FindCaseInsensitive (value);
}
/**
* Find an element based on some key, using a comparison function.
* \return csArrayItemNotFound if not found, else item index.
* \remarks The array must be sorted.
*/
virtual size_t FindSortedKey (const char *value) const
{
return v.FindSortedKey ((char*)value);
}
/**
* Alias for Find() and FindCaseInsensitive().
* \param str String to look for in array.
* \param case_sensitive If true, consider case when performing comparison.
* (default: yes)
* \return csArrayItemNotFound if not found, else item index.
* \remarks Works with sorted and unsorted arrays, but FindSortedKey() is
* faster on sorted arrays.
* <p>
* \remarks Some people find Contains() more idiomatic than Find().
*/
virtual size_t Contains (const char* str, bool case_sensitive = true) const
{
return v.Contains (str, case_sensitive);
}
/**
* Sort array.
* \param case_sensitive If true, consider case when performing comparison.
* (default: yes)
*/
virtual void Sort (bool case_sensitive = true)
{
v.Sort (case_sensitive);
}
/// Delete string \c n from the array.
virtual bool DeleteIndex (size_t n)
{
return v.DeleteIndex (n);
}
/// Insert a string before entry \c n in the array.
virtual bool Insert (size_t n, char const *value)
{
return v.Insert (n, (char*)value);
}
/// Remove all strings from the array, but does not release the memory allocated.
virtual void Empty ()
{
v.Empty ();
}
/**
* Return true if the array is empty.
* \remarks Rigidly equivalent to <tt>return GetSize() == 0</tt>, but more
* idiomatic.
*/
virtual bool IsEmpty () const
{
return v.IsEmpty ();
}
/**
* Insert or reset the element with index \c n.
* If the size of the array is smaller than \c n then it will be resized.
*/
virtual void Put (size_t n, const char* value)
{
v.Put (n, value);
}
};
#endif // __CS_SCFSTRINGARRAY_H__
|