1 | /*
|
---|
2 | * The Apache Software License, Version 1.1
|
---|
3 | *
|
---|
4 | * Copyright (c) 1999-2000 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 | * $Log: ValueStackOf.c,v $
|
---|
59 | * Revision 1.5 2003/12/17 00:18:35 cargilld
|
---|
60 | * Update to memory management so that the static memory manager (one used to call Initialize) is only for static data.
|
---|
61 | *
|
---|
62 | * Revision 1.4 2003/05/29 13:26:44 knoaman
|
---|
63 | * Fix memory leak when using deprecated dom.
|
---|
64 | *
|
---|
65 | * Revision 1.3 2003/05/16 06:01:52 knoaman
|
---|
66 | * Partial implementation of the configurable memory manager.
|
---|
67 | *
|
---|
68 | * Revision 1.2 2002/11/04 15:22:05 tng
|
---|
69 | * C++ Namespace Support.
|
---|
70 | *
|
---|
71 | * Revision 1.1.1.1 2002/02/01 22:22:13 peiyongz
|
---|
72 | * sane_include
|
---|
73 | *
|
---|
74 | * Revision 1.3 2000/03/02 19:54:47 roddey
|
---|
75 | * This checkin includes many changes done while waiting for the
|
---|
76 | * 1.1.0 code to be finished. I can't list them all here, but a list is
|
---|
77 | * available elsewhere.
|
---|
78 | *
|
---|
79 | * Revision 1.2 2000/02/06 07:48:05 rahulj
|
---|
80 | * Year 2K copyright swat.
|
---|
81 | *
|
---|
82 | * Revision 1.1.1.1 1999/11/09 01:05:29 twl
|
---|
83 | * Initial checkin
|
---|
84 | *
|
---|
85 | * Revision 1.2 1999/11/08 20:45:18 rahul
|
---|
86 | * Swat for adding in Product name and CVS comment log variable.
|
---|
87 | *
|
---|
88 | */
|
---|
89 |
|
---|
90 |
|
---|
91 | // ---------------------------------------------------------------------------
|
---|
92 | // Includes
|
---|
93 | // ---------------------------------------------------------------------------
|
---|
94 | #if defined(XERCES_TMPLSINC)
|
---|
95 | #include <xercesc/util/ValueStackOf.hpp>
|
---|
96 | #endif
|
---|
97 |
|
---|
98 | XERCES_CPP_NAMESPACE_BEGIN
|
---|
99 |
|
---|
100 |
|
---|
101 | // ---------------------------------------------------------------------------
|
---|
102 | // ValueStackOf: Constructors and Destructor
|
---|
103 | // ---------------------------------------------------------------------------
|
---|
104 | template <class TElem>
|
---|
105 | ValueStackOf<TElem>::ValueStackOf(const unsigned int fInitCapacity,
|
---|
106 | MemoryManager* const manager,
|
---|
107 | const bool toCallDestructor) :
|
---|
108 |
|
---|
109 | fVector(fInitCapacity, manager, toCallDestructor)
|
---|
110 | {
|
---|
111 | }
|
---|
112 |
|
---|
113 | template <class TElem> ValueStackOf<TElem>::~ValueStackOf()
|
---|
114 | {
|
---|
115 | }
|
---|
116 |
|
---|
117 |
|
---|
118 | // ---------------------------------------------------------------------------
|
---|
119 | // ValueStackOf: Element management methods
|
---|
120 | // ---------------------------------------------------------------------------
|
---|
121 | template <class TElem> void ValueStackOf<TElem>::push(const TElem& toPush)
|
---|
122 | {
|
---|
123 | fVector.addElement(toPush);
|
---|
124 | }
|
---|
125 |
|
---|
126 | template <class TElem> const TElem& ValueStackOf<TElem>::peek() const
|
---|
127 | {
|
---|
128 | const int curSize = fVector.size();
|
---|
129 | if (curSize == 0)
|
---|
130 | ThrowXMLwithMemMgr(EmptyStackException, XMLExcepts::Stack_EmptyStack, fVector.getMemoryManager());
|
---|
131 |
|
---|
132 | return fVector.elementAt(curSize-1);
|
---|
133 | }
|
---|
134 |
|
---|
135 | template <class TElem> TElem ValueStackOf<TElem>::pop()
|
---|
136 | {
|
---|
137 | const int curSize = fVector.size();
|
---|
138 | if (curSize == 0)
|
---|
139 | ThrowXMLwithMemMgr(EmptyStackException, XMLExcepts::Stack_EmptyStack, fVector.getMemoryManager());
|
---|
140 |
|
---|
141 | TElem retVal = fVector.elementAt(curSize-1);
|
---|
142 | fVector.removeElementAt(curSize-1);
|
---|
143 | return retVal;
|
---|
144 | }
|
---|
145 |
|
---|
146 | template <class TElem> void ValueStackOf<TElem>::removeAllElements()
|
---|
147 | {
|
---|
148 | fVector.removeAllElements();
|
---|
149 | }
|
---|
150 |
|
---|
151 |
|
---|
152 | // ---------------------------------------------------------------------------
|
---|
153 | // ValueStackOf: Getter methods
|
---|
154 | // ---------------------------------------------------------------------------
|
---|
155 | template <class TElem> bool ValueStackOf<TElem>::empty()
|
---|
156 | {
|
---|
157 | return (fVector.size() == 0);
|
---|
158 | }
|
---|
159 |
|
---|
160 | template <class TElem> unsigned int ValueStackOf<TElem>::curCapacity()
|
---|
161 | {
|
---|
162 | return fVector.curCapacity();
|
---|
163 | }
|
---|
164 |
|
---|
165 | template <class TElem> unsigned int ValueStackOf<TElem>::size()
|
---|
166 | {
|
---|
167 | return fVector.size();
|
---|
168 | }
|
---|
169 |
|
---|
170 |
|
---|
171 |
|
---|
172 |
|
---|
173 | // ---------------------------------------------------------------------------
|
---|
174 | // ValueStackEnumerator: Constructors and Destructor
|
---|
175 | // ---------------------------------------------------------------------------
|
---|
176 | template <class TElem> ValueStackEnumerator<TElem>::
|
---|
177 | ValueStackEnumerator( ValueStackOf<TElem>* const toEnum
|
---|
178 | , const bool adopt) :
|
---|
179 |
|
---|
180 | fAdopted(adopt)
|
---|
181 | , fCurIndex(0)
|
---|
182 | , fToEnum(toEnum)
|
---|
183 | , fVector(&toEnum->fVector)
|
---|
184 | {
|
---|
185 | }
|
---|
186 |
|
---|
187 | template <class TElem> ValueStackEnumerator<TElem>::~ValueStackEnumerator()
|
---|
188 | {
|
---|
189 | if (fAdopted)
|
---|
190 | delete fToEnum;
|
---|
191 | }
|
---|
192 |
|
---|
193 |
|
---|
194 | // ---------------------------------------------------------------------------
|
---|
195 | // ValueStackEnumerator: Enum interface
|
---|
196 | // ---------------------------------------------------------------------------
|
---|
197 | template <class TElem> bool ValueStackEnumerator<TElem>::hasMoreElements() const
|
---|
198 | {
|
---|
199 | if (fCurIndex >= fVector->size())
|
---|
200 | return false;
|
---|
201 | return true;
|
---|
202 | }
|
---|
203 |
|
---|
204 | template <class TElem> TElem& ValueStackEnumerator<TElem>::nextElement()
|
---|
205 | {
|
---|
206 | return fVector->elementAt(fCurIndex++);
|
---|
207 | }
|
---|
208 |
|
---|
209 | template <class TElem> void ValueStackEnumerator<TElem>::Reset()
|
---|
210 | {
|
---|
211 | fCurIndex = 0;
|
---|
212 | }
|
---|
213 |
|
---|
214 | XERCES_CPP_NAMESPACE_END
|
---|