| <HTML> |
| <BODY BGCOLOR="white"> |
| <PRE> |
| <FONT color="green">001</FONT> /*<a name="line.1"></a> |
| <FONT color="green">002</FONT> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a> |
| <FONT color="green">003</FONT> * or more contributor license agreements. See the NOTICE file<a name="line.3"></a> |
| <FONT color="green">004</FONT> * distributed with this work for additional information<a name="line.4"></a> |
| <FONT color="green">005</FONT> * regarding copyright ownership. The ASF licenses this file<a name="line.5"></a> |
| <FONT color="green">006</FONT> * to you under the Apache License, Version 2.0 (the "License");<a name="line.6"></a> |
| <FONT color="green">007</FONT> * you may not use this file except in compliance with the License.<a name="line.7"></a> |
| <FONT color="green">008</FONT> * You may obtain a copy of the License at<a name="line.8"></a> |
| <FONT color="green">009</FONT> *<a name="line.9"></a> |
| <FONT color="green">010</FONT> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a> |
| <FONT color="green">011</FONT> *<a name="line.11"></a> |
| <FONT color="green">012</FONT> * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a> |
| <FONT color="green">013</FONT> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a> |
| <FONT color="green">014</FONT> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a> |
| <FONT color="green">015</FONT> * See the License for the specific language governing permissions and<a name="line.15"></a> |
| <FONT color="green">016</FONT> * limitations under the License.<a name="line.16"></a> |
| <FONT color="green">017</FONT> */<a name="line.17"></a> |
| <FONT color="green">018</FONT> /*<a name="line.18"></a> |
| <FONT color="green">019</FONT> * $Id: MultiValuedNodeHeapIterator.java 1225426 2011-12-29 04:13:08Z mrglavas $<a name="line.19"></a> |
| <FONT color="green">020</FONT> */<a name="line.20"></a> |
| <FONT color="green">021</FONT> <a name="line.21"></a> |
| <FONT color="green">022</FONT> package org.apache.xalan.xsltc.dom;<a name="line.22"></a> |
| <FONT color="green">023</FONT> <a name="line.23"></a> |
| <FONT color="green">024</FONT> import org.apache.xalan.xsltc.DOM;<a name="line.24"></a> |
| <FONT color="green">025</FONT> import org.apache.xalan.xsltc.runtime.BasisLibrary;<a name="line.25"></a> |
| <FONT color="green">026</FONT> import org.apache.xml.dtm.DTMAxisIterator;<a name="line.26"></a> |
| <FONT color="green">027</FONT> import org.apache.xml.dtm.ref.DTMAxisIteratorBase;<a name="line.27"></a> |
| <FONT color="green">028</FONT> <a name="line.28"></a> |
| <FONT color="green">029</FONT> /**<a name="line.29"></a> |
| <FONT color="green">030</FONT> * <p><code>MultiValuedNodeHeapIterator</code> takes a set of multi-valued<a name="line.30"></a> |
| <FONT color="green">031</FONT> * heap nodes and produces a merged NodeSet in document order with duplicates<a name="line.31"></a> |
| <FONT color="green">032</FONT> * removed.</p><a name="line.32"></a> |
| <FONT color="green">033</FONT> * <p>Each multi-valued heap node (which might be a<a name="line.33"></a> |
| <FONT color="green">034</FONT> * {@link org.apache.xml.dtm.DTMAxisIterator}, but that's not necessary)<a name="line.34"></a> |
| <FONT color="green">035</FONT> * generates DTM node handles in document order. The class<a name="line.35"></a> |
| <FONT color="green">036</FONT> * maintains the multi-valued heap nodes in a heap, not surprisingly, sorted by<a name="line.36"></a> |
| <FONT color="green">037</FONT> * the next DTM node handle available form the heap node.</p><a name="line.37"></a> |
| <FONT color="green">038</FONT> * <p>After a DTM node is pulled from the heap node that's at the top of the<a name="line.38"></a> |
| <FONT color="green">039</FONT> * heap, the heap node is advanced to the next DTM node handle it makes<a name="line.39"></a> |
| <FONT color="green">040</FONT> * available, and the heap nature of the heap is restored to ensure the next<a name="line.40"></a> |
| <FONT color="green">041</FONT> * DTM node handle pulled is next in document order overall.<a name="line.41"></a> |
| <FONT color="green">042</FONT> *<a name="line.42"></a> |
| <FONT color="green">043</FONT> * @author Jacek Ambroziak<a name="line.43"></a> |
| <FONT color="green">044</FONT> * @author Santiago Pericas-Geertsen<a name="line.44"></a> |
| <FONT color="green">045</FONT> */<a name="line.45"></a> |
| <FONT color="green">046</FONT> public abstract class MultiValuedNodeHeapIterator extends DTMAxisIteratorBase {<a name="line.46"></a> |
| <FONT color="green">047</FONT> /** wrapper for NodeIterators to support iterator<a name="line.47"></a> |
| <FONT color="green">048</FONT> comparison on the value of their next() method<a name="line.48"></a> |
| <FONT color="green">049</FONT> */<a name="line.49"></a> |
| <FONT color="green">050</FONT> <a name="line.50"></a> |
| <FONT color="green">051</FONT> /**<a name="line.51"></a> |
| <FONT color="green">052</FONT> * An abstract representation of a set of nodes that will be retrieved in<a name="line.52"></a> |
| <FONT color="green">053</FONT> * document order.<a name="line.53"></a> |
| <FONT color="green">054</FONT> */<a name="line.54"></a> |
| <FONT color="green">055</FONT> public abstract class HeapNode implements Cloneable {<a name="line.55"></a> |
| <FONT color="green">056</FONT> protected int _node, _markedNode;<a name="line.56"></a> |
| <FONT color="green">057</FONT> protected boolean _isStartSet = false;<a name="line.57"></a> |
| <FONT color="green">058</FONT> <a name="line.58"></a> |
| <FONT color="green">059</FONT> /**<a name="line.59"></a> |
| <FONT color="green">060</FONT> * Advance to the next node represented by this {@link HeapNode}<a name="line.60"></a> |
| <FONT color="green">061</FONT> *<a name="line.61"></a> |
| <FONT color="green">062</FONT> * @return the next DTM node.<a name="line.62"></a> |
| <FONT color="green">063</FONT> */<a name="line.63"></a> |
| <FONT color="green">064</FONT> public abstract int step();<a name="line.64"></a> |
| <FONT color="green">065</FONT> <a name="line.65"></a> |
| <FONT color="green">066</FONT> <a name="line.66"></a> |
| <FONT color="green">067</FONT> /**<a name="line.67"></a> |
| <FONT color="green">068</FONT> * Creates a deep copy of this {@link HeapNode}. The clone is not<a name="line.68"></a> |
| <FONT color="green">069</FONT> * reset from the current position of the original.<a name="line.69"></a> |
| <FONT color="green">070</FONT> *<a name="line.70"></a> |
| <FONT color="green">071</FONT> * @return the cloned heap node<a name="line.71"></a> |
| <FONT color="green">072</FONT> */<a name="line.72"></a> |
| <FONT color="green">073</FONT> public HeapNode cloneHeapNode() {<a name="line.73"></a> |
| <FONT color="green">074</FONT> HeapNode clone;<a name="line.74"></a> |
| <FONT color="green">075</FONT> <a name="line.75"></a> |
| <FONT color="green">076</FONT> try {<a name="line.76"></a> |
| <FONT color="green">077</FONT> clone = (HeapNode) super.clone();<a name="line.77"></a> |
| <FONT color="green">078</FONT> } catch (CloneNotSupportedException e) {<a name="line.78"></a> |
| <FONT color="green">079</FONT> BasisLibrary.runTimeError(BasisLibrary.ITERATOR_CLONE_ERR,<a name="line.79"></a> |
| <FONT color="green">080</FONT> e.toString());<a name="line.80"></a> |
| <FONT color="green">081</FONT> return null;<a name="line.81"></a> |
| <FONT color="green">082</FONT> }<a name="line.82"></a> |
| <FONT color="green">083</FONT> <a name="line.83"></a> |
| <FONT color="green">084</FONT> clone._node = _node;<a name="line.84"></a> |
| <FONT color="green">085</FONT> clone._markedNode = _node;<a name="line.85"></a> |
| <FONT color="green">086</FONT> <a name="line.86"></a> |
| <FONT color="green">087</FONT> return clone;<a name="line.87"></a> |
| <FONT color="green">088</FONT> }<a name="line.88"></a> |
| <FONT color="green">089</FONT> <a name="line.89"></a> |
| <FONT color="green">090</FONT> /**<a name="line.90"></a> |
| <FONT color="green">091</FONT> * Remembers the current node for the next call to {@link #gotoMark()}.<a name="line.91"></a> |
| <FONT color="green">092</FONT> */<a name="line.92"></a> |
| <FONT color="green">093</FONT> public void setMark() {<a name="line.93"></a> |
| <FONT color="green">094</FONT> _markedNode = _node;<a name="line.94"></a> |
| <FONT color="green">095</FONT> }<a name="line.95"></a> |
| <FONT color="green">096</FONT> <a name="line.96"></a> |
| <FONT color="green">097</FONT> /**<a name="line.97"></a> |
| <FONT color="green">098</FONT> * Restores the current node remembered by {@link #setMark()}.<a name="line.98"></a> |
| <FONT color="green">099</FONT> */<a name="line.99"></a> |
| <FONT color="green">100</FONT> public void gotoMark() {<a name="line.100"></a> |
| <FONT color="green">101</FONT> _node = _markedNode;<a name="line.101"></a> |
| <FONT color="green">102</FONT> }<a name="line.102"></a> |
| <FONT color="green">103</FONT> <a name="line.103"></a> |
| <FONT color="green">104</FONT> /**<a name="line.104"></a> |
| <FONT color="green">105</FONT> * Performs a comparison of the two heap nodes<a name="line.105"></a> |
| <FONT color="green">106</FONT> *<a name="line.106"></a> |
| <FONT color="green">107</FONT> * @param heapNode the heap node against which to compare<a name="line.107"></a> |
| <FONT color="green">108</FONT> * @return <code>true</code> if and only if the current node for this<a name="line.108"></a> |
| <FONT color="green">109</FONT> * heap node is before the current node of the argument heap<a name="line.109"></a> |
| <FONT color="green">110</FONT> * node in document order.<a name="line.110"></a> |
| <FONT color="green">111</FONT> */<a name="line.111"></a> |
| <FONT color="green">112</FONT> public abstract boolean isLessThan(HeapNode heapNode);<a name="line.112"></a> |
| <FONT color="green">113</FONT> <a name="line.113"></a> |
| <FONT color="green">114</FONT> /**<a name="line.114"></a> |
| <FONT color="green">115</FONT> * Sets context with respect to which this heap node is evaluated.<a name="line.115"></a> |
| <FONT color="green">116</FONT> *<a name="line.116"></a> |
| <FONT color="green">117</FONT> * @param node The new context node<a name="line.117"></a> |
| <FONT color="green">118</FONT> * @return a {@link HeapNode} which may or may not be the same as<a name="line.118"></a> |
| <FONT color="green">119</FONT> * this <code>HeapNode</code>.<a name="line.119"></a> |
| <FONT color="green">120</FONT> */<a name="line.120"></a> |
| <FONT color="green">121</FONT> public abstract HeapNode setStartNode(int node);<a name="line.121"></a> |
| <FONT color="green">122</FONT> <a name="line.122"></a> |
| <FONT color="green">123</FONT> /**<a name="line.123"></a> |
| <FONT color="green">124</FONT> * Reset the heap node back to its beginning.<a name="line.124"></a> |
| <FONT color="green">125</FONT> *<a name="line.125"></a> |
| <FONT color="green">126</FONT> * @return a {@link HeapNode} which may or may not be the same as<a name="line.126"></a> |
| <FONT color="green">127</FONT> * this <code>HeapNode</code>.<a name="line.127"></a> |
| <FONT color="green">128</FONT> */<a name="line.128"></a> |
| <FONT color="green">129</FONT> public abstract HeapNode reset();<a name="line.129"></a> |
| <FONT color="green">130</FONT> } // end of HeapNode<a name="line.130"></a> |
| <FONT color="green">131</FONT> <a name="line.131"></a> |
| <FONT color="green">132</FONT> private static final int InitSize = 8;<a name="line.132"></a> |
| <FONT color="green">133</FONT> <a name="line.133"></a> |
| <FONT color="green">134</FONT> private int _heapSize = 0;<a name="line.134"></a> |
| <FONT color="green">135</FONT> private int _size = InitSize;<a name="line.135"></a> |
| <FONT color="green">136</FONT> private HeapNode[] _heap = new HeapNode[InitSize];<a name="line.136"></a> |
| <FONT color="green">137</FONT> private int _free = 0;<a name="line.137"></a> |
| <FONT color="green">138</FONT> <a name="line.138"></a> |
| <FONT color="green">139</FONT> // Last node returned by this MultiValuedNodeHeapIterator to the caller of<a name="line.139"></a> |
| <FONT color="green">140</FONT> // next; used to prune duplicates<a name="line.140"></a> |
| <FONT color="green">141</FONT> private int _returnedLast;<a name="line.141"></a> |
| <FONT color="green">142</FONT> <a name="line.142"></a> |
| <FONT color="green">143</FONT> // cached returned last for use in gotoMark<a name="line.143"></a> |
| <FONT color="green">144</FONT> private int _cachedReturnedLast = END;<a name="line.144"></a> |
| <FONT color="green">145</FONT> <a name="line.145"></a> |
| <FONT color="green">146</FONT> // cached heap size for use in gotoMark<a name="line.146"></a> |
| <FONT color="green">147</FONT> private int _cachedHeapSize;<a name="line.147"></a> |
| <FONT color="green">148</FONT> <a name="line.148"></a> |
| <FONT color="green">149</FONT> <a name="line.149"></a> |
| <FONT color="green">150</FONT> public DTMAxisIterator cloneIterator() {<a name="line.150"></a> |
| <FONT color="green">151</FONT> _isRestartable = false;<a name="line.151"></a> |
| <FONT color="green">152</FONT> final HeapNode[] heapCopy = new HeapNode[_heap.length];<a name="line.152"></a> |
| <FONT color="green">153</FONT> try {<a name="line.153"></a> |
| <FONT color="green">154</FONT> MultiValuedNodeHeapIterator clone =<a name="line.154"></a> |
| <FONT color="green">155</FONT> (MultiValuedNodeHeapIterator)super.clone();<a name="line.155"></a> |
| <FONT color="green">156</FONT> <a name="line.156"></a> |
| <FONT color="green">157</FONT> for (int i = 0; i < _free; i++) {<a name="line.157"></a> |
| <FONT color="green">158</FONT> heapCopy[i] = _heap[i].cloneHeapNode();<a name="line.158"></a> |
| <FONT color="green">159</FONT> }<a name="line.159"></a> |
| <FONT color="green">160</FONT> clone.setRestartable(false);<a name="line.160"></a> |
| <FONT color="green">161</FONT> clone._heap = heapCopy;<a name="line.161"></a> |
| <FONT color="green">162</FONT> return clone.reset();<a name="line.162"></a> |
| <FONT color="green">163</FONT> } <a name="line.163"></a> |
| <FONT color="green">164</FONT> catch (CloneNotSupportedException e) {<a name="line.164"></a> |
| <FONT color="green">165</FONT> BasisLibrary.runTimeError(BasisLibrary.ITERATOR_CLONE_ERR,<a name="line.165"></a> |
| <FONT color="green">166</FONT> e.toString());<a name="line.166"></a> |
| <FONT color="green">167</FONT> return null;<a name="line.167"></a> |
| <FONT color="green">168</FONT> }<a name="line.168"></a> |
| <FONT color="green">169</FONT> }<a name="line.169"></a> |
| <FONT color="green">170</FONT> <a name="line.170"></a> |
| <FONT color="green">171</FONT> protected void addHeapNode(HeapNode node) {<a name="line.171"></a> |
| <FONT color="green">172</FONT> if (_free == _size) {<a name="line.172"></a> |
| <FONT color="green">173</FONT> HeapNode[] newArray = new HeapNode[_size *= 2];<a name="line.173"></a> |
| <FONT color="green">174</FONT> System.arraycopy(_heap, 0, newArray, 0, _free);<a name="line.174"></a> |
| <FONT color="green">175</FONT> _heap = newArray;<a name="line.175"></a> |
| <FONT color="green">176</FONT> }<a name="line.176"></a> |
| <FONT color="green">177</FONT> _heapSize++;<a name="line.177"></a> |
| <FONT color="green">178</FONT> _heap[_free++] = node;<a name="line.178"></a> |
| <FONT color="green">179</FONT> }<a name="line.179"></a> |
| <FONT color="green">180</FONT> <a name="line.180"></a> |
| <FONT color="green">181</FONT> public int next() {<a name="line.181"></a> |
| <FONT color="green">182</FONT> while (_heapSize > 0) {<a name="line.182"></a> |
| <FONT color="green">183</FONT> final int smallest = _heap[0]._node;<a name="line.183"></a> |
| <FONT color="green">184</FONT> if (smallest == END) { // iterator _heap[0] is done<a name="line.184"></a> |
| <FONT color="green">185</FONT> if (_heapSize > 1) {<a name="line.185"></a> |
| <FONT color="green">186</FONT> // Swap first and last (iterator must be restartable)<a name="line.186"></a> |
| <FONT color="green">187</FONT> final HeapNode temp = _heap[0];<a name="line.187"></a> |
| <FONT color="green">188</FONT> _heap[0] = _heap[--_heapSize];<a name="line.188"></a> |
| <FONT color="green">189</FONT> _heap[_heapSize] = temp;<a name="line.189"></a> |
| <FONT color="green">190</FONT> }<a name="line.190"></a> |
| <FONT color="green">191</FONT> else {<a name="line.191"></a> |
| <FONT color="green">192</FONT> return END;<a name="line.192"></a> |
| <FONT color="green">193</FONT> }<a name="line.193"></a> |
| <FONT color="green">194</FONT> }<a name="line.194"></a> |
| <FONT color="green">195</FONT> else if (smallest == _returnedLast) { // duplicate<a name="line.195"></a> |
| <FONT color="green">196</FONT> _heap[0].step(); // value consumed<a name="line.196"></a> |
| <FONT color="green">197</FONT> }<a name="line.197"></a> |
| <FONT color="green">198</FONT> else {<a name="line.198"></a> |
| <FONT color="green">199</FONT> _heap[0].step(); // value consumed<a name="line.199"></a> |
| <FONT color="green">200</FONT> heapify(0);<a name="line.200"></a> |
| <FONT color="green">201</FONT> return returnNode(_returnedLast = smallest);<a name="line.201"></a> |
| <FONT color="green">202</FONT> }<a name="line.202"></a> |
| <FONT color="green">203</FONT> // fallthrough if not returned above<a name="line.203"></a> |
| <FONT color="green">204</FONT> heapify(0);<a name="line.204"></a> |
| <FONT color="green">205</FONT> }<a name="line.205"></a> |
| <FONT color="green">206</FONT> return END;<a name="line.206"></a> |
| <FONT color="green">207</FONT> }<a name="line.207"></a> |
| <FONT color="green">208</FONT> <a name="line.208"></a> |
| <FONT color="green">209</FONT> public DTMAxisIterator setStartNode(int node) {<a name="line.209"></a> |
| <FONT color="green">210</FONT> if (_isRestartable) {<a name="line.210"></a> |
| <FONT color="green">211</FONT> _startNode = node;<a name="line.211"></a> |
| <FONT color="green">212</FONT> for (int i = 0; i < _free; i++) {<a name="line.212"></a> |
| <FONT color="green">213</FONT> if(!_heap[i]._isStartSet){<a name="line.213"></a> |
| <FONT color="green">214</FONT> _heap[i].setStartNode(node);<a name="line.214"></a> |
| <FONT color="green">215</FONT> _heap[i].step(); // to get the first node<a name="line.215"></a> |
| <FONT color="green">216</FONT> _heap[i]._isStartSet = true;<a name="line.216"></a> |
| <FONT color="green">217</FONT> }<a name="line.217"></a> |
| <FONT color="green">218</FONT> }<a name="line.218"></a> |
| <FONT color="green">219</FONT> // build heap<a name="line.219"></a> |
| <FONT color="green">220</FONT> for (int i = (_heapSize = _free)/2; i >= 0; i--) {<a name="line.220"></a> |
| <FONT color="green">221</FONT> heapify(i);<a name="line.221"></a> |
| <FONT color="green">222</FONT> }<a name="line.222"></a> |
| <FONT color="green">223</FONT> _returnedLast = END;<a name="line.223"></a> |
| <FONT color="green">224</FONT> return resetPosition();<a name="line.224"></a> |
| <FONT color="green">225</FONT> }<a name="line.225"></a> |
| <FONT color="green">226</FONT> return this;<a name="line.226"></a> |
| <FONT color="green">227</FONT> }<a name="line.227"></a> |
| <FONT color="green">228</FONT> <a name="line.228"></a> |
| <FONT color="green">229</FONT> protected void init() {<a name="line.229"></a> |
| <FONT color="green">230</FONT> for (int i =0; i < _free; i++) {<a name="line.230"></a> |
| <FONT color="green">231</FONT> _heap[i] = null;<a name="line.231"></a> |
| <FONT color="green">232</FONT> }<a name="line.232"></a> |
| <FONT color="green">233</FONT> <a name="line.233"></a> |
| <FONT color="green">234</FONT> _heapSize = 0;<a name="line.234"></a> |
| <FONT color="green">235</FONT> _free = 0;<a name="line.235"></a> |
| <FONT color="green">236</FONT> }<a name="line.236"></a> |
| <FONT color="green">237</FONT> <a name="line.237"></a> |
| <FONT color="green">238</FONT> /* Build a heap in document order. put the smallest node on the top. <a name="line.238"></a> |
| <FONT color="green">239</FONT> * "smallest node" means the node before other nodes in document order<a name="line.239"></a> |
| <FONT color="green">240</FONT> */<a name="line.240"></a> |
| <FONT color="green">241</FONT> private void heapify(int i) {<a name="line.241"></a> |
| <FONT color="green">242</FONT> for (int r, l, smallest;;) {<a name="line.242"></a> |
| <FONT color="green">243</FONT> r = (i + 1) << 1; l = r - 1;<a name="line.243"></a> |
| <FONT color="green">244</FONT> smallest = l < _heapSize <a name="line.244"></a> |
| <FONT color="green">245</FONT> && _heap[l].isLessThan(_heap[i]) ? l : i;<a name="line.245"></a> |
| <FONT color="green">246</FONT> if (r < _heapSize && _heap[r].isLessThan(_heap[smallest])) {<a name="line.246"></a> |
| <FONT color="green">247</FONT> smallest = r;<a name="line.247"></a> |
| <FONT color="green">248</FONT> }<a name="line.248"></a> |
| <FONT color="green">249</FONT> if (smallest != i) {<a name="line.249"></a> |
| <FONT color="green">250</FONT> final HeapNode temp = _heap[smallest];<a name="line.250"></a> |
| <FONT color="green">251</FONT> _heap[smallest] = _heap[i];<a name="line.251"></a> |
| <FONT color="green">252</FONT> _heap[i] = temp;<a name="line.252"></a> |
| <FONT color="green">253</FONT> i = smallest;<a name="line.253"></a> |
| <FONT color="green">254</FONT> } else {<a name="line.254"></a> |
| <FONT color="green">255</FONT> break;<a name="line.255"></a> |
| <FONT color="green">256</FONT> }<a name="line.256"></a> |
| <FONT color="green">257</FONT> }<a name="line.257"></a> |
| <FONT color="green">258</FONT> }<a name="line.258"></a> |
| <FONT color="green">259</FONT> <a name="line.259"></a> |
| <FONT color="green">260</FONT> public void setMark() {<a name="line.260"></a> |
| <FONT color="green">261</FONT> for (int i = 0; i < _free; i++) {<a name="line.261"></a> |
| <FONT color="green">262</FONT> _heap[i].setMark();<a name="line.262"></a> |
| <FONT color="green">263</FONT> }<a name="line.263"></a> |
| <FONT color="green">264</FONT> _cachedReturnedLast = _returnedLast; <a name="line.264"></a> |
| <FONT color="green">265</FONT> _cachedHeapSize = _heapSize;<a name="line.265"></a> |
| <FONT color="green">266</FONT> }<a name="line.266"></a> |
| <FONT color="green">267</FONT> <a name="line.267"></a> |
| <FONT color="green">268</FONT> public void gotoMark() {<a name="line.268"></a> |
| <FONT color="green">269</FONT> for (int i = 0; i < _free; i++) {<a name="line.269"></a> |
| <FONT color="green">270</FONT> _heap[i].gotoMark();<a name="line.270"></a> |
| <FONT color="green">271</FONT> }<a name="line.271"></a> |
| <FONT color="green">272</FONT> // rebuild heap after call last() function. fix for bug 20913<a name="line.272"></a> |
| <FONT color="green">273</FONT> for (int i = (_heapSize = _cachedHeapSize)/2; i >= 0; i--) {<a name="line.273"></a> |
| <FONT color="green">274</FONT> heapify(i);<a name="line.274"></a> |
| <FONT color="green">275</FONT> }<a name="line.275"></a> |
| <FONT color="green">276</FONT> _returnedLast = _cachedReturnedLast; <a name="line.276"></a> |
| <FONT color="green">277</FONT> }<a name="line.277"></a> |
| <FONT color="green">278</FONT> <a name="line.278"></a> |
| <FONT color="green">279</FONT> public DTMAxisIterator reset() {<a name="line.279"></a> |
| <FONT color="green">280</FONT> for (int i = 0; i < _free; i++) {<a name="line.280"></a> |
| <FONT color="green">281</FONT> _heap[i].reset();<a name="line.281"></a> |
| <FONT color="green">282</FONT> _heap[i].step();<a name="line.282"></a> |
| <FONT color="green">283</FONT> }<a name="line.283"></a> |
| <FONT color="green">284</FONT> <a name="line.284"></a> |
| <FONT color="green">285</FONT> // build heap<a name="line.285"></a> |
| <FONT color="green">286</FONT> for (int i = (_heapSize = _free)/2; i >= 0; i--) {<a name="line.286"></a> |
| <FONT color="green">287</FONT> heapify(i);<a name="line.287"></a> |
| <FONT color="green">288</FONT> }<a name="line.288"></a> |
| <FONT color="green">289</FONT> <a name="line.289"></a> |
| <FONT color="green">290</FONT> _returnedLast = END;<a name="line.290"></a> |
| <FONT color="green">291</FONT> return resetPosition();<a name="line.291"></a> |
| <FONT color="green">292</FONT> }<a name="line.292"></a> |
| <FONT color="green">293</FONT> <a name="line.293"></a> |
| <FONT color="green">294</FONT> }<a name="line.294"></a> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </PRE> |
| </BODY> |
| </HTML> |
