⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 refarrayof.c

📁 基于属性证书的访问控制源代码,由c++编写,包括openssl,xercesc等
💻 C
字号:
/* * The Apache Software License, Version 1.1 * * Copyright (c) 1999-2000 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 * <http://www.apache.org/>. *//** * $Log: RefArrayOf.c,v $ * Revision 1.5  2003/12/17 00:18:35  cargilld * Update to memory management so that the static memory manager (one used to call Initialize) is only for static data. * * Revision 1.4  2003/05/16 06:01:52  knoaman * Partial implementation of the configurable memory manager. * * Revision 1.3  2003/05/15 19:04:35  knoaman * Partial implementation of the configurable memory manager. * * Revision 1.2  2002/11/04 15:22:04  tng * C++ Namespace Support. * * Revision 1.1.1.1  2002/02/01 22:22:11  peiyongz * sane_include * * Revision 1.3  2000/03/02 19:54:44  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.2  2000/02/06 07:48:03  rahulj * Year 2K copyright swat. * * Revision 1.1.1.1  1999/11/09 01:04:56  twl * Initial checkin * * Revision 1.2  1999/11/08 20:45:12  rahul * Swat for adding in Product name and CVS comment log variable. * */// ---------------------------------------------------------------------------//  Includes// ---------------------------------------------------------------------------#if defined(XERCES_TMPLSINC)#include <xercesc/util/RefArrayOf.hpp>#endifXERCES_CPP_NAMESPACE_BEGIN// ---------------------------------------------------------------------------//  RefArrayOf: Contructors and Destructor// ---------------------------------------------------------------------------template <class TElem>RefArrayOf<TElem>::RefArrayOf(const unsigned int size,                              MemoryManager* const manager) :    fSize(size)    , fArray(0)    , fMemoryManager(manager){    fArray = (TElem**) fMemoryManager->allocate(fSize * sizeof(TElem*));//new TElem*[fSize];    for (unsigned int index = 0; index < fSize; index++)        fArray[index] = 0;}template <class TElem>RefArrayOf<TElem>::RefArrayOf(TElem* values[],                              const unsigned int size,                              MemoryManager* const manager) :    fSize(size)    , fArray(0)    , fMemoryManager(manager){    fArray = (TElem**) fMemoryManager->allocate(fSize * sizeof(TElem*));//new TElem*[fSize];    for (unsigned int index = 0; index < fSize; index++)        fArray[index] = values[index];}template <class TElem> RefArrayOf<TElem>::RefArrayOf(const RefArrayOf<TElem>& source) :    fSize(source.fSize)    , fArray(0)    , fMemoryManager(source.fMemoryManager){    fArray = (TElem**) fMemoryManager->allocate(fSize * sizeof(TElem*));//new TElem*[fSize];    for (unsigned int index = 0; index < fSize; index++)        fArray[index] = source.fArray[index];}template <class TElem> RefArrayOf<TElem>::~RefArrayOf(){    fMemoryManager->deallocate(fArray);//delete [] fArray;}// ---------------------------------------------------------------------------//  RefArrayOf: Public operators// ---------------------------------------------------------------------------template <class TElem> TElem*& RefArrayOf<TElem>::operator[](const unsigned int index){    if (index >= fSize)        ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Array_BadIndex, fMemoryManager);    return fArray[index];}template <class TElem> const TElem* RefArrayOf<TElem>::operator[](const unsigned int index) const{    if (index >= fSize)        ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Array_BadIndex, fMemoryManager);    return fArray[index];}template <class TElem> RefArrayOf<TElem>& RefArrayOf<TElem>::operator=(const RefArrayOf<TElem>& toAssign){    if (this == &toAssign)        return *this;    // Reallocate if not the same size    if (toAssign.fSize != fSize)    {        fMemoryManager->deallocate(fArray);//delete [] fArray;        fSize = toAssign.fSize;        fArray = (TElem**) fMemoryManager->allocate(fSize * sizeof(TElem*));//new TElem*[fSize];    }    // Copy over the source elements    for (unsigned int index = 0; index < fSize; index++)        fArray[index] = toAssign.fArray[index];    return *this;}template <class TElem> bool RefArrayOf<TElem>::operator==(const RefArrayOf<TElem>& toCompare) const{    if (this == &toCompare)        return true;    if (fSize != toCompare.fSize)        return false;    for (unsigned int index = 0; index < fSize; index++)    {        if (fArray[index] != toCompare.fArray[index])            return false;    }    return true;}template <class TElem> bool RefArrayOf<TElem>::operator!=(const RefArrayOf<TElem>& toCompare) const{    return !operator==(toCompare);}// ---------------------------------------------------------------------------//  RefArrayOf: Copy operations// ---------------------------------------------------------------------------template <class TElem> unsigned int RefArrayOf<TElem>::copyFrom(const RefArrayOf<TElem>& srcArray){    //    //  Copy over as many of the source elements as will fit into    //  this array.    //    const unsigned int count = fSize < srcArray.fSize ?                                    fSize : srcArray.fSize;    for (unsigned int index = 0; index < fSize; index++)        fArray[index] = srcArray.fArray[index];    return count;}// ---------------------------------------------------------------------------//  RefArrayOf: Getter methods// ---------------------------------------------------------------------------template <class TElem> unsigned int RefArrayOf<TElem>::length() const{    return fSize;}template <class TElem> TElem** RefArrayOf<TElem>::rawData() const{    return fArray;}// ---------------------------------------------------------------------------//  RefArrayOf: Element management methods// ---------------------------------------------------------------------------template <class TElem> void RefArrayOf<TElem>::deleteAt(const unsigned int index){    if (index >= fSize)        ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Array_BadIndex, fMemoryManager);    delete fArray[index];    fArray[index] = 0;}template <class TElem> void RefArrayOf<TElem>::deleteAllElements(){    for (unsigned int index = 0; index < fSize; index++)    {        delete fArray[index];        fArray[index] = 0;    }}template <class TElem> void RefArrayOf<TElem>::resize(const unsigned int newSize){    if (newSize == fSize)        return;    if (newSize < fSize)        ThrowXMLwithMemMgr(IllegalArgumentException, XMLExcepts::Array_BadNewSize, fMemoryManager);    // Allocate the new array    TElem** newArray = (TElem**) fMemoryManager->allocate    (        newSize * sizeof(TElem*)    );//new TElem*[newSize];    // Copy the existing values    unsigned int index = 0;    for (; index < fSize; index++)        newArray[index] = fArray[index];    for (; index < newSize; index++)        newArray[index] = 0;    // Delete the old array and udpate our members    fMemoryManager->deallocate(fArray);//delete [] fArray;    fArray = newArray;    fSize = newSize;}// ---------------------------------------------------------------------------//  RefArrayEnumerator: Constructors and Destructor// ---------------------------------------------------------------------------template <class TElem> RefArrayEnumerator<TElem>::RefArrayEnumerator(         RefArrayOf<TElem>* const    toEnum                    , const bool                        adopt) :    fAdopted(adopt)    , fCurIndex(0)    , fToEnum(toEnum){}template <class TElem> RefArrayEnumerator<TElem>::~RefArrayEnumerator(){    if (fAdopted)        delete fToEnum;}// ---------------------------------------------------------------------------//  RefArrayEnumerator: Enum interface// ---------------------------------------------------------------------------template <class TElem> bool RefArrayEnumerator<TElem>::hasMoreElements() const{    if (fCurIndex >= fToEnum->length())        return false;    return true;}template <class TElem> TElem& RefArrayEnumerator<TElem>::nextElement(){    return *(*fToEnum)[fCurIndex++];}template <class TElem> void RefArrayEnumerator<TElem>::Reset(){    fCurIndex = 0;}XERCES_CPP_NAMESPACE_END

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -