<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: SuballocatedIntVector.java 468655 2006-10-28 07:12:06Z minchau $<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> /**<a name="line.23"></a> | |
<FONT color="green">024</FONT> * A very simple table that stores a list of int. Very similar API to our<a name="line.24"></a> | |
<FONT color="green">025</FONT> * IntVector class (same API); different internal storage.<a name="line.25"></a> | |
<FONT color="green">026</FONT> * <a name="line.26"></a> | |
<FONT color="green">027</FONT> * This version uses an array-of-arrays solution. Read/write access is thus<a name="line.27"></a> | |
<FONT color="green">028</FONT> * a bit slower than the simple IntVector, and basic storage is a trifle<a name="line.28"></a> | |
<FONT color="green">029</FONT> * higher due to the top-level array -- but appending is O(1) fast rather<a name="line.29"></a> | |
<FONT color="green">030</FONT> * than O(N**2) slow, which will swamp those costs in situations where<a name="line.30"></a> | |
<FONT color="green">031</FONT> * long vectors are being built up.<a name="line.31"></a> | |
<FONT color="green">032</FONT> * <a name="line.32"></a> | |
<FONT color="green">033</FONT> * Known issues:<a name="line.33"></a> | |
<FONT color="green">034</FONT> * <a name="line.34"></a> | |
<FONT color="green">035</FONT> * Some methods are private because they haven't yet been tested properly.<a name="line.35"></a> | |
<FONT color="green">036</FONT> *<a name="line.36"></a> | |
<FONT color="green">037</FONT> * Retrieval performance is critical, since this is used at the core<a name="line.37"></a> | |
<FONT color="green">038</FONT> * of the DTM model. (Append performance is almost as important.)<a name="line.38"></a> | |
<FONT color="green">039</FONT> * That's pushing me toward just letting reads from unset indices<a name="line.39"></a> | |
<FONT color="green">040</FONT> * throw exceptions or return stale data; safer behavior would have<a name="line.40"></a> | |
<FONT color="green">041</FONT> * performance costs.<a name="line.41"></a> | |
<FONT color="green">042</FONT> * */<a name="line.42"></a> | |
<FONT color="green">043</FONT> public class SuballocatedIntVector<a name="line.43"></a> | |
<FONT color="green">044</FONT> {<a name="line.44"></a> | |
<FONT color="green">045</FONT> /** Size of blocks to allocate */<a name="line.45"></a> | |
<FONT color="green">046</FONT> protected int m_blocksize;<a name="line.46"></a> | |
<FONT color="green">047</FONT> <a name="line.47"></a> | |
<FONT color="green">048</FONT> /** Bitwise addressing (much faster than div/remainder */<a name="line.48"></a> | |
<FONT color="green">049</FONT> protected int m_SHIFT, m_MASK;<a name="line.49"></a> | |
<FONT color="green">050</FONT> <a name="line.50"></a> | |
<FONT color="green">051</FONT> /** The default number of blocks to (over)allocate by */<a name="line.51"></a> | |
<FONT color="green">052</FONT> protected static final int NUMBLOCKS_DEFAULT = 32;<a name="line.52"></a> | |
<FONT color="green">053</FONT> <a name="line.53"></a> | |
<FONT color="green">054</FONT> /** The number of blocks to (over)allocate by */<a name="line.54"></a> | |
<FONT color="green">055</FONT> protected int m_numblocks = NUMBLOCKS_DEFAULT;<a name="line.55"></a> | |
<FONT color="green">056</FONT> <a name="line.56"></a> | |
<FONT color="green">057</FONT> /** Array of arrays of ints */<a name="line.57"></a> | |
<FONT color="green">058</FONT> protected int m_map[][];<a name="line.58"></a> | |
<FONT color="green">059</FONT> <a name="line.59"></a> | |
<FONT color="green">060</FONT> /** Number of ints in array */<a name="line.60"></a> | |
<FONT color="green">061</FONT> protected int m_firstFree = 0;<a name="line.61"></a> | |
<FONT color="green">062</FONT> <a name="line.62"></a> | |
<FONT color="green">063</FONT> /** "Shortcut" handle to m_map[0]. Surprisingly helpful for short vectors. */<a name="line.63"></a> | |
<FONT color="green">064</FONT> protected int m_map0[];<a name="line.64"></a> | |
<FONT color="green">065</FONT> <a name="line.65"></a> | |
<FONT color="green">066</FONT> /** "Shortcut" handle to most recently added row of m_map.<a name="line.66"></a> | |
<FONT color="green">067</FONT> * Very helpful during construction.<a name="line.67"></a> | |
<FONT color="green">068</FONT> * @xsl.usage internal<a name="line.68"></a> | |
<FONT color="green">069</FONT> */<a name="line.69"></a> | |
<FONT color="green">070</FONT> protected int m_buildCache[];<a name="line.70"></a> | |
<FONT color="green">071</FONT> protected int m_buildCacheStartIndex;<a name="line.71"></a> | |
<FONT color="green">072</FONT> <a name="line.72"></a> | |
<FONT color="green">073</FONT> <a name="line.73"></a> | |
<FONT color="green">074</FONT> /**<a name="line.74"></a> | |
<FONT color="green">075</FONT> * Default constructor. Note that the default<a name="line.75"></a> | |
<FONT color="green">076</FONT> * block size is currently 2K, which may be overkill for<a name="line.76"></a> | |
<FONT color="green">077</FONT> * small lists and undershootng for large ones.<a name="line.77"></a> | |
<FONT color="green">078</FONT> */<a name="line.78"></a> | |
<FONT color="green">079</FONT> public SuballocatedIntVector()<a name="line.79"></a> | |
<FONT color="green">080</FONT> {<a name="line.80"></a> | |
<FONT color="green">081</FONT> this(2048);<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> /**<a name="line.84"></a> | |
<FONT color="green">085</FONT> * Construct a IntVector, using the given block size and number<a name="line.85"></a> | |
<FONT color="green">086</FONT> * of blocks. For efficiency, we will round the requested size <a name="line.86"></a> | |
<FONT color="green">087</FONT> * off to a power of two.<a name="line.87"></a> | |
<FONT color="green">088</FONT> *<a name="line.88"></a> | |
<FONT color="green">089</FONT> * @param blocksize Size of block to allocate<a name="line.89"></a> | |
<FONT color="green">090</FONT> * @param numblocks Number of blocks to allocate<a name="line.90"></a> | |
<FONT color="green">091</FONT> * */<a name="line.91"></a> | |
<FONT color="green">092</FONT> public SuballocatedIntVector(int blocksize, int numblocks)<a name="line.92"></a> | |
<FONT color="green">093</FONT> {<a name="line.93"></a> | |
<FONT color="green">094</FONT> //m_blocksize = blocksize;<a name="line.94"></a> | |
<FONT color="green">095</FONT> for(m_SHIFT=0;0!=(blocksize>>>=1);++m_SHIFT)<a name="line.95"></a> | |
<FONT color="green">096</FONT> ;<a name="line.96"></a> | |
<FONT color="green">097</FONT> m_blocksize=1<<m_SHIFT;<a name="line.97"></a> | |
<FONT color="green">098</FONT> m_MASK=m_blocksize-1;<a name="line.98"></a> | |
<FONT color="green">099</FONT> m_numblocks = numblocks;<a name="line.99"></a> | |
<FONT color="green">100</FONT> <a name="line.100"></a> | |
<FONT color="green">101</FONT> m_map0=new int[m_blocksize];<a name="line.101"></a> | |
<FONT color="green">102</FONT> m_map = new int[numblocks][];<a name="line.102"></a> | |
<FONT color="green">103</FONT> m_map[0]=m_map0;<a name="line.103"></a> | |
<FONT color="green">104</FONT> m_buildCache = m_map0;<a name="line.104"></a> | |
<FONT color="green">105</FONT> m_buildCacheStartIndex = 0;<a name="line.105"></a> | |
<FONT color="green">106</FONT> }<a name="line.106"></a> | |
<FONT color="green">107</FONT> <a name="line.107"></a> | |
<FONT color="green">108</FONT> /** Construct a IntVector, using the given block size and<a name="line.108"></a> | |
<FONT color="green">109</FONT> * the default number of blocks (32).<a name="line.109"></a> | |
<FONT color="green">110</FONT> *<a name="line.110"></a> | |
<FONT color="green">111</FONT> * @param blocksize Size of block to allocate<a name="line.111"></a> | |
<FONT color="green">112</FONT> * */<a name="line.112"></a> | |
<FONT color="green">113</FONT> public SuballocatedIntVector(int blocksize)<a name="line.113"></a> | |
<FONT color="green">114</FONT> {<a name="line.114"></a> | |
<FONT color="green">115</FONT> this(blocksize, NUMBLOCKS_DEFAULT);<a name="line.115"></a> | |
<FONT color="green">116</FONT> }<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> * Get the length of the list.<a name="line.119"></a> | |
<FONT color="green">120</FONT> *<a name="line.120"></a> | |
<FONT color="green">121</FONT> * @return length of the list<a name="line.121"></a> | |
<FONT color="green">122</FONT> */<a name="line.122"></a> | |
<FONT color="green">123</FONT> public int size()<a name="line.123"></a> | |
<FONT color="green">124</FONT> {<a name="line.124"></a> | |
<FONT color="green">125</FONT> return m_firstFree;<a name="line.125"></a> | |
<FONT color="green">126</FONT> }<a name="line.126"></a> | |
<FONT color="green">127</FONT> <a name="line.127"></a> | |
<FONT color="green">128</FONT> /**<a name="line.128"></a> | |
<FONT color="green">129</FONT> * Set the length of the list. This will only work to truncate the list, and<a name="line.129"></a> | |
<FONT color="green">130</FONT> * even then it has not been heavily tested and may not be trustworthy.<a name="line.130"></a> | |
<FONT color="green">131</FONT> *<a name="line.131"></a> | |
<FONT color="green">132</FONT> * @return length of the list<a name="line.132"></a> | |
<FONT color="green">133</FONT> */<a name="line.133"></a> | |
<FONT color="green">134</FONT> public void setSize(int sz)<a name="line.134"></a> | |
<FONT color="green">135</FONT> {<a name="line.135"></a> | |
<FONT color="green">136</FONT> if(m_firstFree>sz) // Whups; had that backward!<a name="line.136"></a> | |
<FONT color="green">137</FONT> m_firstFree = sz;<a name="line.137"></a> | |
<FONT color="green">138</FONT> }<a name="line.138"></a> | |
<FONT color="green">139</FONT> <a name="line.139"></a> | |
<FONT color="green">140</FONT> /**<a name="line.140"></a> | |
<FONT color="green">141</FONT> * Append a int onto the vector.<a name="line.141"></a> | |
<FONT color="green">142</FONT> *<a name="line.142"></a> | |
<FONT color="green">143</FONT> * @param value Int to add to the list <a name="line.143"></a> | |
<FONT color="green">144</FONT> */<a name="line.144"></a> | |
<FONT color="green">145</FONT> public void addElement(int value)<a name="line.145"></a> | |
<FONT color="green">146</FONT> {<a name="line.146"></a> | |
<FONT color="green">147</FONT> int indexRelativeToCache = m_firstFree - m_buildCacheStartIndex;<a name="line.147"></a> | |
<FONT color="green">148</FONT> <a name="line.148"></a> | |
<FONT color="green">149</FONT> // Is the new index an index into the cache row of m_map?<a name="line.149"></a> | |
<FONT color="green">150</FONT> if(indexRelativeToCache >= 0 && indexRelativeToCache < m_blocksize) {<a name="line.150"></a> | |
<FONT color="green">151</FONT> m_buildCache[indexRelativeToCache]=value;<a name="line.151"></a> | |
<FONT color="green">152</FONT> ++m_firstFree;<a name="line.152"></a> | |
<FONT color="green">153</FONT> } else {<a name="line.153"></a> | |
<FONT color="green">154</FONT> // Growing the outer array should be rare. We initialize to a<a name="line.154"></a> | |
<FONT color="green">155</FONT> // total of m_blocksize squared elements, which at the default<a name="line.155"></a> | |
<FONT color="green">156</FONT> // size is 4M integers... and we grow by at least that much each<a name="line.156"></a> | |
<FONT color="green">157</FONT> // time. However, attempts to microoptimize for this (assume<a name="line.157"></a> | |
<FONT color="green">158</FONT> // long enough and catch exceptions) yield no noticable<a name="line.158"></a> | |
<FONT color="green">159</FONT> // improvement.<a name="line.159"></a> | |
<FONT color="green">160</FONT> <a name="line.160"></a> | |
<FONT color="green">161</FONT> int index=m_firstFree>>>m_SHIFT;<a name="line.161"></a> | |
<FONT color="green">162</FONT> int offset=m_firstFree&m_MASK;<a name="line.162"></a> | |
<FONT color="green">163</FONT> <a name="line.163"></a> | |
<FONT color="green">164</FONT> if(index>=m_map.length)<a name="line.164"></a> | |
<FONT color="green">165</FONT> {<a name="line.165"></a> | |
<FONT color="green">166</FONT> int newsize=index+m_numblocks;<a name="line.166"></a> | |
<FONT color="green">167</FONT> int[][] newMap=new int[newsize][];<a name="line.167"></a> | |
<FONT color="green">168</FONT> System.arraycopy(m_map, 0, newMap, 0, m_map.length);<a name="line.168"></a> | |
<FONT color="green">169</FONT> m_map=newMap;<a name="line.169"></a> | |
<FONT color="green">170</FONT> }<a name="line.170"></a> | |
<FONT color="green">171</FONT> int[] block=m_map[index];<a name="line.171"></a> | |
<FONT color="green">172</FONT> if(null==block)<a name="line.172"></a> | |
<FONT color="green">173</FONT> block=m_map[index]=new int[m_blocksize];<a name="line.173"></a> | |
<FONT color="green">174</FONT> block[offset]=value;<a name="line.174"></a> | |
<FONT color="green">175</FONT> <a name="line.175"></a> | |
<FONT color="green">176</FONT> // Cache the current row of m_map. Next m_blocksize-1<a name="line.176"></a> | |
<FONT color="green">177</FONT> // values added will go to this row.<a name="line.177"></a> | |
<FONT color="green">178</FONT> m_buildCache = block;<a name="line.178"></a> | |
<FONT color="green">179</FONT> m_buildCacheStartIndex = m_firstFree-offset;<a name="line.179"></a> | |
<FONT color="green">180</FONT> <a name="line.180"></a> | |
<FONT color="green">181</FONT> ++m_firstFree;<a name="line.181"></a> | |
<FONT color="green">182</FONT> }<a name="line.182"></a> | |
<FONT color="green">183</FONT> }<a name="line.183"></a> | |
<FONT color="green">184</FONT> <a name="line.184"></a> | |
<FONT color="green">185</FONT> /**<a name="line.185"></a> | |
<FONT color="green">186</FONT> * Append several int values onto the vector.<a name="line.186"></a> | |
<FONT color="green">187</FONT> *<a name="line.187"></a> | |
<FONT color="green">188</FONT> * @param value Int to add to the list <a name="line.188"></a> | |
<FONT color="green">189</FONT> */<a name="line.189"></a> | |
<FONT color="green">190</FONT> private void addElements(int value, int numberOfElements)<a name="line.190"></a> | |
<FONT color="green">191</FONT> {<a name="line.191"></a> | |
<FONT color="green">192</FONT> if(m_firstFree+numberOfElements<m_blocksize)<a name="line.192"></a> | |
<FONT color="green">193</FONT> for (int i = 0; i < numberOfElements; i++) <a name="line.193"></a> | |
<FONT color="green">194</FONT> {<a name="line.194"></a> | |
<FONT color="green">195</FONT> m_map0[m_firstFree++]=value;<a name="line.195"></a> | |
<FONT color="green">196</FONT> }<a name="line.196"></a> | |
<FONT color="green">197</FONT> else<a name="line.197"></a> | |
<FONT color="green">198</FONT> {<a name="line.198"></a> | |
<FONT color="green">199</FONT> int index=m_firstFree>>>m_SHIFT;<a name="line.199"></a> | |
<FONT color="green">200</FONT> int offset=m_firstFree&m_MASK;<a name="line.200"></a> | |
<FONT color="green">201</FONT> m_firstFree+=numberOfElements;<a name="line.201"></a> | |
<FONT color="green">202</FONT> while( numberOfElements>0)<a name="line.202"></a> | |
<FONT color="green">203</FONT> {<a name="line.203"></a> | |
<FONT color="green">204</FONT> if(index>=m_map.length)<a name="line.204"></a> | |
<FONT color="green">205</FONT> {<a name="line.205"></a> | |
<FONT color="green">206</FONT> int newsize=index+m_numblocks;<a name="line.206"></a> | |
<FONT color="green">207</FONT> int[][] newMap=new int[newsize][];<a name="line.207"></a> | |
<FONT color="green">208</FONT> System.arraycopy(m_map, 0, newMap, 0, m_map.length);<a name="line.208"></a> | |
<FONT color="green">209</FONT> m_map=newMap;<a name="line.209"></a> | |
<FONT color="green">210</FONT> }<a name="line.210"></a> | |
<FONT color="green">211</FONT> int[] block=m_map[index];<a name="line.211"></a> | |
<FONT color="green">212</FONT> if(null==block)<a name="line.212"></a> | |
<FONT color="green">213</FONT> block=m_map[index]=new int[m_blocksize];<a name="line.213"></a> | |
<FONT color="green">214</FONT> int copied=(m_blocksize-offset < numberOfElements)<a name="line.214"></a> | |
<FONT color="green">215</FONT> ? m_blocksize-offset : numberOfElements;<a name="line.215"></a> | |
<FONT color="green">216</FONT> numberOfElements-=copied;<a name="line.216"></a> | |
<FONT color="green">217</FONT> while(copied-- > 0)<a name="line.217"></a> | |
<FONT color="green">218</FONT> block[offset++]=value;<a name="line.218"></a> | |
<FONT color="green">219</FONT> <a name="line.219"></a> | |
<FONT color="green">220</FONT> ++index;offset=0;<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> <a name="line.224"></a> | |
<FONT color="green">225</FONT> /**<a name="line.225"></a> | |
<FONT color="green">226</FONT> * Append several slots onto the vector, but do not set the values.<a name="line.226"></a> | |
<FONT color="green">227</FONT> * Note: "Not Set" means the value is unspecified.<a name="line.227"></a> | |
<FONT color="green">228</FONT> *<a name="line.228"></a> | |
<FONT color="green">229</FONT> * @param numberOfElements Int to add to the list <a name="line.229"></a> | |
<FONT color="green">230</FONT> */<a name="line.230"></a> | |
<FONT color="green">231</FONT> private void addElements(int numberOfElements)<a name="line.231"></a> | |
<FONT color="green">232</FONT> {<a name="line.232"></a> | |
<FONT color="green">233</FONT> int newlen=m_firstFree+numberOfElements;<a name="line.233"></a> | |
<FONT color="green">234</FONT> if(newlen>m_blocksize)<a name="line.234"></a> | |
<FONT color="green">235</FONT> {<a name="line.235"></a> | |
<FONT color="green">236</FONT> int index=m_firstFree>>>m_SHIFT;<a name="line.236"></a> | |
<FONT color="green">237</FONT> int newindex=(m_firstFree+numberOfElements)>>>m_SHIFT;<a name="line.237"></a> | |
<FONT color="green">238</FONT> for(int i=index+1;i<=newindex;++i)<a name="line.238"></a> | |
<FONT color="green">239</FONT> m_map[i]=new int[m_blocksize];<a name="line.239"></a> | |
<FONT color="green">240</FONT> }<a name="line.240"></a> | |
<FONT color="green">241</FONT> m_firstFree=newlen;<a name="line.241"></a> | |
<FONT color="green">242</FONT> }<a name="line.242"></a> | |
<FONT color="green">243</FONT> <a name="line.243"></a> | |
<FONT color="green">244</FONT> /**<a name="line.244"></a> | |
<FONT color="green">245</FONT> * Inserts the specified node in this vector at the specified index.<a name="line.245"></a> | |
<FONT color="green">246</FONT> * Each component in this vector with an index greater or equal to<a name="line.246"></a> | |
<FONT color="green">247</FONT> * the specified index is shifted upward to have an index one greater<a name="line.247"></a> | |
<FONT color="green">248</FONT> * than the value it had previously.<a name="line.248"></a> | |
<FONT color="green">249</FONT> *<a name="line.249"></a> | |
<FONT color="green">250</FONT> * Insertion may be an EXPENSIVE operation!<a name="line.250"></a> | |
<FONT color="green">251</FONT> *<a name="line.251"></a> | |
<FONT color="green">252</FONT> * @param value Int to insert<a name="line.252"></a> | |
<FONT color="green">253</FONT> * @param at Index of where to insert <a name="line.253"></a> | |
<FONT color="green">254</FONT> */<a name="line.254"></a> | |
<FONT color="green">255</FONT> private void insertElementAt(int value, int at)<a name="line.255"></a> | |
<FONT color="green">256</FONT> {<a name="line.256"></a> | |
<FONT color="green">257</FONT> if(at==m_firstFree)<a name="line.257"></a> | |
<FONT color="green">258</FONT> addElement(value);<a name="line.258"></a> | |
<FONT color="green">259</FONT> else if (at>m_firstFree)<a name="line.259"></a> | |
<FONT color="green">260</FONT> {<a name="line.260"></a> | |
<FONT color="green">261</FONT> int index=at>>>m_SHIFT;<a name="line.261"></a> | |
<FONT color="green">262</FONT> if(index>=m_map.length)<a name="line.262"></a> | |
<FONT color="green">263</FONT> {<a name="line.263"></a> | |
<FONT color="green">264</FONT> int newsize=index+m_numblocks;<a name="line.264"></a> | |
<FONT color="green">265</FONT> int[][] newMap=new int[newsize][];<a name="line.265"></a> | |
<FONT color="green">266</FONT> System.arraycopy(m_map, 0, newMap, 0, m_map.length);<a name="line.266"></a> | |
<FONT color="green">267</FONT> m_map=newMap;<a name="line.267"></a> | |
<FONT color="green">268</FONT> }<a name="line.268"></a> | |
<FONT color="green">269</FONT> int[] block=m_map[index];<a name="line.269"></a> | |
<FONT color="green">270</FONT> if(null==block)<a name="line.270"></a> | |
<FONT color="green">271</FONT> block=m_map[index]=new int[m_blocksize];<a name="line.271"></a> | |
<FONT color="green">272</FONT> int offset=at&m_MASK;<a name="line.272"></a> | |
<FONT color="green">273</FONT> block[offset]=value;<a name="line.273"></a> | |
<FONT color="green">274</FONT> m_firstFree=offset+1;<a name="line.274"></a> | |
<FONT color="green">275</FONT> }<a name="line.275"></a> | |
<FONT color="green">276</FONT> else<a name="line.276"></a> | |
<FONT color="green">277</FONT> {<a name="line.277"></a> | |
<FONT color="green">278</FONT> int index=at>>>m_SHIFT;<a name="line.278"></a> | |
<FONT color="green">279</FONT> int maxindex=m_firstFree>>>m_SHIFT; // %REVIEW% (m_firstFree+1?)<a name="line.279"></a> | |
<FONT color="green">280</FONT> ++m_firstFree;<a name="line.280"></a> | |
<FONT color="green">281</FONT> int offset=at&m_MASK;<a name="line.281"></a> | |
<FONT color="green">282</FONT> int push;<a name="line.282"></a> | |
<FONT color="green">283</FONT> <a name="line.283"></a> | |
<FONT color="green">284</FONT> // ***** Easier to work down from top?<a name="line.284"></a> | |
<FONT color="green">285</FONT> while(index<=maxindex)<a name="line.285"></a> | |
<FONT color="green">286</FONT> {<a name="line.286"></a> | |
<FONT color="green">287</FONT> int copylen=m_blocksize-offset-1;<a name="line.287"></a> | |
<FONT color="green">288</FONT> int[] block=m_map[index];<a name="line.288"></a> | |
<FONT color="green">289</FONT> if(null==block)<a name="line.289"></a> | |
<FONT color="green">290</FONT> {<a name="line.290"></a> | |
<FONT color="green">291</FONT> push=0;<a name="line.291"></a> | |
<FONT color="green">292</FONT> block=m_map[index]=new int[m_blocksize];<a name="line.292"></a> | |
<FONT color="green">293</FONT> }<a name="line.293"></a> | |
<FONT color="green">294</FONT> else<a name="line.294"></a> | |
<FONT color="green">295</FONT> {<a name="line.295"></a> | |
<FONT color="green">296</FONT> push=block[m_blocksize-1];<a name="line.296"></a> | |
<FONT color="green">297</FONT> System.arraycopy(block, offset , block, offset+1, copylen);<a name="line.297"></a> | |
<FONT color="green">298</FONT> }<a name="line.298"></a> | |
<FONT color="green">299</FONT> block[offset]=value;<a name="line.299"></a> | |
<FONT color="green">300</FONT> value=push;<a name="line.300"></a> | |
<FONT color="green">301</FONT> offset=0;<a name="line.301"></a> | |
<FONT color="green">302</FONT> ++index;<a name="line.302"></a> | |
<FONT color="green">303</FONT> }<a name="line.303"></a> | |
<FONT color="green">304</FONT> }<a name="line.304"></a> | |
<FONT color="green">305</FONT> }<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> * Wipe it out. Currently defined as equivalent to setSize(0).<a name="line.308"></a> | |
<FONT color="green">309</FONT> */<a name="line.309"></a> | |
<FONT color="green">310</FONT> public void removeAllElements()<a name="line.310"></a> | |
<FONT color="green">311</FONT> {<a name="line.311"></a> | |
<FONT color="green">312</FONT> m_firstFree = 0;<a name="line.312"></a> | |
<FONT color="green">313</FONT> m_buildCache = m_map0;<a name="line.313"></a> | |
<FONT color="green">314</FONT> m_buildCacheStartIndex = 0;<a name="line.314"></a> | |
<FONT color="green">315</FONT> }<a name="line.315"></a> | |
<FONT color="green">316</FONT> <a name="line.316"></a> | |
<FONT color="green">317</FONT> /**<a name="line.317"></a> | |
<FONT color="green">318</FONT> * Removes the first occurrence of the argument from this vector.<a name="line.318"></a> | |
<FONT color="green">319</FONT> * If the object is found in this vector, each component in the vector<a name="line.319"></a> | |
<FONT color="green">320</FONT> * with an index greater or equal to the object's index is shifted<a name="line.320"></a> | |
<FONT color="green">321</FONT> * downward to have an index one smaller than the value it had<a name="line.321"></a> | |
<FONT color="green">322</FONT> * previously.<a name="line.322"></a> | |
<FONT color="green">323</FONT> *<a name="line.323"></a> | |
<FONT color="green">324</FONT> * @param s Int to remove from array<a name="line.324"></a> | |
<FONT color="green">325</FONT> *<a name="line.325"></a> | |
<FONT color="green">326</FONT> * @return True if the int was removed, false if it was not found<a name="line.326"></a> | |
<FONT color="green">327</FONT> */<a name="line.327"></a> | |
<FONT color="green">328</FONT> private boolean removeElement(int s)<a name="line.328"></a> | |
<FONT color="green">329</FONT> {<a name="line.329"></a> | |
<FONT color="green">330</FONT> int at=indexOf(s,0);<a name="line.330"></a> | |
<FONT color="green">331</FONT> if(at<0)<a name="line.331"></a> | |
<FONT color="green">332</FONT> return false;<a name="line.332"></a> | |
<FONT color="green">333</FONT> removeElementAt(at);<a name="line.333"></a> | |
<FONT color="green">334</FONT> return true;<a name="line.334"></a> | |
<FONT color="green">335</FONT> }<a name="line.335"></a> | |
<FONT color="green">336</FONT> <a name="line.336"></a> | |
<FONT color="green">337</FONT> /**<a name="line.337"></a> | |
<FONT color="green">338</FONT> * Deletes the component at the specified index. Each component in<a name="line.338"></a> | |
<FONT color="green">339</FONT> * this vector with an index greater or equal to the specified<a name="line.339"></a> | |
<FONT color="green">340</FONT> * index is shifted downward to have an index one smaller than<a name="line.340"></a> | |
<FONT color="green">341</FONT> * the value it had previously.<a name="line.341"></a> | |
<FONT color="green">342</FONT> *<a name="line.342"></a> | |
<FONT color="green">343</FONT> * @param i index of where to remove and int<a name="line.343"></a> | |
<FONT color="green">344</FONT> */<a name="line.344"></a> | |
<FONT color="green">345</FONT> private void removeElementAt(int at)<a name="line.345"></a> | |
<FONT color="green">346</FONT> {<a name="line.346"></a> | |
<FONT color="green">347</FONT> // No point in removing elements that "don't exist"... <a name="line.347"></a> | |
<FONT color="green">348</FONT> if(at<m_firstFree)<a name="line.348"></a> | |
<FONT color="green">349</FONT> {<a name="line.349"></a> | |
<FONT color="green">350</FONT> int index=at>>>m_SHIFT;<a name="line.350"></a> | |
<FONT color="green">351</FONT> int maxindex=m_firstFree>>>m_SHIFT;<a name="line.351"></a> | |
<FONT color="green">352</FONT> int offset=at&m_MASK;<a name="line.352"></a> | |
<FONT color="green">353</FONT> <a name="line.353"></a> | |
<FONT color="green">354</FONT> while(index<=maxindex)<a name="line.354"></a> | |
<FONT color="green">355</FONT> {<a name="line.355"></a> | |
<FONT color="green">356</FONT> int copylen=m_blocksize-offset-1;<a name="line.356"></a> | |
<FONT color="green">357</FONT> int[] block=m_map[index];<a name="line.357"></a> | |
<FONT color="green">358</FONT> if(null==block)<a name="line.358"></a> | |
<FONT color="green">359</FONT> block=m_map[index]=new int[m_blocksize];<a name="line.359"></a> | |
<FONT color="green">360</FONT> else<a name="line.360"></a> | |
<FONT color="green">361</FONT> System.arraycopy(block, offset+1, block, offset, copylen);<a name="line.361"></a> | |
<FONT color="green">362</FONT> if(index<maxindex)<a name="line.362"></a> | |
<FONT color="green">363</FONT> {<a name="line.363"></a> | |
<FONT color="green">364</FONT> int[] next=m_map[index+1];<a name="line.364"></a> | |
<FONT color="green">365</FONT> if(next!=null)<a name="line.365"></a> | |
<FONT color="green">366</FONT> block[m_blocksize-1]=(next!=null) ? next[0] : 0;<a name="line.366"></a> | |
<FONT color="green">367</FONT> }<a name="line.367"></a> | |
<FONT color="green">368</FONT> else<a name="line.368"></a> | |
<FONT color="green">369</FONT> block[m_blocksize-1]=0;<a name="line.369"></a> | |
<FONT color="green">370</FONT> offset=0;<a name="line.370"></a> | |
<FONT color="green">371</FONT> ++index;<a name="line.371"></a> | |
<FONT color="green">372</FONT> }<a name="line.372"></a> | |
<FONT color="green">373</FONT> }<a name="line.373"></a> | |
<FONT color="green">374</FONT> --m_firstFree;<a name="line.374"></a> | |
<FONT color="green">375</FONT> }<a name="line.375"></a> | |
<FONT color="green">376</FONT> <a name="line.376"></a> | |
<FONT color="green">377</FONT> /**<a name="line.377"></a> | |
<FONT color="green">378</FONT> * Sets the component at the specified index of this vector to be the<a name="line.378"></a> | |
<FONT color="green">379</FONT> * specified object. The previous component at that position is discarded.<a name="line.379"></a> | |
<FONT color="green">380</FONT> *<a name="line.380"></a> | |
<FONT color="green">381</FONT> * The index must be a value greater than or equal to 0 and less<a name="line.381"></a> | |
<FONT color="green">382</FONT> * than the current size of the vector.<a name="line.382"></a> | |
<FONT color="green">383</FONT> *<a name="line.383"></a> | |
<FONT color="green">384</FONT> * @param value object to set<a name="line.384"></a> | |
<FONT color="green">385</FONT> * @param at Index of where to set the object<a name="line.385"></a> | |
<FONT color="green">386</FONT> */<a name="line.386"></a> | |
<FONT color="green">387</FONT> public void setElementAt(int value, int at)<a name="line.387"></a> | |
<FONT color="green">388</FONT> {<a name="line.388"></a> | |
<FONT color="green">389</FONT> if(at<m_blocksize)<a name="line.389"></a> | |
<FONT color="green">390</FONT> m_map0[at]=value;<a name="line.390"></a> | |
<FONT color="green">391</FONT> else<a name="line.391"></a> | |
<FONT color="green">392</FONT> {<a name="line.392"></a> | |
<FONT color="green">393</FONT> int index=at>>>m_SHIFT;<a name="line.393"></a> | |
<FONT color="green">394</FONT> int offset=at&m_MASK;<a name="line.394"></a> | |
<FONT color="green">395</FONT> <a name="line.395"></a> | |
<FONT color="green">396</FONT> if(index>=m_map.length)<a name="line.396"></a> | |
<FONT color="green">397</FONT> {<a name="line.397"></a> | |
<FONT color="green">398</FONT> int newsize=index+m_numblocks;<a name="line.398"></a> | |
<FONT color="green">399</FONT> int[][] newMap=new int[newsize][];<a name="line.399"></a> | |
<FONT color="green">400</FONT> System.arraycopy(m_map, 0, newMap, 0, m_map.length);<a name="line.400"></a> | |
<FONT color="green">401</FONT> m_map=newMap;<a name="line.401"></a> | |
<FONT color="green">402</FONT> }<a name="line.402"></a> | |
<FONT color="green">403</FONT> <a name="line.403"></a> | |
<FONT color="green">404</FONT> int[] block=m_map[index];<a name="line.404"></a> | |
<FONT color="green">405</FONT> if(null==block)<a name="line.405"></a> | |
<FONT color="green">406</FONT> block=m_map[index]=new int[m_blocksize];<a name="line.406"></a> | |
<FONT color="green">407</FONT> block[offset]=value;<a name="line.407"></a> | |
<FONT color="green">408</FONT> }<a name="line.408"></a> | |
<FONT color="green">409</FONT> <a name="line.409"></a> | |
<FONT color="green">410</FONT> if(at>=m_firstFree)<a name="line.410"></a> | |
<FONT color="green">411</FONT> m_firstFree=at+1;<a name="line.411"></a> | |
<FONT color="green">412</FONT> }<a name="line.412"></a> | |
<FONT color="green">413</FONT> <a name="line.413"></a> | |
<FONT color="green">414</FONT> <a name="line.414"></a> | |
<FONT color="green">415</FONT> /**<a name="line.415"></a> | |
<FONT color="green">416</FONT> * Get the nth element. This is often at the innermost loop of an<a name="line.416"></a> | |
<FONT color="green">417</FONT> * application, so performance is critical.<a name="line.417"></a> | |
<FONT color="green">418</FONT> *<a name="line.418"></a> | |
<FONT color="green">419</FONT> * @param i index of value to get<a name="line.419"></a> | |
<FONT color="green">420</FONT> *<a name="line.420"></a> | |
<FONT color="green">421</FONT> * @return value at given index. If that value wasn't previously set,<a name="line.421"></a> | |
<FONT color="green">422</FONT> * the result is undefined for performance reasons. It may throw an<a name="line.422"></a> | |
<FONT color="green">423</FONT> * exception (see below), may return zero, or (if setSize has previously<a name="line.423"></a> | |
<FONT color="green">424</FONT> * been used) may return stale data.<a name="line.424"></a> | |
<FONT color="green">425</FONT> *<a name="line.425"></a> | |
<FONT color="green">426</FONT> * @throws ArrayIndexOutOfBoundsException if the index was _clearly_<a name="line.426"></a> | |
<FONT color="green">427</FONT> * unreasonable (negative, or past the highest block).<a name="line.427"></a> | |
<FONT color="green">428</FONT> *<a name="line.428"></a> | |
<FONT color="green">429</FONT> * @throws NullPointerException if the index points to a block that could<a name="line.429"></a> | |
<FONT color="green">430</FONT> * have existed (based on the highest index used) but has never had anything<a name="line.430"></a> | |
<FONT color="green">431</FONT> * set into it.<a name="line.431"></a> | |
<FONT color="green">432</FONT> * %REVIEW% Could add a catch to create the block in that case, or return 0.<a name="line.432"></a> | |
<FONT color="green">433</FONT> * Try/Catch is _supposed_ to be nearly free when not thrown to. Do we<a name="line.433"></a> | |
<FONT color="green">434</FONT> * believe that? Should we have a separate safeElementAt?<a name="line.434"></a> | |
<FONT color="green">435</FONT> */<a name="line.435"></a> | |
<FONT color="green">436</FONT> public int elementAt(int i)<a name="line.436"></a> | |
<FONT color="green">437</FONT> {<a name="line.437"></a> | |
<FONT color="green">438</FONT> // This is actually a significant optimization!<a name="line.438"></a> | |
<FONT color="green">439</FONT> if(i<m_blocksize)<a name="line.439"></a> | |
<FONT color="green">440</FONT> return m_map0[i];<a name="line.440"></a> | |
<FONT color="green">441</FONT> <a name="line.441"></a> | |
<FONT color="green">442</FONT> return m_map[i>>>m_SHIFT][i&m_MASK];<a name="line.442"></a> | |
<FONT color="green">443</FONT> }<a name="line.443"></a> | |
<FONT color="green">444</FONT> <a name="line.444"></a> | |
<FONT color="green">445</FONT> /**<a name="line.445"></a> | |
<FONT color="green">446</FONT> * Tell if the table contains the given node.<a name="line.446"></a> | |
<FONT color="green">447</FONT> *<a name="line.447"></a> | |
<FONT color="green">448</FONT> * @param s object to look for<a name="line.448"></a> | |
<FONT color="green">449</FONT> *<a name="line.449"></a> | |
<FONT color="green">450</FONT> * @return true if the object is in the list<a name="line.450"></a> | |
<FONT color="green">451</FONT> */<a name="line.451"></a> | |
<FONT color="green">452</FONT> private boolean contains(int s)<a name="line.452"></a> | |
<FONT color="green">453</FONT> {<a name="line.453"></a> | |
<FONT color="green">454</FONT> return (indexOf(s,0) >= 0);<a name="line.454"></a> | |
<FONT color="green">455</FONT> }<a name="line.455"></a> | |
<FONT color="green">456</FONT> <a name="line.456"></a> | |
<FONT color="green">457</FONT> /**<a name="line.457"></a> | |
<FONT color="green">458</FONT> * Searches for the first occurence of the given argument,<a name="line.458"></a> | |
<FONT color="green">459</FONT> * beginning the search at index, and testing for equality<a name="line.459"></a> | |
<FONT color="green">460</FONT> * using the equals method.<a name="line.460"></a> | |
<FONT color="green">461</FONT> *<a name="line.461"></a> | |
<FONT color="green">462</FONT> * @param elem object to look for<a name="line.462"></a> | |
<FONT color="green">463</FONT> * @param index Index of where to begin search<a name="line.463"></a> | |
<FONT color="green">464</FONT> * @return the index of the first occurrence of the object<a name="line.464"></a> | |
<FONT color="green">465</FONT> * argument in this vector at position index or later in the<a name="line.465"></a> | |
<FONT color="green">466</FONT> * vector; returns -1 if the object is not found.<a name="line.466"></a> | |
<FONT color="green">467</FONT> */<a name="line.467"></a> | |
<FONT color="green">468</FONT> public int indexOf(int elem, int index)<a name="line.468"></a> | |
<FONT color="green">469</FONT> {<a name="line.469"></a> | |
<FONT color="green">470</FONT> if(index>=m_firstFree)<a name="line.470"></a> | |
<FONT color="green">471</FONT> return -1;<a name="line.471"></a> | |
<FONT color="green">472</FONT> <a name="line.472"></a> | |
<FONT color="green">473</FONT> int bindex=index>>>m_SHIFT;<a name="line.473"></a> | |
<FONT color="green">474</FONT> int boffset=index&m_MASK;<a name="line.474"></a> | |
<FONT color="green">475</FONT> int maxindex=m_firstFree>>>m_SHIFT;<a name="line.475"></a> | |
<FONT color="green">476</FONT> int[] block;<a name="line.476"></a> | |
<FONT color="green">477</FONT> <a name="line.477"></a> | |
<FONT color="green">478</FONT> for(;bindex<maxindex;++bindex)<a name="line.478"></a> | |
<FONT color="green">479</FONT> {<a name="line.479"></a> | |
<FONT color="green">480</FONT> block=m_map[bindex];<a name="line.480"></a> | |
<FONT color="green">481</FONT> if(block!=null)<a name="line.481"></a> | |
<FONT color="green">482</FONT> for(int offset=boffset;offset<m_blocksize;++offset)<a name="line.482"></a> | |
<FONT color="green">483</FONT> if(block[offset]==elem)<a name="line.483"></a> | |
<FONT color="green">484</FONT> return offset+bindex*m_blocksize;<a name="line.484"></a> | |
<FONT color="green">485</FONT> boffset=0; // after first<a name="line.485"></a> | |
<FONT color="green">486</FONT> }<a name="line.486"></a> | |
<FONT color="green">487</FONT> // Last block may need to stop before end<a name="line.487"></a> | |
<FONT color="green">488</FONT> int maxoffset=m_firstFree&m_MASK;<a name="line.488"></a> | |
<FONT color="green">489</FONT> block=m_map[maxindex];<a name="line.489"></a> | |
<FONT color="green">490</FONT> for(int offset=boffset;offset<maxoffset;++offset)<a name="line.490"></a> | |
<FONT color="green">491</FONT> if(block[offset]==elem)<a name="line.491"></a> | |
<FONT color="green">492</FONT> return offset+maxindex*m_blocksize;<a name="line.492"></a> | |
<FONT color="green">493</FONT> <a name="line.493"></a> | |
<FONT color="green">494</FONT> return -1; <a name="line.494"></a> | |
<FONT color="green">495</FONT> }<a name="line.495"></a> | |
<FONT color="green">496</FONT> <a name="line.496"></a> | |
<FONT color="green">497</FONT> /**<a name="line.497"></a> | |
<FONT color="green">498</FONT> * Searches for the first occurence of the given argument,<a name="line.498"></a> | |
<FONT color="green">499</FONT> * beginning the search at index, and testing for equality<a name="line.499"></a> | |
<FONT color="green">500</FONT> * using the equals method.<a name="line.500"></a> | |
<FONT color="green">501</FONT> *<a name="line.501"></a> | |
<FONT color="green">502</FONT> * @param elem object to look for<a name="line.502"></a> | |
<FONT color="green">503</FONT> * @return the index of the first occurrence of the object<a name="line.503"></a> | |
<FONT color="green">504</FONT> * argument in this vector at position index or later in the<a name="line.504"></a> | |
<FONT color="green">505</FONT> * vector; returns -1 if the object is not found.<a name="line.505"></a> | |
<FONT color="green">506</FONT> */<a name="line.506"></a> | |
<FONT color="green">507</FONT> public int indexOf(int elem)<a name="line.507"></a> | |
<FONT color="green">508</FONT> {<a name="line.508"></a> | |
<FONT color="green">509</FONT> return indexOf(elem,0);<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> /**<a name="line.512"></a> | |
<FONT color="green">513</FONT> * Searches for the first occurence of the given argument,<a name="line.513"></a> | |
<FONT color="green">514</FONT> * beginning the search at index, and testing for equality<a name="line.514"></a> | |
<FONT color="green">515</FONT> * using the equals method.<a name="line.515"></a> | |
<FONT color="green">516</FONT> *<a name="line.516"></a> | |
<FONT color="green">517</FONT> * @param elem Object to look for<a name="line.517"></a> | |
<FONT color="green">518</FONT> * @return the index of the first occurrence of the object<a name="line.518"></a> | |
<FONT color="green">519</FONT> * argument in this vector at position index or later in the<a name="line.519"></a> | |
<FONT color="green">520</FONT> * vector; returns -1 if the object is not found.<a name="line.520"></a> | |
<FONT color="green">521</FONT> */<a name="line.521"></a> | |
<FONT color="green">522</FONT> private int lastIndexOf(int elem)<a name="line.522"></a> | |
<FONT color="green">523</FONT> {<a name="line.523"></a> | |
<FONT color="green">524</FONT> int boffset=m_firstFree&m_MASK;<a name="line.524"></a> | |
<FONT color="green">525</FONT> for(int index=m_firstFree>>>m_SHIFT;<a name="line.525"></a> | |
<FONT color="green">526</FONT> index>=0;<a name="line.526"></a> | |
<FONT color="green">527</FONT> --index)<a name="line.527"></a> | |
<FONT color="green">528</FONT> {<a name="line.528"></a> | |
<FONT color="green">529</FONT> int[] block=m_map[index];<a name="line.529"></a> | |
<FONT color="green">530</FONT> if(block!=null)<a name="line.530"></a> | |
<FONT color="green">531</FONT> for(int offset=boffset; offset>=0; --offset)<a name="line.531"></a> | |
<FONT color="green">532</FONT> if(block[offset]==elem)<a name="line.532"></a> | |
<FONT color="green">533</FONT> return offset+index*m_blocksize;<a name="line.533"></a> | |
<FONT color="green">534</FONT> boffset=0; // after first<a name="line.534"></a> | |
<FONT color="green">535</FONT> }<a name="line.535"></a> | |
<FONT color="green">536</FONT> return -1;<a name="line.536"></a> | |
<FONT color="green">537</FONT> }<a name="line.537"></a> | |
<FONT color="green">538</FONT> <a name="line.538"></a> | |
<FONT color="green">539</FONT> /**<a name="line.539"></a> | |
<FONT color="green">540</FONT> * Return the internal m_map0 array<a name="line.540"></a> | |
<FONT color="green">541</FONT> * @return the m_map0 array<a name="line.541"></a> | |
<FONT color="green">542</FONT> */<a name="line.542"></a> | |
<FONT color="green">543</FONT> public final int[] getMap0()<a name="line.543"></a> | |
<FONT color="green">544</FONT> {<a name="line.544"></a> | |
<FONT color="green">545</FONT> return m_map0;<a name="line.545"></a> | |
<FONT color="green">546</FONT> }<a name="line.546"></a> | |
<FONT color="green">547</FONT> <a name="line.547"></a> | |
<FONT color="green">548</FONT> /**<a name="line.548"></a> | |
<FONT color="green">549</FONT> * Return the m_map double array<a name="line.549"></a> | |
<FONT color="green">550</FONT> * @return the internal map of array of arrays <a name="line.550"></a> | |
<FONT color="green">551</FONT> */<a name="line.551"></a> | |
<FONT color="green">552</FONT> public final int[][] getMap()<a name="line.552"></a> | |
<FONT color="green">553</FONT> {<a name="line.553"></a> | |
<FONT color="green">554</FONT> return m_map;<a name="line.554"></a> | |
<FONT color="green">555</FONT> }<a name="line.555"></a> | |
<FONT color="green">556</FONT> <a name="line.556"></a> | |
<FONT color="green">557</FONT> }<a name="line.557"></a> | |
</PRE> | |
</BODY> | |
</HTML> |