1 | /*
|
---|
2 | * The Apache Software License, Version 1.1
|
---|
3 | *
|
---|
4 | * Copyright (c) 1999-2003 The Apache Software Foundation. All rights
|
---|
5 | * reserved.
|
---|
6 | *
|
---|
7 | * Redistribution and use in source and binary forms, with or without
|
---|
8 | * modification, are permitted provided that the following conditions
|
---|
9 | * are met:
|
---|
10 | *
|
---|
11 | * 1. Redistributions of source code must retain the above copyright
|
---|
12 | * notice, this list of conditions and the following disclaimer.
|
---|
13 | *
|
---|
14 | * 2. Redistributions in binary form must reproduce the above copyright
|
---|
15 | * notice, this list of conditions and the following disclaimer in
|
---|
16 | * the documentation and/or other materials provided with the
|
---|
17 | * distribution.
|
---|
18 | *
|
---|
19 | * 3. The end-user documentation included with the redistribution,
|
---|
20 | * if any, must include the following acknowledgment:
|
---|
21 | * "This product includes software developed by the
|
---|
22 | * Apache Software Foundation (http://www.apache.org/)."
|
---|
23 | * Alternately, this acknowledgment may appear in the software itself,
|
---|
24 | * if and wherever such third-party acknowledgments normally appear.
|
---|
25 | *
|
---|
26 | * 4. The names "Xerces" and "Apache Software Foundation" must
|
---|
27 | * not be used to endorse or promote products derived from this
|
---|
28 | * software without prior written permission. For written
|
---|
29 | * permission, please contact apache\@apache.org.
|
---|
30 | *
|
---|
31 | * 5. Products derived from this software may not be called "Apache",
|
---|
32 | * nor may "Apache" appear in their name, without prior written
|
---|
33 | * permission of the Apache Software Foundation.
|
---|
34 | *
|
---|
35 | * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
|
---|
36 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
37 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
---|
38 | * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
|
---|
39 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
---|
40 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
---|
41 | * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
---|
42 | * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
---|
43 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
---|
44 | * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
---|
45 | * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
---|
46 | * SUCH DAMAGE.
|
---|
47 | * ====================================================================
|
---|
48 | *
|
---|
49 | * This software consists of voluntary contributions made by many
|
---|
50 | * individuals on behalf of the Apache Software Foundation, and was
|
---|
51 | * originally based on software copyright (c) 1999, International
|
---|
52 | * Business Machines, Inc., http://www.ibm.com . For more information
|
---|
53 | * on the Apache Software Foundation, please see
|
---|
54 | * <http://www.apache.org/>.
|
---|
55 | */
|
---|
56 |
|
---|
57 | // ---------------------------------------------------------------------------
|
---|
58 | // Includes
|
---|
59 | // ---------------------------------------------------------------------------
|
---|
60 | #if defined(XERCES_TMPLSINC)
|
---|
61 | #include "RefArrayVectorOf.hpp"
|
---|
62 | #endif
|
---|
63 |
|
---|
64 | XERCES_CPP_NAMESPACE_BEGIN
|
---|
65 |
|
---|
66 | // ---------------------------------------------------------------------------
|
---|
67 | // RefArrayVectorOf: Constructor and Destructor
|
---|
68 | // ---------------------------------------------------------------------------
|
---|
69 | template <class TElem>
|
---|
70 | RefArrayVectorOf<TElem>::RefArrayVectorOf( const unsigned int maxElems
|
---|
71 | , const bool adoptElems
|
---|
72 | , MemoryManager* const manager)
|
---|
73 | : BaseRefVectorOf<TElem>(maxElems, adoptElems, manager)
|
---|
74 | {
|
---|
75 | }
|
---|
76 |
|
---|
77 |
|
---|
78 | template <class TElem> RefArrayVectorOf<TElem>::~RefArrayVectorOf()
|
---|
79 | {
|
---|
80 | if (this->fAdoptedElems)
|
---|
81 | {
|
---|
82 | for (unsigned int index = 0; index < this->fCurCount; index++)
|
---|
83 | this->fMemoryManager->deallocate(this->fElemList[index]);//delete[] fElemList[index];
|
---|
84 | }
|
---|
85 | this->fMemoryManager->deallocate(this->fElemList);//delete [] fElemList;
|
---|
86 | }
|
---|
87 |
|
---|
88 | template <class TElem> void
|
---|
89 | RefArrayVectorOf<TElem>::setElementAt(TElem* const toSet, const unsigned int setAt)
|
---|
90 | {
|
---|
91 | if (setAt >= this->fCurCount)
|
---|
92 | ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, this->fMemoryManager);
|
---|
93 |
|
---|
94 | if (this->fAdoptedElems)
|
---|
95 | this->fMemoryManager->deallocate(this->fElemList[setAt]);
|
---|
96 |
|
---|
97 | this->fElemList[setAt] = toSet;
|
---|
98 | }
|
---|
99 |
|
---|
100 | template <class TElem> void RefArrayVectorOf<TElem>::removeAllElements()
|
---|
101 | {
|
---|
102 | for (unsigned int index = 0; index < this->fCurCount; index++)
|
---|
103 | {
|
---|
104 | if (this->fAdoptedElems)
|
---|
105 | this->fMemoryManager->deallocate(this->fElemList[index]);
|
---|
106 |
|
---|
107 | // Keep unused elements zero for sanity's sake
|
---|
108 | this->fElemList[index] = 0;
|
---|
109 | }
|
---|
110 | this->fCurCount = 0;
|
---|
111 | }
|
---|
112 |
|
---|
113 | template <class TElem> void RefArrayVectorOf<TElem>::
|
---|
114 | removeElementAt(const unsigned int removeAt)
|
---|
115 | {
|
---|
116 | if (removeAt >= this->fCurCount)
|
---|
117 | ThrowXMLwithMemMgr(ArrayIndexOutOfBoundsException, XMLExcepts::Vector_BadIndex, this->fMemoryManager);
|
---|
118 |
|
---|
119 | if (this->fAdoptedElems)
|
---|
120 | this->fMemoryManager->deallocate(this->fElemList[removeAt]);
|
---|
121 |
|
---|
122 | // Optimize if its the last element
|
---|
123 | if (removeAt == this->fCurCount-1)
|
---|
124 | {
|
---|
125 | this->fElemList[removeAt] = 0;
|
---|
126 | this->fCurCount--;
|
---|
127 | return;
|
---|
128 | }
|
---|
129 |
|
---|
130 | // Copy down every element above remove point
|
---|
131 | for (unsigned int index = removeAt; index < this->fCurCount-1; index++)
|
---|
132 | this->fElemList[index] = this->fElemList[index+1];
|
---|
133 |
|
---|
134 | // Keep unused elements zero for sanity's sake
|
---|
135 | this->fElemList[this->fCurCount-1] = 0;
|
---|
136 |
|
---|
137 | // And bump down count
|
---|
138 | this->fCurCount--;
|
---|
139 | }
|
---|
140 |
|
---|
141 | template <class TElem> void RefArrayVectorOf<TElem>::removeLastElement()
|
---|
142 | {
|
---|
143 | if (!this->fCurCount)
|
---|
144 | return;
|
---|
145 | this->fCurCount--;
|
---|
146 |
|
---|
147 | if (this->fAdoptedElems)
|
---|
148 | this->fMemoryManager->deallocate(this->fElemList[this->fCurCount]);
|
---|
149 | }
|
---|
150 |
|
---|
151 | template <class TElem> void RefArrayVectorOf<TElem>::cleanup()
|
---|
152 | {
|
---|
153 | if (this->fAdoptedElems)
|
---|
154 | {
|
---|
155 | for (unsigned int index = 0; index < this->fCurCount; index++)
|
---|
156 | this->fMemoryManager->deallocate(this->fElemList[index]);
|
---|
157 | }
|
---|
158 | this->fMemoryManager->deallocate(this->fElemList);//delete [] fElemList;
|
---|
159 | }
|
---|
160 |
|
---|
161 | XERCES_CPP_NAMESPACE_END
|
---|