/* * 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 568078 2007-08-21 11:43:25Z amassari $ */ // --------------------------------------------------------------------------- // Includes // --------------------------------------------------------------------------- #if defined(XERCES_TMPLSINC) #include #endif #include XERCES_CPP_NAMESPACE_BEGIN // --------------------------------------------------------------------------- // ValueVectorOf: Constructors and Destructor // --------------------------------------------------------------------------- template ValueVectorOf::ValueVectorOf(const unsigned int 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 ValueVectorOf::ValueVectorOf(const ValueVectorOf& 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 (unsigned int index = 0; index < fCurCount; index++) fElemList[index] = toCopy.fElemList[index]; } template ValueVectorOf::~ValueVectorOf() { if (fCallDestructor) { for (int index= fMaxCount - 1; index >= 0; index--) fElemList[index].~TElem(); } fMemoryManager->deallocate(fElemList); //delete [] fElemList; } // --------------------------------------------------------------------------- // ValueVectorOf: Operators // --------------------------------------------------------------------------- template ValueVectorOf& ValueVectorOf::operator=(const ValueVectorOf& 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 (unsigned int index = 0; index < fCurCount; index++) fElemList[index] = toAssign.fElemList[index]; return *this; } // --------------------------------------------------------------------------- // ValueVectorOf: Element management // --------------------------------------------------------------------------- template void ValueVectorOf::addElement(const TElem& toAdd) { ensureExtraCapacity(1); fElemList[fCurCount] = toAdd; fCurCount++; } template void ValueVectorOf:: setElementAt(const TElem& toSet, const unsigned int setAt) { if (setAt >= fCurCount) ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, fMemoryManager); fElemList[setAt] = toSet; } template void ValueVectorOf:: insertElementAt(const TElem& toInsert, const unsigned int insertAt) { if (insertAt == fCurCount) { addElement(toInsert); return; } if (insertAt > fCurCount) ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, fMemoryManager); // Make room for the newbie ensureExtraCapacity(1); for (unsigned int index = fCurCount; index > insertAt; index--) fElemList[index] = fElemList[index-1]; // And stick it in and bump the count fElemList[insertAt] = toInsert; fCurCount++; } template void ValueVectorOf:: removeElementAt(const unsigned int removeAt) { if (removeAt >= fCurCount) ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, fMemoryManager); if (removeAt == fCurCount-1) { fCurCount--; return; } // Copy down every element above remove point for (unsigned int index = removeAt; index < fCurCount-1; index++) fElemList[index] = fElemList[index+1]; // And bump down count fCurCount--; } template void ValueVectorOf::removeAllElements() { fCurCount = 0; } template bool ValueVectorOf::containsElement(const TElem& toCheck, const unsigned int startIndex) { for (unsigned int i = startIndex; i < fCurCount; i++) { if (fElemList[i] == toCheck) { return true; } } return false; } // --------------------------------------------------------------------------- // ValueVectorOf: Getter methods // --------------------------------------------------------------------------- template const TElem& ValueVectorOf:: elementAt(const unsigned int getAt) const { if (getAt >= fCurCount) ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, fMemoryManager); return fElemList[getAt]; } template TElem& ValueVectorOf:: elementAt(const unsigned int getAt) { if (getAt >= fCurCount) ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, fMemoryManager); return fElemList[getAt]; } template unsigned int ValueVectorOf::curCapacity() const { return fMaxCount; } template unsigned int ValueVectorOf::size() const { return fCurCount; } template MemoryManager* ValueVectorOf::getMemoryManager() const { return fMemoryManager; } // --------------------------------------------------------------------------- // ValueVectorOf: Miscellaneous // --------------------------------------------------------------------------- template void ValueVectorOf:: ensureExtraCapacity(const unsigned int length) { unsigned int newMax = fCurCount + length; if (newMax <= fMaxCount) return; // Avoid too many reallocations by expanding by a percentage unsigned int minNewMax = (unsigned int)((double)fCurCount * 1.25); if (newMax < minNewMax) newMax = minNewMax; TElem* newList = (TElem*) fMemoryManager->allocate ( newMax * sizeof(TElem) ); //new TElem[newMax]; for (unsigned int index = 0; index < fCurCount; index++) newList[index] = fElemList[index]; fMemoryManager->deallocate(fElemList); //delete [] fElemList; fElemList = newList; fMaxCount = newMax; } template const TElem* ValueVectorOf::rawData() const { return fElemList; } // --------------------------------------------------------------------------- // ValueVectorEnumerator: Constructors and Destructor // --------------------------------------------------------------------------- template ValueVectorEnumerator:: ValueVectorEnumerator( ValueVectorOf* const toEnum , const bool adopt) : fAdopted(adopt) , fCurIndex(0) , fToEnum(toEnum) { } template ValueVectorEnumerator::~ValueVectorEnumerator() { if (fAdopted) delete fToEnum; } // --------------------------------------------------------------------------- // ValueVectorEnumerator: Enum interface // --------------------------------------------------------------------------- template bool ValueVectorEnumerator::hasMoreElements() const { if (fCurIndex >= fToEnum->size()) return false; return true; } template TElem& ValueVectorEnumerator::nextElement() { return fToEnum->elementAt(fCurIndex++); } template void ValueVectorEnumerator::Reset() { fCurIndex = 0; } XERCES_CPP_NAMESPACE_END