/* * The Apache Software License, Version 1.1 * * Copyright (c) 1999-2002 The Apache Software Foundation. All rights * reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in * the documentation and/or other materials provided with the * distribution. * * 3. The end-user documentation included with the redistribution, * if any, must include the following acknowledgment: * "This product includes software developed by the * Apache Software Foundation (http://www.apache.org/)." * Alternately, this acknowledgment may appear in the software itself, * if and wherever such third-party acknowledgments normally appear. * * 4. The names "Xerces" and "Apache Software Foundation" must * not be used to endorse or promote products derived from this * software without prior written permission. For written * permission, please contact apache\@apache.org. * * 5. Products derived from this software may not be called "Apache", * nor may "Apache" appear in their name, without prior written * permission of the Apache Software Foundation. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * ==================================================================== * * This software consists of voluntary contributions made by many * individuals on behalf of the Apache Software Foundation, and was * originally based on software copyright (c) 1999, International * Business Machines, Inc., http://www.ibm.com . For more information * on the Apache Software Foundation, please see * . */ /* * $Log: RefVectorOf.hpp,v $ * Revision 1.2 2002/02/05 13:11:06 tng * [Bug 6114] Memory leaks on iDOM getElementsByTagName(). * * Revision 1.1.1.1 2002/02/01 22:22:12 peiyongz * sane_include * * Revision 1.5 2001/06/25 13:01:52 knoaman * Add constraint checking on elements in complex types to prevent same * element names from having different definitions - use substitueGroups. * * Revision 1.4 2000/03/02 19:54:45 roddey * This checkin includes many changes done while waiting for the * 1.1.0 code to be finished. I can't list them all here, but a list is * available elsewhere. * * Revision 1.3 2000/02/24 20:05:25 abagchi * Swat for removing Log from API docs * * Revision 1.2 2000/02/06 07:48:03 rahulj * Year 2K copyright swat. * * Revision 1.1.1.1 1999/11/09 01:05:05 twl * Initial checkin * * Revision 1.2 1999/11/08 20:45:13 rahul * Swat for adding in Product name and CVS comment log variable. * */ #if !defined(REFVECTOROF_HPP) #define REFVECTOROF_HPP #include #include #include template class RefVectorOf { public : // ----------------------------------------------------------------------- // Constructors and Destructor // ----------------------------------------------------------------------- RefVectorOf(const unsigned int maxElems, const bool adoptElems = true); ~RefVectorOf(); // ----------------------------------------------------------------------- // Element management // ----------------------------------------------------------------------- void addElement(TElem* const toAdd); void setElementAt(TElem* const toSet, const unsigned int setAt); void insertElementAt(TElem* const toInsert, const unsigned int insertAt); TElem* orphanElementAt(const unsigned int orphanAt); void removeAllElements(); void removeElementAt(const unsigned int removeAt); void removeLastElement(); bool containsElement(const TElem* const toCheck); void cleanup(); void reinitialize(); // ----------------------------------------------------------------------- // Getter methods // ----------------------------------------------------------------------- unsigned int curCapacity() const; const TElem* elementAt(const unsigned int getAt) const; TElem* elementAt(const unsigned int getAt); unsigned int size() const; // ----------------------------------------------------------------------- // Miscellaneous // ----------------------------------------------------------------------- void ensureExtraCapacity(const unsigned int length); private: // ----------------------------------------------------------------------- // Data members // ----------------------------------------------------------------------- bool fAdoptedElems; unsigned int fCurCount; unsigned int fMaxCount; TElem** fElemList; }; // // An enumerator for a reference vector. It derives from the basic enumerator // class, so that value vectors can be generically enumerated. // template class RefVectorEnumerator : public XMLEnumerator { public : // ----------------------------------------------------------------------- // Constructors and Destructor // ----------------------------------------------------------------------- RefVectorEnumerator ( RefVectorOf* const toEnum , const bool adopt = false ); ~RefVectorEnumerator(); // ----------------------------------------------------------------------- // Enum interface // ----------------------------------------------------------------------- bool hasMoreElements() const; TElem& nextElement(); void Reset(); private : // ----------------------------------------------------------------------- // Data Members // // fAdopted // Indicates whether we have adopted the passed vector. If so then // we delete the vector when we are destroyed. // // fCurIndex // This is the current index into the vector. // // fToEnum // The reference vector being enumerated. // ----------------------------------------------------------------------- bool fAdopted; unsigned int fCurIndex; RefVectorOf* fToEnum; }; #if !defined(XERCES_TMPLSINC) #include #endif #endif