/usr/include/xercesc/util/ValueVectorOf.c is in libxerces-c-dev 3.1.1-5.
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 287 288 289 290 291 292 293 294 295 | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*
* $Id: ValueVectorOf.c 676911 2008-07-15 13:27:32Z amassari $
*/
// ---------------------------------------------------------------------------
// Includes
// ---------------------------------------------------------------------------
#if defined(XERCES_TMPLSINC)
#include <xercesc/util/ValueVectorOf.hpp>
#endif
#include <string.h>
XERCES_CPP_NAMESPACE_BEGIN
// ---------------------------------------------------------------------------
// ValueVectorOf: Constructors and Destructor
// ---------------------------------------------------------------------------
template <class TElem>
ValueVectorOf<TElem>::ValueVectorOf(const XMLSize_t maxElems,
MemoryManager* const manager,
const bool toCallDestructor) :
fCallDestructor(toCallDestructor)
, fCurCount(0)
, fMaxCount(maxElems)
, fElemList(0)
, fMemoryManager(manager)
{
fElemList = (TElem*) fMemoryManager->allocate
(
fMaxCount * sizeof(TElem)
); //new TElem[fMaxCount];
memset(fElemList, 0, fMaxCount * sizeof(TElem));
}
template <class TElem>
ValueVectorOf<TElem>::ValueVectorOf(const ValueVectorOf<TElem>& toCopy) :
XMemory(toCopy)
, fCallDestructor(toCopy.fCallDestructor)
, fCurCount(toCopy.fCurCount)
, fMaxCount(toCopy.fMaxCount)
, fElemList(0)
, fMemoryManager(toCopy.fMemoryManager)
{
fElemList = (TElem*) fMemoryManager->allocate
(
fMaxCount * sizeof(TElem)
); //new TElem[fMaxCount];
memset(fElemList, 0, fMaxCount * sizeof(TElem));
for (XMLSize_t index = 0; index < fCurCount; index++)
fElemList[index] = toCopy.fElemList[index];
}
template <class TElem> ValueVectorOf<TElem>::~ValueVectorOf()
{
if (fCallDestructor) {
for (XMLSize_t index=fMaxCount; index > 0; index--)
fElemList[index-1].~TElem();
}
fMemoryManager->deallocate(fElemList); //delete [] fElemList;
}
// ---------------------------------------------------------------------------
// ValueVectorOf: Operators
// ---------------------------------------------------------------------------
template <class TElem> ValueVectorOf<TElem>&
ValueVectorOf<TElem>::operator=(const ValueVectorOf<TElem>& toAssign)
{
if (this == &toAssign)
return *this;
// Reallocate if required
if (fMaxCount < toAssign.fCurCount)
{
fMemoryManager->deallocate(fElemList); //delete [] fElemList;
fElemList = (TElem*) fMemoryManager->allocate
(
toAssign.fMaxCount * sizeof(TElem)
); //new TElem[toAssign.fMaxCount];
fMaxCount = toAssign.fMaxCount;
}
fCurCount = toAssign.fCurCount;
for (XMLSize_t index = 0; index < fCurCount; index++)
fElemList[index] = toAssign.fElemList[index];
return *this;
}
// ---------------------------------------------------------------------------
// ValueVectorOf: Element management
// ---------------------------------------------------------------------------
template <class TElem> void ValueVectorOf<TElem>::addElement(const TElem& toAdd)
{
ensureExtraCapacity(1);
fElemList[fCurCount++] = toAdd;
}
template <class TElem> void ValueVectorOf<TElem>::
setElementAt(const TElem& toSet, const XMLSize_t setAt)
{
if (setAt >= fCurCount)
ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, fMemoryManager);
fElemList[setAt] = toSet;
}
template <class TElem> void ValueVectorOf<TElem>::
insertElementAt(const TElem& toInsert, const XMLSize_t insertAt)
{
if (insertAt == fCurCount)
{
addElement(toInsert);
return;
}
if (insertAt > fCurCount)
ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, fMemoryManager);
// Make room for the newbie
ensureExtraCapacity(1);
for (XMLSize_t index = fCurCount; index > insertAt; index--)
fElemList[index] = fElemList[index-1];
// And stick it in and bump the count
fElemList[insertAt] = toInsert;
fCurCount++;
}
template <class TElem> void ValueVectorOf<TElem>::
removeElementAt(const XMLSize_t removeAt)
{
if (removeAt >= fCurCount)
ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, fMemoryManager);
// Copy down every element above remove point
for (XMLSize_t index = removeAt; index < fCurCount-1; index++)
fElemList[index] = fElemList[index+1];
// And bump down count
fCurCount--;
}
template <class TElem> void ValueVectorOf<TElem>::removeAllElements()
{
fCurCount = 0;
}
template <class TElem>
bool ValueVectorOf<TElem>::containsElement(const TElem& toCheck,
const XMLSize_t startIndex) {
for (XMLSize_t i = startIndex; i < fCurCount; i++) {
if (fElemList[i] == toCheck) {
return true;
}
}
return false;
}
// ---------------------------------------------------------------------------
// ValueVectorOf: Getter methods
// ---------------------------------------------------------------------------
template <class TElem> const TElem& ValueVectorOf<TElem>::
elementAt(const XMLSize_t getAt) const
{
if (getAt >= fCurCount)
ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, fMemoryManager);
return fElemList[getAt];
}
template <class TElem> TElem& ValueVectorOf<TElem>::
elementAt(const XMLSize_t getAt)
{
if (getAt >= fCurCount)
ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, fMemoryManager);
return fElemList[getAt];
}
template <class TElem> XMLSize_t ValueVectorOf<TElem>::curCapacity() const
{
return fMaxCount;
}
template <class TElem> XMLSize_t ValueVectorOf<TElem>::size() const
{
return fCurCount;
}
template <class TElem>
MemoryManager* ValueVectorOf<TElem>::getMemoryManager() const
{
return fMemoryManager;
}
// ---------------------------------------------------------------------------
// ValueVectorOf: Miscellaneous
// ---------------------------------------------------------------------------
template <class TElem> void ValueVectorOf<TElem>::
ensureExtraCapacity(const XMLSize_t length)
{
XMLSize_t newMax = fCurCount + length;
if (newMax > fMaxCount)
{
// Avoid too many reallocations by expanding by a percentage
XMLSize_t minNewMax = (XMLSize_t)((double)fCurCount * 1.25);
if (newMax < minNewMax)
newMax = minNewMax;
TElem* newList = (TElem*) fMemoryManager->allocate
(
newMax * sizeof(TElem)
); //new TElem[newMax];
for (XMLSize_t index = 0; index < fCurCount; index++)
newList[index] = fElemList[index];
fMemoryManager->deallocate(fElemList); //delete [] fElemList;
fElemList = newList;
fMaxCount = newMax;
}
}
template <class TElem> const TElem* ValueVectorOf<TElem>::rawData() const
{
return fElemList;
}
// ---------------------------------------------------------------------------
// ValueVectorEnumerator: Constructors and Destructor
// ---------------------------------------------------------------------------
template <class TElem> ValueVectorEnumerator<TElem>::
ValueVectorEnumerator( ValueVectorOf<TElem>* const toEnum
, const bool adopt) :
fAdopted(adopt)
, fCurIndex(0)
, fToEnum(toEnum)
{
}
template <class TElem> ValueVectorEnumerator<TElem>::~ValueVectorEnumerator()
{
if (fAdopted)
delete fToEnum;
}
// ---------------------------------------------------------------------------
// ValueVectorEnumerator: Enum interface
// ---------------------------------------------------------------------------
template <class TElem> bool
ValueVectorEnumerator<TElem>::hasMoreElements() const
{
if (fCurIndex >= fToEnum->size())
return false;
return true;
}
template <class TElem> TElem& ValueVectorEnumerator<TElem>::nextElement()
{
return fToEnum->elementAt(fCurIndex++);
}
template <class TElem> void ValueVectorEnumerator<TElem>::Reset()
{
fCurIndex = 0;
}
XERCES_CPP_NAMESPACE_END
|