| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> |
| <html xmlns="http://www.w3.org/1999/xhtml"> |
| <head> |
| <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> |
| <title>Xalan-C++ API : Main Page</title> |
| <link href="tabs.css" rel="stylesheet" type="text/css"/> |
| <link href="doxygen.css" rel="stylesheet" type="text/css"/> |
| </head> |
| <!-- The head section is copied from Doxygen 1.7.1 generated default output --> |
| <body> |
| <h2 align="center">Xalan-C++ API Documentation</h2> |
| <h3 align="center"><a href="../index.html">The Xalan C++ XSLT Processor Version 1.11</a></h3> |
| <hr/> |
| <!-- Generated by Doxygen 1.7.1 --> |
| <div class="navigation" id="top"> |
| <div class="tabs"> |
| <ul class="tablist"> |
| <li><a href="index.html"><span>Main Page</span></a></li> |
| <li><a href="pages.html"><span>Related Pages</span></a></li> |
| <li><a href="annotated.html"><span>Classes</span></a></li> |
| <li class="current"><a href="files.html"><span>Files</span></a></li> |
| </ul> |
| </div> |
| <div class="tabs2"> |
| <ul class="tablist"> |
| <li><a href="files.html"><span>File List</span></a></li> |
| <li><a href="globals.html"><span>File Members</span></a></li> |
| </ul> |
| </div> |
| <div class="header"> |
| <div class="headertitle"> |
| <h1>XalanArrayAllocator.hpp</h1> </div> |
| </div> |
| <div class="contents"> |
| <a href="XalanArrayAllocator_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span> |
| <a name="l00002"></a>00002 <span class="comment"> * Licensed to the Apache Software Foundation (ASF) under one</span> |
| <a name="l00003"></a>00003 <span class="comment"> * or more contributor license agreements. See the NOTICE file</span> |
| <a name="l00004"></a>00004 <span class="comment"> * distributed with this work for additional information</span> |
| <a name="l00005"></a>00005 <span class="comment"> * regarding copyright ownership. The ASF licenses this file</span> |
| <a name="l00006"></a>00006 <span class="comment"> * to you under the Apache License, Version 2.0 (the "License");</span> |
| <a name="l00007"></a>00007 <span class="comment"> * you may not use this file except in compliance with the License.</span> |
| <a name="l00008"></a>00008 <span class="comment"> * You may obtain a copy of the License at</span> |
| <a name="l00009"></a>00009 <span class="comment"> *</span> |
| <a name="l00010"></a>00010 <span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span> |
| <a name="l00011"></a>00011 <span class="comment"> *</span> |
| <a name="l00012"></a>00012 <span class="comment"> * Unless required by applicable law or agreed to in writing, software</span> |
| <a name="l00013"></a>00013 <span class="comment"> * distributed under the License is distributed on an "AS IS" BASIS,</span> |
| <a name="l00014"></a>00014 <span class="comment"> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span> |
| <a name="l00015"></a>00015 <span class="comment"> * See the License for the specific language governing permissions and</span> |
| <a name="l00016"></a>00016 <span class="comment"> * limitations under the License.</span> |
| <a name="l00017"></a>00017 <span class="comment"> */</span> |
| <a name="l00018"></a>00018 <span class="preprocessor">#if !defined(XALANARRAYALLOCATOR_HEADER_GUARD_1357924680)</span> |
| <a name="l00019"></a>00019 <span class="preprocessor"></span><span class="preprocessor">#define XALANARRAYALLOCATOR_HEADER_GUARD_1357924680</span> |
| <a name="l00020"></a>00020 <span class="preprocessor"></span> |
| <a name="l00021"></a>00021 |
| <a name="l00022"></a>00022 |
| <a name="l00023"></a>00023 <span class="preprocessor">#include <<a class="code" href="PlatformSupportDefinitions_8hpp.html">xalanc/PlatformSupport/PlatformSupportDefinitions.hpp</a>></span> |
| <a name="l00024"></a>00024 |
| <a name="l00025"></a>00025 |
| <a name="l00026"></a>00026 |
| <a name="l00027"></a>00027 <span class="preprocessor">#include <cassert></span> |
| <a name="l00028"></a>00028 <span class="preprocessor">#include <utility></span> |
| <a name="l00029"></a>00029 |
| <a name="l00030"></a>00030 |
| <a name="l00031"></a>00031 |
| <a name="l00032"></a>00032 <span class="preprocessor">#include <<a class="code" href="XalanVector_8hpp.html">xalanc/Include/XalanVector.hpp</a>></span> |
| <a name="l00033"></a>00033 <span class="preprocessor">#include <<a class="code" href="XalanList_8hpp.html">xalanc/Include/XalanList.hpp</a>></span> |
| <a name="l00034"></a>00034 |
| <a name="l00035"></a>00035 |
| <a name="l00036"></a>00036 |
| <a name="l00037"></a>00037 XALAN_CPP_NAMESPACE_BEGIN |
| <a name="l00038"></a>00038 |
| <a name="l00039"></a>00039 |
| <a name="l00040"></a>00040 |
| <a name="l00041"></a>00041 <span class="keyword">template</span><<span class="keyword">class</span> Type> |
| <a name="l00042"></a><a class="code" href="classXalanArrayAllocator.html">00042</a> <span class="keyword">class </span><a class="code" href="PlatformSupportDefinitions_8hpp.html#a72e8d5d428f0210697564ce111006fde">XALAN_PLATFORMSUPPORT_EXPORT</a> <a class="code" href="classXalanArrayAllocator.html">XalanArrayAllocator</a> |
| <a name="l00043"></a>00043 { |
| <a name="l00044"></a>00044 <span class="keyword">public</span>: |
| <a name="l00045"></a>00045 |
| <a name="l00046"></a><a class="code" href="classXalanArrayAllocator.html#a4d8c37dc8ac16aaaad0990487c853e50">00046</a> <span class="keyword">typedef</span> <a class="code" href="classXalanVector.html">XalanVector<Type></a> <a class="code" href="classXalanVector.html">VectorType</a>; |
| <a name="l00047"></a><a class="code" href="classXalanArrayAllocator.html#a8349fa0abb51cc1b9a0b8ffd5478b17a">00047</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="classXalanVector.html#ad6fb8b1165e71ac328cf6408c529548f">VectorType::size_type</a> <a class="code" href="XalanMap_8hpp.html#a39efc23c4f36ef6389e4a1fbe96c5f2e">size_type</a>; |
| <a name="l00048"></a>00048 |
| <a name="l00049"></a><a class="code" href="classXalanArrayAllocator.html#a32397a50cd5fb474d748119451e706e3">00049</a> <span class="keyword">typedef</span> XALAN_STD_QUALIFIER pair<size_type, VectorType * > ListEntryType; |
| <a name="l00050"></a><a class="code" href="classXalanArrayAllocator.html#a8de5f351f5ed3db37309ecb1a47a4230">00050</a> <span class="keyword">typedef</span> <a class="code" href="classXalanList.html">XalanList<ListEntryType></a> <a class="code" href="classXalanList.html">ListType</a>; |
| <a name="l00051"></a>00051 |
| <a name="l00052"></a><a class="code" href="classXalanArrayAllocator.html#a0a655e8bd06efb59c33f93c360aadf9b">00052</a> <span class="keyword">typedef</span> Type value_type; |
| <a name="l00053"></a>00053 |
| <a name="l00054"></a><a class="code" href="classXalanArrayAllocator.html#ac4308529206dfa2b45f7aea64953c2ed">00054</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="structXalanListIteratorBase.html">ListType::iterator</a> <a class="code" href="structXalanListIteratorBase.html">ListIteratorType</a>; |
| <a name="l00055"></a>00055 |
| <a name="l00056"></a>00056 <span class="comment">// Default size for vector allocation.</span> |
| <a name="l00057"></a><a class="code" href="classXalanArrayAllocator.html#ac67ec10dcff5b51ee22908a05f7adc12a8e3ee16b2cda1395ffc03b824d8eeb14">00057</a> <span class="keyword">enum</span> { eDefaultBlockSize = 500 }; |
| <a name="l00058"></a>00058 <span class="comment"></span> |
| <a name="l00059"></a>00059 <span class="comment"> /**</span> |
| <a name="l00060"></a>00060 <span class="comment"> * Constructor.</span> |
| <a name="l00061"></a>00061 <span class="comment"> *</span> |
| <a name="l00062"></a>00062 <span class="comment"> * @param theBlockSize The block size when allocating.</span> |
| <a name="l00063"></a>00063 <span class="comment"> */</span> |
| <a name="l00064"></a><a class="code" href="classXalanArrayAllocator.html#aa4f6607bd8c34fb2355325308f31ad4f">00064</a> <a class="code" href="classXalanArrayAllocator.html">XalanArrayAllocator</a>(MemoryManager& theManager, |
| <a name="l00065"></a>00065 <a class="code" href="XalanMap_8hpp.html#a39efc23c4f36ef6389e4a1fbe96c5f2e">size_type</a> theBlockSize = eDefaultBlockSize) : |
| <a name="l00066"></a>00066 m_list(theManager), |
| <a name="l00067"></a>00067 m_blockSize(theBlockSize), |
| <a name="l00068"></a>00068 m_lastEntryFound(0) |
| <a name="l00069"></a>00069 { |
| <a name="l00070"></a>00070 } |
| <a name="l00071"></a>00071 |
| <a name="l00072"></a><a class="code" href="classXalanArrayAllocator.html#aeb21356fcce70f26e53b06f518e8d0a6">00072</a> ~<a class="code" href="classXalanArrayAllocator.html">XalanArrayAllocator</a>() |
| <a name="l00073"></a>00073 { |
| <a name="l00074"></a>00074 <span class="keyword">typename</span> <a class="code" href="structXalanListIteratorBase.html">ListType::iterator</a> iter = m_list.begin(); |
| <a name="l00075"></a>00075 |
| <a name="l00076"></a>00076 MemoryManager& theManager = m_list.getMemoryManager(); |
| <a name="l00077"></a>00077 |
| <a name="l00078"></a>00078 <span class="keywordflow">for</span>( iter = m_list.begin(); iter != m_list.end(); ++iter) |
| <a name="l00079"></a>00079 { |
| <a name="l00080"></a>00080 <span class="keywordflow">if</span>( (*iter).second != 0) |
| <a name="l00081"></a>00081 { |
| <a name="l00082"></a>00082 <span class="preprocessor">#if defined(XALAN_REQUIRES_QUALIFIED_DESTRUCTOR)</span> |
| <a name="l00083"></a>00083 <span class="preprocessor"></span> (*iter).second->VectorType::~VectorType(); |
| <a name="l00084"></a>00084 <span class="preprocessor">#else</span> |
| <a name="l00085"></a>00085 <span class="preprocessor"></span> (*iter).second->~VectorType(); |
| <a name="l00086"></a>00086 <span class="preprocessor">#endif </span> |
| <a name="l00087"></a>00087 <span class="preprocessor"></span> theManager.deallocate((<span class="keywordtype">void</span>*)(*iter).second); |
| <a name="l00088"></a>00088 } |
| <a name="l00089"></a>00089 } |
| <a name="l00090"></a>00090 } |
| <a name="l00091"></a>00091 <span class="comment"></span> |
| <a name="l00092"></a>00092 <span class="comment"> /**</span> |
| <a name="l00093"></a>00093 <span class="comment"> * Clear the instance, and release all allocated memory</span> |
| <a name="l00094"></a>00094 <span class="comment"> */</span> |
| <a name="l00095"></a>00095 <span class="keywordtype">void</span> |
| <a name="l00096"></a><a class="code" href="classXalanArrayAllocator.html#a96cbdf822de28f8e6a9d6b65ca714e56">00096</a> <a class="code" href="DOMStringHelper_8hpp.html#a3beaa7474ee8377a7de5fe4eceddcc94" title="Remove all elements from target string.">clear</a>() |
| <a name="l00097"></a>00097 { |
| <a name="l00098"></a>00098 m_list.clear(); |
| <a name="l00099"></a>00099 |
| <a name="l00100"></a>00100 m_lastEntryFound = 0; |
| <a name="l00101"></a>00101 } |
| <a name="l00102"></a>00102 <span class="comment"></span> |
| <a name="l00103"></a>00103 <span class="comment"> /**</span> |
| <a name="l00104"></a>00104 <span class="comment"> * Reset the instance, but keep all memory so it can be</span> |
| <a name="l00105"></a>00105 <span class="comment"> * reused for allocations. This invalidates all previous</span> |
| <a name="l00106"></a>00106 <span class="comment"> * allocations.</span> |
| <a name="l00107"></a>00107 <span class="comment"> */</span> |
| <a name="l00108"></a>00108 <span class="keywordtype">void</span> |
| <a name="l00109"></a><a class="code" href="classXalanArrayAllocator.html#a61e9781bb3fe76c59b8b92d81b8cffac">00109</a> reset() |
| <a name="l00110"></a>00110 { |
| <a name="l00111"></a>00111 <span class="keywordflow">if</span> (m_list.empty() == <span class="keyword">true</span>) |
| <a name="l00112"></a>00112 { |
| <a name="l00113"></a>00113 m_lastEntryFound = 0; |
| <a name="l00114"></a>00114 } |
| <a name="l00115"></a>00115 <span class="keywordflow">else</span> |
| <a name="l00116"></a>00116 { |
| <a name="l00117"></a>00117 <span class="keyword">const</span> <a class="code" href="structXalanListIteratorBase.html">ListIteratorType</a> theEnd = m_list.end(); |
| <a name="l00118"></a>00118 <a class="code" href="structXalanListIteratorBase.html">ListIteratorType</a> theCurrent = m_list.begin(); |
| <a name="l00119"></a>00119 |
| <a name="l00120"></a>00120 <span class="keywordflow">do</span> |
| <a name="l00121"></a>00121 { |
| <a name="l00122"></a>00122 (*theCurrent).first = (*theCurrent).second->size(); |
| <a name="l00123"></a>00123 |
| <a name="l00124"></a>00124 ++theCurrent; |
| <a name="l00125"></a>00125 } <span class="keywordflow">while</span>(theCurrent != theEnd); |
| <a name="l00126"></a>00126 |
| <a name="l00127"></a>00127 m_lastEntryFound = &*m_list.begin(); |
| <a name="l00128"></a>00128 } |
| <a name="l00129"></a>00129 } |
| <a name="l00130"></a>00130 <span class="comment"></span> |
| <a name="l00131"></a>00131 <span class="comment"> /**</span> |
| <a name="l00132"></a>00132 <span class="comment"> * Allocate slots for the given number of Types</span> |
| <a name="l00133"></a>00133 <span class="comment"> * instance and return the address of the slots.</span> |
| <a name="l00134"></a>00134 <span class="comment"> *</span> |
| <a name="l00135"></a>00135 <span class="comment"> * @param theCount The number of slots to allocate</span> |
| <a name="l00136"></a>00136 <span class="comment"> */</span> |
| <a name="l00137"></a>00137 Type* |
| <a name="l00138"></a><a class="code" href="classXalanArrayAllocator.html#a036982e97b0979c4a38fcce062ecadf8">00138</a> allocate(<a class="code" href="XalanMap_8hpp.html#a39efc23c4f36ef6389e4a1fbe96c5f2e">size_type</a> theCount) |
| <a name="l00139"></a>00139 { |
| <a name="l00140"></a>00140 <span class="comment">// Handle the case of theCount being greater than the block size first...</span> |
| <a name="l00141"></a>00141 <span class="keywordflow">if</span> (theCount >= m_blockSize) |
| <a name="l00142"></a>00142 { |
| <a name="l00143"></a>00143 <span class="keywordflow">return</span> createEntry(theCount, theCount); |
| <a name="l00144"></a>00144 } |
| <a name="l00145"></a>00145 <span class="keywordflow">else</span> |
| <a name="l00146"></a>00146 { |
| <a name="l00147"></a>00147 <a class="code" href="classXalanArrayAllocator.html#a32397a50cd5fb474d748119451e706e3">ListEntryType</a>* theEntry = |
| <a name="l00148"></a>00148 findEntry(theCount); |
| <a name="l00149"></a>00149 |
| <a name="l00150"></a>00150 <span class="comment">// Did we find a slot?</span> |
| <a name="l00151"></a>00151 <span class="keywordflow">if</span> (theEntry == 0) |
| <a name="l00152"></a>00152 { |
| <a name="l00153"></a>00153 <span class="comment">// Nope, create a new one...</span> |
| <a name="l00154"></a>00154 <span class="keywordflow">return</span> createEntry(m_blockSize, theCount); |
| <a name="l00155"></a>00155 } |
| <a name="l00156"></a>00156 <span class="keywordflow">else</span> |
| <a name="l00157"></a>00157 { |
| <a name="l00158"></a>00158 <span class="comment">// The address we want is that of the first free element in the</span> |
| <a name="l00159"></a>00159 <span class="comment">// vector...</span> |
| <a name="l00160"></a>00160 assert( theEntry->second != 0); |
| <a name="l00161"></a>00161 Type* <span class="keyword">const</span> thePointer = |
| <a name="l00162"></a>00162 &*theEntry->second->begin() + (theEntry->second->size() - theEntry->first); |
| <a name="l00163"></a>00163 |
| <a name="l00164"></a>00164 <span class="comment">// Resize the vector to the appropriate size...</span> |
| <a name="l00165"></a>00165 theEntry->first -= theCount; |
| <a name="l00166"></a>00166 |
| <a name="l00167"></a>00167 <span class="keywordflow">return</span> thePointer; |
| <a name="l00168"></a>00168 } |
| <a name="l00169"></a>00169 } |
| <a name="l00170"></a>00170 } |
| <a name="l00171"></a>00171 |
| <a name="l00172"></a>00172 <span class="keyword">private</span>: |
| <a name="l00173"></a>00173 |
| <a name="l00174"></a>00174 <span class="comment">// Utility functions...</span> |
| <a name="l00175"></a>00175 Type* |
| <a name="l00176"></a>00176 createEntry( |
| <a name="l00177"></a>00177 <a class="code" href="XalanMap_8hpp.html#a39efc23c4f36ef6389e4a1fbe96c5f2e">size_type</a> theBlockSize, |
| <a name="l00178"></a>00178 <a class="code" href="XalanMap_8hpp.html#a39efc23c4f36ef6389e4a1fbe96c5f2e">size_type</a> theCount) |
| <a name="l00179"></a>00179 { |
| <a name="l00180"></a>00180 assert(theBlockSize >= theCount); |
| <a name="l00181"></a>00181 |
| <a name="l00182"></a>00182 <span class="comment">// Push on a new entry. The entry has no open space,</span> |
| <a name="l00183"></a>00183 <span class="comment">// since it's greater than our block size...</span> |
| <a name="l00184"></a>00184 m_list.push_back(ListEntryType(0, VectorType::create(m_list.getMemoryManager()))); |
| <a name="l00185"></a>00185 |
| <a name="l00186"></a>00186 <span class="comment">// Get the new entry...</span> |
| <a name="l00187"></a>00187 ListEntryType& theNewEntry = m_list.back(); |
| <a name="l00188"></a>00188 |
| <a name="l00189"></a>00189 <span class="comment">// Resize the vector to the appropriate size...</span> |
| <a name="l00190"></a>00190 assert(theNewEntry.second); |
| <a name="l00191"></a>00191 |
| <a name="l00192"></a>00192 theNewEntry.second->resize(theBlockSize, value_type()); |
| <a name="l00193"></a>00193 |
| <a name="l00194"></a>00194 <span class="comment">// Set the number of free spaces accordingly...</span> |
| <a name="l00195"></a>00195 theNewEntry.first = theBlockSize - theCount; |
| <a name="l00196"></a>00196 |
| <a name="l00197"></a>00197 <span class="keywordflow">if</span> (theNewEntry.first != 0) |
| <a name="l00198"></a>00198 { |
| <a name="l00199"></a>00199 m_lastEntryFound = &theNewEntry; |
| <a name="l00200"></a>00200 } |
| <a name="l00201"></a>00201 |
| <a name="l00202"></a>00202 <span class="comment">// Return a pointer to the beginning of the allocated memory...</span> |
| <a name="l00203"></a>00203 <span class="keywordflow">return</span> &*theNewEntry.second->begin(); |
| <a name="l00204"></a>00204 } |
| <a name="l00205"></a>00205 |
| <a name="l00206"></a>00206 ListEntryType* |
| <a name="l00207"></a>00207 findEntry(<a class="code" href="XalanMap_8hpp.html#a39efc23c4f36ef6389e4a1fbe96c5f2e">size_type</a> theCount) |
| <a name="l00208"></a>00208 { |
| <a name="l00209"></a>00209 <span class="comment">// Search for an entry that has some free space.</span> |
| <a name="l00210"></a>00210 |
| <a name="l00211"></a>00211 <span class="keywordflow">if</span> (m_lastEntryFound != 0 && m_lastEntryFound->first >= theCount) |
| <a name="l00212"></a>00212 { |
| <a name="l00213"></a>00213 <span class="keywordflow">return</span> m_lastEntryFound; |
| <a name="l00214"></a>00214 } |
| <a name="l00215"></a>00215 <span class="keywordflow">else</span> |
| <a name="l00216"></a>00216 { |
| <a name="l00217"></a>00217 <span class="keyword">const</span> ListIteratorType theEnd = m_list.end(); |
| <a name="l00218"></a>00218 ListIteratorType theCurrent = m_list.begin(); |
| <a name="l00219"></a>00219 |
| <a name="l00220"></a>00220 ListEntryType* theEntry = 0; |
| <a name="l00221"></a>00221 |
| <a name="l00222"></a>00222 <span class="keywordflow">while</span>(theCurrent != theEnd) |
| <a name="l00223"></a>00223 { |
| <a name="l00224"></a>00224 <span class="comment">// We're looking for the best fit, so</span> |
| <a name="l00225"></a>00225 <span class="comment">// if the free space and the count we're</span> |
| <a name="l00226"></a>00226 <span class="comment">// looking for are equal, that's pretty</span> |
| <a name="l00227"></a>00227 <span class="comment">// much the best we can do...</span> |
| <a name="l00228"></a>00228 <span class="keywordflow">if</span> ((*theCurrent).first == theCount) |
| <a name="l00229"></a>00229 { |
| <a name="l00230"></a>00230 theEntry = &*theCurrent; |
| <a name="l00231"></a>00231 |
| <a name="l00232"></a>00232 <span class="keywordflow">break</span>; |
| <a name="l00233"></a>00233 } |
| <a name="l00234"></a>00234 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*theCurrent).first >= theCount) |
| <a name="l00235"></a>00235 { |
| <a name="l00236"></a>00236 <span class="comment">// If we haven't found anything yet, the first</span> |
| <a name="l00237"></a>00237 <span class="comment">// entry we find that's large enough becomes</span> |
| <a name="l00238"></a>00238 <span class="comment">// our best fit.</span> |
| <a name="l00239"></a>00239 <span class="comment">//</span> |
| <a name="l00240"></a>00240 <span class="comment">// Otherwise, we'll assume that a smaller</span> |
| <a name="l00241"></a>00241 <span class="comment">// slot is a better fit, though I may be</span> |
| <a name="l00242"></a>00242 <span class="comment">// wrong about this...</span> |
| <a name="l00243"></a>00243 <span class="keywordflow">if</span> (theEntry == 0 || |
| <a name="l00244"></a>00244 (*theCurrent).first < theEntry->first) |
| <a name="l00245"></a>00245 { |
| <a name="l00246"></a>00246 <span class="comment">// Nope, so this becomes our best-fit so far.</span> |
| <a name="l00247"></a>00247 theEntry = &*theCurrent; |
| <a name="l00248"></a>00248 } |
| <a name="l00249"></a>00249 |
| <a name="l00250"></a>00250 ++theCurrent; |
| <a name="l00251"></a>00251 } |
| <a name="l00252"></a>00252 <span class="keywordflow">else</span> |
| <a name="l00253"></a>00253 { |
| <a name="l00254"></a>00254 <span class="comment">// Won't fit, so just continue...</span> |
| <a name="l00255"></a>00255 ++theCurrent; |
| <a name="l00256"></a>00256 } |
| <a name="l00257"></a>00257 } |
| <a name="l00258"></a>00258 |
| <a name="l00259"></a>00259 m_lastEntryFound = theEntry; |
| <a name="l00260"></a>00260 |
| <a name="l00261"></a>00261 <span class="keywordflow">return</span> theEntry; |
| <a name="l00262"></a>00262 } |
| <a name="l00263"></a>00263 } |
| <a name="l00264"></a>00264 |
| <a name="l00265"></a>00265 <span class="comment">// Not implemented...</span> |
| <a name="l00266"></a>00266 <a class="code" href="classXalanArrayAllocator.html">XalanArrayAllocator</a>(<span class="keyword">const</span> <a class="code" href="classXalanArrayAllocator.html">XalanArrayAllocator<Type></a>& theSource); |
| <a name="l00267"></a>00267 |
| <a name="l00268"></a>00268 <a class="code" href="classXalanArrayAllocator.html">XalanArrayAllocator<Type></a>& |
| <a name="l00269"></a>00269 operator=(<span class="keyword">const</span> <a class="code" href="classXalanArrayAllocator.html">XalanArrayAllocator<Type></a>& theSource); |
| <a name="l00270"></a>00270 |
| <a name="l00271"></a>00271 <span class="keywordtype">bool</span> |
| <a name="l00272"></a>00272 <a class="code" href="ElemAttributeSet_8hpp.html#ae199bc16afddda1065706543e752d292">operator==</a>(<span class="keyword">const</span> <a class="code" href="classXalanArrayAllocator.html">XalanArrayAllocator<Type></a>& theRHS) <span class="keyword">const</span>; |
| <a name="l00273"></a>00273 |
| <a name="l00274"></a>00274 |
| <a name="l00275"></a>00275 <span class="comment">// Data members...</span> |
| <a name="l00276"></a>00276 ListType m_list; |
| <a name="l00277"></a>00277 |
| <a name="l00278"></a>00278 <span class="keyword">const</span> <a class="code" href="XalanMap_8hpp.html#a39efc23c4f36ef6389e4a1fbe96c5f2e">size_type</a> m_blockSize; |
| <a name="l00279"></a>00279 |
| <a name="l00280"></a>00280 ListEntryType* m_lastEntryFound; |
| <a name="l00281"></a>00281 }; |
| <a name="l00282"></a>00282 |
| <a name="l00283"></a>00283 |
| <a name="l00284"></a>00284 |
| <a name="l00285"></a>00285 XALAN_CPP_NAMESPACE_END |
| <a name="l00286"></a>00286 |
| <a name="l00287"></a>00287 |
| <a name="l00288"></a>00288 |
| <a name="l00289"></a>00289 <span class="preprocessor">#endif // !defined(XALANARRAYALLOCATOR_HEADER_GUARD_1357924680)</span> |
| </pre></div></div> |
| </div> |
| <p align="center"><a href="graph_legend.html">Interpreting class diagrams</a></p> |
| <p><font color="#000000" face="arial,helvetica,sanserif" size="-1"> |
| <i><a href="http://www.doxygen.org/">Doxygen</a> and |
| <a href="http://www.graphviz.org/">GraphViz</a> are |
| used to generate this API documentation from the Xalan-C header files.</i></font></p> |
| |
| <table border="0" cellpadding="0" cellspacing="0" width="80%"> |
| <tr> |
| <td width="80%" valign="top"> |
| <p align="center"><b>Xalan-C++ XSLT Processor Version 1.11</b><br/> |
| Copyright © 1999-2012 The Apache Software Foundation.<br/> |
| All Rights Reserved.</p> |
| </td> |
| </tr> |
| <tr> |
| <td width="100%"> |
| <p align="center"><img src="asf_logo_wide.gif" width="268" height="25" align="bottom" border="0" alt="Apache Logo"> |
| </td> |
| </tr> |
| </table> |
| </body> |
| </html> |
