|
13
|
1 <HTML>
|
|
|
2 <BODY BGCOLOR="white">
|
|
|
3 <PRE>
|
|
|
4 <FONT color="green">001</FONT> /*<a name="line.1"></a>
|
|
|
5 <FONT color="green">002</FONT> * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a>
|
|
|
6 <FONT color="green">003</FONT> * contributor license agreements. See the NOTICE file distributed with<a name="line.3"></a>
|
|
|
7 <FONT color="green">004</FONT> * this work for additional information regarding copyright ownership.<a name="line.4"></a>
|
|
|
8 <FONT color="green">005</FONT> * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a>
|
|
|
9 <FONT color="green">006</FONT> * (the "License"); you may not use this file except in compliance with<a name="line.6"></a>
|
|
|
10 <FONT color="green">007</FONT> * the License. You may obtain a copy of the License at<a name="line.7"></a>
|
|
|
11 <FONT color="green">008</FONT> *<a name="line.8"></a>
|
|
|
12 <FONT color="green">009</FONT> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a>
|
|
|
13 <FONT color="green">010</FONT> *<a name="line.10"></a>
|
|
|
14 <FONT color="green">011</FONT> * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a>
|
|
|
15 <FONT color="green">012</FONT> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a>
|
|
|
16 <FONT color="green">013</FONT> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a>
|
|
|
17 <FONT color="green">014</FONT> * See the License for the specific language governing permissions and<a name="line.14"></a>
|
|
|
18 <FONT color="green">015</FONT> * limitations under the License.<a name="line.15"></a>
|
|
|
19 <FONT color="green">016</FONT> */<a name="line.16"></a>
|
|
|
20 <FONT color="green">017</FONT> <a name="line.17"></a>
|
|
|
21 <FONT color="green">018</FONT> package org.apache.commons.math.util;<a name="line.18"></a>
|
|
|
22 <FONT color="green">019</FONT> <a name="line.19"></a>
|
|
|
23 <FONT color="green">020</FONT> import java.io.IOException;<a name="line.20"></a>
|
|
|
24 <FONT color="green">021</FONT> import java.io.ObjectInputStream;<a name="line.21"></a>
|
|
|
25 <FONT color="green">022</FONT> import java.io.Serializable;<a name="line.22"></a>
|
|
|
26 <FONT color="green">023</FONT> import java.util.ConcurrentModificationException;<a name="line.23"></a>
|
|
|
27 <FONT color="green">024</FONT> import java.util.NoSuchElementException;<a name="line.24"></a>
|
|
|
28 <FONT color="green">025</FONT> <a name="line.25"></a>
|
|
|
29 <FONT color="green">026</FONT> import org.apache.commons.math.MathRuntimeException;<a name="line.26"></a>
|
|
|
30 <FONT color="green">027</FONT> <a name="line.27"></a>
|
|
|
31 <FONT color="green">028</FONT> /**<a name="line.28"></a>
|
|
|
32 <FONT color="green">029</FONT> * Open addressed map from int to double.<a name="line.29"></a>
|
|
|
33 <FONT color="green">030</FONT> * <p>This class provides a dedicated map from integers to doubles with a<a name="line.30"></a>
|
|
|
34 <FONT color="green">031</FONT> * much smaller memory overhead than standard <code>java.util.Map</code>.</p><a name="line.31"></a>
|
|
|
35 <FONT color="green">032</FONT> * <p>This class is not synchronized. The specialized iterators returned by<a name="line.32"></a>
|
|
|
36 <FONT color="green">033</FONT> * {@link #iterator()} are fail-fast: they throw a<a name="line.33"></a>
|
|
|
37 <FONT color="green">034</FONT> * <code>ConcurrentModificationException</code> when they detect the map has been<a name="line.34"></a>
|
|
|
38 <FONT color="green">035</FONT> * modified during iteration.</p><a name="line.35"></a>
|
|
|
39 <FONT color="green">036</FONT> * @version $Revision: 885278 $ $Date: 2009-11-29 16:47:51 -0500 (Sun, 29 Nov 2009) $<a name="line.36"></a>
|
|
|
40 <FONT color="green">037</FONT> * @since 2.0<a name="line.37"></a>
|
|
|
41 <FONT color="green">038</FONT> */<a name="line.38"></a>
|
|
|
42 <FONT color="green">039</FONT> public class OpenIntToDoubleHashMap implements Serializable {<a name="line.39"></a>
|
|
|
43 <FONT color="green">040</FONT> <a name="line.40"></a>
|
|
|
44 <FONT color="green">041</FONT> /** Status indicator for free table entries. */<a name="line.41"></a>
|
|
|
45 <FONT color="green">042</FONT> protected static final byte FREE = 0;<a name="line.42"></a>
|
|
|
46 <FONT color="green">043</FONT> <a name="line.43"></a>
|
|
|
47 <FONT color="green">044</FONT> /** Status indicator for full table entries. */<a name="line.44"></a>
|
|
|
48 <FONT color="green">045</FONT> protected static final byte FULL = 1;<a name="line.45"></a>
|
|
|
49 <FONT color="green">046</FONT> <a name="line.46"></a>
|
|
|
50 <FONT color="green">047</FONT> /** Status indicator for removed table entries. */<a name="line.47"></a>
|
|
|
51 <FONT color="green">048</FONT> protected static final byte REMOVED = 2;<a name="line.48"></a>
|
|
|
52 <FONT color="green">049</FONT> <a name="line.49"></a>
|
|
|
53 <FONT color="green">050</FONT> /** Serializable version identifier */<a name="line.50"></a>
|
|
|
54 <FONT color="green">051</FONT> private static final long serialVersionUID = -3646337053166149105L;<a name="line.51"></a>
|
|
|
55 <FONT color="green">052</FONT> <a name="line.52"></a>
|
|
|
56 <FONT color="green">053</FONT> /** Message for map modification during iteration. */<a name="line.53"></a>
|
|
|
57 <FONT color="green">054</FONT> private static final String CONCURRENT_MODIFICATION_MESSAGE =<a name="line.54"></a>
|
|
|
58 <FONT color="green">055</FONT> "map has been modified while iterating";<a name="line.55"></a>
|
|
|
59 <FONT color="green">056</FONT> <a name="line.56"></a>
|
|
|
60 <FONT color="green">057</FONT> /** Message for exhausted iterator. */<a name="line.57"></a>
|
|
|
61 <FONT color="green">058</FONT> private static final String EXHAUSTED_ITERATOR_MESSAGE =<a name="line.58"></a>
|
|
|
62 <FONT color="green">059</FONT> "iterator exhausted";<a name="line.59"></a>
|
|
|
63 <FONT color="green">060</FONT> <a name="line.60"></a>
|
|
|
64 <FONT color="green">061</FONT> /** Load factor for the map. */<a name="line.61"></a>
|
|
|
65 <FONT color="green">062</FONT> private static final float LOAD_FACTOR = 0.5f;<a name="line.62"></a>
|
|
|
66 <FONT color="green">063</FONT> <a name="line.63"></a>
|
|
|
67 <FONT color="green">064</FONT> /** Default starting size.<a name="line.64"></a>
|
|
|
68 <FONT color="green">065</FONT> * <p>This must be a power of two for bit mask to work properly. </p><a name="line.65"></a>
|
|
|
69 <FONT color="green">066</FONT> */<a name="line.66"></a>
|
|
|
70 <FONT color="green">067</FONT> private static final int DEFAULT_EXPECTED_SIZE = 16;<a name="line.67"></a>
|
|
|
71 <FONT color="green">068</FONT> <a name="line.68"></a>
|
|
|
72 <FONT color="green">069</FONT> /** Multiplier for size growth when map fills up.<a name="line.69"></a>
|
|
|
73 <FONT color="green">070</FONT> * <p>This must be a power of two for bit mask to work properly. </p><a name="line.70"></a>
|
|
|
74 <FONT color="green">071</FONT> */<a name="line.71"></a>
|
|
|
75 <FONT color="green">072</FONT> private static final int RESIZE_MULTIPLIER = 2;<a name="line.72"></a>
|
|
|
76 <FONT color="green">073</FONT> <a name="line.73"></a>
|
|
|
77 <FONT color="green">074</FONT> /** Number of bits to perturb the index when probing for collision resolution. */<a name="line.74"></a>
|
|
|
78 <FONT color="green">075</FONT> private static final int PERTURB_SHIFT = 5;<a name="line.75"></a>
|
|
|
79 <FONT color="green">076</FONT> <a name="line.76"></a>
|
|
|
80 <FONT color="green">077</FONT> /** Keys table. */<a name="line.77"></a>
|
|
|
81 <FONT color="green">078</FONT> private int[] keys;<a name="line.78"></a>
|
|
|
82 <FONT color="green">079</FONT> <a name="line.79"></a>
|
|
|
83 <FONT color="green">080</FONT> /** Values table. */<a name="line.80"></a>
|
|
|
84 <FONT color="green">081</FONT> private double[] values;<a name="line.81"></a>
|
|
|
85 <FONT color="green">082</FONT> <a name="line.82"></a>
|
|
|
86 <FONT color="green">083</FONT> /** States table. */<a name="line.83"></a>
|
|
|
87 <FONT color="green">084</FONT> private byte[] states;<a name="line.84"></a>
|
|
|
88 <FONT color="green">085</FONT> <a name="line.85"></a>
|
|
|
89 <FONT color="green">086</FONT> /** Return value for missing entries. */<a name="line.86"></a>
|
|
|
90 <FONT color="green">087</FONT> private final double missingEntries;<a name="line.87"></a>
|
|
|
91 <FONT color="green">088</FONT> <a name="line.88"></a>
|
|
|
92 <FONT color="green">089</FONT> /** Current size of the map. */<a name="line.89"></a>
|
|
|
93 <FONT color="green">090</FONT> private int size;<a name="line.90"></a>
|
|
|
94 <FONT color="green">091</FONT> <a name="line.91"></a>
|
|
|
95 <FONT color="green">092</FONT> /** Bit mask for hash values. */<a name="line.92"></a>
|
|
|
96 <FONT color="green">093</FONT> private int mask;<a name="line.93"></a>
|
|
|
97 <FONT color="green">094</FONT> <a name="line.94"></a>
|
|
|
98 <FONT color="green">095</FONT> /** Modifications count. */<a name="line.95"></a>
|
|
|
99 <FONT color="green">096</FONT> private transient int count;<a name="line.96"></a>
|
|
|
100 <FONT color="green">097</FONT> <a name="line.97"></a>
|
|
|
101 <FONT color="green">098</FONT> /**<a name="line.98"></a>
|
|
|
102 <FONT color="green">099</FONT> * Build an empty map with default size and using NaN for missing entries.<a name="line.99"></a>
|
|
|
103 <FONT color="green">100</FONT> */<a name="line.100"></a>
|
|
|
104 <FONT color="green">101</FONT> public OpenIntToDoubleHashMap() {<a name="line.101"></a>
|
|
|
105 <FONT color="green">102</FONT> this(DEFAULT_EXPECTED_SIZE, Double.NaN);<a name="line.102"></a>
|
|
|
106 <FONT color="green">103</FONT> }<a name="line.103"></a>
|
|
|
107 <FONT color="green">104</FONT> <a name="line.104"></a>
|
|
|
108 <FONT color="green">105</FONT> /**<a name="line.105"></a>
|
|
|
109 <FONT color="green">106</FONT> * Build an empty map with default size<a name="line.106"></a>
|
|
|
110 <FONT color="green">107</FONT> * @param missingEntries value to return when a missing entry is fetched<a name="line.107"></a>
|
|
|
111 <FONT color="green">108</FONT> */<a name="line.108"></a>
|
|
|
112 <FONT color="green">109</FONT> public OpenIntToDoubleHashMap(final double missingEntries) {<a name="line.109"></a>
|
|
|
113 <FONT color="green">110</FONT> this(DEFAULT_EXPECTED_SIZE, missingEntries);<a name="line.110"></a>
|
|
|
114 <FONT color="green">111</FONT> }<a name="line.111"></a>
|
|
|
115 <FONT color="green">112</FONT> <a name="line.112"></a>
|
|
|
116 <FONT color="green">113</FONT> /**<a name="line.113"></a>
|
|
|
117 <FONT color="green">114</FONT> * Build an empty map with specified size and using NaN for missing entries.<a name="line.114"></a>
|
|
|
118 <FONT color="green">115</FONT> * @param expectedSize expected number of elements in the map<a name="line.115"></a>
|
|
|
119 <FONT color="green">116</FONT> */<a name="line.116"></a>
|
|
|
120 <FONT color="green">117</FONT> public OpenIntToDoubleHashMap(final int expectedSize) {<a name="line.117"></a>
|
|
|
121 <FONT color="green">118</FONT> this(expectedSize, Double.NaN);<a name="line.118"></a>
|
|
|
122 <FONT color="green">119</FONT> }<a name="line.119"></a>
|
|
|
123 <FONT color="green">120</FONT> <a name="line.120"></a>
|
|
|
124 <FONT color="green">121</FONT> /**<a name="line.121"></a>
|
|
|
125 <FONT color="green">122</FONT> * Build an empty map with specified size.<a name="line.122"></a>
|
|
|
126 <FONT color="green">123</FONT> * @param expectedSize expected number of elements in the map<a name="line.123"></a>
|
|
|
127 <FONT color="green">124</FONT> * @param missingEntries value to return when a missing entry is fetched<a name="line.124"></a>
|
|
|
128 <FONT color="green">125</FONT> */<a name="line.125"></a>
|
|
|
129 <FONT color="green">126</FONT> public OpenIntToDoubleHashMap(final int expectedSize,<a name="line.126"></a>
|
|
|
130 <FONT color="green">127</FONT> final double missingEntries) {<a name="line.127"></a>
|
|
|
131 <FONT color="green">128</FONT> final int capacity = computeCapacity(expectedSize);<a name="line.128"></a>
|
|
|
132 <FONT color="green">129</FONT> keys = new int[capacity];<a name="line.129"></a>
|
|
|
133 <FONT color="green">130</FONT> values = new double[capacity];<a name="line.130"></a>
|
|
|
134 <FONT color="green">131</FONT> states = new byte[capacity];<a name="line.131"></a>
|
|
|
135 <FONT color="green">132</FONT> this.missingEntries = missingEntries;<a name="line.132"></a>
|
|
|
136 <FONT color="green">133</FONT> mask = capacity - 1;<a name="line.133"></a>
|
|
|
137 <FONT color="green">134</FONT> }<a name="line.134"></a>
|
|
|
138 <FONT color="green">135</FONT> <a name="line.135"></a>
|
|
|
139 <FONT color="green">136</FONT> /**<a name="line.136"></a>
|
|
|
140 <FONT color="green">137</FONT> * Copy constructor.<a name="line.137"></a>
|
|
|
141 <FONT color="green">138</FONT> * @param source map to copy<a name="line.138"></a>
|
|
|
142 <FONT color="green">139</FONT> */<a name="line.139"></a>
|
|
|
143 <FONT color="green">140</FONT> public OpenIntToDoubleHashMap(final OpenIntToDoubleHashMap source) {<a name="line.140"></a>
|
|
|
144 <FONT color="green">141</FONT> final int length = source.keys.length;<a name="line.141"></a>
|
|
|
145 <FONT color="green">142</FONT> keys = new int[length];<a name="line.142"></a>
|
|
|
146 <FONT color="green">143</FONT> System.arraycopy(source.keys, 0, keys, 0, length);<a name="line.143"></a>
|
|
|
147 <FONT color="green">144</FONT> values = new double[length];<a name="line.144"></a>
|
|
|
148 <FONT color="green">145</FONT> System.arraycopy(source.values, 0, values, 0, length);<a name="line.145"></a>
|
|
|
149 <FONT color="green">146</FONT> states = new byte[length];<a name="line.146"></a>
|
|
|
150 <FONT color="green">147</FONT> System.arraycopy(source.states, 0, states, 0, length);<a name="line.147"></a>
|
|
|
151 <FONT color="green">148</FONT> missingEntries = source.missingEntries;<a name="line.148"></a>
|
|
|
152 <FONT color="green">149</FONT> size = source.size;<a name="line.149"></a>
|
|
|
153 <FONT color="green">150</FONT> mask = source.mask;<a name="line.150"></a>
|
|
|
154 <FONT color="green">151</FONT> count = source.count;<a name="line.151"></a>
|
|
|
155 <FONT color="green">152</FONT> }<a name="line.152"></a>
|
|
|
156 <FONT color="green">153</FONT> <a name="line.153"></a>
|
|
|
157 <FONT color="green">154</FONT> /**<a name="line.154"></a>
|
|
|
158 <FONT color="green">155</FONT> * Compute the capacity needed for a given size.<a name="line.155"></a>
|
|
|
159 <FONT color="green">156</FONT> * @param expectedSize expected size of the map<a name="line.156"></a>
|
|
|
160 <FONT color="green">157</FONT> * @return capacity to use for the specified size<a name="line.157"></a>
|
|
|
161 <FONT color="green">158</FONT> */<a name="line.158"></a>
|
|
|
162 <FONT color="green">159</FONT> private static int computeCapacity(final int expectedSize) {<a name="line.159"></a>
|
|
|
163 <FONT color="green">160</FONT> if (expectedSize == 0) {<a name="line.160"></a>
|
|
|
164 <FONT color="green">161</FONT> return 1;<a name="line.161"></a>
|
|
|
165 <FONT color="green">162</FONT> }<a name="line.162"></a>
|
|
|
166 <FONT color="green">163</FONT> final int capacity = (int) Math.ceil(expectedSize / LOAD_FACTOR);<a name="line.163"></a>
|
|
|
167 <FONT color="green">164</FONT> final int powerOfTwo = Integer.highestOneBit(capacity);<a name="line.164"></a>
|
|
|
168 <FONT color="green">165</FONT> if (powerOfTwo == capacity) {<a name="line.165"></a>
|
|
|
169 <FONT color="green">166</FONT> return capacity;<a name="line.166"></a>
|
|
|
170 <FONT color="green">167</FONT> }<a name="line.167"></a>
|
|
|
171 <FONT color="green">168</FONT> return nextPowerOfTwo(capacity);<a name="line.168"></a>
|
|
|
172 <FONT color="green">169</FONT> }<a name="line.169"></a>
|
|
|
173 <FONT color="green">170</FONT> <a name="line.170"></a>
|
|
|
174 <FONT color="green">171</FONT> /**<a name="line.171"></a>
|
|
|
175 <FONT color="green">172</FONT> * Find the smallest power of two greater than the input value<a name="line.172"></a>
|
|
|
176 <FONT color="green">173</FONT> * @param i input value<a name="line.173"></a>
|
|
|
177 <FONT color="green">174</FONT> * @return smallest power of two greater than the input value<a name="line.174"></a>
|
|
|
178 <FONT color="green">175</FONT> */<a name="line.175"></a>
|
|
|
179 <FONT color="green">176</FONT> private static int nextPowerOfTwo(final int i) {<a name="line.176"></a>
|
|
|
180 <FONT color="green">177</FONT> return Integer.highestOneBit(i) << 1;<a name="line.177"></a>
|
|
|
181 <FONT color="green">178</FONT> }<a name="line.178"></a>
|
|
|
182 <FONT color="green">179</FONT> <a name="line.179"></a>
|
|
|
183 <FONT color="green">180</FONT> /**<a name="line.180"></a>
|
|
|
184 <FONT color="green">181</FONT> * Get the stored value associated with the given key<a name="line.181"></a>
|
|
|
185 <FONT color="green">182</FONT> * @param key key associated with the data<a name="line.182"></a>
|
|
|
186 <FONT color="green">183</FONT> * @return data associated with the key<a name="line.183"></a>
|
|
|
187 <FONT color="green">184</FONT> */<a name="line.184"></a>
|
|
|
188 <FONT color="green">185</FONT> public double get(final int key) {<a name="line.185"></a>
|
|
|
189 <FONT color="green">186</FONT> <a name="line.186"></a>
|
|
|
190 <FONT color="green">187</FONT> final int hash = hashOf(key);<a name="line.187"></a>
|
|
|
191 <FONT color="green">188</FONT> int index = hash & mask;<a name="line.188"></a>
|
|
|
192 <FONT color="green">189</FONT> if (containsKey(key, index)) {<a name="line.189"></a>
|
|
|
193 <FONT color="green">190</FONT> return values[index];<a name="line.190"></a>
|
|
|
194 <FONT color="green">191</FONT> }<a name="line.191"></a>
|
|
|
195 <FONT color="green">192</FONT> <a name="line.192"></a>
|
|
|
196 <FONT color="green">193</FONT> if (states[index] == FREE) {<a name="line.193"></a>
|
|
|
197 <FONT color="green">194</FONT> return missingEntries;<a name="line.194"></a>
|
|
|
198 <FONT color="green">195</FONT> }<a name="line.195"></a>
|
|
|
199 <FONT color="green">196</FONT> <a name="line.196"></a>
|
|
|
200 <FONT color="green">197</FONT> int j = index;<a name="line.197"></a>
|
|
|
201 <FONT color="green">198</FONT> for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {<a name="line.198"></a>
|
|
|
202 <FONT color="green">199</FONT> j = probe(perturb, j);<a name="line.199"></a>
|
|
|
203 <FONT color="green">200</FONT> index = j & mask;<a name="line.200"></a>
|
|
|
204 <FONT color="green">201</FONT> if (containsKey(key, index)) {<a name="line.201"></a>
|
|
|
205 <FONT color="green">202</FONT> return values[index];<a name="line.202"></a>
|
|
|
206 <FONT color="green">203</FONT> }<a name="line.203"></a>
|
|
|
207 <FONT color="green">204</FONT> }<a name="line.204"></a>
|
|
|
208 <FONT color="green">205</FONT> <a name="line.205"></a>
|
|
|
209 <FONT color="green">206</FONT> return missingEntries;<a name="line.206"></a>
|
|
|
210 <FONT color="green">207</FONT> <a name="line.207"></a>
|
|
|
211 <FONT color="green">208</FONT> }<a name="line.208"></a>
|
|
|
212 <FONT color="green">209</FONT> <a name="line.209"></a>
|
|
|
213 <FONT color="green">210</FONT> /**<a name="line.210"></a>
|
|
|
214 <FONT color="green">211</FONT> * Check if a value is associated with a key.<a name="line.211"></a>
|
|
|
215 <FONT color="green">212</FONT> * @param key key to check<a name="line.212"></a>
|
|
|
216 <FONT color="green">213</FONT> * @return true if a value is associated with key<a name="line.213"></a>
|
|
|
217 <FONT color="green">214</FONT> */<a name="line.214"></a>
|
|
|
218 <FONT color="green">215</FONT> public boolean containsKey(final int key) {<a name="line.215"></a>
|
|
|
219 <FONT color="green">216</FONT> <a name="line.216"></a>
|
|
|
220 <FONT color="green">217</FONT> final int hash = hashOf(key);<a name="line.217"></a>
|
|
|
221 <FONT color="green">218</FONT> int index = hash & mask;<a name="line.218"></a>
|
|
|
222 <FONT color="green">219</FONT> if (containsKey(key, index)) {<a name="line.219"></a>
|
|
|
223 <FONT color="green">220</FONT> return true;<a name="line.220"></a>
|
|
|
224 <FONT color="green">221</FONT> }<a name="line.221"></a>
|
|
|
225 <FONT color="green">222</FONT> <a name="line.222"></a>
|
|
|
226 <FONT color="green">223</FONT> if (states[index] == FREE) {<a name="line.223"></a>
|
|
|
227 <FONT color="green">224</FONT> return false;<a name="line.224"></a>
|
|
|
228 <FONT color="green">225</FONT> }<a name="line.225"></a>
|
|
|
229 <FONT color="green">226</FONT> <a name="line.226"></a>
|
|
|
230 <FONT color="green">227</FONT> int j = index;<a name="line.227"></a>
|
|
|
231 <FONT color="green">228</FONT> for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {<a name="line.228"></a>
|
|
|
232 <FONT color="green">229</FONT> j = probe(perturb, j);<a name="line.229"></a>
|
|
|
233 <FONT color="green">230</FONT> index = j & mask;<a name="line.230"></a>
|
|
|
234 <FONT color="green">231</FONT> if (containsKey(key, index)) {<a name="line.231"></a>
|
|
|
235 <FONT color="green">232</FONT> return true;<a name="line.232"></a>
|
|
|
236 <FONT color="green">233</FONT> }<a name="line.233"></a>
|
|
|
237 <FONT color="green">234</FONT> }<a name="line.234"></a>
|
|
|
238 <FONT color="green">235</FONT> <a name="line.235"></a>
|
|
|
239 <FONT color="green">236</FONT> return false;<a name="line.236"></a>
|
|
|
240 <FONT color="green">237</FONT> <a name="line.237"></a>
|
|
|
241 <FONT color="green">238</FONT> }<a name="line.238"></a>
|
|
|
242 <FONT color="green">239</FONT> <a name="line.239"></a>
|
|
|
243 <FONT color="green">240</FONT> /**<a name="line.240"></a>
|
|
|
244 <FONT color="green">241</FONT> * Get an iterator over map elements.<a name="line.241"></a>
|
|
|
245 <FONT color="green">242</FONT> * <p>The specialized iterators returned are fail-fast: they throw a<a name="line.242"></a>
|
|
|
246 <FONT color="green">243</FONT> * <code>ConcurrentModificationException</code> when they detect the map<a name="line.243"></a>
|
|
|
247 <FONT color="green">244</FONT> * has been modified during iteration.</p><a name="line.244"></a>
|
|
|
248 <FONT color="green">245</FONT> * @return iterator over the map elements<a name="line.245"></a>
|
|
|
249 <FONT color="green">246</FONT> */<a name="line.246"></a>
|
|
|
250 <FONT color="green">247</FONT> public Iterator iterator() {<a name="line.247"></a>
|
|
|
251 <FONT color="green">248</FONT> return new Iterator();<a name="line.248"></a>
|
|
|
252 <FONT color="green">249</FONT> }<a name="line.249"></a>
|
|
|
253 <FONT color="green">250</FONT> <a name="line.250"></a>
|
|
|
254 <FONT color="green">251</FONT> /**<a name="line.251"></a>
|
|
|
255 <FONT color="green">252</FONT> * Perturb the hash for starting probing.<a name="line.252"></a>
|
|
|
256 <FONT color="green">253</FONT> * @param hash initial hash<a name="line.253"></a>
|
|
|
257 <FONT color="green">254</FONT> * @return perturbed hash<a name="line.254"></a>
|
|
|
258 <FONT color="green">255</FONT> */<a name="line.255"></a>
|
|
|
259 <FONT color="green">256</FONT> private static int perturb(final int hash) {<a name="line.256"></a>
|
|
|
260 <FONT color="green">257</FONT> return hash & 0x7fffffff;<a name="line.257"></a>
|
|
|
261 <FONT color="green">258</FONT> }<a name="line.258"></a>
|
|
|
262 <FONT color="green">259</FONT> <a name="line.259"></a>
|
|
|
263 <FONT color="green">260</FONT> /**<a name="line.260"></a>
|
|
|
264 <FONT color="green">261</FONT> * Find the index at which a key should be inserted<a name="line.261"></a>
|
|
|
265 <FONT color="green">262</FONT> * @param key key to lookup<a name="line.262"></a>
|
|
|
266 <FONT color="green">263</FONT> * @return index at which key should be inserted<a name="line.263"></a>
|
|
|
267 <FONT color="green">264</FONT> */<a name="line.264"></a>
|
|
|
268 <FONT color="green">265</FONT> private int findInsertionIndex(final int key) {<a name="line.265"></a>
|
|
|
269 <FONT color="green">266</FONT> return findInsertionIndex(keys, states, key, mask);<a name="line.266"></a>
|
|
|
270 <FONT color="green">267</FONT> }<a name="line.267"></a>
|
|
|
271 <FONT color="green">268</FONT> <a name="line.268"></a>
|
|
|
272 <FONT color="green">269</FONT> /**<a name="line.269"></a>
|
|
|
273 <FONT color="green">270</FONT> * Find the index at which a key should be inserted<a name="line.270"></a>
|
|
|
274 <FONT color="green">271</FONT> * @param keys keys table<a name="line.271"></a>
|
|
|
275 <FONT color="green">272</FONT> * @param states states table<a name="line.272"></a>
|
|
|
276 <FONT color="green">273</FONT> * @param key key to lookup<a name="line.273"></a>
|
|
|
277 <FONT color="green">274</FONT> * @param mask bit mask for hash values<a name="line.274"></a>
|
|
|
278 <FONT color="green">275</FONT> * @return index at which key should be inserted<a name="line.275"></a>
|
|
|
279 <FONT color="green">276</FONT> */<a name="line.276"></a>
|
|
|
280 <FONT color="green">277</FONT> private static int findInsertionIndex(final int[] keys, final byte[] states,<a name="line.277"></a>
|
|
|
281 <FONT color="green">278</FONT> final int key, final int mask) {<a name="line.278"></a>
|
|
|
282 <FONT color="green">279</FONT> final int hash = hashOf(key);<a name="line.279"></a>
|
|
|
283 <FONT color="green">280</FONT> int index = hash & mask;<a name="line.280"></a>
|
|
|
284 <FONT color="green">281</FONT> if (states[index] == FREE) {<a name="line.281"></a>
|
|
|
285 <FONT color="green">282</FONT> return index;<a name="line.282"></a>
|
|
|
286 <FONT color="green">283</FONT> } else if (states[index] == FULL && keys[index] == key) {<a name="line.283"></a>
|
|
|
287 <FONT color="green">284</FONT> return changeIndexSign(index);<a name="line.284"></a>
|
|
|
288 <FONT color="green">285</FONT> }<a name="line.285"></a>
|
|
|
289 <FONT color="green">286</FONT> <a name="line.286"></a>
|
|
|
290 <FONT color="green">287</FONT> int perturb = perturb(hash);<a name="line.287"></a>
|
|
|
291 <FONT color="green">288</FONT> int j = index;<a name="line.288"></a>
|
|
|
292 <FONT color="green">289</FONT> if (states[index] == FULL) {<a name="line.289"></a>
|
|
|
293 <FONT color="green">290</FONT> while (true) {<a name="line.290"></a>
|
|
|
294 <FONT color="green">291</FONT> j = probe(perturb, j);<a name="line.291"></a>
|
|
|
295 <FONT color="green">292</FONT> index = j & mask;<a name="line.292"></a>
|
|
|
296 <FONT color="green">293</FONT> perturb >>= PERTURB_SHIFT;<a name="line.293"></a>
|
|
|
297 <FONT color="green">294</FONT> <a name="line.294"></a>
|
|
|
298 <FONT color="green">295</FONT> if (states[index] != FULL || keys[index] == key) {<a name="line.295"></a>
|
|
|
299 <FONT color="green">296</FONT> break;<a name="line.296"></a>
|
|
|
300 <FONT color="green">297</FONT> }<a name="line.297"></a>
|
|
|
301 <FONT color="green">298</FONT> }<a name="line.298"></a>
|
|
|
302 <FONT color="green">299</FONT> }<a name="line.299"></a>
|
|
|
303 <FONT color="green">300</FONT> <a name="line.300"></a>
|
|
|
304 <FONT color="green">301</FONT> if (states[index] == FREE) {<a name="line.301"></a>
|
|
|
305 <FONT color="green">302</FONT> return index;<a name="line.302"></a>
|
|
|
306 <FONT color="green">303</FONT> } else if (states[index] == FULL) {<a name="line.303"></a>
|
|
|
307 <FONT color="green">304</FONT> // due to the loop exit condition,<a name="line.304"></a>
|
|
|
308 <FONT color="green">305</FONT> // if (states[index] == FULL) then keys[index] == key<a name="line.305"></a>
|
|
|
309 <FONT color="green">306</FONT> return changeIndexSign(index);<a name="line.306"></a>
|
|
|
310 <FONT color="green">307</FONT> }<a name="line.307"></a>
|
|
|
311 <FONT color="green">308</FONT> <a name="line.308"></a>
|
|
|
312 <FONT color="green">309</FONT> final int firstRemoved = index;<a name="line.309"></a>
|
|
|
313 <FONT color="green">310</FONT> while (true) {<a name="line.310"></a>
|
|
|
314 <FONT color="green">311</FONT> j = probe(perturb, j);<a name="line.311"></a>
|
|
|
315 <FONT color="green">312</FONT> index = j & mask;<a name="line.312"></a>
|
|
|
316 <FONT color="green">313</FONT> <a name="line.313"></a>
|
|
|
317 <FONT color="green">314</FONT> if (states[index] == FREE) {<a name="line.314"></a>
|
|
|
318 <FONT color="green">315</FONT> return firstRemoved;<a name="line.315"></a>
|
|
|
319 <FONT color="green">316</FONT> } else if (states[index] == FULL && keys[index] == key) {<a name="line.316"></a>
|
|
|
320 <FONT color="green">317</FONT> return changeIndexSign(index);<a name="line.317"></a>
|
|
|
321 <FONT color="green">318</FONT> }<a name="line.318"></a>
|
|
|
322 <FONT color="green">319</FONT> <a name="line.319"></a>
|
|
|
323 <FONT color="green">320</FONT> perturb >>= PERTURB_SHIFT;<a name="line.320"></a>
|
|
|
324 <FONT color="green">321</FONT> <a name="line.321"></a>
|
|
|
325 <FONT color="green">322</FONT> }<a name="line.322"></a>
|
|
|
326 <FONT color="green">323</FONT> <a name="line.323"></a>
|
|
|
327 <FONT color="green">324</FONT> }<a name="line.324"></a>
|
|
|
328 <FONT color="green">325</FONT> <a name="line.325"></a>
|
|
|
329 <FONT color="green">326</FONT> /**<a name="line.326"></a>
|
|
|
330 <FONT color="green">327</FONT> * Compute next probe for collision resolution<a name="line.327"></a>
|
|
|
331 <FONT color="green">328</FONT> * @param perturb perturbed hash<a name="line.328"></a>
|
|
|
332 <FONT color="green">329</FONT> * @param j previous probe<a name="line.329"></a>
|
|
|
333 <FONT color="green">330</FONT> * @return next probe<a name="line.330"></a>
|
|
|
334 <FONT color="green">331</FONT> */<a name="line.331"></a>
|
|
|
335 <FONT color="green">332</FONT> private static int probe(final int perturb, final int j) {<a name="line.332"></a>
|
|
|
336 <FONT color="green">333</FONT> return (j << 2) + j + perturb + 1;<a name="line.333"></a>
|
|
|
337 <FONT color="green">334</FONT> }<a name="line.334"></a>
|
|
|
338 <FONT color="green">335</FONT> <a name="line.335"></a>
|
|
|
339 <FONT color="green">336</FONT> /**<a name="line.336"></a>
|
|
|
340 <FONT color="green">337</FONT> * Change the index sign<a name="line.337"></a>
|
|
|
341 <FONT color="green">338</FONT> * @param index initial index<a name="line.338"></a>
|
|
|
342 <FONT color="green">339</FONT> * @return changed index<a name="line.339"></a>
|
|
|
343 <FONT color="green">340</FONT> */<a name="line.340"></a>
|
|
|
344 <FONT color="green">341</FONT> private static int changeIndexSign(final int index) {<a name="line.341"></a>
|
|
|
345 <FONT color="green">342</FONT> return -index - 1;<a name="line.342"></a>
|
|
|
346 <FONT color="green">343</FONT> }<a name="line.343"></a>
|
|
|
347 <FONT color="green">344</FONT> <a name="line.344"></a>
|
|
|
348 <FONT color="green">345</FONT> /**<a name="line.345"></a>
|
|
|
349 <FONT color="green">346</FONT> * Get the number of elements stored in the map.<a name="line.346"></a>
|
|
|
350 <FONT color="green">347</FONT> * @return number of elements stored in the map<a name="line.347"></a>
|
|
|
351 <FONT color="green">348</FONT> */<a name="line.348"></a>
|
|
|
352 <FONT color="green">349</FONT> public int size() {<a name="line.349"></a>
|
|
|
353 <FONT color="green">350</FONT> return size;<a name="line.350"></a>
|
|
|
354 <FONT color="green">351</FONT> }<a name="line.351"></a>
|
|
|
355 <FONT color="green">352</FONT> <a name="line.352"></a>
|
|
|
356 <FONT color="green">353</FONT> <a name="line.353"></a>
|
|
|
357 <FONT color="green">354</FONT> /**<a name="line.354"></a>
|
|
|
358 <FONT color="green">355</FONT> * Remove the value associated with a key.<a name="line.355"></a>
|
|
|
359 <FONT color="green">356</FONT> * @param key key to which the value is associated<a name="line.356"></a>
|
|
|
360 <FONT color="green">357</FONT> * @return removed value<a name="line.357"></a>
|
|
|
361 <FONT color="green">358</FONT> */<a name="line.358"></a>
|
|
|
362 <FONT color="green">359</FONT> public double remove(final int key) {<a name="line.359"></a>
|
|
|
363 <FONT color="green">360</FONT> <a name="line.360"></a>
|
|
|
364 <FONT color="green">361</FONT> final int hash = hashOf(key);<a name="line.361"></a>
|
|
|
365 <FONT color="green">362</FONT> int index = hash & mask;<a name="line.362"></a>
|
|
|
366 <FONT color="green">363</FONT> if (containsKey(key, index)) {<a name="line.363"></a>
|
|
|
367 <FONT color="green">364</FONT> return doRemove(index);<a name="line.364"></a>
|
|
|
368 <FONT color="green">365</FONT> }<a name="line.365"></a>
|
|
|
369 <FONT color="green">366</FONT> <a name="line.366"></a>
|
|
|
370 <FONT color="green">367</FONT> if (states[index] == FREE) {<a name="line.367"></a>
|
|
|
371 <FONT color="green">368</FONT> return missingEntries;<a name="line.368"></a>
|
|
|
372 <FONT color="green">369</FONT> }<a name="line.369"></a>
|
|
|
373 <FONT color="green">370</FONT> <a name="line.370"></a>
|
|
|
374 <FONT color="green">371</FONT> int j = index;<a name="line.371"></a>
|
|
|
375 <FONT color="green">372</FONT> for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {<a name="line.372"></a>
|
|
|
376 <FONT color="green">373</FONT> j = probe(perturb, j);<a name="line.373"></a>
|
|
|
377 <FONT color="green">374</FONT> index = j & mask;<a name="line.374"></a>
|
|
|
378 <FONT color="green">375</FONT> if (containsKey(key, index)) {<a name="line.375"></a>
|
|
|
379 <FONT color="green">376</FONT> return doRemove(index);<a name="line.376"></a>
|
|
|
380 <FONT color="green">377</FONT> }<a name="line.377"></a>
|
|
|
381 <FONT color="green">378</FONT> }<a name="line.378"></a>
|
|
|
382 <FONT color="green">379</FONT> <a name="line.379"></a>
|
|
|
383 <FONT color="green">380</FONT> return missingEntries;<a name="line.380"></a>
|
|
|
384 <FONT color="green">381</FONT> <a name="line.381"></a>
|
|
|
385 <FONT color="green">382</FONT> }<a name="line.382"></a>
|
|
|
386 <FONT color="green">383</FONT> <a name="line.383"></a>
|
|
|
387 <FONT color="green">384</FONT> /**<a name="line.384"></a>
|
|
|
388 <FONT color="green">385</FONT> * Check if the tables contain an element associated with specified key<a name="line.385"></a>
|
|
|
389 <FONT color="green">386</FONT> * at specified index.<a name="line.386"></a>
|
|
|
390 <FONT color="green">387</FONT> * @param key key to check<a name="line.387"></a>
|
|
|
391 <FONT color="green">388</FONT> * @param index index to check<a name="line.388"></a>
|
|
|
392 <FONT color="green">389</FONT> * @return true if an element is associated with key at index<a name="line.389"></a>
|
|
|
393 <FONT color="green">390</FONT> */<a name="line.390"></a>
|
|
|
394 <FONT color="green">391</FONT> private boolean containsKey(final int key, final int index) {<a name="line.391"></a>
|
|
|
395 <FONT color="green">392</FONT> return (key != 0 || states[index] == FULL) && keys[index] == key;<a name="line.392"></a>
|
|
|
396 <FONT color="green">393</FONT> }<a name="line.393"></a>
|
|
|
397 <FONT color="green">394</FONT> <a name="line.394"></a>
|
|
|
398 <FONT color="green">395</FONT> /**<a name="line.395"></a>
|
|
|
399 <FONT color="green">396</FONT> * Remove an element at specified index.<a name="line.396"></a>
|
|
|
400 <FONT color="green">397</FONT> * @param index index of the element to remove<a name="line.397"></a>
|
|
|
401 <FONT color="green">398</FONT> * @return removed value<a name="line.398"></a>
|
|
|
402 <FONT color="green">399</FONT> */<a name="line.399"></a>
|
|
|
403 <FONT color="green">400</FONT> private double doRemove(int index) {<a name="line.400"></a>
|
|
|
404 <FONT color="green">401</FONT> keys[index] = 0;<a name="line.401"></a>
|
|
|
405 <FONT color="green">402</FONT> states[index] = REMOVED;<a name="line.402"></a>
|
|
|
406 <FONT color="green">403</FONT> final double previous = values[index];<a name="line.403"></a>
|
|
|
407 <FONT color="green">404</FONT> values[index] = missingEntries;<a name="line.404"></a>
|
|
|
408 <FONT color="green">405</FONT> --size;<a name="line.405"></a>
|
|
|
409 <FONT color="green">406</FONT> ++count;<a name="line.406"></a>
|
|
|
410 <FONT color="green">407</FONT> return previous;<a name="line.407"></a>
|
|
|
411 <FONT color="green">408</FONT> }<a name="line.408"></a>
|
|
|
412 <FONT color="green">409</FONT> <a name="line.409"></a>
|
|
|
413 <FONT color="green">410</FONT> /**<a name="line.410"></a>
|
|
|
414 <FONT color="green">411</FONT> * Put a value associated with a key in the map.<a name="line.411"></a>
|
|
|
415 <FONT color="green">412</FONT> * @param key key to which value is associated<a name="line.412"></a>
|
|
|
416 <FONT color="green">413</FONT> * @param value value to put in the map<a name="line.413"></a>
|
|
|
417 <FONT color="green">414</FONT> * @return previous value associated with the key<a name="line.414"></a>
|
|
|
418 <FONT color="green">415</FONT> */<a name="line.415"></a>
|
|
|
419 <FONT color="green">416</FONT> public double put(final int key, final double value) {<a name="line.416"></a>
|
|
|
420 <FONT color="green">417</FONT> int index = findInsertionIndex(key);<a name="line.417"></a>
|
|
|
421 <FONT color="green">418</FONT> double previous = missingEntries;<a name="line.418"></a>
|
|
|
422 <FONT color="green">419</FONT> boolean newMapping = true;<a name="line.419"></a>
|
|
|
423 <FONT color="green">420</FONT> if (index < 0) {<a name="line.420"></a>
|
|
|
424 <FONT color="green">421</FONT> index = changeIndexSign(index);<a name="line.421"></a>
|
|
|
425 <FONT color="green">422</FONT> previous = values[index];<a name="line.422"></a>
|
|
|
426 <FONT color="green">423</FONT> newMapping = false;<a name="line.423"></a>
|
|
|
427 <FONT color="green">424</FONT> }<a name="line.424"></a>
|
|
|
428 <FONT color="green">425</FONT> keys[index] = key;<a name="line.425"></a>
|
|
|
429 <FONT color="green">426</FONT> states[index] = FULL;<a name="line.426"></a>
|
|
|
430 <FONT color="green">427</FONT> values[index] = value;<a name="line.427"></a>
|
|
|
431 <FONT color="green">428</FONT> if (newMapping) {<a name="line.428"></a>
|
|
|
432 <FONT color="green">429</FONT> ++size;<a name="line.429"></a>
|
|
|
433 <FONT color="green">430</FONT> if (shouldGrowTable()) {<a name="line.430"></a>
|
|
|
434 <FONT color="green">431</FONT> growTable();<a name="line.431"></a>
|
|
|
435 <FONT color="green">432</FONT> }<a name="line.432"></a>
|
|
|
436 <FONT color="green">433</FONT> ++count;<a name="line.433"></a>
|
|
|
437 <FONT color="green">434</FONT> }<a name="line.434"></a>
|
|
|
438 <FONT color="green">435</FONT> return previous;<a name="line.435"></a>
|
|
|
439 <FONT color="green">436</FONT> <a name="line.436"></a>
|
|
|
440 <FONT color="green">437</FONT> }<a name="line.437"></a>
|
|
|
441 <FONT color="green">438</FONT> <a name="line.438"></a>
|
|
|
442 <FONT color="green">439</FONT> /**<a name="line.439"></a>
|
|
|
443 <FONT color="green">440</FONT> * Grow the tables.<a name="line.440"></a>
|
|
|
444 <FONT color="green">441</FONT> */<a name="line.441"></a>
|
|
|
445 <FONT color="green">442</FONT> private void growTable() {<a name="line.442"></a>
|
|
|
446 <FONT color="green">443</FONT> <a name="line.443"></a>
|
|
|
447 <FONT color="green">444</FONT> final int oldLength = states.length;<a name="line.444"></a>
|
|
|
448 <FONT color="green">445</FONT> final int[] oldKeys = keys;<a name="line.445"></a>
|
|
|
449 <FONT color="green">446</FONT> final double[] oldValues = values;<a name="line.446"></a>
|
|
|
450 <FONT color="green">447</FONT> final byte[] oldStates = states;<a name="line.447"></a>
|
|
|
451 <FONT color="green">448</FONT> <a name="line.448"></a>
|
|
|
452 <FONT color="green">449</FONT> final int newLength = RESIZE_MULTIPLIER * oldLength;<a name="line.449"></a>
|
|
|
453 <FONT color="green">450</FONT> final int[] newKeys = new int[newLength];<a name="line.450"></a>
|
|
|
454 <FONT color="green">451</FONT> final double[] newValues = new double[newLength];<a name="line.451"></a>
|
|
|
455 <FONT color="green">452</FONT> final byte[] newStates = new byte[newLength];<a name="line.452"></a>
|
|
|
456 <FONT color="green">453</FONT> final int newMask = newLength - 1;<a name="line.453"></a>
|
|
|
457 <FONT color="green">454</FONT> for (int i = 0; i < oldLength; ++i) {<a name="line.454"></a>
|
|
|
458 <FONT color="green">455</FONT> if (oldStates[i] == FULL) {<a name="line.455"></a>
|
|
|
459 <FONT color="green">456</FONT> final int key = oldKeys[i];<a name="line.456"></a>
|
|
|
460 <FONT color="green">457</FONT> final int index = findInsertionIndex(newKeys, newStates, key, newMask);<a name="line.457"></a>
|
|
|
461 <FONT color="green">458</FONT> newKeys[index] = key;<a name="line.458"></a>
|
|
|
462 <FONT color="green">459</FONT> newValues[index] = oldValues[i];<a name="line.459"></a>
|
|
|
463 <FONT color="green">460</FONT> newStates[index] = FULL;<a name="line.460"></a>
|
|
|
464 <FONT color="green">461</FONT> }<a name="line.461"></a>
|
|
|
465 <FONT color="green">462</FONT> }<a name="line.462"></a>
|
|
|
466 <FONT color="green">463</FONT> <a name="line.463"></a>
|
|
|
467 <FONT color="green">464</FONT> mask = newMask;<a name="line.464"></a>
|
|
|
468 <FONT color="green">465</FONT> keys = newKeys;<a name="line.465"></a>
|
|
|
469 <FONT color="green">466</FONT> values = newValues;<a name="line.466"></a>
|
|
|
470 <FONT color="green">467</FONT> states = newStates;<a name="line.467"></a>
|
|
|
471 <FONT color="green">468</FONT> <a name="line.468"></a>
|
|
|
472 <FONT color="green">469</FONT> }<a name="line.469"></a>
|
|
|
473 <FONT color="green">470</FONT> <a name="line.470"></a>
|
|
|
474 <FONT color="green">471</FONT> /**<a name="line.471"></a>
|
|
|
475 <FONT color="green">472</FONT> * Check if tables should grow due to increased size.<a name="line.472"></a>
|
|
|
476 <FONT color="green">473</FONT> * @return true if tables should grow<a name="line.473"></a>
|
|
|
477 <FONT color="green">474</FONT> */<a name="line.474"></a>
|
|
|
478 <FONT color="green">475</FONT> private boolean shouldGrowTable() {<a name="line.475"></a>
|
|
|
479 <FONT color="green">476</FONT> return size > (mask + 1) * LOAD_FACTOR;<a name="line.476"></a>
|
|
|
480 <FONT color="green">477</FONT> }<a name="line.477"></a>
|
|
|
481 <FONT color="green">478</FONT> <a name="line.478"></a>
|
|
|
482 <FONT color="green">479</FONT> /**<a name="line.479"></a>
|
|
|
483 <FONT color="green">480</FONT> * Compute the hash value of a key<a name="line.480"></a>
|
|
|
484 <FONT color="green">481</FONT> * @param key key to hash<a name="line.481"></a>
|
|
|
485 <FONT color="green">482</FONT> * @return hash value of the key<a name="line.482"></a>
|
|
|
486 <FONT color="green">483</FONT> */<a name="line.483"></a>
|
|
|
487 <FONT color="green">484</FONT> private static int hashOf(final int key) {<a name="line.484"></a>
|
|
|
488 <FONT color="green">485</FONT> final int h = key ^ ((key >>> 20) ^ (key >>> 12));<a name="line.485"></a>
|
|
|
489 <FONT color="green">486</FONT> return h ^ (h >>> 7) ^ (h >>> 4);<a name="line.486"></a>
|
|
|
490 <FONT color="green">487</FONT> }<a name="line.487"></a>
|
|
|
491 <FONT color="green">488</FONT> <a name="line.488"></a>
|
|
|
492 <FONT color="green">489</FONT> <a name="line.489"></a>
|
|
|
493 <FONT color="green">490</FONT> /** Iterator class for the map. */<a name="line.490"></a>
|
|
|
494 <FONT color="green">491</FONT> public class Iterator {<a name="line.491"></a>
|
|
|
495 <FONT color="green">492</FONT> <a name="line.492"></a>
|
|
|
496 <FONT color="green">493</FONT> /** Reference modification count. */<a name="line.493"></a>
|
|
|
497 <FONT color="green">494</FONT> private final int referenceCount;<a name="line.494"></a>
|
|
|
498 <FONT color="green">495</FONT> <a name="line.495"></a>
|
|
|
499 <FONT color="green">496</FONT> /** Index of current element. */<a name="line.496"></a>
|
|
|
500 <FONT color="green">497</FONT> private int current;<a name="line.497"></a>
|
|
|
501 <FONT color="green">498</FONT> <a name="line.498"></a>
|
|
|
502 <FONT color="green">499</FONT> /** Index of next element. */<a name="line.499"></a>
|
|
|
503 <FONT color="green">500</FONT> private int next;<a name="line.500"></a>
|
|
|
504 <FONT color="green">501</FONT> <a name="line.501"></a>
|
|
|
505 <FONT color="green">502</FONT> /**<a name="line.502"></a>
|
|
|
506 <FONT color="green">503</FONT> * Simple constructor.<a name="line.503"></a>
|
|
|
507 <FONT color="green">504</FONT> */<a name="line.504"></a>
|
|
|
508 <FONT color="green">505</FONT> private Iterator() {<a name="line.505"></a>
|
|
|
509 <FONT color="green">506</FONT> <a name="line.506"></a>
|
|
|
510 <FONT color="green">507</FONT> // preserve the modification count of the map to detect concurrent modifications later<a name="line.507"></a>
|
|
|
511 <FONT color="green">508</FONT> referenceCount = count;<a name="line.508"></a>
|
|
|
512 <FONT color="green">509</FONT> <a name="line.509"></a>
|
|
|
513 <FONT color="green">510</FONT> // initialize current index<a name="line.510"></a>
|
|
|
514 <FONT color="green">511</FONT> next = -1;<a name="line.511"></a>
|
|
|
515 <FONT color="green">512</FONT> try {<a name="line.512"></a>
|
|
|
516 <FONT color="green">513</FONT> advance();<a name="line.513"></a>
|
|
|
517 <FONT color="green">514</FONT> } catch (NoSuchElementException nsee) {<a name="line.514"></a>
|
|
|
518 <FONT color="green">515</FONT> // ignored<a name="line.515"></a>
|
|
|
519 <FONT color="green">516</FONT> }<a name="line.516"></a>
|
|
|
520 <FONT color="green">517</FONT> <a name="line.517"></a>
|
|
|
521 <FONT color="green">518</FONT> }<a name="line.518"></a>
|
|
|
522 <FONT color="green">519</FONT> <a name="line.519"></a>
|
|
|
523 <FONT color="green">520</FONT> /**<a name="line.520"></a>
|
|
|
524 <FONT color="green">521</FONT> * Check if there is a next element in the map.<a name="line.521"></a>
|
|
|
525 <FONT color="green">522</FONT> * @return true if there is a next element<a name="line.522"></a>
|
|
|
526 <FONT color="green">523</FONT> */<a name="line.523"></a>
|
|
|
527 <FONT color="green">524</FONT> public boolean hasNext() {<a name="line.524"></a>
|
|
|
528 <FONT color="green">525</FONT> return next >= 0;<a name="line.525"></a>
|
|
|
529 <FONT color="green">526</FONT> }<a name="line.526"></a>
|
|
|
530 <FONT color="green">527</FONT> <a name="line.527"></a>
|
|
|
531 <FONT color="green">528</FONT> /**<a name="line.528"></a>
|
|
|
532 <FONT color="green">529</FONT> * Get the key of current entry.<a name="line.529"></a>
|
|
|
533 <FONT color="green">530</FONT> * @return key of current entry<a name="line.530"></a>
|
|
|
534 <FONT color="green">531</FONT> * @exception ConcurrentModificationException if the map is modified during iteration<a name="line.531"></a>
|
|
|
535 <FONT color="green">532</FONT> * @exception NoSuchElementException if there is no element left in the map<a name="line.532"></a>
|
|
|
536 <FONT color="green">533</FONT> */<a name="line.533"></a>
|
|
|
537 <FONT color="green">534</FONT> public int key()<a name="line.534"></a>
|
|
|
538 <FONT color="green">535</FONT> throws ConcurrentModificationException, NoSuchElementException {<a name="line.535"></a>
|
|
|
539 <FONT color="green">536</FONT> if (referenceCount != count) {<a name="line.536"></a>
|
|
|
540 <FONT color="green">537</FONT> throw MathRuntimeException.createConcurrentModificationException(<a name="line.537"></a>
|
|
|
541 <FONT color="green">538</FONT> CONCURRENT_MODIFICATION_MESSAGE);<a name="line.538"></a>
|
|
|
542 <FONT color="green">539</FONT> }<a name="line.539"></a>
|
|
|
543 <FONT color="green">540</FONT> if (current < 0) {<a name="line.540"></a>
|
|
|
544 <FONT color="green">541</FONT> throw MathRuntimeException.createNoSuchElementException(EXHAUSTED_ITERATOR_MESSAGE);<a name="line.541"></a>
|
|
|
545 <FONT color="green">542</FONT> }<a name="line.542"></a>
|
|
|
546 <FONT color="green">543</FONT> return keys[current];<a name="line.543"></a>
|
|
|
547 <FONT color="green">544</FONT> }<a name="line.544"></a>
|
|
|
548 <FONT color="green">545</FONT> <a name="line.545"></a>
|
|
|
549 <FONT color="green">546</FONT> /**<a name="line.546"></a>
|
|
|
550 <FONT color="green">547</FONT> * Get the value of current entry.<a name="line.547"></a>
|
|
|
551 <FONT color="green">548</FONT> * @return value of current entry<a name="line.548"></a>
|
|
|
552 <FONT color="green">549</FONT> * @exception ConcurrentModificationException if the map is modified during iteration<a name="line.549"></a>
|
|
|
553 <FONT color="green">550</FONT> * @exception NoSuchElementException if there is no element left in the map<a name="line.550"></a>
|
|
|
554 <FONT color="green">551</FONT> */<a name="line.551"></a>
|
|
|
555 <FONT color="green">552</FONT> public double value()<a name="line.552"></a>
|
|
|
556 <FONT color="green">553</FONT> throws ConcurrentModificationException, NoSuchElementException {<a name="line.553"></a>
|
|
|
557 <FONT color="green">554</FONT> if (referenceCount != count) {<a name="line.554"></a>
|
|
|
558 <FONT color="green">555</FONT> throw MathRuntimeException.createConcurrentModificationException(<a name="line.555"></a>
|
|
|
559 <FONT color="green">556</FONT> CONCURRENT_MODIFICATION_MESSAGE);<a name="line.556"></a>
|
|
|
560 <FONT color="green">557</FONT> }<a name="line.557"></a>
|
|
|
561 <FONT color="green">558</FONT> if (current < 0) {<a name="line.558"></a>
|
|
|
562 <FONT color="green">559</FONT> throw MathRuntimeException.createNoSuchElementException(EXHAUSTED_ITERATOR_MESSAGE);<a name="line.559"></a>
|
|
|
563 <FONT color="green">560</FONT> }<a name="line.560"></a>
|
|
|
564 <FONT color="green">561</FONT> return values[current];<a name="line.561"></a>
|
|
|
565 <FONT color="green">562</FONT> }<a name="line.562"></a>
|
|
|
566 <FONT color="green">563</FONT> <a name="line.563"></a>
|
|
|
567 <FONT color="green">564</FONT> /**<a name="line.564"></a>
|
|
|
568 <FONT color="green">565</FONT> * Advance iterator one step further.<a name="line.565"></a>
|
|
|
569 <FONT color="green">566</FONT> * @exception ConcurrentModificationException if the map is modified during iteration<a name="line.566"></a>
|
|
|
570 <FONT color="green">567</FONT> * @exception NoSuchElementException if there is no element left in the map<a name="line.567"></a>
|
|
|
571 <FONT color="green">568</FONT> */<a name="line.568"></a>
|
|
|
572 <FONT color="green">569</FONT> public void advance()<a name="line.569"></a>
|
|
|
573 <FONT color="green">570</FONT> throws ConcurrentModificationException, NoSuchElementException {<a name="line.570"></a>
|
|
|
574 <FONT color="green">571</FONT> <a name="line.571"></a>
|
|
|
575 <FONT color="green">572</FONT> if (referenceCount != count) {<a name="line.572"></a>
|
|
|
576 <FONT color="green">573</FONT> throw MathRuntimeException.createConcurrentModificationException(<a name="line.573"></a>
|
|
|
577 <FONT color="green">574</FONT> CONCURRENT_MODIFICATION_MESSAGE);<a name="line.574"></a>
|
|
|
578 <FONT color="green">575</FONT> }<a name="line.575"></a>
|
|
|
579 <FONT color="green">576</FONT> <a name="line.576"></a>
|
|
|
580 <FONT color="green">577</FONT> // advance on step<a name="line.577"></a>
|
|
|
581 <FONT color="green">578</FONT> current = next;<a name="line.578"></a>
|
|
|
582 <FONT color="green">579</FONT> <a name="line.579"></a>
|
|
|
583 <FONT color="green">580</FONT> // prepare next step<a name="line.580"></a>
|
|
|
584 <FONT color="green">581</FONT> try {<a name="line.581"></a>
|
|
|
585 <FONT color="green">582</FONT> while (states[++next] != FULL) {<a name="line.582"></a>
|
|
|
586 <FONT color="green">583</FONT> // nothing to do<a name="line.583"></a>
|
|
|
587 <FONT color="green">584</FONT> }<a name="line.584"></a>
|
|
|
588 <FONT color="green">585</FONT> } catch (ArrayIndexOutOfBoundsException e) {<a name="line.585"></a>
|
|
|
589 <FONT color="green">586</FONT> next = -2;<a name="line.586"></a>
|
|
|
590 <FONT color="green">587</FONT> if (current < 0) {<a name="line.587"></a>
|
|
|
591 <FONT color="green">588</FONT> throw MathRuntimeException.createNoSuchElementException(EXHAUSTED_ITERATOR_MESSAGE);<a name="line.588"></a>
|
|
|
592 <FONT color="green">589</FONT> }<a name="line.589"></a>
|
|
|
593 <FONT color="green">590</FONT> }<a name="line.590"></a>
|
|
|
594 <FONT color="green">591</FONT> <a name="line.591"></a>
|
|
|
595 <FONT color="green">592</FONT> }<a name="line.592"></a>
|
|
|
596 <FONT color="green">593</FONT> <a name="line.593"></a>
|
|
|
597 <FONT color="green">594</FONT> }<a name="line.594"></a>
|
|
|
598 <FONT color="green">595</FONT> <a name="line.595"></a>
|
|
|
599 <FONT color="green">596</FONT> /**<a name="line.596"></a>
|
|
|
600 <FONT color="green">597</FONT> * Read a serialized object.<a name="line.597"></a>
|
|
|
601 <FONT color="green">598</FONT> * @param stream input stream<a name="line.598"></a>
|
|
|
602 <FONT color="green">599</FONT> * @throws IOException if object cannot be read<a name="line.599"></a>
|
|
|
603 <FONT color="green">600</FONT> * @throws ClassNotFoundException if the class corresponding<a name="line.600"></a>
|
|
|
604 <FONT color="green">601</FONT> * to the serialized object cannot be found<a name="line.601"></a>
|
|
|
605 <FONT color="green">602</FONT> */<a name="line.602"></a>
|
|
|
606 <FONT color="green">603</FONT> private void readObject(final ObjectInputStream stream)<a name="line.603"></a>
|
|
|
607 <FONT color="green">604</FONT> throws IOException, ClassNotFoundException {<a name="line.604"></a>
|
|
|
608 <FONT color="green">605</FONT> stream.defaultReadObject();<a name="line.605"></a>
|
|
|
609 <FONT color="green">606</FONT> count = 0;<a name="line.606"></a>
|
|
|
610 <FONT color="green">607</FONT> }<a name="line.607"></a>
|
|
|
611 <FONT color="green">608</FONT> <a name="line.608"></a>
|
|
|
612 <FONT color="green">609</FONT> <a name="line.609"></a>
|
|
|
613 <FONT color="green">610</FONT> }<a name="line.610"></a>
|
|
|
614
|
|
|
615
|
|
|
616
|
|
|
617
|
|
|
618
|
|
|
619
|
|
|
620
|
|
|
621
|
|
|
622
|
|
|
623
|
|
|
624
|
|
|
625
|
|
|
626
|
|
|
627
|
|
|
628
|
|
|
629
|
|
|
630
|
|
|
631
|
|
|
632
|
|
|
633
|
|
|
634
|
|
|
635
|
|
|
636
|
|
|
637
|
|
|
638
|
|
|
639
|
|
|
640
|
|
|
641
|
|
|
642
|
|
|
643
|
|
|
644
|
|
|
645
|
|
|
646
|
|
|
647
|
|
|
648
|
|
|
649
|
|
|
650
|
|
|
651
|
|
|
652
|
|
|
653
|
|
|
654
|
|
|
655
|
|
|
656
|
|
|
657
|
|
|
658
|
|
|
659
|
|
|
660
|
|
|
661
|
|
|
662
|
|
|
663
|
|
|
664
|
|
|
665
|
|
|
666
|
|
|
667
|
|
|
668
|
|
|
669
|
|
|
670
|
|
|
671
|
|
|
672
|
|
|
673
|
|
|
674 </PRE>
|
|
|
675 </BODY>
|
|
|
676 </HTML>
|
