| <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: NodeVector.java 1225445 2011-12-29 06:08:53Z mrglavas $<a name="line.19"></a> |
| <FONT color="green">020</FONT> */<a name="line.20"></a> |
| <FONT color="green">021</FONT> package org.apache.xml.utils;<a name="line.21"></a> |
| <FONT color="green">022</FONT> <a name="line.22"></a> |
| <FONT color="green">023</FONT> import java.io.Serializable;<a name="line.23"></a> |
| <FONT color="green">024</FONT> <a name="line.24"></a> |
| <FONT color="green">025</FONT> import org.apache.xml.dtm.DTM;<a name="line.25"></a> |
| <FONT color="green">026</FONT> <a name="line.26"></a> |
| <FONT color="green">027</FONT> /**<a name="line.27"></a> |
| <FONT color="green">028</FONT> * A very simple table that stores a list of Nodes.<a name="line.28"></a> |
| <FONT color="green">029</FONT> * @xsl.usage internal<a name="line.29"></a> |
| <FONT color="green">030</FONT> */<a name="line.30"></a> |
| <FONT color="green">031</FONT> public class NodeVector implements Serializable, Cloneable<a name="line.31"></a> |
| <FONT color="green">032</FONT> {<a name="line.32"></a> |
| <FONT color="green">033</FONT> static final long serialVersionUID = -713473092200731870L;<a name="line.33"></a> |
| <FONT color="green">034</FONT> <a name="line.34"></a> |
| <FONT color="green">035</FONT> /**<a name="line.35"></a> |
| <FONT color="green">036</FONT> * Size of blocks to allocate.<a name="line.36"></a> |
| <FONT color="green">037</FONT> * @serial <a name="line.37"></a> |
| <FONT color="green">038</FONT> */<a name="line.38"></a> |
| <FONT color="green">039</FONT> private int m_blocksize;<a name="line.39"></a> |
| <FONT color="green">040</FONT> <a name="line.40"></a> |
| <FONT color="green">041</FONT> /**<a name="line.41"></a> |
| <FONT color="green">042</FONT> * Array of nodes this points to.<a name="line.42"></a> |
| <FONT color="green">043</FONT> * @serial <a name="line.43"></a> |
| <FONT color="green">044</FONT> */<a name="line.44"></a> |
| <FONT color="green">045</FONT> private int m_map[];<a name="line.45"></a> |
| <FONT color="green">046</FONT> <a name="line.46"></a> |
| <FONT color="green">047</FONT> /**<a name="line.47"></a> |
| <FONT color="green">048</FONT> * Number of nodes in this NodeVector.<a name="line.48"></a> |
| <FONT color="green">049</FONT> * @serial <a name="line.49"></a> |
| <FONT color="green">050</FONT> */<a name="line.50"></a> |
| <FONT color="green">051</FONT> protected int m_firstFree = 0;<a name="line.51"></a> |
| <FONT color="green">052</FONT> <a name="line.52"></a> |
| <FONT color="green">053</FONT> /**<a name="line.53"></a> |
| <FONT color="green">054</FONT> * Size of the array this points to.<a name="line.54"></a> |
| <FONT color="green">055</FONT> * @serial <a name="line.55"></a> |
| <FONT color="green">056</FONT> */<a name="line.56"></a> |
| <FONT color="green">057</FONT> private int m_mapSize; // lazy initialization<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> * Default constructor.<a name="line.60"></a> |
| <FONT color="green">061</FONT> */<a name="line.61"></a> |
| <FONT color="green">062</FONT> public NodeVector()<a name="line.62"></a> |
| <FONT color="green">063</FONT> {<a name="line.63"></a> |
| <FONT color="green">064</FONT> m_blocksize = 32;<a name="line.64"></a> |
| <FONT color="green">065</FONT> m_mapSize = 0;<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> /**<a name="line.68"></a> |
| <FONT color="green">069</FONT> * Construct a NodeVector, using the given block size.<a name="line.69"></a> |
| <FONT color="green">070</FONT> *<a name="line.70"></a> |
| <FONT color="green">071</FONT> * @param blocksize Size of blocks to allocate<a name="line.71"></a> |
| <FONT color="green">072</FONT> */<a name="line.72"></a> |
| <FONT color="green">073</FONT> public NodeVector(int blocksize)<a name="line.73"></a> |
| <FONT color="green">074</FONT> {<a name="line.74"></a> |
| <FONT color="green">075</FONT> m_blocksize = blocksize;<a name="line.75"></a> |
| <FONT color="green">076</FONT> m_mapSize = 0;<a name="line.76"></a> |
| <FONT color="green">077</FONT> }<a name="line.77"></a> |
| <FONT color="green">078</FONT> <a name="line.78"></a> |
| <FONT color="green">079</FONT> /**<a name="line.79"></a> |
| <FONT color="green">080</FONT> * Get a cloned LocPathIterator.<a name="line.80"></a> |
| <FONT color="green">081</FONT> *<a name="line.81"></a> |
| <FONT color="green">082</FONT> * @return A clone of this<a name="line.82"></a> |
| <FONT color="green">083</FONT> *<a name="line.83"></a> |
| <FONT color="green">084</FONT> * @throws CloneNotSupportedException<a name="line.84"></a> |
| <FONT color="green">085</FONT> */<a name="line.85"></a> |
| <FONT color="green">086</FONT> public Object clone() throws CloneNotSupportedException<a name="line.86"></a> |
| <FONT color="green">087</FONT> {<a name="line.87"></a> |
| <FONT color="green">088</FONT> <a name="line.88"></a> |
| <FONT color="green">089</FONT> NodeVector clone = (NodeVector) super.clone();<a name="line.89"></a> |
| <FONT color="green">090</FONT> <a name="line.90"></a> |
| <FONT color="green">091</FONT> if ((null != this.m_map) && (this.m_map == clone.m_map))<a name="line.91"></a> |
| <FONT color="green">092</FONT> {<a name="line.92"></a> |
| <FONT color="green">093</FONT> clone.m_map = new int[this.m_map.length];<a name="line.93"></a> |
| <FONT color="green">094</FONT> <a name="line.94"></a> |
| <FONT color="green">095</FONT> System.arraycopy(this.m_map, 0, clone.m_map, 0, this.m_map.length);<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> return clone;<a name="line.98"></a> |
| <FONT color="green">099</FONT> }<a name="line.99"></a> |
| <FONT color="green">100</FONT> <a name="line.100"></a> |
| <FONT color="green">101</FONT> /**<a name="line.101"></a> |
| <FONT color="green">102</FONT> * Get the length of the list.<a name="line.102"></a> |
| <FONT color="green">103</FONT> *<a name="line.103"></a> |
| <FONT color="green">104</FONT> * @return Number of nodes in this NodeVector<a name="line.104"></a> |
| <FONT color="green">105</FONT> */<a name="line.105"></a> |
| <FONT color="green">106</FONT> public int size()<a name="line.106"></a> |
| <FONT color="green">107</FONT> {<a name="line.107"></a> |
| <FONT color="green">108</FONT> return m_firstFree;<a name="line.108"></a> |
| <FONT color="green">109</FONT> }<a name="line.109"></a> |
| <FONT color="green">110</FONT> <a name="line.110"></a> |
| <FONT color="green">111</FONT> /**<a name="line.111"></a> |
| <FONT color="green">112</FONT> * Append a Node onto the vector.<a name="line.112"></a> |
| <FONT color="green">113</FONT> *<a name="line.113"></a> |
| <FONT color="green">114</FONT> * @param value Node to add to the vector<a name="line.114"></a> |
| <FONT color="green">115</FONT> */<a name="line.115"></a> |
| <FONT color="green">116</FONT> public void addElement(int value)<a name="line.116"></a> |
| <FONT color="green">117</FONT> {<a name="line.117"></a> |
| <FONT color="green">118</FONT> <a name="line.118"></a> |
| <FONT color="green">119</FONT> if ((m_firstFree + 1) >= m_mapSize)<a name="line.119"></a> |
| <FONT color="green">120</FONT> {<a name="line.120"></a> |
| <FONT color="green">121</FONT> if (null == m_map)<a name="line.121"></a> |
| <FONT color="green">122</FONT> {<a name="line.122"></a> |
| <FONT color="green">123</FONT> m_map = new int[m_blocksize];<a name="line.123"></a> |
| <FONT color="green">124</FONT> m_mapSize = m_blocksize;<a name="line.124"></a> |
| <FONT color="green">125</FONT> }<a name="line.125"></a> |
| <FONT color="green">126</FONT> else<a name="line.126"></a> |
| <FONT color="green">127</FONT> {<a name="line.127"></a> |
| <FONT color="green">128</FONT> m_mapSize += m_blocksize;<a name="line.128"></a> |
| <FONT color="green">129</FONT> <a name="line.129"></a> |
| <FONT color="green">130</FONT> int newMap[] = new int[m_mapSize];<a name="line.130"></a> |
| <FONT color="green">131</FONT> <a name="line.131"></a> |
| <FONT color="green">132</FONT> System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);<a name="line.132"></a> |
| <FONT color="green">133</FONT> <a name="line.133"></a> |
| <FONT color="green">134</FONT> m_map = newMap;<a name="line.134"></a> |
| <FONT color="green">135</FONT> }<a name="line.135"></a> |
| <FONT color="green">136</FONT> }<a name="line.136"></a> |
| <FONT color="green">137</FONT> <a name="line.137"></a> |
| <FONT color="green">138</FONT> m_map[m_firstFree] = value;<a name="line.138"></a> |
| <FONT color="green">139</FONT> <a name="line.139"></a> |
| <FONT color="green">140</FONT> m_firstFree++;<a name="line.140"></a> |
| <FONT color="green">141</FONT> }<a name="line.141"></a> |
| <FONT color="green">142</FONT> <a name="line.142"></a> |
| <FONT color="green">143</FONT> /**<a name="line.143"></a> |
| <FONT color="green">144</FONT> * Append a Node onto the vector.<a name="line.144"></a> |
| <FONT color="green">145</FONT> *<a name="line.145"></a> |
| <FONT color="green">146</FONT> * @param value Node to add to the vector<a name="line.146"></a> |
| <FONT color="green">147</FONT> */<a name="line.147"></a> |
| <FONT color="green">148</FONT> public final void push(int value)<a name="line.148"></a> |
| <FONT color="green">149</FONT> {<a name="line.149"></a> |
| <FONT color="green">150</FONT> <a name="line.150"></a> |
| <FONT color="green">151</FONT> int ff = m_firstFree;<a name="line.151"></a> |
| <FONT color="green">152</FONT> <a name="line.152"></a> |
| <FONT color="green">153</FONT> if ((ff + 1) >= m_mapSize)<a name="line.153"></a> |
| <FONT color="green">154</FONT> {<a name="line.154"></a> |
| <FONT color="green">155</FONT> if (null == m_map)<a name="line.155"></a> |
| <FONT color="green">156</FONT> {<a name="line.156"></a> |
| <FONT color="green">157</FONT> m_map = new int[m_blocksize];<a name="line.157"></a> |
| <FONT color="green">158</FONT> m_mapSize = m_blocksize;<a name="line.158"></a> |
| <FONT color="green">159</FONT> }<a name="line.159"></a> |
| <FONT color="green">160</FONT> else<a name="line.160"></a> |
| <FONT color="green">161</FONT> {<a name="line.161"></a> |
| <FONT color="green">162</FONT> m_mapSize += m_blocksize;<a name="line.162"></a> |
| <FONT color="green">163</FONT> <a name="line.163"></a> |
| <FONT color="green">164</FONT> int newMap[] = new int[m_mapSize];<a name="line.164"></a> |
| <FONT color="green">165</FONT> <a name="line.165"></a> |
| <FONT color="green">166</FONT> System.arraycopy(m_map, 0, newMap, 0, ff + 1);<a name="line.166"></a> |
| <FONT color="green">167</FONT> <a name="line.167"></a> |
| <FONT color="green">168</FONT> m_map = newMap;<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> <a name="line.171"></a> |
| <FONT color="green">172</FONT> m_map[ff] = value;<a name="line.172"></a> |
| <FONT color="green">173</FONT> <a name="line.173"></a> |
| <FONT color="green">174</FONT> ff++;<a name="line.174"></a> |
| <FONT color="green">175</FONT> <a name="line.175"></a> |
| <FONT color="green">176</FONT> m_firstFree = ff;<a name="line.176"></a> |
| <FONT color="green">177</FONT> }<a name="line.177"></a> |
| <FONT color="green">178</FONT> <a name="line.178"></a> |
| <FONT color="green">179</FONT> /**<a name="line.179"></a> |
| <FONT color="green">180</FONT> * Pop a node from the tail of the vector and return the result.<a name="line.180"></a> |
| <FONT color="green">181</FONT> *<a name="line.181"></a> |
| <FONT color="green">182</FONT> * @return the node at the tail of the vector<a name="line.182"></a> |
| <FONT color="green">183</FONT> */<a name="line.183"></a> |
| <FONT color="green">184</FONT> public final int pop()<a name="line.184"></a> |
| <FONT color="green">185</FONT> {<a name="line.185"></a> |
| <FONT color="green">186</FONT> <a name="line.186"></a> |
| <FONT color="green">187</FONT> m_firstFree--;<a name="line.187"></a> |
| <FONT color="green">188</FONT> <a name="line.188"></a> |
| <FONT color="green">189</FONT> int n = m_map[m_firstFree];<a name="line.189"></a> |
| <FONT color="green">190</FONT> <a name="line.190"></a> |
| <FONT color="green">191</FONT> m_map[m_firstFree] = DTM.NULL;<a name="line.191"></a> |
| <FONT color="green">192</FONT> <a name="line.192"></a> |
| <FONT color="green">193</FONT> return n;<a name="line.193"></a> |
| <FONT color="green">194</FONT> }<a name="line.194"></a> |
| <FONT color="green">195</FONT> <a name="line.195"></a> |
| <FONT color="green">196</FONT> /**<a name="line.196"></a> |
| <FONT color="green">197</FONT> * Pop a node from the tail of the vector and return the<a name="line.197"></a> |
| <FONT color="green">198</FONT> * top of the stack after the pop.<a name="line.198"></a> |
| <FONT color="green">199</FONT> *<a name="line.199"></a> |
| <FONT color="green">200</FONT> * @return The top of the stack after it's been popped<a name="line.200"></a> |
| <FONT color="green">201</FONT> */<a name="line.201"></a> |
| <FONT color="green">202</FONT> public final int popAndTop()<a name="line.202"></a> |
| <FONT color="green">203</FONT> {<a name="line.203"></a> |
| <FONT color="green">204</FONT> <a name="line.204"></a> |
| <FONT color="green">205</FONT> m_firstFree--;<a name="line.205"></a> |
| <FONT color="green">206</FONT> <a name="line.206"></a> |
| <FONT color="green">207</FONT> m_map[m_firstFree] = DTM.NULL;<a name="line.207"></a> |
| <FONT color="green">208</FONT> <a name="line.208"></a> |
| <FONT color="green">209</FONT> return (m_firstFree == 0) ? DTM.NULL : m_map[m_firstFree - 1];<a name="line.209"></a> |
| <FONT color="green">210</FONT> }<a name="line.210"></a> |
| <FONT color="green">211</FONT> <a name="line.211"></a> |
| <FONT color="green">212</FONT> /**<a name="line.212"></a> |
| <FONT color="green">213</FONT> * Pop a node from the tail of the vector.<a name="line.213"></a> |
| <FONT color="green">214</FONT> */<a name="line.214"></a> |
| <FONT color="green">215</FONT> public final void popQuick()<a name="line.215"></a> |
| <FONT color="green">216</FONT> {<a name="line.216"></a> |
| <FONT color="green">217</FONT> <a name="line.217"></a> |
| <FONT color="green">218</FONT> m_firstFree--;<a name="line.218"></a> |
| <FONT color="green">219</FONT> <a name="line.219"></a> |
| <FONT color="green">220</FONT> m_map[m_firstFree] = DTM.NULL;<a name="line.220"></a> |
| <FONT color="green">221</FONT> }<a name="line.221"></a> |
| <FONT color="green">222</FONT> <a name="line.222"></a> |
| <FONT color="green">223</FONT> /**<a name="line.223"></a> |
| <FONT color="green">224</FONT> * Return the node at the top of the stack without popping the stack.<a name="line.224"></a> |
| <FONT color="green">225</FONT> * Special purpose method for TransformerImpl, pushElemTemplateElement.<a name="line.225"></a> |
| <FONT color="green">226</FONT> * Performance critical.<a name="line.226"></a> |
| <FONT color="green">227</FONT> *<a name="line.227"></a> |
| <FONT color="green">228</FONT> * @return Node at the top of the stack or null if stack is empty.<a name="line.228"></a> |
| <FONT color="green">229</FONT> */<a name="line.229"></a> |
| <FONT color="green">230</FONT> public final int peepOrNull()<a name="line.230"></a> |
| <FONT color="green">231</FONT> {<a name="line.231"></a> |
| <FONT color="green">232</FONT> return ((null != m_map) && (m_firstFree > 0))<a name="line.232"></a> |
| <FONT color="green">233</FONT> ? m_map[m_firstFree - 1] : DTM.NULL;<a name="line.233"></a> |
| <FONT color="green">234</FONT> }<a name="line.234"></a> |
| <FONT color="green">235</FONT> <a name="line.235"></a> |
| <FONT color="green">236</FONT> /**<a name="line.236"></a> |
| <FONT color="green">237</FONT> * Push a pair of nodes into the stack.<a name="line.237"></a> |
| <FONT color="green">238</FONT> * Special purpose method for TransformerImpl, pushElemTemplateElement.<a name="line.238"></a> |
| <FONT color="green">239</FONT> * Performance critical.<a name="line.239"></a> |
| <FONT color="green">240</FONT> *<a name="line.240"></a> |
| <FONT color="green">241</FONT> * @param v1 First node to add to vector<a name="line.241"></a> |
| <FONT color="green">242</FONT> * @param v2 Second node to add to vector<a name="line.242"></a> |
| <FONT color="green">243</FONT> */<a name="line.243"></a> |
| <FONT color="green">244</FONT> public final void pushPair(int v1, int v2)<a name="line.244"></a> |
| <FONT color="green">245</FONT> {<a name="line.245"></a> |
| <FONT color="green">246</FONT> <a name="line.246"></a> |
| <FONT color="green">247</FONT> if (null == m_map)<a name="line.247"></a> |
| <FONT color="green">248</FONT> {<a name="line.248"></a> |
| <FONT color="green">249</FONT> m_map = new int[m_blocksize];<a name="line.249"></a> |
| <FONT color="green">250</FONT> m_mapSize = m_blocksize;<a name="line.250"></a> |
| <FONT color="green">251</FONT> }<a name="line.251"></a> |
| <FONT color="green">252</FONT> else<a name="line.252"></a> |
| <FONT color="green">253</FONT> {<a name="line.253"></a> |
| <FONT color="green">254</FONT> if ((m_firstFree + 2) >= m_mapSize)<a name="line.254"></a> |
| <FONT color="green">255</FONT> {<a name="line.255"></a> |
| <FONT color="green">256</FONT> m_mapSize += m_blocksize;<a name="line.256"></a> |
| <FONT color="green">257</FONT> <a name="line.257"></a> |
| <FONT color="green">258</FONT> int newMap[] = new int[m_mapSize];<a name="line.258"></a> |
| <FONT color="green">259</FONT> <a name="line.259"></a> |
| <FONT color="green">260</FONT> System.arraycopy(m_map, 0, newMap, 0, m_firstFree);<a name="line.260"></a> |
| <FONT color="green">261</FONT> <a name="line.261"></a> |
| <FONT color="green">262</FONT> m_map = newMap;<a name="line.262"></a> |
| <FONT color="green">263</FONT> }<a name="line.263"></a> |
| <FONT color="green">264</FONT> }<a name="line.264"></a> |
| <FONT color="green">265</FONT> <a name="line.265"></a> |
| <FONT color="green">266</FONT> m_map[m_firstFree] = v1;<a name="line.266"></a> |
| <FONT color="green">267</FONT> m_map[m_firstFree + 1] = v2;<a name="line.267"></a> |
| <FONT color="green">268</FONT> m_firstFree += 2;<a name="line.268"></a> |
| <FONT color="green">269</FONT> }<a name="line.269"></a> |
| <FONT color="green">270</FONT> <a name="line.270"></a> |
| <FONT color="green">271</FONT> /**<a name="line.271"></a> |
| <FONT color="green">272</FONT> * Pop a pair of nodes from the tail of the stack.<a name="line.272"></a> |
| <FONT color="green">273</FONT> * Special purpose method for TransformerImpl, pushElemTemplateElement.<a name="line.273"></a> |
| <FONT color="green">274</FONT> * Performance critical.<a name="line.274"></a> |
| <FONT color="green">275</FONT> */<a name="line.275"></a> |
| <FONT color="green">276</FONT> public final void popPair()<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> m_firstFree -= 2;<a name="line.279"></a> |
| <FONT color="green">280</FONT> m_map[m_firstFree] = DTM.NULL;<a name="line.280"></a> |
| <FONT color="green">281</FONT> m_map[m_firstFree + 1] = DTM.NULL;<a name="line.281"></a> |
| <FONT color="green">282</FONT> }<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> * Set the tail of the stack to the given node.<a name="line.285"></a> |
| <FONT color="green">286</FONT> * Special purpose method for TransformerImpl, pushElemTemplateElement.<a name="line.286"></a> |
| <FONT color="green">287</FONT> * Performance critical.<a name="line.287"></a> |
| <FONT color="green">288</FONT> *<a name="line.288"></a> |
| <FONT color="green">289</FONT> * @param n Node to set at the tail of vector<a name="line.289"></a> |
| <FONT color="green">290</FONT> */<a name="line.290"></a> |
| <FONT color="green">291</FONT> public final void setTail(int n)<a name="line.291"></a> |
| <FONT color="green">292</FONT> {<a name="line.292"></a> |
| <FONT color="green">293</FONT> m_map[m_firstFree - 1] = n;<a name="line.293"></a> |
| <FONT color="green">294</FONT> }<a name="line.294"></a> |
| <FONT color="green">295</FONT> <a name="line.295"></a> |
| <FONT color="green">296</FONT> /**<a name="line.296"></a> |
| <FONT color="green">297</FONT> * Set the given node one position from the tail.<a name="line.297"></a> |
| <FONT color="green">298</FONT> * Special purpose method for TransformerImpl, pushElemTemplateElement.<a name="line.298"></a> |
| <FONT color="green">299</FONT> * Performance critical.<a name="line.299"></a> |
| <FONT color="green">300</FONT> *<a name="line.300"></a> |
| <FONT color="green">301</FONT> * @param n Node to set<a name="line.301"></a> |
| <FONT color="green">302</FONT> */<a name="line.302"></a> |
| <FONT color="green">303</FONT> public final void setTailSub1(int n)<a name="line.303"></a> |
| <FONT color="green">304</FONT> {<a name="line.304"></a> |
| <FONT color="green">305</FONT> m_map[m_firstFree - 2] = n;<a name="line.305"></a> |
| <FONT color="green">306</FONT> }<a name="line.306"></a> |
| <FONT color="green">307</FONT> <a name="line.307"></a> |
| <FONT color="green">308</FONT> /**<a name="line.308"></a> |
| <FONT color="green">309</FONT> * Return the node at the tail of the vector without popping<a name="line.309"></a> |
| <FONT color="green">310</FONT> * Special purpose method for TransformerImpl, pushElemTemplateElement.<a name="line.310"></a> |
| <FONT color="green">311</FONT> * Performance critical.<a name="line.311"></a> |
| <FONT color="green">312</FONT> *<a name="line.312"></a> |
| <FONT color="green">313</FONT> * @return Node at the tail of the vector<a name="line.313"></a> |
| <FONT color="green">314</FONT> */<a name="line.314"></a> |
| <FONT color="green">315</FONT> public final int peepTail()<a name="line.315"></a> |
| <FONT color="green">316</FONT> {<a name="line.316"></a> |
| <FONT color="green">317</FONT> return m_map[m_firstFree - 1];<a name="line.317"></a> |
| <FONT color="green">318</FONT> }<a name="line.318"></a> |
| <FONT color="green">319</FONT> <a name="line.319"></a> |
| <FONT color="green">320</FONT> /**<a name="line.320"></a> |
| <FONT color="green">321</FONT> * Return the node one position from the tail without popping.<a name="line.321"></a> |
| <FONT color="green">322</FONT> * Special purpose method for TransformerImpl, pushElemTemplateElement.<a name="line.322"></a> |
| <FONT color="green">323</FONT> * Performance critical.<a name="line.323"></a> |
| <FONT color="green">324</FONT> *<a name="line.324"></a> |
| <FONT color="green">325</FONT> * @return Node one away from the tail<a name="line.325"></a> |
| <FONT color="green">326</FONT> */<a name="line.326"></a> |
| <FONT color="green">327</FONT> public final int peepTailSub1()<a name="line.327"></a> |
| <FONT color="green">328</FONT> {<a name="line.328"></a> |
| <FONT color="green">329</FONT> return m_map[m_firstFree - 2];<a name="line.329"></a> |
| <FONT color="green">330</FONT> }<a name="line.330"></a> |
| <FONT color="green">331</FONT> <a name="line.331"></a> |
| <FONT color="green">332</FONT> /**<a name="line.332"></a> |
| <FONT color="green">333</FONT> * Insert a node in order in the list.<a name="line.333"></a> |
| <FONT color="green">334</FONT> *<a name="line.334"></a> |
| <FONT color="green">335</FONT> * @param value Node to insert<a name="line.335"></a> |
| <FONT color="green">336</FONT> */<a name="line.336"></a> |
| <FONT color="green">337</FONT> public void insertInOrder(int value)<a name="line.337"></a> |
| <FONT color="green">338</FONT> {<a name="line.338"></a> |
| <FONT color="green">339</FONT> <a name="line.339"></a> |
| <FONT color="green">340</FONT> for (int i = 0; i < m_firstFree; i++)<a name="line.340"></a> |
| <FONT color="green">341</FONT> {<a name="line.341"></a> |
| <FONT color="green">342</FONT> if (value < m_map[i])<a name="line.342"></a> |
| <FONT color="green">343</FONT> {<a name="line.343"></a> |
| <FONT color="green">344</FONT> insertElementAt(value, i);<a name="line.344"></a> |
| <FONT color="green">345</FONT> <a name="line.345"></a> |
| <FONT color="green">346</FONT> return;<a name="line.346"></a> |
| <FONT color="green">347</FONT> }<a name="line.347"></a> |
| <FONT color="green">348</FONT> }<a name="line.348"></a> |
| <FONT color="green">349</FONT> <a name="line.349"></a> |
| <FONT color="green">350</FONT> addElement(value);<a name="line.350"></a> |
| <FONT color="green">351</FONT> }<a name="line.351"></a> |
| <FONT color="green">352</FONT> <a name="line.352"></a> |
| <FONT color="green">353</FONT> /**<a name="line.353"></a> |
| <FONT color="green">354</FONT> * Inserts the specified node in this vector at the specified index.<a name="line.354"></a> |
| <FONT color="green">355</FONT> * Each component in this vector with an index greater or equal to<a name="line.355"></a> |
| <FONT color="green">356</FONT> * the specified index is shifted upward to have an index one greater<a name="line.356"></a> |
| <FONT color="green">357</FONT> * than the value it had previously.<a name="line.357"></a> |
| <FONT color="green">358</FONT> *<a name="line.358"></a> |
| <FONT color="green">359</FONT> * @param value Node to insert<a name="line.359"></a> |
| <FONT color="green">360</FONT> * @param at Position where to insert<a name="line.360"></a> |
| <FONT color="green">361</FONT> */<a name="line.361"></a> |
| <FONT color="green">362</FONT> public void insertElementAt(int value, int at)<a name="line.362"></a> |
| <FONT color="green">363</FONT> {<a name="line.363"></a> |
| <FONT color="green">364</FONT> <a name="line.364"></a> |
| <FONT color="green">365</FONT> if (null == m_map)<a name="line.365"></a> |
| <FONT color="green">366</FONT> {<a name="line.366"></a> |
| <FONT color="green">367</FONT> m_map = new int[m_blocksize];<a name="line.367"></a> |
| <FONT color="green">368</FONT> m_mapSize = m_blocksize;<a name="line.368"></a> |
| <FONT color="green">369</FONT> }<a name="line.369"></a> |
| <FONT color="green">370</FONT> else if ((m_firstFree + 1) >= m_mapSize)<a name="line.370"></a> |
| <FONT color="green">371</FONT> {<a name="line.371"></a> |
| <FONT color="green">372</FONT> m_mapSize += m_blocksize;<a name="line.372"></a> |
| <FONT color="green">373</FONT> <a name="line.373"></a> |
| <FONT color="green">374</FONT> int newMap[] = new int[m_mapSize];<a name="line.374"></a> |
| <FONT color="green">375</FONT> <a name="line.375"></a> |
| <FONT color="green">376</FONT> System.arraycopy(m_map, 0, newMap, 0, m_firstFree + 1);<a name="line.376"></a> |
| <FONT color="green">377</FONT> <a name="line.377"></a> |
| <FONT color="green">378</FONT> m_map = newMap;<a name="line.378"></a> |
| <FONT color="green">379</FONT> }<a name="line.379"></a> |
| <FONT color="green">380</FONT> <a name="line.380"></a> |
| <FONT color="green">381</FONT> if (at <= (m_firstFree - 1))<a name="line.381"></a> |
| <FONT color="green">382</FONT> {<a name="line.382"></a> |
| <FONT color="green">383</FONT> System.arraycopy(m_map, at, m_map, at + 1, m_firstFree - at);<a name="line.383"></a> |
| <FONT color="green">384</FONT> }<a name="line.384"></a> |
| <FONT color="green">385</FONT> <a name="line.385"></a> |
| <FONT color="green">386</FONT> m_map[at] = value;<a name="line.386"></a> |
| <FONT color="green">387</FONT> <a name="line.387"></a> |
| <FONT color="green">388</FONT> m_firstFree++;<a name="line.388"></a> |
| <FONT color="green">389</FONT> }<a name="line.389"></a> |
| <FONT color="green">390</FONT> <a name="line.390"></a> |
| <FONT color="green">391</FONT> /**<a name="line.391"></a> |
| <FONT color="green">392</FONT> * Append the nodes to the list.<a name="line.392"></a> |
| <FONT color="green">393</FONT> *<a name="line.393"></a> |
| <FONT color="green">394</FONT> * @param nodes NodeVector to append to this list<a name="line.394"></a> |
| <FONT color="green">395</FONT> */<a name="line.395"></a> |
| <FONT color="green">396</FONT> public void appendNodes(NodeVector nodes)<a name="line.396"></a> |
| <FONT color="green">397</FONT> {<a name="line.397"></a> |
| <FONT color="green">398</FONT> <a name="line.398"></a> |
| <FONT color="green">399</FONT> int nNodes = nodes.size();<a name="line.399"></a> |
| <FONT color="green">400</FONT> <a name="line.400"></a> |
| <FONT color="green">401</FONT> if (null == m_map)<a name="line.401"></a> |
| <FONT color="green">402</FONT> {<a name="line.402"></a> |
| <FONT color="green">403</FONT> m_mapSize = nNodes + m_blocksize;<a name="line.403"></a> |
| <FONT color="green">404</FONT> m_map = new int[m_mapSize];<a name="line.404"></a> |
| <FONT color="green">405</FONT> }<a name="line.405"></a> |
| <FONT color="green">406</FONT> else if ((m_firstFree + nNodes) >= m_mapSize)<a name="line.406"></a> |
| <FONT color="green">407</FONT> {<a name="line.407"></a> |
| <FONT color="green">408</FONT> m_mapSize += (nNodes + m_blocksize);<a name="line.408"></a> |
| <FONT color="green">409</FONT> <a name="line.409"></a> |
| <FONT color="green">410</FONT> int newMap[] = new int[m_mapSize];<a name="line.410"></a> |
| <FONT color="green">411</FONT> <a name="line.411"></a> |
| <FONT color="green">412</FONT> System.arraycopy(m_map, 0, newMap, 0, m_firstFree + nNodes);<a name="line.412"></a> |
| <FONT color="green">413</FONT> <a name="line.413"></a> |
| <FONT color="green">414</FONT> m_map = newMap;<a name="line.414"></a> |
| <FONT color="green">415</FONT> }<a name="line.415"></a> |
| <FONT color="green">416</FONT> <a name="line.416"></a> |
| <FONT color="green">417</FONT> System.arraycopy(nodes.m_map, 0, m_map, m_firstFree, nNodes);<a name="line.417"></a> |
| <FONT color="green">418</FONT> <a name="line.418"></a> |
| <FONT color="green">419</FONT> m_firstFree += nNodes;<a name="line.419"></a> |
| <FONT color="green">420</FONT> }<a name="line.420"></a> |
| <FONT color="green">421</FONT> <a name="line.421"></a> |
| <FONT color="green">422</FONT> /**<a name="line.422"></a> |
| <FONT color="green">423</FONT> * Inserts the specified node in this vector at the specified index.<a name="line.423"></a> |
| <FONT color="green">424</FONT> * Each component in this vector with an index greater or equal to<a name="line.424"></a> |
| <FONT color="green">425</FONT> * the specified index is shifted upward to have an index one greater<a name="line.425"></a> |
| <FONT color="green">426</FONT> * than the value it had previously.<a name="line.426"></a> |
| <FONT color="green">427</FONT> */<a name="line.427"></a> |
| <FONT color="green">428</FONT> public void removeAllElements()<a name="line.428"></a> |
| <FONT color="green">429</FONT> {<a name="line.429"></a> |
| <FONT color="green">430</FONT> <a name="line.430"></a> |
| <FONT color="green">431</FONT> if (null == m_map)<a name="line.431"></a> |
| <FONT color="green">432</FONT> return;<a name="line.432"></a> |
| <FONT color="green">433</FONT> <a name="line.433"></a> |
| <FONT color="green">434</FONT> for (int i = 0; i < m_firstFree; i++)<a name="line.434"></a> |
| <FONT color="green">435</FONT> {<a name="line.435"></a> |
| <FONT color="green">436</FONT> m_map[i] = DTM.NULL;<a name="line.436"></a> |
| <FONT color="green">437</FONT> }<a name="line.437"></a> |
| <FONT color="green">438</FONT> <a name="line.438"></a> |
| <FONT color="green">439</FONT> m_firstFree = 0;<a name="line.439"></a> |
| <FONT color="green">440</FONT> }<a name="line.440"></a> |
| <FONT color="green">441</FONT> <a name="line.441"></a> |
| <FONT color="green">442</FONT> /**<a name="line.442"></a> |
| <FONT color="green">443</FONT> * Set the length to zero, but don't clear the array.<a name="line.443"></a> |
| <FONT color="green">444</FONT> */<a name="line.444"></a> |
| <FONT color="green">445</FONT> public void RemoveAllNoClear()<a name="line.445"></a> |
| <FONT color="green">446</FONT> {<a name="line.446"></a> |
| <FONT color="green">447</FONT> <a name="line.447"></a> |
| <FONT color="green">448</FONT> if (null == m_map)<a name="line.448"></a> |
| <FONT color="green">449</FONT> return;<a name="line.449"></a> |
| <FONT color="green">450</FONT> <a name="line.450"></a> |
| <FONT color="green">451</FONT> m_firstFree = 0;<a name="line.451"></a> |
| <FONT color="green">452</FONT> }<a name="line.452"></a> |
| <FONT color="green">453</FONT> <a name="line.453"></a> |
| <FONT color="green">454</FONT> /**<a name="line.454"></a> |
| <FONT color="green">455</FONT> * Removes the first occurrence of the argument from this vector.<a name="line.455"></a> |
| <FONT color="green">456</FONT> * If the object is found in this vector, each component in the vector<a name="line.456"></a> |
| <FONT color="green">457</FONT> * with an index greater or equal to the object's index is shifted<a name="line.457"></a> |
| <FONT color="green">458</FONT> * downward to have an index one smaller than the value it had<a name="line.458"></a> |
| <FONT color="green">459</FONT> * previously.<a name="line.459"></a> |
| <FONT color="green">460</FONT> *<a name="line.460"></a> |
| <FONT color="green">461</FONT> * @param s Node to remove from the list<a name="line.461"></a> |
| <FONT color="green">462</FONT> *<a name="line.462"></a> |
| <FONT color="green">463</FONT> * @return True if the node was successfully removed<a name="line.463"></a> |
| <FONT color="green">464</FONT> */<a name="line.464"></a> |
| <FONT color="green">465</FONT> public boolean removeElement(int s)<a name="line.465"></a> |
| <FONT color="green">466</FONT> {<a name="line.466"></a> |
| <FONT color="green">467</FONT> <a name="line.467"></a> |
| <FONT color="green">468</FONT> if (null == m_map)<a name="line.468"></a> |
| <FONT color="green">469</FONT> return false;<a name="line.469"></a> |
| <FONT color="green">470</FONT> <a name="line.470"></a> |
| <FONT color="green">471</FONT> for (int i = 0; i < m_firstFree; i++)<a name="line.471"></a> |
| <FONT color="green">472</FONT> {<a name="line.472"></a> |
| <FONT color="green">473</FONT> int node = m_map[i];<a name="line.473"></a> |
| <FONT color="green">474</FONT> <a name="line.474"></a> |
| <FONT color="green">475</FONT> if (node == s)<a name="line.475"></a> |
| <FONT color="green">476</FONT> {<a name="line.476"></a> |
| <FONT color="green">477</FONT> if (i > m_firstFree)<a name="line.477"></a> |
| <FONT color="green">478</FONT> System.arraycopy(m_map, i + 1, m_map, i - 1, m_firstFree - i);<a name="line.478"></a> |
| <FONT color="green">479</FONT> else<a name="line.479"></a> |
| <FONT color="green">480</FONT> m_map[i] = DTM.NULL;<a name="line.480"></a> |
| <FONT color="green">481</FONT> <a name="line.481"></a> |
| <FONT color="green">482</FONT> m_firstFree--;<a name="line.482"></a> |
| <FONT color="green">483</FONT> <a name="line.483"></a> |
| <FONT color="green">484</FONT> return true;<a name="line.484"></a> |
| <FONT color="green">485</FONT> }<a name="line.485"></a> |
| <FONT color="green">486</FONT> }<a name="line.486"></a> |
| <FONT color="green">487</FONT> <a name="line.487"></a> |
| <FONT color="green">488</FONT> return false;<a name="line.488"></a> |
| <FONT color="green">489</FONT> }<a name="line.489"></a> |
| <FONT color="green">490</FONT> <a name="line.490"></a> |
| <FONT color="green">491</FONT> /**<a name="line.491"></a> |
| <FONT color="green">492</FONT> * Deletes the component at the specified index. Each component in<a name="line.492"></a> |
| <FONT color="green">493</FONT> * this vector with an index greater or equal to the specified<a name="line.493"></a> |
| <FONT color="green">494</FONT> * index is shifted downward to have an index one smaller than<a name="line.494"></a> |
| <FONT color="green">495</FONT> * the value it had previously.<a name="line.495"></a> |
| <FONT color="green">496</FONT> *<a name="line.496"></a> |
| <FONT color="green">497</FONT> * @param i Index of node to remove<a name="line.497"></a> |
| <FONT color="green">498</FONT> */<a name="line.498"></a> |
| <FONT color="green">499</FONT> public void removeElementAt(int i)<a name="line.499"></a> |
| <FONT color="green">500</FONT> {<a name="line.500"></a> |
| <FONT color="green">501</FONT> <a name="line.501"></a> |
| <FONT color="green">502</FONT> if (null == m_map)<a name="line.502"></a> |
| <FONT color="green">503</FONT> return;<a name="line.503"></a> |
| <FONT color="green">504</FONT> <a name="line.504"></a> |
| <FONT color="green">505</FONT> if (i > m_firstFree)<a name="line.505"></a> |
| <FONT color="green">506</FONT> System.arraycopy(m_map, i + 1, m_map, i - 1, m_firstFree - i);<a name="line.506"></a> |
| <FONT color="green">507</FONT> else<a name="line.507"></a> |
| <FONT color="green">508</FONT> m_map[i] = DTM.NULL;<a name="line.508"></a> |
| <FONT color="green">509</FONT> }<a name="line.509"></a> |
| <FONT color="green">510</FONT> <a name="line.510"></a> |
| <FONT color="green">511</FONT> /**<a name="line.511"></a> |
| <FONT color="green">512</FONT> * Sets the component at the specified index of this vector to be the<a name="line.512"></a> |
| <FONT color="green">513</FONT> * specified object. The previous component at that position is discarded.<a name="line.513"></a> |
| <FONT color="green">514</FONT> *<a name="line.514"></a> |
| <FONT color="green">515</FONT> * The index must be a value greater than or equal to 0 and less<a name="line.515"></a> |
| <FONT color="green">516</FONT> * than the current size of the vector.<a name="line.516"></a> |
| <FONT color="green">517</FONT> *<a name="line.517"></a> |
| <FONT color="green">518</FONT> * @param node Node to set<a name="line.518"></a> |
| <FONT color="green">519</FONT> * @param index Index of where to set the node<a name="line.519"></a> |
| <FONT color="green">520</FONT> */<a name="line.520"></a> |
| <FONT color="green">521</FONT> public void setElementAt(int node, int index)<a name="line.521"></a> |
| <FONT color="green">522</FONT> {<a name="line.522"></a> |
| <FONT color="green">523</FONT> <a name="line.523"></a> |
| <FONT color="green">524</FONT> if (null == m_map)<a name="line.524"></a> |
| <FONT color="green">525</FONT> {<a name="line.525"></a> |
| <FONT color="green">526</FONT> m_map = new int[m_blocksize];<a name="line.526"></a> |
| <FONT color="green">527</FONT> m_mapSize = m_blocksize;<a name="line.527"></a> |
| <FONT color="green">528</FONT> }<a name="line.528"></a> |
| <FONT color="green">529</FONT> <a name="line.529"></a> |
| <FONT color="green">530</FONT> if(index == -1)<a name="line.530"></a> |
| <FONT color="green">531</FONT> addElement(node);<a name="line.531"></a> |
| <FONT color="green">532</FONT> <a name="line.532"></a> |
| <FONT color="green">533</FONT> m_map[index] = node;<a name="line.533"></a> |
| <FONT color="green">534</FONT> }<a name="line.534"></a> |
| <FONT color="green">535</FONT> <a name="line.535"></a> |
| <FONT color="green">536</FONT> /**<a name="line.536"></a> |
| <FONT color="green">537</FONT> * Get the nth element.<a name="line.537"></a> |
| <FONT color="green">538</FONT> *<a name="line.538"></a> |
| <FONT color="green">539</FONT> * @param i Index of node to get<a name="line.539"></a> |
| <FONT color="green">540</FONT> *<a name="line.540"></a> |
| <FONT color="green">541</FONT> * @return Node at specified index<a name="line.541"></a> |
| <FONT color="green">542</FONT> */<a name="line.542"></a> |
| <FONT color="green">543</FONT> public int elementAt(int i)<a name="line.543"></a> |
| <FONT color="green">544</FONT> {<a name="line.544"></a> |
| <FONT color="green">545</FONT> <a name="line.545"></a> |
| <FONT color="green">546</FONT> if (null == m_map)<a name="line.546"></a> |
| <FONT color="green">547</FONT> return DTM.NULL;<a name="line.547"></a> |
| <FONT color="green">548</FONT> <a name="line.548"></a> |
| <FONT color="green">549</FONT> return m_map[i];<a name="line.549"></a> |
| <FONT color="green">550</FONT> }<a name="line.550"></a> |
| <FONT color="green">551</FONT> <a name="line.551"></a> |
| <FONT color="green">552</FONT> /**<a name="line.552"></a> |
| <FONT color="green">553</FONT> * Tell if the table contains the given node.<a name="line.553"></a> |
| <FONT color="green">554</FONT> *<a name="line.554"></a> |
| <FONT color="green">555</FONT> * @param s Node to look for<a name="line.555"></a> |
| <FONT color="green">556</FONT> *<a name="line.556"></a> |
| <FONT color="green">557</FONT> * @return True if the given node was found.<a name="line.557"></a> |
| <FONT color="green">558</FONT> */<a name="line.558"></a> |
| <FONT color="green">559</FONT> public boolean contains(int s)<a name="line.559"></a> |
| <FONT color="green">560</FONT> {<a name="line.560"></a> |
| <FONT color="green">561</FONT> <a name="line.561"></a> |
| <FONT color="green">562</FONT> if (null == m_map)<a name="line.562"></a> |
| <FONT color="green">563</FONT> return false;<a name="line.563"></a> |
| <FONT color="green">564</FONT> <a name="line.564"></a> |
| <FONT color="green">565</FONT> for (int i = 0; i < m_firstFree; i++)<a name="line.565"></a> |
| <FONT color="green">566</FONT> {<a name="line.566"></a> |
| <FONT color="green">567</FONT> int node = m_map[i];<a name="line.567"></a> |
| <FONT color="green">568</FONT> <a name="line.568"></a> |
| <FONT color="green">569</FONT> if (node == s)<a name="line.569"></a> |
| <FONT color="green">570</FONT> return true;<a name="line.570"></a> |
| <FONT color="green">571</FONT> }<a name="line.571"></a> |
| <FONT color="green">572</FONT> <a name="line.572"></a> |
| <FONT color="green">573</FONT> return false;<a name="line.573"></a> |
| <FONT color="green">574</FONT> }<a name="line.574"></a> |
| <FONT color="green">575</FONT> <a name="line.575"></a> |
| <FONT color="green">576</FONT> /**<a name="line.576"></a> |
| <FONT color="green">577</FONT> * Searches for the first occurence of the given argument,<a name="line.577"></a> |
| <FONT color="green">578</FONT> * beginning the search at index, and testing for equality<a name="line.578"></a> |
| <FONT color="green">579</FONT> * using the equals method.<a name="line.579"></a> |
| <FONT color="green">580</FONT> *<a name="line.580"></a> |
| <FONT color="green">581</FONT> * @param elem Node to look for<a name="line.581"></a> |
| <FONT color="green">582</FONT> * @param index Index of where to start the search<a name="line.582"></a> |
| <FONT color="green">583</FONT> * @return the index of the first occurrence of the object<a name="line.583"></a> |
| <FONT color="green">584</FONT> * argument in this vector at position index or later in the<a name="line.584"></a> |
| <FONT color="green">585</FONT> * vector; returns -1 if the object is not found.<a name="line.585"></a> |
| <FONT color="green">586</FONT> */<a name="line.586"></a> |
| <FONT color="green">587</FONT> public int indexOf(int elem, int index)<a name="line.587"></a> |
| <FONT color="green">588</FONT> {<a name="line.588"></a> |
| <FONT color="green">589</FONT> <a name="line.589"></a> |
| <FONT color="green">590</FONT> if (null == m_map)<a name="line.590"></a> |
| <FONT color="green">591</FONT> return -1;<a name="line.591"></a> |
| <FONT color="green">592</FONT> <a name="line.592"></a> |
| <FONT color="green">593</FONT> for (int i = index; i < m_firstFree; i++)<a name="line.593"></a> |
| <FONT color="green">594</FONT> {<a name="line.594"></a> |
| <FONT color="green">595</FONT> int node = m_map[i];<a name="line.595"></a> |
| <FONT color="green">596</FONT> <a name="line.596"></a> |
| <FONT color="green">597</FONT> if (node == elem)<a name="line.597"></a> |
| <FONT color="green">598</FONT> return i;<a name="line.598"></a> |
| <FONT color="green">599</FONT> }<a name="line.599"></a> |
| <FONT color="green">600</FONT> <a name="line.600"></a> |
| <FONT color="green">601</FONT> return -1;<a name="line.601"></a> |
| <FONT color="green">602</FONT> }<a name="line.602"></a> |
| <FONT color="green">603</FONT> <a name="line.603"></a> |
| <FONT color="green">604</FONT> /**<a name="line.604"></a> |
| <FONT color="green">605</FONT> * Searches for the first occurence of the given argument,<a name="line.605"></a> |
| <FONT color="green">606</FONT> * beginning the search at index, and testing for equality<a name="line.606"></a> |
| <FONT color="green">607</FONT> * using the equals method.<a name="line.607"></a> |
| <FONT color="green">608</FONT> *<a name="line.608"></a> |
| <FONT color="green">609</FONT> * @param elem Node to look for<a name="line.609"></a> |
| <FONT color="green">610</FONT> * @return the index of the first occurrence of the object<a name="line.610"></a> |
| <FONT color="green">611</FONT> * argument in this vector at position index or later in the<a name="line.611"></a> |
| <FONT color="green">612</FONT> * vector; returns -1 if the object is not found.<a name="line.612"></a> |
| <FONT color="green">613</FONT> */<a name="line.613"></a> |
| <FONT color="green">614</FONT> public int indexOf(int elem)<a name="line.614"></a> |
| <FONT color="green">615</FONT> {<a name="line.615"></a> |
| <FONT color="green">616</FONT> <a name="line.616"></a> |
| <FONT color="green">617</FONT> if (null == m_map)<a name="line.617"></a> |
| <FONT color="green">618</FONT> return -1;<a name="line.618"></a> |
| <FONT color="green">619</FONT> <a name="line.619"></a> |
| <FONT color="green">620</FONT> for (int i = 0; i < m_firstFree; i++)<a name="line.620"></a> |
| <FONT color="green">621</FONT> {<a name="line.621"></a> |
| <FONT color="green">622</FONT> int node = m_map[i];<a name="line.622"></a> |
| <FONT color="green">623</FONT> <a name="line.623"></a> |
| <FONT color="green">624</FONT> if (node == elem)<a name="line.624"></a> |
| <FONT color="green">625</FONT> return i;<a name="line.625"></a> |
| <FONT color="green">626</FONT> }<a name="line.626"></a> |
| <FONT color="green">627</FONT> <a name="line.627"></a> |
| <FONT color="green">628</FONT> return -1;<a name="line.628"></a> |
| <FONT color="green">629</FONT> }<a name="line.629"></a> |
| <FONT color="green">630</FONT> <a name="line.630"></a> |
| <FONT color="green">631</FONT> /**<a name="line.631"></a> |
| <FONT color="green">632</FONT> * Sort an array using a quicksort algorithm.<a name="line.632"></a> |
| <FONT color="green">633</FONT> *<a name="line.633"></a> |
| <FONT color="green">634</FONT> * @param a The array to be sorted.<a name="line.634"></a> |
| <FONT color="green">635</FONT> * @param lo0 The low index.<a name="line.635"></a> |
| <FONT color="green">636</FONT> * @param hi0 The high index.<a name="line.636"></a> |
| <FONT color="green">637</FONT> *<a name="line.637"></a> |
| <FONT color="green">638</FONT> * @throws Exception<a name="line.638"></a> |
| <FONT color="green">639</FONT> */<a name="line.639"></a> |
| <FONT color="green">640</FONT> public void sort(int a[], int lo0, int hi0) throws Exception<a name="line.640"></a> |
| <FONT color="green">641</FONT> {<a name="line.641"></a> |
| <FONT color="green">642</FONT> <a name="line.642"></a> |
| <FONT color="green">643</FONT> int lo = lo0;<a name="line.643"></a> |
| <FONT color="green">644</FONT> int hi = hi0;<a name="line.644"></a> |
| <FONT color="green">645</FONT> <a name="line.645"></a> |
| <FONT color="green">646</FONT> // pause(lo, hi);<a name="line.646"></a> |
| <FONT color="green">647</FONT> if (lo >= hi)<a name="line.647"></a> |
| <FONT color="green">648</FONT> {<a name="line.648"></a> |
| <FONT color="green">649</FONT> return;<a name="line.649"></a> |
| <FONT color="green">650</FONT> }<a name="line.650"></a> |
| <FONT color="green">651</FONT> else if (lo == hi - 1)<a name="line.651"></a> |
| <FONT color="green">652</FONT> {<a name="line.652"></a> |
| <FONT color="green">653</FONT> <a name="line.653"></a> |
| <FONT color="green">654</FONT> /*<a name="line.654"></a> |
| <FONT color="green">655</FONT> * sort a two element list by swapping if necessary<a name="line.655"></a> |
| <FONT color="green">656</FONT> */<a name="line.656"></a> |
| <FONT color="green">657</FONT> if (a[lo] > a[hi])<a name="line.657"></a> |
| <FONT color="green">658</FONT> {<a name="line.658"></a> |
| <FONT color="green">659</FONT> int T = a[lo];<a name="line.659"></a> |
| <FONT color="green">660</FONT> <a name="line.660"></a> |
| <FONT color="green">661</FONT> a[lo] = a[hi];<a name="line.661"></a> |
| <FONT color="green">662</FONT> a[hi] = T;<a name="line.662"></a> |
| <FONT color="green">663</FONT> }<a name="line.663"></a> |
| <FONT color="green">664</FONT> <a name="line.664"></a> |
| <FONT color="green">665</FONT> return;<a name="line.665"></a> |
| <FONT color="green">666</FONT> }<a name="line.666"></a> |
| <FONT color="green">667</FONT> <a name="line.667"></a> |
| <FONT color="green">668</FONT> /*<a name="line.668"></a> |
| <FONT color="green">669</FONT> * Pick a pivot and move it out of the way<a name="line.669"></a> |
| <FONT color="green">670</FONT> */<a name="line.670"></a> |
| <FONT color="green">671</FONT> int mid = (lo + hi) >>> 1;<a name="line.671"></a> |
| <FONT color="green">672</FONT> int pivot = a[mid];<a name="line.672"></a> |
| <FONT color="green">673</FONT> <a name="line.673"></a> |
| <FONT color="green">674</FONT> a[mid] = a[hi];<a name="line.674"></a> |
| <FONT color="green">675</FONT> a[hi] = pivot;<a name="line.675"></a> |
| <FONT color="green">676</FONT> <a name="line.676"></a> |
| <FONT color="green">677</FONT> while (lo < hi)<a name="line.677"></a> |
| <FONT color="green">678</FONT> {<a name="line.678"></a> |
| <FONT color="green">679</FONT> <a name="line.679"></a> |
| <FONT color="green">680</FONT> /*<a name="line.680"></a> |
| <FONT color="green">681</FONT> * Search forward from a[lo] until an element is found that<a name="line.681"></a> |
| <FONT color="green">682</FONT> * is greater than the pivot or lo >= hi<a name="line.682"></a> |
| <FONT color="green">683</FONT> */<a name="line.683"></a> |
| <FONT color="green">684</FONT> while (a[lo] <= pivot && lo < hi)<a name="line.684"></a> |
| <FONT color="green">685</FONT> {<a name="line.685"></a> |
| <FONT color="green">686</FONT> lo++;<a name="line.686"></a> |
| <FONT color="green">687</FONT> }<a name="line.687"></a> |
| <FONT color="green">688</FONT> <a name="line.688"></a> |
| <FONT color="green">689</FONT> /*<a name="line.689"></a> |
| <FONT color="green">690</FONT> * Search backward from a[hi] until element is found that<a name="line.690"></a> |
| <FONT color="green">691</FONT> * is less than the pivot, or lo >= hi<a name="line.691"></a> |
| <FONT color="green">692</FONT> */<a name="line.692"></a> |
| <FONT color="green">693</FONT> while (pivot <= a[hi] && lo < hi)<a name="line.693"></a> |
| <FONT color="green">694</FONT> {<a name="line.694"></a> |
| <FONT color="green">695</FONT> hi--;<a name="line.695"></a> |
| <FONT color="green">696</FONT> }<a name="line.696"></a> |
| <FONT color="green">697</FONT> <a name="line.697"></a> |
| <FONT color="green">698</FONT> /*<a name="line.698"></a> |
| <FONT color="green">699</FONT> * Swap elements a[lo] and a[hi]<a name="line.699"></a> |
| <FONT color="green">700</FONT> */<a name="line.700"></a> |
| <FONT color="green">701</FONT> if (lo < hi)<a name="line.701"></a> |
| <FONT color="green">702</FONT> {<a name="line.702"></a> |
| <FONT color="green">703</FONT> int T = a[lo];<a name="line.703"></a> |
| <FONT color="green">704</FONT> <a name="line.704"></a> |
| <FONT color="green">705</FONT> a[lo] = a[hi];<a name="line.705"></a> |
| <FONT color="green">706</FONT> a[hi] = T;<a name="line.706"></a> |
| <FONT color="green">707</FONT> <a name="line.707"></a> |
| <FONT color="green">708</FONT> // pause();<a name="line.708"></a> |
| <FONT color="green">709</FONT> }<a name="line.709"></a> |
| <FONT color="green">710</FONT> <a name="line.710"></a> |
| <FONT color="green">711</FONT> // if (stopRequested) {<a name="line.711"></a> |
| <FONT color="green">712</FONT> // return;<a name="line.712"></a> |
| <FONT color="green">713</FONT> // }<a name="line.713"></a> |
| <FONT color="green">714</FONT> }<a name="line.714"></a> |
| <FONT color="green">715</FONT> <a name="line.715"></a> |
| <FONT color="green">716</FONT> /*<a name="line.716"></a> |
| <FONT color="green">717</FONT> * Put the median in the "center" of the list<a name="line.717"></a> |
| <FONT color="green">718</FONT> */<a name="line.718"></a> |
| <FONT color="green">719</FONT> a[hi0] = a[hi];<a name="line.719"></a> |
| <FONT color="green">720</FONT> a[hi] = pivot;<a name="line.720"></a> |
| <FONT color="green">721</FONT> <a name="line.721"></a> |
| <FONT color="green">722</FONT> /*<a name="line.722"></a> |
| <FONT color="green">723</FONT> * Recursive calls, elements a[lo0] to a[lo-1] are less than or<a name="line.723"></a> |
| <FONT color="green">724</FONT> * equal to pivot, elements a[hi+1] to a[hi0] are greater than<a name="line.724"></a> |
| <FONT color="green">725</FONT> * pivot.<a name="line.725"></a> |
| <FONT color="green">726</FONT> */<a name="line.726"></a> |
| <FONT color="green">727</FONT> sort(a, lo0, lo - 1);<a name="line.727"></a> |
| <FONT color="green">728</FONT> sort(a, hi + 1, hi0);<a name="line.728"></a> |
| <FONT color="green">729</FONT> }<a name="line.729"></a> |
| <FONT color="green">730</FONT> <a name="line.730"></a> |
| <FONT color="green">731</FONT> /**<a name="line.731"></a> |
| <FONT color="green">732</FONT> * Sort an array using a quicksort algorithm.<a name="line.732"></a> |
| <FONT color="green">733</FONT> *<a name="line.733"></a> |
| <FONT color="green">734</FONT> * @throws Exception<a name="line.734"></a> |
| <FONT color="green">735</FONT> */<a name="line.735"></a> |
| <FONT color="green">736</FONT> public void sort() throws Exception<a name="line.736"></a> |
| <FONT color="green">737</FONT> {<a name="line.737"></a> |
| <FONT color="green">738</FONT> sort(m_map, 0, m_firstFree - 1);<a name="line.738"></a> |
| <FONT color="green">739</FONT> }<a name="line.739"></a> |
| <FONT color="green">740</FONT> }<a name="line.740"></a> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </PRE> |
| </BODY> |
| </HTML> |
