| <!DOCTYPE HTML> |
| <html lang="en"> |
| <head> |
| <!-- Generated by javadoc (17) --> |
| <title>Source code</title> |
| <meta name="viewport" content="width=device-width, initial-scale=1"> |
| <meta name="description" content="source: package: org.apache.hadoop.metrics2.util, class: MetricSampleQuantiles"> |
| <meta name="generator" content="javadoc/SourceToHTMLConverter"> |
| <link rel="stylesheet" type="text/css" href="../../../../../../stylesheet.css" title="Style"> |
| </head> |
| <body class="source-page"> |
| <main role="main"> |
| <div class="source-container"> |
| <pre><span class="source-line-no">001</span><span id="line-1">/*</span> |
| <span class="source-line-no">002</span><span id="line-2"> * Licensed to the Apache Software Foundation (ASF) under one</span> |
| <span class="source-line-no">003</span><span id="line-3"> * or more contributor license agreements. See the NOTICE file</span> |
| <span class="source-line-no">004</span><span id="line-4"> * distributed with this work for additional information</span> |
| <span class="source-line-no">005</span><span id="line-5"> * regarding copyright ownership. The ASF licenses this file</span> |
| <span class="source-line-no">006</span><span id="line-6"> * to you under the Apache License, Version 2.0 (the</span> |
| <span class="source-line-no">007</span><span id="line-7"> * "License"); you may not use this file except in compliance</span> |
| <span class="source-line-no">008</span><span id="line-8"> * with the License. You may obtain a copy of the License at</span> |
| <span class="source-line-no">009</span><span id="line-9"> *</span> |
| <span class="source-line-no">010</span><span id="line-10"> * http://www.apache.org/licenses/LICENSE-2.0</span> |
| <span class="source-line-no">011</span><span id="line-11"> *</span> |
| <span class="source-line-no">012</span><span id="line-12"> * Unless required by applicable law or agreed to in writing, software</span> |
| <span class="source-line-no">013</span><span id="line-13"> * distributed under the License is distributed on an "AS IS" BASIS,</span> |
| <span class="source-line-no">014</span><span id="line-14"> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span> |
| <span class="source-line-no">015</span><span id="line-15"> * See the License for the specific language governing permissions and</span> |
| <span class="source-line-no">016</span><span id="line-16"> * limitations under the License.</span> |
| <span class="source-line-no">017</span><span id="line-17"> */</span> |
| <span class="source-line-no">018</span><span id="line-18">package org.apache.hadoop.metrics2.util;</span> |
| <span class="source-line-no">019</span><span id="line-19"></span> |
| <span class="source-line-no">020</span><span id="line-20">import java.io.IOException;</span> |
| <span class="source-line-no">021</span><span id="line-21">import java.util.Arrays;</span> |
| <span class="source-line-no">022</span><span id="line-22">import java.util.HashMap;</span> |
| <span class="source-line-no">023</span><span id="line-23">import java.util.LinkedList;</span> |
| <span class="source-line-no">024</span><span id="line-24">import java.util.ListIterator;</span> |
| <span class="source-line-no">025</span><span id="line-25">import java.util.Map;</span> |
| <span class="source-line-no">026</span><span id="line-26">import org.apache.yetus.audience.InterfaceAudience;</span> |
| <span class="source-line-no">027</span><span id="line-27"></span> |
| <span class="source-line-no">028</span><span id="line-28">/**</span> |
| <span class="source-line-no">029</span><span id="line-29"> * Implementation of the Cormode, Korn, Muthukrishnan, and Srivastava algorithm for streaming</span> |
| <span class="source-line-no">030</span><span id="line-30"> * calculation of targeted high-percentile epsilon-approximate quantiles. This is a generalization</span> |
| <span class="source-line-no">031</span><span id="line-31"> * of the earlier work by Greenwald and Khanna (GK), which essentially allows different error bounds</span> |
| <span class="source-line-no">032</span><span id="line-32"> * on the targeted quantiles, which allows for far more efficient calculation of high-percentiles.</span> |
| <span class="source-line-no">033</span><span id="line-33"> * See: Cormode, Korn, Muthukrishnan, and Srivastava "Effective Computation of Biased Quantiles over</span> |
| <span class="source-line-no">034</span><span id="line-34"> * Data Streams" in ICDE 2005 Greenwald and Khanna, "Space-efficient online computation of quantile</span> |
| <span class="source-line-no">035</span><span id="line-35"> * summaries" in SIGMOD 2001</span> |
| <span class="source-line-no">036</span><span id="line-36"> */</span> |
| <span class="source-line-no">037</span><span id="line-37">@InterfaceAudience.Private</span> |
| <span class="source-line-no">038</span><span id="line-38">@SuppressWarnings("JdkObsolete") // This is a use case for LinkedList</span> |
| <span class="source-line-no">039</span><span id="line-39">public class MetricSampleQuantiles {</span> |
| <span class="source-line-no">040</span><span id="line-40"></span> |
| <span class="source-line-no">041</span><span id="line-41"> /**</span> |
| <span class="source-line-no">042</span><span id="line-42"> * Total number of items in stream</span> |
| <span class="source-line-no">043</span><span id="line-43"> */</span> |
| <span class="source-line-no">044</span><span id="line-44"> private long count = 0;</span> |
| <span class="source-line-no">045</span><span id="line-45"></span> |
| <span class="source-line-no">046</span><span id="line-46"> /**</span> |
| <span class="source-line-no">047</span><span id="line-47"> * Current list of sampled items, maintained in sorted order with error bounds</span> |
| <span class="source-line-no">048</span><span id="line-48"> */</span> |
| <span class="source-line-no">049</span><span id="line-49"> private LinkedList<SampleItem> samples;</span> |
| <span class="source-line-no">050</span><span id="line-50"></span> |
| <span class="source-line-no">051</span><span id="line-51"> /**</span> |
| <span class="source-line-no">052</span><span id="line-52"> * Buffers incoming items to be inserted in batch. Items are inserted into the buffer linearly.</span> |
| <span class="source-line-no">053</span><span id="line-53"> * When the buffer fills, it is flushed into the samples array in its entirety.</span> |
| <span class="source-line-no">054</span><span id="line-54"> */</span> |
| <span class="source-line-no">055</span><span id="line-55"> private long[] buffer = new long[500];</span> |
| <span class="source-line-no">056</span><span id="line-56"> private int bufferCount = 0;</span> |
| <span class="source-line-no">057</span><span id="line-57"></span> |
| <span class="source-line-no">058</span><span id="line-58"> /**</span> |
| <span class="source-line-no">059</span><span id="line-59"> * Array of Quantiles that we care about, along with desired error.</span> |
| <span class="source-line-no">060</span><span id="line-60"> */</span> |
| <span class="source-line-no">061</span><span id="line-61"> private final MetricQuantile[] quantiles;</span> |
| <span class="source-line-no">062</span><span id="line-62"></span> |
| <span class="source-line-no">063</span><span id="line-63"> public MetricSampleQuantiles(MetricQuantile[] quantiles) {</span> |
| <span class="source-line-no">064</span><span id="line-64"> this.quantiles = Arrays.copyOf(quantiles, quantiles.length);</span> |
| <span class="source-line-no">065</span><span id="line-65"> this.samples = new LinkedList<>();</span> |
| <span class="source-line-no">066</span><span id="line-66"> }</span> |
| <span class="source-line-no">067</span><span id="line-67"></span> |
| <span class="source-line-no">068</span><span id="line-68"> /**</span> |
| <span class="source-line-no">069</span><span id="line-69"> * Specifies the allowable error for this rank, depending on which quantiles are being targeted.</span> |
| <span class="source-line-no">070</span><span id="line-70"> * This is the f(r_i, n) function from the CKMS paper. It's basically how wide the range of this</span> |
| <span class="source-line-no">071</span><span id="line-71"> * rank can be. the index in the list of samples</span> |
| <span class="source-line-no">072</span><span id="line-72"> */</span> |
| <span class="source-line-no">073</span><span id="line-73"> private double allowableError(int rank) {</span> |
| <span class="source-line-no">074</span><span id="line-74"> int size = samples.size();</span> |
| <span class="source-line-no">075</span><span id="line-75"> double minError = size + 1;</span> |
| <span class="source-line-no">076</span><span id="line-76"> for (MetricQuantile q : quantiles) {</span> |
| <span class="source-line-no">077</span><span id="line-77"> double error;</span> |
| <span class="source-line-no">078</span><span id="line-78"> if (rank <= q.quantile * size) {</span> |
| <span class="source-line-no">079</span><span id="line-79"> error = (2.0 * q.error * (size - rank)) / (1.0 - q.quantile);</span> |
| <span class="source-line-no">080</span><span id="line-80"> } else {</span> |
| <span class="source-line-no">081</span><span id="line-81"> error = (2.0 * q.error * rank) / q.quantile;</span> |
| <span class="source-line-no">082</span><span id="line-82"> }</span> |
| <span class="source-line-no">083</span><span id="line-83"> if (error < minError) {</span> |
| <span class="source-line-no">084</span><span id="line-84"> minError = error;</span> |
| <span class="source-line-no">085</span><span id="line-85"> }</span> |
| <span class="source-line-no">086</span><span id="line-86"> }</span> |
| <span class="source-line-no">087</span><span id="line-87"></span> |
| <span class="source-line-no">088</span><span id="line-88"> return minError;</span> |
| <span class="source-line-no">089</span><span id="line-89"> }</span> |
| <span class="source-line-no">090</span><span id="line-90"></span> |
| <span class="source-line-no">091</span><span id="line-91"> /**</span> |
| <span class="source-line-no">092</span><span id="line-92"> * Add a new value from the stream.</span> |
| <span class="source-line-no">093</span><span id="line-93"> * @param v the value to insert</span> |
| <span class="source-line-no">094</span><span id="line-94"> */</span> |
| <span class="source-line-no">095</span><span id="line-95"> synchronized public void insert(long v) {</span> |
| <span class="source-line-no">096</span><span id="line-96"> buffer[bufferCount] = v;</span> |
| <span class="source-line-no">097</span><span id="line-97"> bufferCount++;</span> |
| <span class="source-line-no">098</span><span id="line-98"></span> |
| <span class="source-line-no">099</span><span id="line-99"> count++;</span> |
| <span class="source-line-no">100</span><span id="line-100"></span> |
| <span class="source-line-no">101</span><span id="line-101"> if (bufferCount == buffer.length) {</span> |
| <span class="source-line-no">102</span><span id="line-102"> insertBatch();</span> |
| <span class="source-line-no">103</span><span id="line-103"> compress();</span> |
| <span class="source-line-no">104</span><span id="line-104"> }</span> |
| <span class="source-line-no">105</span><span id="line-105"> }</span> |
| <span class="source-line-no">106</span><span id="line-106"></span> |
| <span class="source-line-no">107</span><span id="line-107"> /**</span> |
| <span class="source-line-no">108</span><span id="line-108"> * Merges items from buffer into the samples array in one pass. This is more efficient than doing</span> |
| <span class="source-line-no">109</span><span id="line-109"> * an insert on every item.</span> |
| <span class="source-line-no">110</span><span id="line-110"> */</span> |
| <span class="source-line-no">111</span><span id="line-111"> private void insertBatch() {</span> |
| <span class="source-line-no">112</span><span id="line-112"> if (bufferCount == 0) {</span> |
| <span class="source-line-no">113</span><span id="line-113"> return;</span> |
| <span class="source-line-no">114</span><span id="line-114"> }</span> |
| <span class="source-line-no">115</span><span id="line-115"></span> |
| <span class="source-line-no">116</span><span id="line-116"> Arrays.sort(buffer, 0, bufferCount);</span> |
| <span class="source-line-no">117</span><span id="line-117"></span> |
| <span class="source-line-no">118</span><span id="line-118"> // Base case: no samples</span> |
| <span class="source-line-no">119</span><span id="line-119"> int start = 0;</span> |
| <span class="source-line-no">120</span><span id="line-120"> if (samples.isEmpty()) {</span> |
| <span class="source-line-no">121</span><span id="line-121"> SampleItem newItem = new SampleItem(buffer[0], 1, 0);</span> |
| <span class="source-line-no">122</span><span id="line-122"> samples.add(newItem);</span> |
| <span class="source-line-no">123</span><span id="line-123"> start++;</span> |
| <span class="source-line-no">124</span><span id="line-124"> }</span> |
| <span class="source-line-no">125</span><span id="line-125"></span> |
| <span class="source-line-no">126</span><span id="line-126"> ListIterator<SampleItem> it = samples.listIterator();</span> |
| <span class="source-line-no">127</span><span id="line-127"> SampleItem item = it.next();</span> |
| <span class="source-line-no">128</span><span id="line-128"> for (int i = start; i < bufferCount; i++) {</span> |
| <span class="source-line-no">129</span><span id="line-129"> long v = buffer[i];</span> |
| <span class="source-line-no">130</span><span id="line-130"> while (it.nextIndex() < samples.size() && item.value < v) {</span> |
| <span class="source-line-no">131</span><span id="line-131"> item = it.next();</span> |
| <span class="source-line-no">132</span><span id="line-132"> }</span> |
| <span class="source-line-no">133</span><span id="line-133"> // If we found that bigger item, back up so we insert ourselves before it</span> |
| <span class="source-line-no">134</span><span id="line-134"> if (item.value > v) {</span> |
| <span class="source-line-no">135</span><span id="line-135"> it.previous();</span> |
| <span class="source-line-no">136</span><span id="line-136"> }</span> |
| <span class="source-line-no">137</span><span id="line-137"> // We use different indexes for the edge comparisons, because of the above</span> |
| <span class="source-line-no">138</span><span id="line-138"> // if statement that adjusts the iterator</span> |
| <span class="source-line-no">139</span><span id="line-139"> int delta;</span> |
| <span class="source-line-no">140</span><span id="line-140"> if (it.previousIndex() == 0 || it.nextIndex() == samples.size()) {</span> |
| <span class="source-line-no">141</span><span id="line-141"> delta = 0;</span> |
| <span class="source-line-no">142</span><span id="line-142"> } else {</span> |
| <span class="source-line-no">143</span><span id="line-143"> delta = ((int) Math.floor(allowableError(it.nextIndex()))) - 1;</span> |
| <span class="source-line-no">144</span><span id="line-144"> }</span> |
| <span class="source-line-no">145</span><span id="line-145"> SampleItem newItem = new SampleItem(v, 1, delta);</span> |
| <span class="source-line-no">146</span><span id="line-146"> it.add(newItem);</span> |
| <span class="source-line-no">147</span><span id="line-147"> item = newItem;</span> |
| <span class="source-line-no">148</span><span id="line-148"> }</span> |
| <span class="source-line-no">149</span><span id="line-149"></span> |
| <span class="source-line-no">150</span><span id="line-150"> bufferCount = 0;</span> |
| <span class="source-line-no">151</span><span id="line-151"> }</span> |
| <span class="source-line-no">152</span><span id="line-152"></span> |
| <span class="source-line-no">153</span><span id="line-153"> /**</span> |
| <span class="source-line-no">154</span><span id="line-154"> * Try to remove extraneous items from the set of sampled items. This checks if an item is</span> |
| <span class="source-line-no">155</span><span id="line-155"> * unnecessary based on the desired error bounds, and merges it with the adjacent item if it is.</span> |
| <span class="source-line-no">156</span><span id="line-156"> */</span> |
| <span class="source-line-no">157</span><span id="line-157"> private void compress() {</span> |
| <span class="source-line-no">158</span><span id="line-158"> if (samples.size() < 2) {</span> |
| <span class="source-line-no">159</span><span id="line-159"> return;</span> |
| <span class="source-line-no">160</span><span id="line-160"> }</span> |
| <span class="source-line-no">161</span><span id="line-161"></span> |
| <span class="source-line-no">162</span><span id="line-162"> ListIterator<SampleItem> it = samples.listIterator();</span> |
| <span class="source-line-no">163</span><span id="line-163"> SampleItem prev = null;</span> |
| <span class="source-line-no">164</span><span id="line-164"> SampleItem next = it.next();</span> |
| <span class="source-line-no">165</span><span id="line-165"></span> |
| <span class="source-line-no">166</span><span id="line-166"> while (it.hasNext()) {</span> |
| <span class="source-line-no">167</span><span id="line-167"> prev = next;</span> |
| <span class="source-line-no">168</span><span id="line-168"> next = it.next();</span> |
| <span class="source-line-no">169</span><span id="line-169"> if (prev.g + next.g + next.delta <= allowableError(it.previousIndex())) {</span> |
| <span class="source-line-no">170</span><span id="line-170"> next.g += prev.g;</span> |
| <span class="source-line-no">171</span><span id="line-171"> // Remove prev. it.remove() kills the last thing returned.</span> |
| <span class="source-line-no">172</span><span id="line-172"> it.previous();</span> |
| <span class="source-line-no">173</span><span id="line-173"> it.previous();</span> |
| <span class="source-line-no">174</span><span id="line-174"> it.remove();</span> |
| <span class="source-line-no">175</span><span id="line-175"> // it.next() is now equal to next, skip it back forward again</span> |
| <span class="source-line-no">176</span><span id="line-176"> it.next();</span> |
| <span class="source-line-no">177</span><span id="line-177"> }</span> |
| <span class="source-line-no">178</span><span id="line-178"> }</span> |
| <span class="source-line-no">179</span><span id="line-179"> }</span> |
| <span class="source-line-no">180</span><span id="line-180"></span> |
| <span class="source-line-no">181</span><span id="line-181"> /**</span> |
| <span class="source-line-no">182</span><span id="line-182"> * Get the estimated value at the specified quantile.</span> |
| <span class="source-line-no">183</span><span id="line-183"> * @param quantile Queried quantile, e.g. 0.50 or 0.99.</span> |
| <span class="source-line-no">184</span><span id="line-184"> * @return Estimated value at that quantile.</span> |
| <span class="source-line-no">185</span><span id="line-185"> */</span> |
| <span class="source-line-no">186</span><span id="line-186"> private long query(double quantile) throws IOException {</span> |
| <span class="source-line-no">187</span><span id="line-187"> if (samples.isEmpty()) {</span> |
| <span class="source-line-no">188</span><span id="line-188"> throw new IOException("No samples present");</span> |
| <span class="source-line-no">189</span><span id="line-189"> }</span> |
| <span class="source-line-no">190</span><span id="line-190"></span> |
| <span class="source-line-no">191</span><span id="line-191"> int rankMin = 0;</span> |
| <span class="source-line-no">192</span><span id="line-192"> int desired = (int) (quantile * count);</span> |
| <span class="source-line-no">193</span><span id="line-193"></span> |
| <span class="source-line-no">194</span><span id="line-194"> for (int i = 1; i < samples.size(); i++) {</span> |
| <span class="source-line-no">195</span><span id="line-195"> SampleItem prev = samples.get(i - 1);</span> |
| <span class="source-line-no">196</span><span id="line-196"> SampleItem cur = samples.get(i);</span> |
| <span class="source-line-no">197</span><span id="line-197"></span> |
| <span class="source-line-no">198</span><span id="line-198"> rankMin += prev.g;</span> |
| <span class="source-line-no">199</span><span id="line-199"></span> |
| <span class="source-line-no">200</span><span id="line-200"> if (rankMin + cur.g + cur.delta > desired + (allowableError(i) / 2)) {</span> |
| <span class="source-line-no">201</span><span id="line-201"> return prev.value;</span> |
| <span class="source-line-no">202</span><span id="line-202"> }</span> |
| <span class="source-line-no">203</span><span id="line-203"> }</span> |
| <span class="source-line-no">204</span><span id="line-204"></span> |
| <span class="source-line-no">205</span><span id="line-205"> // edge case of wanting max value</span> |
| <span class="source-line-no">206</span><span id="line-206"> return samples.get(samples.size() - 1).value;</span> |
| <span class="source-line-no">207</span><span id="line-207"> }</span> |
| <span class="source-line-no">208</span><span id="line-208"></span> |
| <span class="source-line-no">209</span><span id="line-209"> /**</span> |
| <span class="source-line-no">210</span><span id="line-210"> * Get a snapshot of the current values of all the tracked quantiles.</span> |
| <span class="source-line-no">211</span><span id="line-211"> * @return snapshot of the tracked quantiles if no items have been added to the estimator</span> |
| <span class="source-line-no">212</span><span id="line-212"> */</span> |
| <span class="source-line-no">213</span><span id="line-213"> synchronized public Map<MetricQuantile, Long> snapshot() throws IOException {</span> |
| <span class="source-line-no">214</span><span id="line-214"> // flush the buffer first for best results</span> |
| <span class="source-line-no">215</span><span id="line-215"> insertBatch();</span> |
| <span class="source-line-no">216</span><span id="line-216"> Map<MetricQuantile, Long> values = new HashMap<>(quantiles.length);</span> |
| <span class="source-line-no">217</span><span id="line-217"> for (int i = 0; i < quantiles.length; i++) {</span> |
| <span class="source-line-no">218</span><span id="line-218"> values.put(quantiles[i], query(quantiles[i].quantile));</span> |
| <span class="source-line-no">219</span><span id="line-219"> }</span> |
| <span class="source-line-no">220</span><span id="line-220"></span> |
| <span class="source-line-no">221</span><span id="line-221"> return values;</span> |
| <span class="source-line-no">222</span><span id="line-222"> }</span> |
| <span class="source-line-no">223</span><span id="line-223"></span> |
| <span class="source-line-no">224</span><span id="line-224"> /**</span> |
| <span class="source-line-no">225</span><span id="line-225"> * Returns the number of items that the estimator has processed</span> |
| <span class="source-line-no">226</span><span id="line-226"> * @return count total number of items processed</span> |
| <span class="source-line-no">227</span><span id="line-227"> */</span> |
| <span class="source-line-no">228</span><span id="line-228"> synchronized public long getCount() {</span> |
| <span class="source-line-no">229</span><span id="line-229"> return count;</span> |
| <span class="source-line-no">230</span><span id="line-230"> }</span> |
| <span class="source-line-no">231</span><span id="line-231"></span> |
| <span class="source-line-no">232</span><span id="line-232"> /**</span> |
| <span class="source-line-no">233</span><span id="line-233"> * Returns the number of samples kept by the estimator</span> |
| <span class="source-line-no">234</span><span id="line-234"> * @return count current number of samples</span> |
| <span class="source-line-no">235</span><span id="line-235"> */</span> |
| <span class="source-line-no">236</span><span id="line-236"> synchronized public int getSampleCount() {</span> |
| <span class="source-line-no">237</span><span id="line-237"> return samples.size();</span> |
| <span class="source-line-no">238</span><span id="line-238"> }</span> |
| <span class="source-line-no">239</span><span id="line-239"></span> |
| <span class="source-line-no">240</span><span id="line-240"> /**</span> |
| <span class="source-line-no">241</span><span id="line-241"> * Resets the estimator, clearing out all previously inserted items</span> |
| <span class="source-line-no">242</span><span id="line-242"> */</span> |
| <span class="source-line-no">243</span><span id="line-243"> synchronized public void clear() {</span> |
| <span class="source-line-no">244</span><span id="line-244"> count = 0;</span> |
| <span class="source-line-no">245</span><span id="line-245"> bufferCount = 0;</span> |
| <span class="source-line-no">246</span><span id="line-246"> samples.clear();</span> |
| <span class="source-line-no">247</span><span id="line-247"> }</span> |
| <span class="source-line-no">248</span><span id="line-248"></span> |
| <span class="source-line-no">249</span><span id="line-249"> /**</span> |
| <span class="source-line-no">250</span><span id="line-250"> * Describes a measured value passed to the estimator, tracking additional metadata required by</span> |
| <span class="source-line-no">251</span><span id="line-251"> * the CKMS algorithm.</span> |
| <span class="source-line-no">252</span><span id="line-252"> */</span> |
| <span class="source-line-no">253</span><span id="line-253"> private static class SampleItem {</span> |
| <span class="source-line-no">254</span><span id="line-254"></span> |
| <span class="source-line-no">255</span><span id="line-255"> /**</span> |
| <span class="source-line-no">256</span><span id="line-256"> * Value of the sampled item (e.g. a measured latency value)</span> |
| <span class="source-line-no">257</span><span id="line-257"> */</span> |
| <span class="source-line-no">258</span><span id="line-258"> private final long value;</span> |
| <span class="source-line-no">259</span><span id="line-259"></span> |
| <span class="source-line-no">260</span><span id="line-260"> /**</span> |
| <span class="source-line-no">261</span><span id="line-261"> * Difference between the lowest possible rank of the previous item, and the lowest possible</span> |
| <span class="source-line-no">262</span><span id="line-262"> * rank of this item. The sum of the g of all previous items yields this item's lower bound.</span> |
| <span class="source-line-no">263</span><span id="line-263"> */</span> |
| <span class="source-line-no">264</span><span id="line-264"> private int g;</span> |
| <span class="source-line-no">265</span><span id="line-265"></span> |
| <span class="source-line-no">266</span><span id="line-266"> /**</span> |
| <span class="source-line-no">267</span><span id="line-267"> * Difference between the item's greatest possible rank and lowest possible rank.</span> |
| <span class="source-line-no">268</span><span id="line-268"> */</span> |
| <span class="source-line-no">269</span><span id="line-269"> private final int delta;</span> |
| <span class="source-line-no">270</span><span id="line-270"></span> |
| <span class="source-line-no">271</span><span id="line-271"> public SampleItem(long value, int lowerDelta, int delta) {</span> |
| <span class="source-line-no">272</span><span id="line-272"> this.value = value;</span> |
| <span class="source-line-no">273</span><span id="line-273"> this.g = lowerDelta;</span> |
| <span class="source-line-no">274</span><span id="line-274"> this.delta = delta;</span> |
| <span class="source-line-no">275</span><span id="line-275"> }</span> |
| <span class="source-line-no">276</span><span id="line-276"></span> |
| <span class="source-line-no">277</span><span id="line-277"> @Override</span> |
| <span class="source-line-no">278</span><span id="line-278"> public String toString() {</span> |
| <span class="source-line-no">279</span><span id="line-279"> return String.format("%d, %d, %d", value, g, delta);</span> |
| <span class="source-line-no">280</span><span id="line-280"> }</span> |
| <span class="source-line-no">281</span><span id="line-281"> }</span> |
| <span class="source-line-no">282</span><span id="line-282">}</span> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </pre> |
| </div> |
| </main> |
| </body> |
| </html> |
