| <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> |
| <html lang="en"> |
| <head> |
| <title>Source code</title> |
| <link rel="stylesheet" type="text/css" href="../../../../../../../stylesheet.css" title="Style"> |
| </head> |
| <body> |
| <div class="sourceContainer"> |
| <pre><span class="sourceLineNo">001</span>/**<a name="line.1"></a> |
| <span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a> |
| <span class="sourceLineNo">003</span> * contributor license agreements. See the NOTICE file distributed with this<a name="line.3"></a> |
| <span class="sourceLineNo">004</span> * work for additional information regarding copyright ownership. The ASF<a name="line.4"></a> |
| <span class="sourceLineNo">005</span> * licenses this file to you under the Apache License, Version 2.0 (the<a name="line.5"></a> |
| <span class="sourceLineNo">006</span> * "License"); you may not use this file except in compliance with the License.<a name="line.6"></a> |
| <span class="sourceLineNo">007</span> * You may obtain a copy of the License at<a name="line.7"></a> |
| <span class="sourceLineNo">008</span> *<a name="line.8"></a> |
| <span class="sourceLineNo">009</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a> |
| <span class="sourceLineNo">010</span> *<a name="line.10"></a> |
| <span class="sourceLineNo">011</span> * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a> |
| <span class="sourceLineNo">012</span> * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT<a name="line.12"></a> |
| <span class="sourceLineNo">013</span> * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the<a name="line.13"></a> |
| <span class="sourceLineNo">014</span> * License for the specific language governing permissions and limitations under<a name="line.14"></a> |
| <span class="sourceLineNo">015</span> * the License.<a name="line.15"></a> |
| <span class="sourceLineNo">016</span> */<a name="line.16"></a> |
| <span class="sourceLineNo">017</span>package org.apache.hadoop.hbase.io.hfile;<a name="line.17"></a> |
| <span class="sourceLineNo">018</span><a name="line.18"></a> |
| <span class="sourceLineNo">019</span>import java.util.ArrayList;<a name="line.19"></a> |
| <span class="sourceLineNo">020</span>import java.util.Arrays;<a name="line.20"></a> |
| <span class="sourceLineNo">021</span>import java.util.Collections;<a name="line.21"></a> |
| <span class="sourceLineNo">022</span>import java.util.Random;<a name="line.22"></a> |
| <span class="sourceLineNo">023</span><a name="line.23"></a> |
| <span class="sourceLineNo">024</span>/**<a name="line.24"></a> |
| <span class="sourceLineNo">025</span> * A class that generates random numbers that follow some distribution.<a name="line.25"></a> |
| <span class="sourceLineNo">026</span> * <p><a name="line.26"></a> |
| <span class="sourceLineNo">027</span> * Copied from<a name="line.27"></a> |
| <span class="sourceLineNo">028</span> * <a href="https://issues.apache.org/jira/browse/HADOOP-3315">hadoop-3315 tfile</a>.<a name="line.28"></a> |
| <span class="sourceLineNo">029</span> * Remove after tfile is committed and use the tfile version of this class<a name="line.29"></a> |
| <span class="sourceLineNo">030</span> * instead.</p><a name="line.30"></a> |
| <span class="sourceLineNo">031</span> */<a name="line.31"></a> |
| <span class="sourceLineNo">032</span>public class RandomDistribution {<a name="line.32"></a> |
| <span class="sourceLineNo">033</span> /**<a name="line.33"></a> |
| <span class="sourceLineNo">034</span> * Interface for discrete (integer) random distributions.<a name="line.34"></a> |
| <span class="sourceLineNo">035</span> */<a name="line.35"></a> |
| <span class="sourceLineNo">036</span> public interface DiscreteRNG {<a name="line.36"></a> |
| <span class="sourceLineNo">037</span> /**<a name="line.37"></a> |
| <span class="sourceLineNo">038</span> * Get the next random number<a name="line.38"></a> |
| <span class="sourceLineNo">039</span> *<a name="line.39"></a> |
| <span class="sourceLineNo">040</span> * @return the next random number.<a name="line.40"></a> |
| <span class="sourceLineNo">041</span> */<a name="line.41"></a> |
| <span class="sourceLineNo">042</span> int nextInt();<a name="line.42"></a> |
| <span class="sourceLineNo">043</span> }<a name="line.43"></a> |
| <span class="sourceLineNo">044</span><a name="line.44"></a> |
| <span class="sourceLineNo">045</span> /**<a name="line.45"></a> |
| <span class="sourceLineNo">046</span> * P(i)=1/(max-min)<a name="line.46"></a> |
| <span class="sourceLineNo">047</span> */<a name="line.47"></a> |
| <span class="sourceLineNo">048</span> public static final class Flat implements DiscreteRNG {<a name="line.48"></a> |
| <span class="sourceLineNo">049</span> private final Random random;<a name="line.49"></a> |
| <span class="sourceLineNo">050</span> private final int min;<a name="line.50"></a> |
| <span class="sourceLineNo">051</span> private final int max;<a name="line.51"></a> |
| <span class="sourceLineNo">052</span><a name="line.52"></a> |
| <span class="sourceLineNo">053</span> /**<a name="line.53"></a> |
| <span class="sourceLineNo">054</span> * Generate random integers from min (inclusive) to max (exclusive)<a name="line.54"></a> |
| <span class="sourceLineNo">055</span> * following even distribution.<a name="line.55"></a> |
| <span class="sourceLineNo">056</span> *<a name="line.56"></a> |
| <span class="sourceLineNo">057</span> * @param random<a name="line.57"></a> |
| <span class="sourceLineNo">058</span> * The basic random number generator.<a name="line.58"></a> |
| <span class="sourceLineNo">059</span> * @param min<a name="line.59"></a> |
| <span class="sourceLineNo">060</span> * Minimum integer<a name="line.60"></a> |
| <span class="sourceLineNo">061</span> * @param max<a name="line.61"></a> |
| <span class="sourceLineNo">062</span> * maximum integer (exclusive).<a name="line.62"></a> |
| <span class="sourceLineNo">063</span> *<a name="line.63"></a> |
| <span class="sourceLineNo">064</span> */<a name="line.64"></a> |
| <span class="sourceLineNo">065</span> public Flat(Random random, int min, int max) {<a name="line.65"></a> |
| <span class="sourceLineNo">066</span> if (min >= max) {<a name="line.66"></a> |
| <span class="sourceLineNo">067</span> throw new IllegalArgumentException("Invalid range");<a name="line.67"></a> |
| <span class="sourceLineNo">068</span> }<a name="line.68"></a> |
| <span class="sourceLineNo">069</span> this.random = random;<a name="line.69"></a> |
| <span class="sourceLineNo">070</span> this.min = min;<a name="line.70"></a> |
| <span class="sourceLineNo">071</span> this.max = max;<a name="line.71"></a> |
| <span class="sourceLineNo">072</span> }<a name="line.72"></a> |
| <span class="sourceLineNo">073</span><a name="line.73"></a> |
| <span class="sourceLineNo">074</span> /**<a name="line.74"></a> |
| <span class="sourceLineNo">075</span> * @see DiscreteRNG#nextInt()<a name="line.75"></a> |
| <span class="sourceLineNo">076</span> */<a name="line.76"></a> |
| <span class="sourceLineNo">077</span> @Override<a name="line.77"></a> |
| <span class="sourceLineNo">078</span> public int nextInt() {<a name="line.78"></a> |
| <span class="sourceLineNo">079</span> return random.nextInt(max - min) + min;<a name="line.79"></a> |
| <span class="sourceLineNo">080</span> }<a name="line.80"></a> |
| <span class="sourceLineNo">081</span> }<a name="line.81"></a> |
| <span class="sourceLineNo">082</span><a name="line.82"></a> |
| <span class="sourceLineNo">083</span> /**<a name="line.83"></a> |
| <span class="sourceLineNo">084</span> * Zipf distribution. The ratio of the probabilities of integer i and j is<a name="line.84"></a> |
| <span class="sourceLineNo">085</span> * defined as follows:<a name="line.85"></a> |
| <span class="sourceLineNo">086</span> *<a name="line.86"></a> |
| <span class="sourceLineNo">087</span> * P(i)/P(j)=((j-min+1)/(i-min+1))^sigma.<a name="line.87"></a> |
| <span class="sourceLineNo">088</span> */<a name="line.88"></a> |
| <span class="sourceLineNo">089</span> public static final class Zipf implements DiscreteRNG {<a name="line.89"></a> |
| <span class="sourceLineNo">090</span> private static final double DEFAULT_EPSILON = 0.001;<a name="line.90"></a> |
| <span class="sourceLineNo">091</span> private final Random random;<a name="line.91"></a> |
| <span class="sourceLineNo">092</span> private final ArrayList<Integer> k;<a name="line.92"></a> |
| <span class="sourceLineNo">093</span> private final ArrayList<Double> v;<a name="line.93"></a> |
| <span class="sourceLineNo">094</span><a name="line.94"></a> |
| <span class="sourceLineNo">095</span> /**<a name="line.95"></a> |
| <span class="sourceLineNo">096</span> * Constructor<a name="line.96"></a> |
| <span class="sourceLineNo">097</span> *<a name="line.97"></a> |
| <span class="sourceLineNo">098</span> * @param r<a name="line.98"></a> |
| <span class="sourceLineNo">099</span> * The random number generator.<a name="line.99"></a> |
| <span class="sourceLineNo">100</span> * @param min<a name="line.100"></a> |
| <span class="sourceLineNo">101</span> * minimum integer (inclusvie)<a name="line.101"></a> |
| <span class="sourceLineNo">102</span> * @param max<a name="line.102"></a> |
| <span class="sourceLineNo">103</span> * maximum integer (exclusive)<a name="line.103"></a> |
| <span class="sourceLineNo">104</span> * @param sigma<a name="line.104"></a> |
| <span class="sourceLineNo">105</span> * parameter sigma. (sigma > 1.0)<a name="line.105"></a> |
| <span class="sourceLineNo">106</span> */<a name="line.106"></a> |
| <span class="sourceLineNo">107</span> public Zipf(Random r, int min, int max, double sigma) {<a name="line.107"></a> |
| <span class="sourceLineNo">108</span> this(r, min, max, sigma, DEFAULT_EPSILON);<a name="line.108"></a> |
| <span class="sourceLineNo">109</span> }<a name="line.109"></a> |
| <span class="sourceLineNo">110</span><a name="line.110"></a> |
| <span class="sourceLineNo">111</span> /**<a name="line.111"></a> |
| <span class="sourceLineNo">112</span> * Constructor.<a name="line.112"></a> |
| <span class="sourceLineNo">113</span> *<a name="line.113"></a> |
| <span class="sourceLineNo">114</span> * @param r<a name="line.114"></a> |
| <span class="sourceLineNo">115</span> * The random number generator.<a name="line.115"></a> |
| <span class="sourceLineNo">116</span> * @param min<a name="line.116"></a> |
| <span class="sourceLineNo">117</span> * minimum integer (inclusvie)<a name="line.117"></a> |
| <span class="sourceLineNo">118</span> * @param max<a name="line.118"></a> |
| <span class="sourceLineNo">119</span> * maximum integer (exclusive)<a name="line.119"></a> |
| <span class="sourceLineNo">120</span> * @param sigma<a name="line.120"></a> |
| <span class="sourceLineNo">121</span> * parameter sigma. (sigma > 1.0)<a name="line.121"></a> |
| <span class="sourceLineNo">122</span> * @param epsilon<a name="line.122"></a> |
| <span class="sourceLineNo">123</span> * Allowable error percentage (0 < epsilon < 1.0).<a name="line.123"></a> |
| <span class="sourceLineNo">124</span> */<a name="line.124"></a> |
| <span class="sourceLineNo">125</span> public Zipf(Random r, int min, int max, double sigma, double epsilon) {<a name="line.125"></a> |
| <span class="sourceLineNo">126</span> if ((max <= min) || (sigma <= 1) || (epsilon <= 0)<a name="line.126"></a> |
| <span class="sourceLineNo">127</span> || (epsilon >= 0.5)) {<a name="line.127"></a> |
| <span class="sourceLineNo">128</span> throw new IllegalArgumentException("Invalid arguments");<a name="line.128"></a> |
| <span class="sourceLineNo">129</span> }<a name="line.129"></a> |
| <span class="sourceLineNo">130</span> random = r;<a name="line.130"></a> |
| <span class="sourceLineNo">131</span> k = new ArrayList<>();<a name="line.131"></a> |
| <span class="sourceLineNo">132</span> v = new ArrayList<>();<a name="line.132"></a> |
| <span class="sourceLineNo">133</span><a name="line.133"></a> |
| <span class="sourceLineNo">134</span> double sum = 0;<a name="line.134"></a> |
| <span class="sourceLineNo">135</span> int last = -1;<a name="line.135"></a> |
| <span class="sourceLineNo">136</span> for (int i = min; i < max; ++i) {<a name="line.136"></a> |
| <span class="sourceLineNo">137</span> sum += Math.exp(-sigma * Math.log(i - min + 1));<a name="line.137"></a> |
| <span class="sourceLineNo">138</span> if ((last == -1) || i * (1 - epsilon) > last) {<a name="line.138"></a> |
| <span class="sourceLineNo">139</span> k.add(i);<a name="line.139"></a> |
| <span class="sourceLineNo">140</span> v.add(sum);<a name="line.140"></a> |
| <span class="sourceLineNo">141</span> last = i;<a name="line.141"></a> |
| <span class="sourceLineNo">142</span> }<a name="line.142"></a> |
| <span class="sourceLineNo">143</span> }<a name="line.143"></a> |
| <span class="sourceLineNo">144</span><a name="line.144"></a> |
| <span class="sourceLineNo">145</span> if (last != max - 1) {<a name="line.145"></a> |
| <span class="sourceLineNo">146</span> k.add(max - 1);<a name="line.146"></a> |
| <span class="sourceLineNo">147</span> v.add(sum);<a name="line.147"></a> |
| <span class="sourceLineNo">148</span> }<a name="line.148"></a> |
| <span class="sourceLineNo">149</span><a name="line.149"></a> |
| <span class="sourceLineNo">150</span> v.set(v.size() - 1, 1.0);<a name="line.150"></a> |
| <span class="sourceLineNo">151</span><a name="line.151"></a> |
| <span class="sourceLineNo">152</span> for (int i = v.size() - 2; i >= 0; --i) {<a name="line.152"></a> |
| <span class="sourceLineNo">153</span> v.set(i, v.get(i) / sum);<a name="line.153"></a> |
| <span class="sourceLineNo">154</span> }<a name="line.154"></a> |
| <span class="sourceLineNo">155</span> }<a name="line.155"></a> |
| <span class="sourceLineNo">156</span><a name="line.156"></a> |
| <span class="sourceLineNo">157</span> /**<a name="line.157"></a> |
| <span class="sourceLineNo">158</span> * @see DiscreteRNG#nextInt()<a name="line.158"></a> |
| <span class="sourceLineNo">159</span> */<a name="line.159"></a> |
| <span class="sourceLineNo">160</span> @Override<a name="line.160"></a> |
| <span class="sourceLineNo">161</span> public int nextInt() {<a name="line.161"></a> |
| <span class="sourceLineNo">162</span> double d = random.nextDouble();<a name="line.162"></a> |
| <span class="sourceLineNo">163</span> int idx = Collections.binarySearch(v, d);<a name="line.163"></a> |
| <span class="sourceLineNo">164</span><a name="line.164"></a> |
| <span class="sourceLineNo">165</span> if (idx > 0) {<a name="line.165"></a> |
| <span class="sourceLineNo">166</span> ++idx;<a name="line.166"></a> |
| <span class="sourceLineNo">167</span> }<a name="line.167"></a> |
| <span class="sourceLineNo">168</span> else {<a name="line.168"></a> |
| <span class="sourceLineNo">169</span> idx = -(idx + 1);<a name="line.169"></a> |
| <span class="sourceLineNo">170</span> }<a name="line.170"></a> |
| <span class="sourceLineNo">171</span><a name="line.171"></a> |
| <span class="sourceLineNo">172</span> if (idx >= v.size()) {<a name="line.172"></a> |
| <span class="sourceLineNo">173</span> idx = v.size() - 1;<a name="line.173"></a> |
| <span class="sourceLineNo">174</span> }<a name="line.174"></a> |
| <span class="sourceLineNo">175</span><a name="line.175"></a> |
| <span class="sourceLineNo">176</span> if (idx == 0) {<a name="line.176"></a> |
| <span class="sourceLineNo">177</span> return k.get(0);<a name="line.177"></a> |
| <span class="sourceLineNo">178</span> }<a name="line.178"></a> |
| <span class="sourceLineNo">179</span><a name="line.179"></a> |
| <span class="sourceLineNo">180</span> int ceiling = k.get(idx);<a name="line.180"></a> |
| <span class="sourceLineNo">181</span> int lower = k.get(idx - 1);<a name="line.181"></a> |
| <span class="sourceLineNo">182</span><a name="line.182"></a> |
| <span class="sourceLineNo">183</span> return ceiling - random.nextInt(ceiling - lower);<a name="line.183"></a> |
| <span class="sourceLineNo">184</span> }<a name="line.184"></a> |
| <span class="sourceLineNo">185</span> }<a name="line.185"></a> |
| <span class="sourceLineNo">186</span><a name="line.186"></a> |
| <span class="sourceLineNo">187</span> /**<a name="line.187"></a> |
| <span class="sourceLineNo">188</span> * Binomial distribution.<a name="line.188"></a> |
| <span class="sourceLineNo">189</span> *<a name="line.189"></a> |
| <span class="sourceLineNo">190</span> * P(k)=select(n, k)*p^k*(1-p)^(n-k) (k = 0, 1, ..., n)<a name="line.190"></a> |
| <span class="sourceLineNo">191</span> *<a name="line.191"></a> |
| <span class="sourceLineNo">192</span> * P(k)=select(max-min-1, k-min)*p^(k-min)*(1-p)^(k-min)*(1-p)^(max-k-1)<a name="line.192"></a> |
| <span class="sourceLineNo">193</span> */<a name="line.193"></a> |
| <span class="sourceLineNo">194</span> public static final class Binomial implements DiscreteRNG {<a name="line.194"></a> |
| <span class="sourceLineNo">195</span> private final Random random;<a name="line.195"></a> |
| <span class="sourceLineNo">196</span> private final int min;<a name="line.196"></a> |
| <span class="sourceLineNo">197</span> private final int n;<a name="line.197"></a> |
| <span class="sourceLineNo">198</span> private final double[] v;<a name="line.198"></a> |
| <span class="sourceLineNo">199</span><a name="line.199"></a> |
| <span class="sourceLineNo">200</span> private static double select(int n, int k) {<a name="line.200"></a> |
| <span class="sourceLineNo">201</span> double ret = 1.0;<a name="line.201"></a> |
| <span class="sourceLineNo">202</span> for (int i = k + 1; i <= n; ++i) {<a name="line.202"></a> |
| <span class="sourceLineNo">203</span> ret *= (double) i / (i - k);<a name="line.203"></a> |
| <span class="sourceLineNo">204</span> }<a name="line.204"></a> |
| <span class="sourceLineNo">205</span> return ret;<a name="line.205"></a> |
| <span class="sourceLineNo">206</span> }<a name="line.206"></a> |
| <span class="sourceLineNo">207</span><a name="line.207"></a> |
| <span class="sourceLineNo">208</span> private static double power(double p, int k) {<a name="line.208"></a> |
| <span class="sourceLineNo">209</span> return Math.exp(k * Math.log(p));<a name="line.209"></a> |
| <span class="sourceLineNo">210</span> }<a name="line.210"></a> |
| <span class="sourceLineNo">211</span><a name="line.211"></a> |
| <span class="sourceLineNo">212</span> /**<a name="line.212"></a> |
| <span class="sourceLineNo">213</span> * Generate random integers from min (inclusive) to max (exclusive)<a name="line.213"></a> |
| <span class="sourceLineNo">214</span> * following Binomial distribution.<a name="line.214"></a> |
| <span class="sourceLineNo">215</span> *<a name="line.215"></a> |
| <span class="sourceLineNo">216</span> * @param random<a name="line.216"></a> |
| <span class="sourceLineNo">217</span> * The basic random number generator.<a name="line.217"></a> |
| <span class="sourceLineNo">218</span> * @param min<a name="line.218"></a> |
| <span class="sourceLineNo">219</span> * Minimum integer<a name="line.219"></a> |
| <span class="sourceLineNo">220</span> * @param max<a name="line.220"></a> |
| <span class="sourceLineNo">221</span> * maximum integer (exclusive).<a name="line.221"></a> |
| <span class="sourceLineNo">222</span> * @param p<a name="line.222"></a> |
| <span class="sourceLineNo">223</span> * parameter.<a name="line.223"></a> |
| <span class="sourceLineNo">224</span> *<a name="line.224"></a> |
| <span class="sourceLineNo">225</span> */<a name="line.225"></a> |
| <span class="sourceLineNo">226</span> public Binomial(Random random, int min, int max, double p) {<a name="line.226"></a> |
| <span class="sourceLineNo">227</span> if (min >= max) {<a name="line.227"></a> |
| <span class="sourceLineNo">228</span> throw new IllegalArgumentException("Invalid range");<a name="line.228"></a> |
| <span class="sourceLineNo">229</span> }<a name="line.229"></a> |
| <span class="sourceLineNo">230</span> this.random = random;<a name="line.230"></a> |
| <span class="sourceLineNo">231</span> this.min = min;<a name="line.231"></a> |
| <span class="sourceLineNo">232</span> this.n = max - min - 1;<a name="line.232"></a> |
| <span class="sourceLineNo">233</span> if (n > 0) {<a name="line.233"></a> |
| <span class="sourceLineNo">234</span> v = new double[n + 1];<a name="line.234"></a> |
| <span class="sourceLineNo">235</span> double sum = 0.0;<a name="line.235"></a> |
| <span class="sourceLineNo">236</span> for (int i = 0; i <= n; ++i) {<a name="line.236"></a> |
| <span class="sourceLineNo">237</span> sum += select(n, i) * power(p, i) * power(1 - p, n - i);<a name="line.237"></a> |
| <span class="sourceLineNo">238</span> v[i] = sum;<a name="line.238"></a> |
| <span class="sourceLineNo">239</span> }<a name="line.239"></a> |
| <span class="sourceLineNo">240</span> for (int i = 0; i <= n; ++i) {<a name="line.240"></a> |
| <span class="sourceLineNo">241</span> v[i] /= sum;<a name="line.241"></a> |
| <span class="sourceLineNo">242</span> }<a name="line.242"></a> |
| <span class="sourceLineNo">243</span> }<a name="line.243"></a> |
| <span class="sourceLineNo">244</span> else {<a name="line.244"></a> |
| <span class="sourceLineNo">245</span> v = null;<a name="line.245"></a> |
| <span class="sourceLineNo">246</span> }<a name="line.246"></a> |
| <span class="sourceLineNo">247</span> }<a name="line.247"></a> |
| <span class="sourceLineNo">248</span><a name="line.248"></a> |
| <span class="sourceLineNo">249</span> /**<a name="line.249"></a> |
| <span class="sourceLineNo">250</span> * @see DiscreteRNG#nextInt()<a name="line.250"></a> |
| <span class="sourceLineNo">251</span> */<a name="line.251"></a> |
| <span class="sourceLineNo">252</span> @Override<a name="line.252"></a> |
| <span class="sourceLineNo">253</span> public int nextInt() {<a name="line.253"></a> |
| <span class="sourceLineNo">254</span> if (v == null) {<a name="line.254"></a> |
| <span class="sourceLineNo">255</span> return min;<a name="line.255"></a> |
| <span class="sourceLineNo">256</span> }<a name="line.256"></a> |
| <span class="sourceLineNo">257</span> double d = random.nextDouble();<a name="line.257"></a> |
| <span class="sourceLineNo">258</span> int idx = Arrays.binarySearch(v, d);<a name="line.258"></a> |
| <span class="sourceLineNo">259</span> if (idx > 0) {<a name="line.259"></a> |
| <span class="sourceLineNo">260</span> ++idx;<a name="line.260"></a> |
| <span class="sourceLineNo">261</span> } else {<a name="line.261"></a> |
| <span class="sourceLineNo">262</span> idx = -(idx + 1);<a name="line.262"></a> |
| <span class="sourceLineNo">263</span> }<a name="line.263"></a> |
| <span class="sourceLineNo">264</span><a name="line.264"></a> |
| <span class="sourceLineNo">265</span> if (idx >= v.length) {<a name="line.265"></a> |
| <span class="sourceLineNo">266</span> idx = v.length - 1;<a name="line.266"></a> |
| <span class="sourceLineNo">267</span> }<a name="line.267"></a> |
| <span class="sourceLineNo">268</span> return idx + min;<a name="line.268"></a> |
| <span class="sourceLineNo">269</span> }<a name="line.269"></a> |
| <span class="sourceLineNo">270</span> }<a name="line.270"></a> |
| <span class="sourceLineNo">271</span>}<a name="line.271"></a> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </pre> |
| </div> |
| </body> |
| </html> |