| <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: ChunkedIntArray.java 1225427 2011-12-29 04:33:32Z 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.dtm.ref;<a name="line.21"></a> |
| <FONT color="green">022</FONT> <a name="line.22"></a> |
| <FONT color="green">023</FONT> import org.apache.xml.res.XMLErrorResources;<a name="line.23"></a> |
| <FONT color="green">024</FONT> import org.apache.xml.res.XMLMessages;<a name="line.24"></a> |
| <FONT color="green">025</FONT> <a name="line.25"></a> |
| <FONT color="green">026</FONT> /**<a name="line.26"></a> |
| <FONT color="green">027</FONT> * <code>ChunkedIntArray</code> is an extensible array of blocks of integers.<a name="line.27"></a> |
| <FONT color="green">028</FONT> * (I'd consider Vector, but it's unable to handle integers except by<a name="line.28"></a> |
| <FONT color="green">029</FONT> * turning them into Objects.)<a name="line.29"></a> |
| <FONT color="green">030</FONT> <a name="line.30"></a> |
| <FONT color="green">031</FONT> * <p>Making this a separate class means some call-and-return overhead. But<a name="line.31"></a> |
| <FONT color="green">032</FONT> * doing it all inline tends to be fragile and expensive in coder time,<a name="line.32"></a> |
| <FONT color="green">033</FONT> * not to mention driving up code size. If you want to inline it, feel free.<a name="line.33"></a> |
| <FONT color="green">034</FONT> * The Java text suggest that private and Final methods may be inlined, <a name="line.34"></a> |
| <FONT color="green">035</FONT> * and one can argue that this beast need not be made subclassable...</p><a name="line.35"></a> |
| <FONT color="green">036</FONT> *<a name="line.36"></a> |
| <FONT color="green">037</FONT> * <p>%REVIEW% This has strong conceptual overlap with the IntVector class.<a name="line.37"></a> |
| <FONT color="green">038</FONT> * It would probably be a good thing to merge the two, when time permits.<p><a name="line.38"></a> |
| <FONT color="green">039</FONT> */<a name="line.39"></a> |
| <FONT color="green">040</FONT> final class ChunkedIntArray<a name="line.40"></a> |
| <FONT color="green">041</FONT> {<a name="line.41"></a> |
| <FONT color="green">042</FONT> static final int slotsize=4; // Locked, MUST be power of two in current code<a name="line.42"></a> |
| <FONT color="green">043</FONT> // Debugging tip: Cranking lowbits down to 4 or so is a good<a name="line.43"></a> |
| <FONT color="green">044</FONT> // way to pound on the array addressing code.<a name="line.44"></a> |
| <FONT color="green">045</FONT> static final int lowbits=10; // How many bits address within chunks<a name="line.45"></a> |
| <FONT color="green">046</FONT> static final int chunkalloc=1<<lowbits;<a name="line.46"></a> |
| <FONT color="green">047</FONT> static final int lowmask=chunkalloc-1;<a name="line.47"></a> |
| <FONT color="green">048</FONT> <a name="line.48"></a> |
| <FONT color="green">049</FONT> ChunksVector chunks=new ChunksVector();<a name="line.49"></a> |
| <FONT color="green">050</FONT> final int fastArray[] = new int[chunkalloc];<a name="line.50"></a> |
| <FONT color="green">051</FONT> int lastUsed=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> * Create a new CIA with specified record size. Currently record size MUST<a name="line.54"></a> |
| <FONT color="green">055</FONT> * be a power of two... and in fact is hardcoded to 4.<a name="line.55"></a> |
| <FONT color="green">056</FONT> */<a name="line.56"></a> |
| <FONT color="green">057</FONT> ChunkedIntArray(int slotsize)<a name="line.57"></a> |
| <FONT color="green">058</FONT> {<a name="line.58"></a> |
| <FONT color="green">059</FONT> if(this.slotsize<slotsize)<a name="line.59"></a> |
| <FONT color="green">060</FONT> throw new ArrayIndexOutOfBoundsException(XMLMessages.createXMLMessage(XMLErrorResources.ER_CHUNKEDINTARRAY_NOT_SUPPORTED, new Object[]{Integer.toString(slotsize)})); //"ChunkedIntArray("+slotsize+") not currently supported");<a name="line.60"></a> |
| <FONT color="green">061</FONT> else if (this.slotsize>slotsize)<a name="line.61"></a> |
| <FONT color="green">062</FONT> System.out.println("*****WARNING: ChunkedIntArray("+slotsize+") wasting "+(this.slotsize-slotsize)+" words per slot");<a name="line.62"></a> |
| <FONT color="green">063</FONT> chunks.addElement(fastArray);<a name="line.63"></a> |
| <FONT color="green">064</FONT> }<a name="line.64"></a> |
| <FONT color="green">065</FONT> /**<a name="line.65"></a> |
| <FONT color="green">066</FONT> * Append a 4-integer record to the CIA, starting with record 1. (Since<a name="line.66"></a> |
| <FONT color="green">067</FONT> * arrays are initialized to all-0, 0 has been reserved as the "unknown"<a name="line.67"></a> |
| <FONT color="green">068</FONT> * value in DTM.)<a name="line.68"></a> |
| <FONT color="green">069</FONT> * @return the index at which this record was inserted.<a name="line.69"></a> |
| <FONT color="green">070</FONT> */<a name="line.70"></a> |
| <FONT color="green">071</FONT> int appendSlot(int w0, int w1, int w2, int w3)<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> try<a name="line.74"></a> |
| <FONT color="green">075</FONT> {<a name="line.75"></a> |
| <FONT color="green">076</FONT> int newoffset = (lastUsed+1)*slotsize;<a name="line.76"></a> |
| <FONT color="green">077</FONT> fastArray[newoffset] = w0;<a name="line.77"></a> |
| <FONT color="green">078</FONT> fastArray[newoffset+1] = w1;<a name="line.78"></a> |
| <FONT color="green">079</FONT> fastArray[newoffset+2] = w2;<a name="line.79"></a> |
| <FONT color="green">080</FONT> fastArray[newoffset+3] = w3;<a name="line.80"></a> |
| <FONT color="green">081</FONT> return ++lastUsed;<a name="line.81"></a> |
| <FONT color="green">082</FONT> }<a name="line.82"></a> |
| <FONT color="green">083</FONT> catch(ArrayIndexOutOfBoundsException aioobe)<a name="line.83"></a> |
| <FONT color="green">084</FONT> */<a name="line.84"></a> |
| <FONT color="green">085</FONT> {<a name="line.85"></a> |
| <FONT color="green">086</FONT> final int slotsize=4;<a name="line.86"></a> |
| <FONT color="green">087</FONT> int newoffset = (lastUsed+1)*slotsize;<a name="line.87"></a> |
| <FONT color="green">088</FONT> int chunkpos = newoffset >> lowbits;<a name="line.88"></a> |
| <FONT color="green">089</FONT> int slotpos = (newoffset & lowmask);<a name="line.89"></a> |
| <FONT color="green">090</FONT> <a name="line.90"></a> |
| <FONT color="green">091</FONT> // Grow if needed<a name="line.91"></a> |
| <FONT color="green">092</FONT> if (chunkpos > chunks.size() - 1)<a name="line.92"></a> |
| <FONT color="green">093</FONT> chunks.addElement(new int[chunkalloc]);<a name="line.93"></a> |
| <FONT color="green">094</FONT> int[] chunk = chunks.elementAt(chunkpos);<a name="line.94"></a> |
| <FONT color="green">095</FONT> chunk[slotpos] = w0;<a name="line.95"></a> |
| <FONT color="green">096</FONT> chunk[slotpos+1] = w1;<a name="line.96"></a> |
| <FONT color="green">097</FONT> chunk[slotpos+2] = w2;<a name="line.97"></a> |
| <FONT color="green">098</FONT> chunk[slotpos+3] = w3;<a name="line.98"></a> |
| <FONT color="green">099</FONT> <a name="line.99"></a> |
| <FONT color="green">100</FONT> return ++lastUsed;<a name="line.100"></a> |
| <FONT color="green">101</FONT> }<a name="line.101"></a> |
| <FONT color="green">102</FONT> }<a name="line.102"></a> |
| <FONT color="green">103</FONT> /**<a name="line.103"></a> |
| <FONT color="green">104</FONT> * Retrieve an integer from the CIA by record number and column within<a name="line.104"></a> |
| <FONT color="green">105</FONT> * the record, both 0-based (though position 0 is reserved for special<a name="line.105"></a> |
| <FONT color="green">106</FONT> * purposes).<a name="line.106"></a> |
| <FONT color="green">107</FONT> * @param position int Record number<a name="line.107"></a> |
| <FONT color="green">108</FONT> * @param slotpos int Column number<a name="line.108"></a> |
| <FONT color="green">109</FONT> */<a name="line.109"></a> |
| <FONT color="green">110</FONT> int readEntry(int position, int offset) throws ArrayIndexOutOfBoundsException<a name="line.110"></a> |
| <FONT color="green">111</FONT> {<a name="line.111"></a> |
| <FONT color="green">112</FONT> /*<a name="line.112"></a> |
| <FONT color="green">113</FONT> try<a name="line.113"></a> |
| <FONT color="green">114</FONT> {<a name="line.114"></a> |
| <FONT color="green">115</FONT> return fastArray[(position*slotsize)+offset];<a name="line.115"></a> |
| <FONT color="green">116</FONT> }<a name="line.116"></a> |
| <FONT color="green">117</FONT> catch(ArrayIndexOutOfBoundsException aioobe)<a name="line.117"></a> |
| <FONT color="green">118</FONT> */<a name="line.118"></a> |
| <FONT color="green">119</FONT> {<a name="line.119"></a> |
| <FONT color="green">120</FONT> // System.out.println("Using slow read (1)");<a name="line.120"></a> |
| <FONT color="green">121</FONT> if (offset>=slotsize)<a name="line.121"></a> |
| <FONT color="green">122</FONT> throw new ArrayIndexOutOfBoundsException(XMLMessages.createXMLMessage(XMLErrorResources.ER_OFFSET_BIGGER_THAN_SLOT, null)); //"Offset bigger than slot");<a name="line.122"></a> |
| <FONT color="green">123</FONT> position*=slotsize;<a name="line.123"></a> |
| <FONT color="green">124</FONT> int chunkpos = position >> lowbits;<a name="line.124"></a> |
| <FONT color="green">125</FONT> int slotpos = position & lowmask;<a name="line.125"></a> |
| <FONT color="green">126</FONT> int[] chunk = chunks.elementAt(chunkpos);<a name="line.126"></a> |
| <FONT color="green">127</FONT> return chunk[slotpos + offset];<a name="line.127"></a> |
| <FONT color="green">128</FONT> }<a name="line.128"></a> |
| <FONT color="green">129</FONT> }<a name="line.129"></a> |
| <FONT color="green">130</FONT> <a name="line.130"></a> |
| <FONT color="green">131</FONT> // Check that the node at index "position" is not an ancestor<a name="line.131"></a> |
| <FONT color="green">132</FONT> // of the node at index "startPos". IF IT IS, DO NOT ACCEPT IT AND<a name="line.132"></a> |
| <FONT color="green">133</FONT> // RETURN -1. If position is NOT an ancestor, return position.<a name="line.133"></a> |
| <FONT color="green">134</FONT> // Special case: The Document node (position==0) is acceptable.<a name="line.134"></a> |
| <FONT color="green">135</FONT> //<a name="line.135"></a> |
| <FONT color="green">136</FONT> // This test supports DTM.getNextPreceding.<a name="line.136"></a> |
| <FONT color="green">137</FONT> int specialFind(int startPos, int position)<a name="line.137"></a> |
| <FONT color="green">138</FONT> {<a name="line.138"></a> |
| <FONT color="green">139</FONT> // We have to look all the way up the ancestor chain<a name="line.139"></a> |
| <FONT color="green">140</FONT> // to make sure we don't have an ancestor.<a name="line.140"></a> |
| <FONT color="green">141</FONT> int ancestor = startPos;<a name="line.141"></a> |
| <FONT color="green">142</FONT> while(ancestor > 0)<a name="line.142"></a> |
| <FONT color="green">143</FONT> {<a name="line.143"></a> |
| <FONT color="green">144</FONT> // Get the node whose index == ancestor<a name="line.144"></a> |
| <FONT color="green">145</FONT> ancestor*=slotsize;<a name="line.145"></a> |
| <FONT color="green">146</FONT> int chunkpos = ancestor >> lowbits;<a name="line.146"></a> |
| <FONT color="green">147</FONT> int slotpos = ancestor & lowmask;<a name="line.147"></a> |
| <FONT color="green">148</FONT> int[] chunk = chunks.elementAt(chunkpos);<a name="line.148"></a> |
| <FONT color="green">149</FONT> <a name="line.149"></a> |
| <FONT color="green">150</FONT> // Get that node's parent (Note that this assumes w[1]<a name="line.150"></a> |
| <FONT color="green">151</FONT> // is the parent node index. That's really a DTM feature<a name="line.151"></a> |
| <FONT color="green">152</FONT> // rather than a ChunkedIntArray feature.)<a name="line.152"></a> |
| <FONT color="green">153</FONT> ancestor = chunk[slotpos + 1];<a name="line.153"></a> |
| <FONT color="green">154</FONT> <a name="line.154"></a> |
| <FONT color="green">155</FONT> if(ancestor == position)<a name="line.155"></a> |
| <FONT color="green">156</FONT> break;<a name="line.156"></a> |
| <FONT color="green">157</FONT> }<a name="line.157"></a> |
| <FONT color="green">158</FONT> <a name="line.158"></a> |
| <FONT color="green">159</FONT> if (ancestor <= 0) <a name="line.159"></a> |
| <FONT color="green">160</FONT> {<a name="line.160"></a> |
| <FONT color="green">161</FONT> return position;<a name="line.161"></a> |
| <FONT color="green">162</FONT> }<a name="line.162"></a> |
| <FONT color="green">163</FONT> return -1;<a name="line.163"></a> |
| <FONT color="green">164</FONT> }<a name="line.164"></a> |
| <FONT color="green">165</FONT> <a name="line.165"></a> |
| <FONT color="green">166</FONT> /**<a name="line.166"></a> |
| <FONT color="green">167</FONT> * @return int index of highest-numbered record currently in use<a name="line.167"></a> |
| <FONT color="green">168</FONT> */<a name="line.168"></a> |
| <FONT color="green">169</FONT> int slotsUsed()<a name="line.169"></a> |
| <FONT color="green">170</FONT> {<a name="line.170"></a> |
| <FONT color="green">171</FONT> return lastUsed;<a name="line.171"></a> |
| <FONT color="green">172</FONT> }<a name="line.172"></a> |
| <FONT color="green">173</FONT> <a name="line.173"></a> |
| <FONT color="green">174</FONT> /** Disard the highest-numbered record. This is used in the string-buffer<a name="line.174"></a> |
| <FONT color="green">175</FONT> CIA; when only a single characters() chunk has been recieved, its index<a name="line.175"></a> |
| <FONT color="green">176</FONT> is moved into the Text node rather than being referenced by indirection<a name="line.176"></a> |
| <FONT color="green">177</FONT> into the text accumulator.<a name="line.177"></a> |
| <FONT color="green">178</FONT> */<a name="line.178"></a> |
| <FONT color="green">179</FONT> void discardLast()<a name="line.179"></a> |
| <FONT color="green">180</FONT> {<a name="line.180"></a> |
| <FONT color="green">181</FONT> --lastUsed;<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> * Overwrite the integer found at a specific record and column.<a name="line.185"></a> |
| <FONT color="green">186</FONT> * Used to back-patch existing records, most often changing their<a name="line.186"></a> |
| <FONT color="green">187</FONT> * "next sibling" reference from 0 (unknown) to something meaningful<a name="line.187"></a> |
| <FONT color="green">188</FONT> * @param position int Record number<a name="line.188"></a> |
| <FONT color="green">189</FONT> * @param offset int Column number<a name="line.189"></a> |
| <FONT color="green">190</FONT> * @param value int New contents<a name="line.190"></a> |
| <FONT color="green">191</FONT> */<a name="line.191"></a> |
| <FONT color="green">192</FONT> void writeEntry(int position, int offset, int value) throws ArrayIndexOutOfBoundsException<a name="line.192"></a> |
| <FONT color="green">193</FONT> {<a name="line.193"></a> |
| <FONT color="green">194</FONT> /*<a name="line.194"></a> |
| <FONT color="green">195</FONT> try<a name="line.195"></a> |
| <FONT color="green">196</FONT> {<a name="line.196"></a> |
| <FONT color="green">197</FONT> fastArray[( position*slotsize)+offset] = value;<a name="line.197"></a> |
| <FONT color="green">198</FONT> }<a name="line.198"></a> |
| <FONT color="green">199</FONT> catch(ArrayIndexOutOfBoundsException aioobe)<a name="line.199"></a> |
| <FONT color="green">200</FONT> */<a name="line.200"></a> |
| <FONT color="green">201</FONT> {<a name="line.201"></a> |
| <FONT color="green">202</FONT> if (offset >= slotsize)<a name="line.202"></a> |
| <FONT color="green">203</FONT> throw new ArrayIndexOutOfBoundsException(XMLMessages.createXMLMessage(XMLErrorResources.ER_OFFSET_BIGGER_THAN_SLOT, null)); //"Offset bigger than slot");<a name="line.203"></a> |
| <FONT color="green">204</FONT> position*=slotsize;<a name="line.204"></a> |
| <FONT color="green">205</FONT> int chunkpos = position >> lowbits;<a name="line.205"></a> |
| <FONT color="green">206</FONT> int slotpos = position & lowmask;<a name="line.206"></a> |
| <FONT color="green">207</FONT> int[] chunk = chunks.elementAt(chunkpos);<a name="line.207"></a> |
| <FONT color="green">208</FONT> chunk[slotpos + offset] = value; // ATOMIC!<a name="line.208"></a> |
| <FONT color="green">209</FONT> }<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> * Overwrite an entire (4-integer) record at the specified index.<a name="line.213"></a> |
| <FONT color="green">214</FONT> * Mostly used to create record 0, the Document node.<a name="line.214"></a> |
| <FONT color="green">215</FONT> * @param position integer Record number<a name="line.215"></a> |
| <FONT color="green">216</FONT> * @param w0 int <a name="line.216"></a> |
| <FONT color="green">217</FONT> * @param w1 int<a name="line.217"></a> |
| <FONT color="green">218</FONT> * @param w2 int<a name="line.218"></a> |
| <FONT color="green">219</FONT> * @param w3 int<a name="line.219"></a> |
| <FONT color="green">220</FONT> */<a name="line.220"></a> |
| <FONT color="green">221</FONT> void writeSlot(int position, int w0, int w1, int w2, int w3)<a name="line.221"></a> |
| <FONT color="green">222</FONT> {<a name="line.222"></a> |
| <FONT color="green">223</FONT> position *= slotsize;<a name="line.223"></a> |
| <FONT color="green">224</FONT> int chunkpos = position >> lowbits;<a name="line.224"></a> |
| <FONT color="green">225</FONT> int slotpos = (position & lowmask);<a name="line.225"></a> |
| <FONT color="green">226</FONT> <a name="line.226"></a> |
| <FONT color="green">227</FONT> // Grow if needed<a name="line.227"></a> |
| <FONT color="green">228</FONT> if (chunkpos > chunks.size() - 1)<a name="line.228"></a> |
| <FONT color="green">229</FONT> chunks.addElement(new int[chunkalloc]);<a name="line.229"></a> |
| <FONT color="green">230</FONT> int[] chunk = chunks.elementAt(chunkpos);<a name="line.230"></a> |
| <FONT color="green">231</FONT> chunk[slotpos] = w0;<a name="line.231"></a> |
| <FONT color="green">232</FONT> chunk[slotpos + 1] = w1;<a name="line.232"></a> |
| <FONT color="green">233</FONT> chunk[slotpos + 2] = w2;<a name="line.233"></a> |
| <FONT color="green">234</FONT> chunk[slotpos + 3] = w3;<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> /**<a name="line.237"></a> |
| <FONT color="green">238</FONT> * Retrieve the contents of a record into a user-supplied buffer array.<a name="line.238"></a> |
| <FONT color="green">239</FONT> * Used to reduce addressing overhead when code will access several<a name="line.239"></a> |
| <FONT color="green">240</FONT> * columns of the record.<a name="line.240"></a> |
| <FONT color="green">241</FONT> * @param position int Record number<a name="line.241"></a> |
| <FONT color="green">242</FONT> * @param buffer int[] Integer array provided by user, must be large enough<a name="line.242"></a> |
| <FONT color="green">243</FONT> * to hold a complete record.<a name="line.243"></a> |
| <FONT color="green">244</FONT> */<a name="line.244"></a> |
| <FONT color="green">245</FONT> void readSlot(int position, int[] buffer)<a name="line.245"></a> |
| <FONT color="green">246</FONT> {<a name="line.246"></a> |
| <FONT color="green">247</FONT> /*<a name="line.247"></a> |
| <FONT color="green">248</FONT> try<a name="line.248"></a> |
| <FONT color="green">249</FONT> {<a name="line.249"></a> |
| <FONT color="green">250</FONT> System.arraycopy(fastArray, position*slotsize, buffer, 0, slotsize);<a name="line.250"></a> |
| <FONT color="green">251</FONT> }<a name="line.251"></a> |
| <FONT color="green">252</FONT> catch(ArrayIndexOutOfBoundsException aioobe)<a name="line.252"></a> |
| <FONT color="green">253</FONT> */<a name="line.253"></a> |
| <FONT color="green">254</FONT> {<a name="line.254"></a> |
| <FONT color="green">255</FONT> // System.out.println("Using slow read (2): "+position);<a name="line.255"></a> |
| <FONT color="green">256</FONT> position *= slotsize;<a name="line.256"></a> |
| <FONT color="green">257</FONT> int chunkpos = position >> lowbits;<a name="line.257"></a> |
| <FONT color="green">258</FONT> int slotpos = (position & lowmask);<a name="line.258"></a> |
| <FONT color="green">259</FONT> <a name="line.259"></a> |
| <FONT color="green">260</FONT> // Grow if needed<a name="line.260"></a> |
| <FONT color="green">261</FONT> if (chunkpos > chunks.size() - 1)<a name="line.261"></a> |
| <FONT color="green">262</FONT> chunks.addElement(new int[chunkalloc]);<a name="line.262"></a> |
| <FONT color="green">263</FONT> int[] chunk = chunks.elementAt(chunkpos);<a name="line.263"></a> |
| <FONT color="green">264</FONT> System.arraycopy(chunk,slotpos,buffer,0,slotsize);<a name="line.264"></a> |
| <FONT color="green">265</FONT> }<a name="line.265"></a> |
| <FONT color="green">266</FONT> }<a name="line.266"></a> |
| <FONT color="green">267</FONT> <a name="line.267"></a> |
| <FONT color="green">268</FONT> static class ChunksVector<a name="line.268"></a> |
| <FONT color="green">269</FONT> {<a name="line.269"></a> |
| <FONT color="green">270</FONT> static final int BLOCKSIZE = 64;<a name="line.270"></a> |
| <FONT color="green">271</FONT> int[] m_map[] = new int[BLOCKSIZE][];<a name="line.271"></a> |
| <FONT color="green">272</FONT> int m_mapSize = BLOCKSIZE;<a name="line.272"></a> |
| <FONT color="green">273</FONT> int pos = 0;<a name="line.273"></a> |
| <FONT color="green">274</FONT> <a name="line.274"></a> |
| <FONT color="green">275</FONT> ChunksVector()<a name="line.275"></a> |
| <FONT color="green">276</FONT> {<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> final int size()<a name="line.279"></a> |
| <FONT color="green">280</FONT> {<a name="line.280"></a> |
| <FONT color="green">281</FONT> return pos;<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> void addElement(int[] value)<a name="line.284"></a> |
| <FONT color="green">285</FONT> {<a name="line.285"></a> |
| <FONT color="green">286</FONT> if(pos >= m_mapSize)<a name="line.286"></a> |
| <FONT color="green">287</FONT> {<a name="line.287"></a> |
| <FONT color="green">288</FONT> int orgMapSize = m_mapSize;<a name="line.288"></a> |
| <FONT color="green">289</FONT> while(pos >= m_mapSize)<a name="line.289"></a> |
| <FONT color="green">290</FONT> m_mapSize+=BLOCKSIZE;<a name="line.290"></a> |
| <FONT color="green">291</FONT> int[] newMap[] = new int[m_mapSize][];<a name="line.291"></a> |
| <FONT color="green">292</FONT> System.arraycopy(m_map, 0, newMap, 0, orgMapSize);<a name="line.292"></a> |
| <FONT color="green">293</FONT> m_map = newMap;<a name="line.293"></a> |
| <FONT color="green">294</FONT> }<a name="line.294"></a> |
| <FONT color="green">295</FONT> // For now, just do a simple append. A sorted insert only <a name="line.295"></a> |
| <FONT color="green">296</FONT> // makes sense if we're doing an binary search or some such.<a name="line.296"></a> |
| <FONT color="green">297</FONT> m_map[pos] = value;<a name="line.297"></a> |
| <FONT color="green">298</FONT> pos++;<a name="line.298"></a> |
| <FONT color="green">299</FONT> }<a name="line.299"></a> |
| <FONT color="green">300</FONT> <a name="line.300"></a> |
| <FONT color="green">301</FONT> final int[] elementAt(int pos)<a name="line.301"></a> |
| <FONT color="green">302</FONT> {<a name="line.302"></a> |
| <FONT color="green">303</FONT> return m_map[pos];<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> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </PRE> |
| </BODY> |
| </HTML> |
