| <!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.hbase.regionserver, class: CellFlatMap"> |
| <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.hbase.regionserver;</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.util.Collection;</span> |
| <span class="source-line-no">021</span><span id="line-21">import java.util.Comparator;</span> |
| <span class="source-line-no">022</span><span id="line-22">import java.util.Iterator;</span> |
| <span class="source-line-no">023</span><span id="line-23">import java.util.Map;</span> |
| <span class="source-line-no">024</span><span id="line-24">import java.util.NavigableMap;</span> |
| <span class="source-line-no">025</span><span id="line-25">import java.util.NavigableSet;</span> |
| <span class="source-line-no">026</span><span id="line-26">import java.util.Set;</span> |
| <span class="source-line-no">027</span><span id="line-27">import org.apache.hadoop.hbase.Cell;</span> |
| <span class="source-line-no">028</span><span id="line-28">import org.apache.yetus.audience.InterfaceAudience;</span> |
| <span class="source-line-no">029</span><span id="line-29"></span> |
| <span class="source-line-no">030</span><span id="line-30">/**</span> |
| <span class="source-line-no">031</span><span id="line-31"> * CellFlatMap stores a constant number of elements and is immutable after creation stage. Being</span> |
| <span class="source-line-no">032</span><span id="line-32"> * immutable, the CellFlatMap can be implemented as array. The actual array can be on- or off-heap</span> |
| <span class="source-line-no">033</span><span id="line-33"> * and is implemented in concrete class derived from CellFlatMap. The CellFlatMap uses no</span> |
| <span class="source-line-no">034</span><span id="line-34"> * synchronization primitives, it is assumed to be created by a single thread and then it can be</span> |
| <span class="source-line-no">035</span><span id="line-35"> * read-only by multiple threads. The "flat" in the name, means that the memory layout of the Map is</span> |
| <span class="source-line-no">036</span><span id="line-36"> * sequential array and thus requires less memory than ConcurrentSkipListMap.</span> |
| <span class="source-line-no">037</span><span id="line-37"> */</span> |
| <span class="source-line-no">038</span><span id="line-38">@InterfaceAudience.Private</span> |
| <span class="source-line-no">039</span><span id="line-39">public abstract class CellFlatMap<T extends Cell> implements NavigableMap<T, T> {</span> |
| <span class="source-line-no">040</span><span id="line-40"></span> |
| <span class="source-line-no">041</span><span id="line-41"> private final Comparator<? super T> comparator;</span> |
| <span class="source-line-no">042</span><span id="line-42"> protected int minCellIdx = 0; // the index of the minimal cell (for sub-sets)</span> |
| <span class="source-line-no">043</span><span id="line-43"> protected int maxCellIdx = 0; // the index of the cell after the maximal cell (for sub-sets)</span> |
| <span class="source-line-no">044</span><span id="line-44"> private boolean descending = false;</span> |
| <span class="source-line-no">045</span><span id="line-45"></span> |
| <span class="source-line-no">046</span><span id="line-46"> /* C-tor */</span> |
| <span class="source-line-no">047</span><span id="line-47"> public CellFlatMap(Comparator<? super T> comparator, int min, int max, boolean d) {</span> |
| <span class="source-line-no">048</span><span id="line-48"> this.comparator = comparator;</span> |
| <span class="source-line-no">049</span><span id="line-49"> this.minCellIdx = min;</span> |
| <span class="source-line-no">050</span><span id="line-50"> this.maxCellIdx = max;</span> |
| <span class="source-line-no">051</span><span id="line-51"> this.descending = d;</span> |
| <span class="source-line-no">052</span><span id="line-52"> }</span> |
| <span class="source-line-no">053</span><span id="line-53"></span> |
| <span class="source-line-no">054</span><span id="line-54"> /* Used for abstract CellFlatMap creation, implemented by derived class */</span> |
| <span class="source-line-no">055</span><span id="line-55"> protected abstract CellFlatMap<T> createSubCellFlatMap(int min, int max, boolean descending);</span> |
| <span class="source-line-no">056</span><span id="line-56"></span> |
| <span class="source-line-no">057</span><span id="line-57"> /* Returns the i-th cell in the cell block */</span> |
| <span class="source-line-no">058</span><span id="line-58"> protected abstract T getCell(int i);</span> |
| <span class="source-line-no">059</span><span id="line-59"></span> |
| <span class="source-line-no">060</span><span id="line-60"> /**</span> |
| <span class="source-line-no">061</span><span id="line-61"> * Binary search for a given key in between given boundaries of the array. Positive returned</span> |
| <span class="source-line-no">062</span><span id="line-62"> * numbers mean the index. Negative returned numbers means the key not found. The absolute value</span> |
| <span class="source-line-no">063</span><span id="line-63"> * of the output is the possible insert index for the searched key In twos-complement, (-1 *</span> |
| <span class="source-line-no">064</span><span id="line-64"> * insertion point)-1 is the bitwise not of the insert point.</span> |
| <span class="source-line-no">065</span><span id="line-65"> * @param needle The key to look for in all of the entries</span> |
| <span class="source-line-no">066</span><span id="line-66"> * @return Same return value as Arrays.binarySearch.</span> |
| <span class="source-line-no">067</span><span id="line-67"> */</span> |
| <span class="source-line-no">068</span><span id="line-68"> private int find(T needle) {</span> |
| <span class="source-line-no">069</span><span id="line-69"> int begin = minCellIdx;</span> |
| <span class="source-line-no">070</span><span id="line-70"> int end = maxCellIdx - 1;</span> |
| <span class="source-line-no">071</span><span id="line-71"></span> |
| <span class="source-line-no">072</span><span id="line-72"> while (begin <= end) {</span> |
| <span class="source-line-no">073</span><span id="line-73"> int mid = begin + ((end - begin) >> 1);</span> |
| <span class="source-line-no">074</span><span id="line-74"> T midCell = getCell(mid);</span> |
| <span class="source-line-no">075</span><span id="line-75"> int compareRes = comparator.compare(midCell, needle);</span> |
| <span class="source-line-no">076</span><span id="line-76"></span> |
| <span class="source-line-no">077</span><span id="line-77"> if (compareRes == 0) {</span> |
| <span class="source-line-no">078</span><span id="line-78"> return mid; // 0 means equals. We found the key</span> |
| <span class="source-line-no">079</span><span id="line-79"> }</span> |
| <span class="source-line-no">080</span><span id="line-80"> // Key not found. Check the comparison results; reverse the meaning of</span> |
| <span class="source-line-no">081</span><span id="line-81"> // the comparison in case the order is descending (using XOR)</span> |
| <span class="source-line-no">082</span><span id="line-82"> if ((compareRes < 0) ^ descending) {</span> |
| <span class="source-line-no">083</span><span id="line-83"> // midCell is less than needle so we need to look at farther up</span> |
| <span class="source-line-no">084</span><span id="line-84"> begin = mid + 1;</span> |
| <span class="source-line-no">085</span><span id="line-85"> } else {</span> |
| <span class="source-line-no">086</span><span id="line-86"> // midCell is greater than needle so we need to look down</span> |
| <span class="source-line-no">087</span><span id="line-87"> end = mid - 1;</span> |
| <span class="source-line-no">088</span><span id="line-88"> }</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"> return (-1 * begin) - 1;</span> |
| <span class="source-line-no">092</span><span id="line-92"> }</span> |
| <span class="source-line-no">093</span><span id="line-93"></span> |
| <span class="source-line-no">094</span><span id="line-94"> /**</span> |
| <span class="source-line-no">095</span><span id="line-95"> * Get the index of the given anchor key for creating subsequent set. It doesn't matter whether</span> |
| <span class="source-line-no">096</span><span id="line-96"> * the given key exists in the set or not. taking into consideration whether the key should be</span> |
| <span class="source-line-no">097</span><span id="line-97"> * inclusive or exclusive.</span> |
| <span class="source-line-no">098</span><span id="line-98"> */</span> |
| <span class="source-line-no">099</span><span id="line-99"> private int getValidIndex(T key, boolean inclusive, boolean tail) {</span> |
| <span class="source-line-no">100</span><span id="line-100"> final int index = find(key);</span> |
| <span class="source-line-no">101</span><span id="line-101"> // get the valid (positive) insertion point from the output of the find() method</span> |
| <span class="source-line-no">102</span><span id="line-102"> int insertionPoint = index < 0 ? ~index : index;</span> |
| <span class="source-line-no">103</span><span id="line-103"></span> |
| <span class="source-line-no">104</span><span id="line-104"> // correct the insertion point in case the given anchor key DOES EXIST in the set</span> |
| <span class="source-line-no">105</span><span id="line-105"> if (index >= 0) {</span> |
| <span class="source-line-no">106</span><span id="line-106"> if (descending && !(tail ^ inclusive)) {</span> |
| <span class="source-line-no">107</span><span id="line-107"> // for the descending case</span> |
| <span class="source-line-no">108</span><span id="line-108"> // if anchor for head set (tail=false) AND anchor is not inclusive -> move the insertion pt</span> |
| <span class="source-line-no">109</span><span id="line-109"> // if anchor for tail set (tail=true) AND the keys is inclusive -> move the insertion point</span> |
| <span class="source-line-no">110</span><span id="line-110"> // because the end index of a set is the index of the cell after the maximal cell</span> |
| <span class="source-line-no">111</span><span id="line-111"> insertionPoint += 1;</span> |
| <span class="source-line-no">112</span><span id="line-112"> } else if (!descending && (tail ^ inclusive)) {</span> |
| <span class="source-line-no">113</span><span id="line-113"> // for the ascending case</span> |
| <span class="source-line-no">114</span><span id="line-114"> // if anchor for head set (tail=false) AND anchor is inclusive -> move the insertion point</span> |
| <span class="source-line-no">115</span><span id="line-115"> // because the end index of a set is the index of the cell after the maximal cell</span> |
| <span class="source-line-no">116</span><span id="line-116"> // if anchor for tail set (tail=true) AND the keys is not inclusive -> move the insertion pt</span> |
| <span class="source-line-no">117</span><span id="line-117"> insertionPoint += 1;</span> |
| <span class="source-line-no">118</span><span id="line-118"> }</span> |
| <span class="source-line-no">119</span><span id="line-119"> }</span> |
| <span class="source-line-no">120</span><span id="line-120"> // insert the insertion point into the valid range,</span> |
| <span class="source-line-no">121</span><span id="line-121"> // as we may enlarge it too much in the above correction</span> |
| <span class="source-line-no">122</span><span id="line-122"> return Math.min(Math.max(insertionPoint, minCellIdx), maxCellIdx);</span> |
| <span class="source-line-no">123</span><span id="line-123"> }</span> |
| <span class="source-line-no">124</span><span id="line-124"></span> |
| <span class="source-line-no">125</span><span id="line-125"> @Override</span> |
| <span class="source-line-no">126</span><span id="line-126"> public Comparator<? super T> comparator() {</span> |
| <span class="source-line-no">127</span><span id="line-127"> return comparator;</span> |
| <span class="source-line-no">128</span><span id="line-128"> }</span> |
| <span class="source-line-no">129</span><span id="line-129"></span> |
| <span class="source-line-no">130</span><span id="line-130"> @Override</span> |
| <span class="source-line-no">131</span><span id="line-131"> public int size() {</span> |
| <span class="source-line-no">132</span><span id="line-132"> return maxCellIdx - minCellIdx;</span> |
| <span class="source-line-no">133</span><span id="line-133"> }</span> |
| <span class="source-line-no">134</span><span id="line-134"></span> |
| <span class="source-line-no">135</span><span id="line-135"> @Override</span> |
| <span class="source-line-no">136</span><span id="line-136"> public boolean isEmpty() {</span> |
| <span class="source-line-no">137</span><span id="line-137"> return (size() == 0);</span> |
| <span class="source-line-no">138</span><span id="line-138"> }</span> |
| <span class="source-line-no">139</span><span id="line-139"></span> |
| <span class="source-line-no">140</span><span id="line-140"> // ---------------- Sub-Maps ----------------</span> |
| <span class="source-line-no">141</span><span id="line-141"> @Override</span> |
| <span class="source-line-no">142</span><span id="line-142"> public NavigableMap<T, T> subMap(T fromKey, boolean fromInclusive, T toKey, boolean toInclusive) {</span> |
| <span class="source-line-no">143</span><span id="line-143"> final int lessCellIndex = getValidIndex(fromKey, fromInclusive, true);</span> |
| <span class="source-line-no">144</span><span id="line-144"> final int greaterCellIndex = getValidIndex(toKey, toInclusive, false);</span> |
| <span class="source-line-no">145</span><span id="line-145"> if (descending) {</span> |
| <span class="source-line-no">146</span><span id="line-146"> return createSubCellFlatMap(greaterCellIndex, lessCellIndex, descending);</span> |
| <span class="source-line-no">147</span><span id="line-147"> } else {</span> |
| <span class="source-line-no">148</span><span id="line-148"> return createSubCellFlatMap(lessCellIndex, greaterCellIndex, descending);</span> |
| <span class="source-line-no">149</span><span id="line-149"> }</span> |
| <span class="source-line-no">150</span><span id="line-150"> }</span> |
| <span class="source-line-no">151</span><span id="line-151"></span> |
| <span class="source-line-no">152</span><span id="line-152"> @Override</span> |
| <span class="source-line-no">153</span><span id="line-153"> public NavigableMap<T, T> headMap(T toKey, boolean inclusive) {</span> |
| <span class="source-line-no">154</span><span id="line-154"> if (descending) {</span> |
| <span class="source-line-no">155</span><span id="line-155"> return createSubCellFlatMap(getValidIndex(toKey, inclusive, false), maxCellIdx, descending);</span> |
| <span class="source-line-no">156</span><span id="line-156"> } else {</span> |
| <span class="source-line-no">157</span><span id="line-157"> return createSubCellFlatMap(minCellIdx, getValidIndex(toKey, inclusive, false), descending);</span> |
| <span class="source-line-no">158</span><span id="line-158"> }</span> |
| <span class="source-line-no">159</span><span id="line-159"> }</span> |
| <span class="source-line-no">160</span><span id="line-160"></span> |
| <span class="source-line-no">161</span><span id="line-161"> @Override</span> |
| <span class="source-line-no">162</span><span id="line-162"> public NavigableMap<T, T> tailMap(T fromKey, boolean inclusive) {</span> |
| <span class="source-line-no">163</span><span id="line-163"> if (descending) {</span> |
| <span class="source-line-no">164</span><span id="line-164"> return createSubCellFlatMap(minCellIdx, getValidIndex(fromKey, inclusive, true), descending);</span> |
| <span class="source-line-no">165</span><span id="line-165"> } else {</span> |
| <span class="source-line-no">166</span><span id="line-166"> return createSubCellFlatMap(getValidIndex(fromKey, inclusive, true), maxCellIdx, descending);</span> |
| <span class="source-line-no">167</span><span id="line-167"> }</span> |
| <span class="source-line-no">168</span><span id="line-168"> }</span> |
| <span class="source-line-no">169</span><span id="line-169"></span> |
| <span class="source-line-no">170</span><span id="line-170"> @Override</span> |
| <span class="source-line-no">171</span><span id="line-171"> public NavigableMap<T, T> descendingMap() {</span> |
| <span class="source-line-no">172</span><span id="line-172"> return createSubCellFlatMap(minCellIdx, maxCellIdx, true);</span> |
| <span class="source-line-no">173</span><span id="line-173"> }</span> |
| <span class="source-line-no">174</span><span id="line-174"></span> |
| <span class="source-line-no">175</span><span id="line-175"> @Override</span> |
| <span class="source-line-no">176</span><span id="line-176"> public NavigableMap<T, T> subMap(T k1, T k2) {</span> |
| <span class="source-line-no">177</span><span id="line-177"> return this.subMap(k1, true, k2, true);</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"> @Override</span> |
| <span class="source-line-no">181</span><span id="line-181"> public NavigableMap<T, T> headMap(T k) {</span> |
| <span class="source-line-no">182</span><span id="line-182"> return this.headMap(k, true);</span> |
| <span class="source-line-no">183</span><span id="line-183"> }</span> |
| <span class="source-line-no">184</span><span id="line-184"></span> |
| <span class="source-line-no">185</span><span id="line-185"> @Override</span> |
| <span class="source-line-no">186</span><span id="line-186"> public NavigableMap<T, T> tailMap(T k) {</span> |
| <span class="source-line-no">187</span><span id="line-187"> return this.tailMap(k, true);</span> |
| <span class="source-line-no">188</span><span id="line-188"> }</span> |
| <span class="source-line-no">189</span><span id="line-189"></span> |
| <span class="source-line-no">190</span><span id="line-190"> // -------------------------------- Key's getters --------------------------------</span> |
| <span class="source-line-no">191</span><span id="line-191"> @Override</span> |
| <span class="source-line-no">192</span><span id="line-192"> public T firstKey() {</span> |
| <span class="source-line-no">193</span><span id="line-193"> if (isEmpty()) {</span> |
| <span class="source-line-no">194</span><span id="line-194"> return null;</span> |
| <span class="source-line-no">195</span><span id="line-195"> }</span> |
| <span class="source-line-no">196</span><span id="line-196"> return descending ? getCell(maxCellIdx - 1) : getCell(minCellIdx);</span> |
| <span class="source-line-no">197</span><span id="line-197"> }</span> |
| <span class="source-line-no">198</span><span id="line-198"></span> |
| <span class="source-line-no">199</span><span id="line-199"> @Override</span> |
| <span class="source-line-no">200</span><span id="line-200"> public T lastKey() {</span> |
| <span class="source-line-no">201</span><span id="line-201"> if (isEmpty()) {</span> |
| <span class="source-line-no">202</span><span id="line-202"> return null;</span> |
| <span class="source-line-no">203</span><span id="line-203"> }</span> |
| <span class="source-line-no">204</span><span id="line-204"> return descending ? getCell(minCellIdx) : getCell(maxCellIdx - 1);</span> |
| <span class="source-line-no">205</span><span id="line-205"> }</span> |
| <span class="source-line-no">206</span><span id="line-206"></span> |
| <span class="source-line-no">207</span><span id="line-207"> @Override</span> |
| <span class="source-line-no">208</span><span id="line-208"> public T lowerKey(T k) {</span> |
| <span class="source-line-no">209</span><span id="line-209"> if (isEmpty()) {</span> |
| <span class="source-line-no">210</span><span id="line-210"> return null;</span> |
| <span class="source-line-no">211</span><span id="line-211"> }</span> |
| <span class="source-line-no">212</span><span id="line-212"> int index = find(k);</span> |
| <span class="source-line-no">213</span><span id="line-213"> // If index>=0 there's a key exactly equal</span> |
| <span class="source-line-no">214</span><span id="line-214"> index = (index >= 0) ? index - 1 : -(index);</span> |
| <span class="source-line-no">215</span><span id="line-215"> return (index < minCellIdx || index >= maxCellIdx) ? null : getCell(index);</span> |
| <span class="source-line-no">216</span><span id="line-216"> }</span> |
| <span class="source-line-no">217</span><span id="line-217"></span> |
| <span class="source-line-no">218</span><span id="line-218"> @Override</span> |
| <span class="source-line-no">219</span><span id="line-219"> public T floorKey(T k) {</span> |
| <span class="source-line-no">220</span><span id="line-220"> if (isEmpty()) {</span> |
| <span class="source-line-no">221</span><span id="line-221"> return null;</span> |
| <span class="source-line-no">222</span><span id="line-222"> }</span> |
| <span class="source-line-no">223</span><span id="line-223"> int index = find(k);</span> |
| <span class="source-line-no">224</span><span id="line-224"> index = (index >= 0) ? index : -(index);</span> |
| <span class="source-line-no">225</span><span id="line-225"> return (index < minCellIdx || index >= maxCellIdx) ? null : getCell(index);</span> |
| <span class="source-line-no">226</span><span id="line-226"> }</span> |
| <span class="source-line-no">227</span><span id="line-227"></span> |
| <span class="source-line-no">228</span><span id="line-228"> @Override</span> |
| <span class="source-line-no">229</span><span id="line-229"> public T ceilingKey(T k) {</span> |
| <span class="source-line-no">230</span><span id="line-230"> if (isEmpty()) {</span> |
| <span class="source-line-no">231</span><span id="line-231"> return null;</span> |
| <span class="source-line-no">232</span><span id="line-232"> }</span> |
| <span class="source-line-no">233</span><span id="line-233"> int index = find(k);</span> |
| <span class="source-line-no">234</span><span id="line-234"> index = (index >= 0) ? index : -(index) + 1;</span> |
| <span class="source-line-no">235</span><span id="line-235"> return (index < minCellIdx || index >= maxCellIdx) ? null : getCell(index);</span> |
| <span class="source-line-no">236</span><span id="line-236"> }</span> |
| <span class="source-line-no">237</span><span id="line-237"></span> |
| <span class="source-line-no">238</span><span id="line-238"> @Override</span> |
| <span class="source-line-no">239</span><span id="line-239"> public T higherKey(T k) {</span> |
| <span class="source-line-no">240</span><span id="line-240"> if (isEmpty()) {</span> |
| <span class="source-line-no">241</span><span id="line-241"> return null;</span> |
| <span class="source-line-no">242</span><span id="line-242"> }</span> |
| <span class="source-line-no">243</span><span id="line-243"> int index = find(k);</span> |
| <span class="source-line-no">244</span><span id="line-244"> index = (index >= 0) ? index + 1 : -(index) + 1;</span> |
| <span class="source-line-no">245</span><span id="line-245"> return (index < minCellIdx || index >= maxCellIdx) ? null : getCell(index);</span> |
| <span class="source-line-no">246</span><span id="line-246"> }</span> |
| <span class="source-line-no">247</span><span id="line-247"></span> |
| <span class="source-line-no">248</span><span id="line-248"> @Override</span> |
| <span class="source-line-no">249</span><span id="line-249"> public boolean containsKey(Object o) {</span> |
| <span class="source-line-no">250</span><span id="line-250"> int index = find((T) o);</span> |
| <span class="source-line-no">251</span><span id="line-251"> return (index >= 0);</span> |
| <span class="source-line-no">252</span><span id="line-252"> }</span> |
| <span class="source-line-no">253</span><span id="line-253"></span> |
| <span class="source-line-no">254</span><span id="line-254"> @Override</span> |
| <span class="source-line-no">255</span><span id="line-255"> public boolean containsValue(Object o) { // use containsKey(Object o) instead</span> |
| <span class="source-line-no">256</span><span id="line-256"> throw new UnsupportedOperationException("Use containsKey(Object o) instead");</span> |
| <span class="source-line-no">257</span><span id="line-257"> }</span> |
| <span class="source-line-no">258</span><span id="line-258"></span> |
| <span class="source-line-no">259</span><span id="line-259"> @Override</span> |
| <span class="source-line-no">260</span><span id="line-260"> public T get(Object o) {</span> |
| <span class="source-line-no">261</span><span id="line-261"> int index = find((T) o);</span> |
| <span class="source-line-no">262</span><span id="line-262"> return (index >= 0) ? getCell(index) : null;</span> |
| <span class="source-line-no">263</span><span id="line-263"> }</span> |
| <span class="source-line-no">264</span><span id="line-264"></span> |
| <span class="source-line-no">265</span><span id="line-265"> // -------------------------------- Entry's getters --------------------------------</span> |
| <span class="source-line-no">266</span><span id="line-266"></span> |
| <span class="source-line-no">267</span><span id="line-267"> private static class CellFlatMapEntry<T> implements Entry<T, T> {</span> |
| <span class="source-line-no">268</span><span id="line-268"> private final T cell;</span> |
| <span class="source-line-no">269</span><span id="line-269"></span> |
| <span class="source-line-no">270</span><span id="line-270"> public CellFlatMapEntry(T cell) {</span> |
| <span class="source-line-no">271</span><span id="line-271"> this.cell = cell;</span> |
| <span class="source-line-no">272</span><span id="line-272"> }</span> |
| <span class="source-line-no">273</span><span id="line-273"></span> |
| <span class="source-line-no">274</span><span id="line-274"> @Override</span> |
| <span class="source-line-no">275</span><span id="line-275"> public T getKey() {</span> |
| <span class="source-line-no">276</span><span id="line-276"> return cell;</span> |
| <span class="source-line-no">277</span><span id="line-277"> }</span> |
| <span class="source-line-no">278</span><span id="line-278"></span> |
| <span class="source-line-no">279</span><span id="line-279"> @Override</span> |
| <span class="source-line-no">280</span><span id="line-280"> public T getValue() {</span> |
| <span class="source-line-no">281</span><span id="line-281"> return cell;</span> |
| <span class="source-line-no">282</span><span id="line-282"> }</span> |
| <span class="source-line-no">283</span><span id="line-283"></span> |
| <span class="source-line-no">284</span><span id="line-284"> @Override</span> |
| <span class="source-line-no">285</span><span id="line-285"> public T setValue(T value) {</span> |
| <span class="source-line-no">286</span><span id="line-286"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">287</span><span id="line-287"> }</span> |
| <span class="source-line-no">288</span><span id="line-288"> }</span> |
| <span class="source-line-no">289</span><span id="line-289"></span> |
| <span class="source-line-no">290</span><span id="line-290"> @Override</span> |
| <span class="source-line-no">291</span><span id="line-291"> public Entry<T, T> lowerEntry(T k) {</span> |
| <span class="source-line-no">292</span><span id="line-292"> T cell = lowerKey(k);</span> |
| <span class="source-line-no">293</span><span id="line-293"> if (cell == null) {</span> |
| <span class="source-line-no">294</span><span id="line-294"> return null;</span> |
| <span class="source-line-no">295</span><span id="line-295"> }</span> |
| <span class="source-line-no">296</span><span id="line-296"> return new CellFlatMapEntry<>(cell);</span> |
| <span class="source-line-no">297</span><span id="line-297"> }</span> |
| <span class="source-line-no">298</span><span id="line-298"></span> |
| <span class="source-line-no">299</span><span id="line-299"> @Override</span> |
| <span class="source-line-no">300</span><span id="line-300"> public Entry<T, T> higherEntry(T k) {</span> |
| <span class="source-line-no">301</span><span id="line-301"> T cell = higherKey(k);</span> |
| <span class="source-line-no">302</span><span id="line-302"> if (cell == null) {</span> |
| <span class="source-line-no">303</span><span id="line-303"> return null;</span> |
| <span class="source-line-no">304</span><span id="line-304"> }</span> |
| <span class="source-line-no">305</span><span id="line-305"> return new CellFlatMapEntry<>(cell);</span> |
| <span class="source-line-no">306</span><span id="line-306"> }</span> |
| <span class="source-line-no">307</span><span id="line-307"></span> |
| <span class="source-line-no">308</span><span id="line-308"> @Override</span> |
| <span class="source-line-no">309</span><span id="line-309"> public Entry<T, T> ceilingEntry(T k) {</span> |
| <span class="source-line-no">310</span><span id="line-310"> T cell = ceilingKey(k);</span> |
| <span class="source-line-no">311</span><span id="line-311"> if (cell == null) {</span> |
| <span class="source-line-no">312</span><span id="line-312"> return null;</span> |
| <span class="source-line-no">313</span><span id="line-313"> }</span> |
| <span class="source-line-no">314</span><span id="line-314"> return new CellFlatMapEntry<>(cell);</span> |
| <span class="source-line-no">315</span><span id="line-315"> }</span> |
| <span class="source-line-no">316</span><span id="line-316"></span> |
| <span class="source-line-no">317</span><span id="line-317"> @Override</span> |
| <span class="source-line-no">318</span><span id="line-318"> public Entry<T, T> floorEntry(T k) {</span> |
| <span class="source-line-no">319</span><span id="line-319"> T cell = floorKey(k);</span> |
| <span class="source-line-no">320</span><span id="line-320"> if (cell == null) {</span> |
| <span class="source-line-no">321</span><span id="line-321"> return null;</span> |
| <span class="source-line-no">322</span><span id="line-322"> }</span> |
| <span class="source-line-no">323</span><span id="line-323"> return new CellFlatMapEntry<>(cell);</span> |
| <span class="source-line-no">324</span><span id="line-324"> }</span> |
| <span class="source-line-no">325</span><span id="line-325"></span> |
| <span class="source-line-no">326</span><span id="line-326"> @Override</span> |
| <span class="source-line-no">327</span><span id="line-327"> public Entry<T, T> firstEntry() {</span> |
| <span class="source-line-no">328</span><span id="line-328"> T cell = firstKey();</span> |
| <span class="source-line-no">329</span><span id="line-329"> if (cell == null) {</span> |
| <span class="source-line-no">330</span><span id="line-330"> return null;</span> |
| <span class="source-line-no">331</span><span id="line-331"> }</span> |
| <span class="source-line-no">332</span><span id="line-332"> return new CellFlatMapEntry<>(cell);</span> |
| <span class="source-line-no">333</span><span id="line-333"> }</span> |
| <span class="source-line-no">334</span><span id="line-334"></span> |
| <span class="source-line-no">335</span><span id="line-335"> @Override</span> |
| <span class="source-line-no">336</span><span id="line-336"> public Entry<T, T> lastEntry() {</span> |
| <span class="source-line-no">337</span><span id="line-337"> T cell = lastKey();</span> |
| <span class="source-line-no">338</span><span id="line-338"> if (cell == null) {</span> |
| <span class="source-line-no">339</span><span id="line-339"> return null;</span> |
| <span class="source-line-no">340</span><span id="line-340"> }</span> |
| <span class="source-line-no">341</span><span id="line-341"> return new CellFlatMapEntry<>(cell);</span> |
| <span class="source-line-no">342</span><span id="line-342"> }</span> |
| <span class="source-line-no">343</span><span id="line-343"></span> |
| <span class="source-line-no">344</span><span id="line-344"> // The following 2 methods (pollFirstEntry, pollLastEntry) are unsupported because these are</span> |
| <span class="source-line-no">345</span><span id="line-345"> // updating methods.</span> |
| <span class="source-line-no">346</span><span id="line-346"> @Override</span> |
| <span class="source-line-no">347</span><span id="line-347"> public Entry<T, T> pollFirstEntry() {</span> |
| <span class="source-line-no">348</span><span id="line-348"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">349</span><span id="line-349"> }</span> |
| <span class="source-line-no">350</span><span id="line-350"></span> |
| <span class="source-line-no">351</span><span id="line-351"> @Override</span> |
| <span class="source-line-no">352</span><span id="line-352"> public Entry<T, T> pollLastEntry() {</span> |
| <span class="source-line-no">353</span><span id="line-353"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">354</span><span id="line-354"> }</span> |
| <span class="source-line-no">355</span><span id="line-355"></span> |
| <span class="source-line-no">356</span><span id="line-356"> // -------------------------------- Updates --------------------------------</span> |
| <span class="source-line-no">357</span><span id="line-357"> // All updating methods below are unsupported.</span> |
| <span class="source-line-no">358</span><span id="line-358"> // Assuming an array of Cells will be allocated externally,</span> |
| <span class="source-line-no">359</span><span id="line-359"> // fill up with Cells and provided in construction time.</span> |
| <span class="source-line-no">360</span><span id="line-360"> // Later the structure is immutable.</span> |
| <span class="source-line-no">361</span><span id="line-361"> @Override</span> |
| <span class="source-line-no">362</span><span id="line-362"> public T put(T k, T v) {</span> |
| <span class="source-line-no">363</span><span id="line-363"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">364</span><span id="line-364"> }</span> |
| <span class="source-line-no">365</span><span id="line-365"></span> |
| <span class="source-line-no">366</span><span id="line-366"> @Override</span> |
| <span class="source-line-no">367</span><span id="line-367"> public void clear() {</span> |
| <span class="source-line-no">368</span><span id="line-368"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">369</span><span id="line-369"> }</span> |
| <span class="source-line-no">370</span><span id="line-370"></span> |
| <span class="source-line-no">371</span><span id="line-371"> @Override</span> |
| <span class="source-line-no">372</span><span id="line-372"> public T remove(Object o) {</span> |
| <span class="source-line-no">373</span><span id="line-373"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">374</span><span id="line-374"> }</span> |
| <span class="source-line-no">375</span><span id="line-375"></span> |
| <span class="source-line-no">376</span><span id="line-376"> @Override</span> |
| <span class="source-line-no">377</span><span id="line-377"> public void putAll(Map<? extends T, ? extends T> map) {</span> |
| <span class="source-line-no">378</span><span id="line-378"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">379</span><span id="line-379"> }</span> |
| <span class="source-line-no">380</span><span id="line-380"></span> |
| <span class="source-line-no">381</span><span id="line-381"> // -------------------------------- Sub-Sets --------------------------------</span> |
| <span class="source-line-no">382</span><span id="line-382"> @Override</span> |
| <span class="source-line-no">383</span><span id="line-383"> public NavigableSet<T> navigableKeySet() {</span> |
| <span class="source-line-no">384</span><span id="line-384"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">385</span><span id="line-385"> }</span> |
| <span class="source-line-no">386</span><span id="line-386"></span> |
| <span class="source-line-no">387</span><span id="line-387"> @Override</span> |
| <span class="source-line-no">388</span><span id="line-388"> public NavigableSet<T> descendingKeySet() {</span> |
| <span class="source-line-no">389</span><span id="line-389"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">390</span><span id="line-390"> }</span> |
| <span class="source-line-no">391</span><span id="line-391"></span> |
| <span class="source-line-no">392</span><span id="line-392"> @Override</span> |
| <span class="source-line-no">393</span><span id="line-393"> public NavigableSet<T> keySet() {</span> |
| <span class="source-line-no">394</span><span id="line-394"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">395</span><span id="line-395"> }</span> |
| <span class="source-line-no">396</span><span id="line-396"></span> |
| <span class="source-line-no">397</span><span id="line-397"> @Override</span> |
| <span class="source-line-no">398</span><span id="line-398"> public Collection<T> values() {</span> |
| <span class="source-line-no">399</span><span id="line-399"> return new CellFlatMapCollection();</span> |
| <span class="source-line-no">400</span><span id="line-400"> }</span> |
| <span class="source-line-no">401</span><span id="line-401"></span> |
| <span class="source-line-no">402</span><span id="line-402"> @Override</span> |
| <span class="source-line-no">403</span><span id="line-403"> public Set<Entry<T, T>> entrySet() {</span> |
| <span class="source-line-no">404</span><span id="line-404"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">405</span><span id="line-405"> }</span> |
| <span class="source-line-no">406</span><span id="line-406"></span> |
| <span class="source-line-no">407</span><span id="line-407"> // -------------------------------- Iterator K --------------------------------</span> |
| <span class="source-line-no">408</span><span id="line-408"> private final class CellFlatMapIterator implements Iterator<T> {</span> |
| <span class="source-line-no">409</span><span id="line-409"> int index;</span> |
| <span class="source-line-no">410</span><span id="line-410"></span> |
| <span class="source-line-no">411</span><span id="line-411"> private CellFlatMapIterator() {</span> |
| <span class="source-line-no">412</span><span id="line-412"> index = descending ? maxCellIdx - 1 : minCellIdx;</span> |
| <span class="source-line-no">413</span><span id="line-413"> }</span> |
| <span class="source-line-no">414</span><span id="line-414"></span> |
| <span class="source-line-no">415</span><span id="line-415"> @Override</span> |
| <span class="source-line-no">416</span><span id="line-416"> public boolean hasNext() {</span> |
| <span class="source-line-no">417</span><span id="line-417"> return descending ? (index >= minCellIdx) : (index < maxCellIdx);</span> |
| <span class="source-line-no">418</span><span id="line-418"> }</span> |
| <span class="source-line-no">419</span><span id="line-419"></span> |
| <span class="source-line-no">420</span><span id="line-420"> @Override</span> |
| <span class="source-line-no">421</span><span id="line-421"> public T next() {</span> |
| <span class="source-line-no">422</span><span id="line-422"> T result = getCell(index);</span> |
| <span class="source-line-no">423</span><span id="line-423"> if (descending) {</span> |
| <span class="source-line-no">424</span><span id="line-424"> index--;</span> |
| <span class="source-line-no">425</span><span id="line-425"> } else {</span> |
| <span class="source-line-no">426</span><span id="line-426"> index++;</span> |
| <span class="source-line-no">427</span><span id="line-427"> }</span> |
| <span class="source-line-no">428</span><span id="line-428"> return result;</span> |
| <span class="source-line-no">429</span><span id="line-429"> }</span> |
| <span class="source-line-no">430</span><span id="line-430"></span> |
| <span class="source-line-no">431</span><span id="line-431"> @Override</span> |
| <span class="source-line-no">432</span><span id="line-432"> public void remove() {</span> |
| <span class="source-line-no">433</span><span id="line-433"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">434</span><span id="line-434"> }</span> |
| <span class="source-line-no">435</span><span id="line-435"> }</span> |
| <span class="source-line-no">436</span><span id="line-436"></span> |
| <span class="source-line-no">437</span><span id="line-437"> // -------------------------------- Collection --------------------------------</span> |
| <span class="source-line-no">438</span><span id="line-438"> private final class CellFlatMapCollection implements Collection<T> {</span> |
| <span class="source-line-no">439</span><span id="line-439"></span> |
| <span class="source-line-no">440</span><span id="line-440"> @Override</span> |
| <span class="source-line-no">441</span><span id="line-441"> public int size() {</span> |
| <span class="source-line-no">442</span><span id="line-442"> return CellFlatMap.this.size();</span> |
| <span class="source-line-no">443</span><span id="line-443"> }</span> |
| <span class="source-line-no">444</span><span id="line-444"></span> |
| <span class="source-line-no">445</span><span id="line-445"> @Override</span> |
| <span class="source-line-no">446</span><span id="line-446"> public boolean isEmpty() {</span> |
| <span class="source-line-no">447</span><span id="line-447"> return CellFlatMap.this.isEmpty();</span> |
| <span class="source-line-no">448</span><span id="line-448"> }</span> |
| <span class="source-line-no">449</span><span id="line-449"></span> |
| <span class="source-line-no">450</span><span id="line-450"> @Override</span> |
| <span class="source-line-no">451</span><span id="line-451"> public void clear() {</span> |
| <span class="source-line-no">452</span><span id="line-452"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">453</span><span id="line-453"> }</span> |
| <span class="source-line-no">454</span><span id="line-454"></span> |
| <span class="source-line-no">455</span><span id="line-455"> @Override</span> |
| <span class="source-line-no">456</span><span id="line-456"> public boolean contains(Object o) {</span> |
| <span class="source-line-no">457</span><span id="line-457"> return containsKey(o);</span> |
| <span class="source-line-no">458</span><span id="line-458"> }</span> |
| <span class="source-line-no">459</span><span id="line-459"></span> |
| <span class="source-line-no">460</span><span id="line-460"> @Override</span> |
| <span class="source-line-no">461</span><span id="line-461"> public Iterator<T> iterator() {</span> |
| <span class="source-line-no">462</span><span id="line-462"> return new CellFlatMapIterator();</span> |
| <span class="source-line-no">463</span><span id="line-463"> }</span> |
| <span class="source-line-no">464</span><span id="line-464"></span> |
| <span class="source-line-no">465</span><span id="line-465"> @Override</span> |
| <span class="source-line-no">466</span><span id="line-466"> public Object[] toArray() {</span> |
| <span class="source-line-no">467</span><span id="line-467"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">468</span><span id="line-468"> }</span> |
| <span class="source-line-no">469</span><span id="line-469"></span> |
| <span class="source-line-no">470</span><span id="line-470"> @Override</span> |
| <span class="source-line-no">471</span><span id="line-471"> public <T> T[] toArray(T[] ts) {</span> |
| <span class="source-line-no">472</span><span id="line-472"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">473</span><span id="line-473"> }</span> |
| <span class="source-line-no">474</span><span id="line-474"></span> |
| <span class="source-line-no">475</span><span id="line-475"> @Override</span> |
| <span class="source-line-no">476</span><span id="line-476"> public boolean add(T k) {</span> |
| <span class="source-line-no">477</span><span id="line-477"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">478</span><span id="line-478"> }</span> |
| <span class="source-line-no">479</span><span id="line-479"></span> |
| <span class="source-line-no">480</span><span id="line-480"> @Override</span> |
| <span class="source-line-no">481</span><span id="line-481"> public boolean remove(Object o) {</span> |
| <span class="source-line-no">482</span><span id="line-482"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">483</span><span id="line-483"> }</span> |
| <span class="source-line-no">484</span><span id="line-484"></span> |
| <span class="source-line-no">485</span><span id="line-485"> @Override</span> |
| <span class="source-line-no">486</span><span id="line-486"> public boolean containsAll(Collection<?> collection) {</span> |
| <span class="source-line-no">487</span><span id="line-487"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">488</span><span id="line-488"> }</span> |
| <span class="source-line-no">489</span><span id="line-489"></span> |
| <span class="source-line-no">490</span><span id="line-490"> @Override</span> |
| <span class="source-line-no">491</span><span id="line-491"> public boolean addAll(Collection<? extends T> collection) {</span> |
| <span class="source-line-no">492</span><span id="line-492"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">493</span><span id="line-493"> }</span> |
| <span class="source-line-no">494</span><span id="line-494"></span> |
| <span class="source-line-no">495</span><span id="line-495"> @Override</span> |
| <span class="source-line-no">496</span><span id="line-496"> public boolean removeAll(Collection<?> collection) {</span> |
| <span class="source-line-no">497</span><span id="line-497"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">498</span><span id="line-498"> }</span> |
| <span class="source-line-no">499</span><span id="line-499"></span> |
| <span class="source-line-no">500</span><span id="line-500"> @Override</span> |
| <span class="source-line-no">501</span><span id="line-501"> public boolean retainAll(Collection<?> collection) {</span> |
| <span class="source-line-no">502</span><span id="line-502"> throw new UnsupportedOperationException();</span> |
| <span class="source-line-no">503</span><span id="line-503"> }</span> |
| <span class="source-line-no">504</span><span id="line-504"> }</span> |
| <span class="source-line-no">505</span><span id="line-505">}</span> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </pre> |
| </div> |
| </main> |
| </body> |
| </html> |
