| <!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, class: CellComparatorImpl"> |
| <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;</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.Comparator;</span> |
| <span class="source-line-no">021</span><span id="line-21">import org.apache.hadoop.hbase.util.ByteBufferUtils;</span> |
| <span class="source-line-no">022</span><span id="line-22">import org.apache.hadoop.hbase.util.Bytes;</span> |
| <span class="source-line-no">023</span><span id="line-23">import org.apache.yetus.audience.InterfaceAudience;</span> |
| <span class="source-line-no">024</span><span id="line-24">import org.apache.yetus.audience.InterfaceStability;</span> |
| <span class="source-line-no">025</span><span id="line-25"></span> |
| <span class="source-line-no">026</span><span id="line-26">/**</span> |
| <span class="source-line-no">027</span><span id="line-27"> * Compare two HBase cells. Do not use this method comparing <code>-ROOT-</code> or</span> |
| <span class="source-line-no">028</span><span id="line-28"> * <code>hbase:meta</code> cells. Cells from these tables need a specialized comparator, one that</span> |
| <span class="source-line-no">029</span><span id="line-29"> * takes account of the special formatting of the row where we have commas to delimit table from</span> |
| <span class="source-line-no">030</span><span id="line-30"> * regionname, from row. See KeyValue for how it has a special comparator to do hbase:meta cells and</span> |
| <span class="source-line-no">031</span><span id="line-31"> * yet another for -ROOT-.</span> |
| <span class="source-line-no">032</span><span id="line-32"> * <p></span> |
| <span class="source-line-no">033</span><span id="line-33"> * While using this comparator for {{@link #compareRows(Cell, Cell)} et al, the hbase:meta cells</span> |
| <span class="source-line-no">034</span><span id="line-34"> * format should be taken into consideration, for which the instance of this comparator should be</span> |
| <span class="source-line-no">035</span><span id="line-35"> * used. In all other cases the static APIs in this comparator would be enough</span> |
| <span class="source-line-no">036</span><span id="line-36"> * <p></span> |
| <span class="source-line-no">037</span><span id="line-37"> * HOT methods. We spend a good portion of CPU comparing. Anything that makes the compare faster</span> |
| <span class="source-line-no">038</span><span id="line-38"> * will likely manifest at the macro level.</span> |
| <span class="source-line-no">039</span><span id="line-39"> * </p></span> |
| <span class="source-line-no">040</span><span id="line-40"> */</span> |
| <span class="source-line-no">041</span><span id="line-41">@edu.umd.cs.findbugs.annotations.SuppressWarnings(value = "UNKNOWN",</span> |
| <span class="source-line-no">042</span><span id="line-42"> justification = "Findbugs doesn't like the way we are negating the result of"</span> |
| <span class="source-line-no">043</span><span id="line-43"> + " a compare in below")</span> |
| <span class="source-line-no">044</span><span id="line-44">@InterfaceAudience.Private</span> |
| <span class="source-line-no">045</span><span id="line-45">@InterfaceStability.Evolving</span> |
| <span class="source-line-no">046</span><span id="line-46">public class CellComparatorImpl implements CellComparator {</span> |
| <span class="source-line-no">047</span><span id="line-47"></span> |
| <span class="source-line-no">048</span><span id="line-48"> private static final long serialVersionUID = 8186411895799094989L;</span> |
| <span class="source-line-no">049</span><span id="line-49"></span> |
| <span class="source-line-no">050</span><span id="line-50"> /**</span> |
| <span class="source-line-no">051</span><span id="line-51"> * Comparator for plain key/values; i.e. non-catalog table key/values. Works on Key portion of</span> |
| <span class="source-line-no">052</span><span id="line-52"> * KeyValue only.</span> |
| <span class="source-line-no">053</span><span id="line-53"> */</span> |
| <span class="source-line-no">054</span><span id="line-54"> public static final CellComparatorImpl COMPARATOR = new CellComparatorImpl();</span> |
| <span class="source-line-no">055</span><span id="line-55"></span> |
| <span class="source-line-no">056</span><span id="line-56"> @Override</span> |
| <span class="source-line-no">057</span><span id="line-57"> public final int compare(final Cell a, final Cell b) {</span> |
| <span class="source-line-no">058</span><span id="line-58"> return compare(a, b, false);</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"> @Override</span> |
| <span class="source-line-no">062</span><span id="line-62"> public int compare(final Cell l, final Cell r, boolean ignoreSequenceid) {</span> |
| <span class="source-line-no">063</span><span id="line-63"> int diff = 0;</span> |
| <span class="source-line-no">064</span><span id="line-64"> // "Peel off" the most common path.</span> |
| <span class="source-line-no">065</span><span id="line-65"> if (l instanceof KeyValue && r instanceof KeyValue) {</span> |
| <span class="source-line-no">066</span><span id="line-66"> diff = compareKeyValues((KeyValue) l, (KeyValue) r);</span> |
| <span class="source-line-no">067</span><span id="line-67"> if (diff != 0) {</span> |
| <span class="source-line-no">068</span><span id="line-68"> return diff;</span> |
| <span class="source-line-no">069</span><span id="line-69"> }</span> |
| <span class="source-line-no">070</span><span id="line-70"> } else if (l instanceof KeyValue && r instanceof ByteBufferKeyValue) {</span> |
| <span class="source-line-no">071</span><span id="line-71"> diff = compareKVVsBBKV((KeyValue) l, (ByteBufferKeyValue) r);</span> |
| <span class="source-line-no">072</span><span id="line-72"> if (diff != 0) {</span> |
| <span class="source-line-no">073</span><span id="line-73"> return diff;</span> |
| <span class="source-line-no">074</span><span id="line-74"> }</span> |
| <span class="source-line-no">075</span><span id="line-75"> } else if (l instanceof ByteBufferKeyValue && r instanceof KeyValue) {</span> |
| <span class="source-line-no">076</span><span id="line-76"> diff = compareKVVsBBKV((KeyValue) r, (ByteBufferKeyValue) l);</span> |
| <span class="source-line-no">077</span><span id="line-77"> if (diff != 0) {</span> |
| <span class="source-line-no">078</span><span id="line-78"> // negate- Findbugs will complain?</span> |
| <span class="source-line-no">079</span><span id="line-79"> return -diff;</span> |
| <span class="source-line-no">080</span><span id="line-80"> }</span> |
| <span class="source-line-no">081</span><span id="line-81"> } else if (l instanceof ByteBufferKeyValue && r instanceof ByteBufferKeyValue) {</span> |
| <span class="source-line-no">082</span><span id="line-82"> diff = compareBBKV((ByteBufferKeyValue) l, (ByteBufferKeyValue) r);</span> |
| <span class="source-line-no">083</span><span id="line-83"> if (diff != 0) {</span> |
| <span class="source-line-no">084</span><span id="line-84"> return diff;</span> |
| <span class="source-line-no">085</span><span id="line-85"> }</span> |
| <span class="source-line-no">086</span><span id="line-86"> } else {</span> |
| <span class="source-line-no">087</span><span id="line-87"> int leftRowLength = l.getRowLength();</span> |
| <span class="source-line-no">088</span><span id="line-88"> int rightRowLength = r.getRowLength();</span> |
| <span class="source-line-no">089</span><span id="line-89"> diff = compareRows(l, leftRowLength, r, rightRowLength);</span> |
| <span class="source-line-no">090</span><span id="line-90"> if (diff != 0) {</span> |
| <span class="source-line-no">091</span><span id="line-91"> return diff;</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"> diff = compareWithoutRow(l, r);</span> |
| <span class="source-line-no">095</span><span id="line-95"> if (diff != 0) {</span> |
| <span class="source-line-no">096</span><span id="line-96"> return diff;</span> |
| <span class="source-line-no">097</span><span id="line-97"> }</span> |
| <span class="source-line-no">098</span><span id="line-98"> }</span> |
| <span class="source-line-no">099</span><span id="line-99"></span> |
| <span class="source-line-no">100</span><span id="line-100"> if (ignoreSequenceid) {</span> |
| <span class="source-line-no">101</span><span id="line-101"> return diff;</span> |
| <span class="source-line-no">102</span><span id="line-102"> }</span> |
| <span class="source-line-no">103</span><span id="line-103"> // Negate following comparisons so later edits show up first mvccVersion: later sorts first</span> |
| <span class="source-line-no">104</span><span id="line-104"> return Long.compare(PrivateCellUtil.getSequenceId(r), PrivateCellUtil.getSequenceId(l));</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"> private int compareKeyValues(final KeyValue left, final KeyValue right) {</span> |
| <span class="source-line-no">108</span><span id="line-108"> int diff;</span> |
| <span class="source-line-no">109</span><span id="line-109"> // Compare Rows. Cache row length.</span> |
| <span class="source-line-no">110</span><span id="line-110"> int leftRowLength = left.getRowLength();</span> |
| <span class="source-line-no">111</span><span id="line-111"> int rightRowLength = right.getRowLength();</span> |
| <span class="source-line-no">112</span><span id="line-112"> diff = Bytes.compareTo(left.getRowArray(), left.getRowOffset(), leftRowLength,</span> |
| <span class="source-line-no">113</span><span id="line-113"> right.getRowArray(), right.getRowOffset(), rightRowLength);</span> |
| <span class="source-line-no">114</span><span id="line-114"> if (diff != 0) {</span> |
| <span class="source-line-no">115</span><span id="line-115"> return diff;</span> |
| <span class="source-line-no">116</span><span id="line-116"> }</span> |
| <span class="source-line-no">117</span><span id="line-117"></span> |
| <span class="source-line-no">118</span><span id="line-118"> // If the column is not specified, the "minimum" key type appears as latest in the sorted</span> |
| <span class="source-line-no">119</span><span id="line-119"> // order, regardless of the timestamp. This is used for specifying the last key/value in a</span> |
| <span class="source-line-no">120</span><span id="line-120"> // given row, because there is no "lexicographically last column" (it would be infinitely</span> |
| <span class="source-line-no">121</span><span id="line-121"> // long).</span> |
| <span class="source-line-no">122</span><span id="line-122"> // The "maximum" key type does not need this behavior. Copied from KeyValue. This is bad in</span> |
| <span class="source-line-no">123</span><span id="line-123"> // that</span> |
| <span class="source-line-no">124</span><span id="line-124"> // we can't do memcmp w/ special rules like this.</span> |
| <span class="source-line-no">125</span><span id="line-125"> // TODO: Is there a test for this behavior?</span> |
| <span class="source-line-no">126</span><span id="line-126"> int leftFamilyLengthPosition = left.getFamilyLengthPosition(leftRowLength);</span> |
| <span class="source-line-no">127</span><span id="line-127"> int leftFamilyLength = left.getFamilyLength(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">128</span><span id="line-128"> int leftKeyLength = left.getKeyLength();</span> |
| <span class="source-line-no">129</span><span id="line-129"> int leftQualifierLength =</span> |
| <span class="source-line-no">130</span><span id="line-130"> left.getQualifierLength(leftKeyLength, leftRowLength, leftFamilyLength);</span> |
| <span class="source-line-no">131</span><span id="line-131"></span> |
| <span class="source-line-no">132</span><span id="line-132"> // No need of left row length below here.</span> |
| <span class="source-line-no">133</span><span id="line-133"></span> |
| <span class="source-line-no">134</span><span id="line-134"> byte leftType = left.getTypeByte(leftKeyLength);</span> |
| <span class="source-line-no">135</span><span id="line-135"> if (</span> |
| <span class="source-line-no">136</span><span id="line-136"> leftType == KeyValue.Type.Minimum.getCode() && leftFamilyLength + leftQualifierLength == 0</span> |
| <span class="source-line-no">137</span><span id="line-137"> ) {</span> |
| <span class="source-line-no">138</span><span id="line-138"> // left is "bigger", i.e. it appears later in the sorted order</span> |
| <span class="source-line-no">139</span><span id="line-139"> return 1;</span> |
| <span class="source-line-no">140</span><span id="line-140"> }</span> |
| <span class="source-line-no">141</span><span id="line-141"></span> |
| <span class="source-line-no">142</span><span id="line-142"> int rightFamilyLengthPosition = right.getFamilyLengthPosition(rightRowLength);</span> |
| <span class="source-line-no">143</span><span id="line-143"> int rightFamilyLength = right.getFamilyLength(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">144</span><span id="line-144"> int rightKeyLength = right.getKeyLength();</span> |
| <span class="source-line-no">145</span><span id="line-145"> int rightQualifierLength =</span> |
| <span class="source-line-no">146</span><span id="line-146"> right.getQualifierLength(rightKeyLength, rightRowLength, rightFamilyLength);</span> |
| <span class="source-line-no">147</span><span id="line-147"></span> |
| <span class="source-line-no">148</span><span id="line-148"> // No need of right row length below here.</span> |
| <span class="source-line-no">149</span><span id="line-149"></span> |
| <span class="source-line-no">150</span><span id="line-150"> byte rightType = right.getTypeByte(rightKeyLength);</span> |
| <span class="source-line-no">151</span><span id="line-151"> if (</span> |
| <span class="source-line-no">152</span><span id="line-152"> rightType == KeyValue.Type.Minimum.getCode() && rightFamilyLength + rightQualifierLength == 0</span> |
| <span class="source-line-no">153</span><span id="line-153"> ) {</span> |
| <span class="source-line-no">154</span><span id="line-154"> return -1;</span> |
| <span class="source-line-no">155</span><span id="line-155"> }</span> |
| <span class="source-line-no">156</span><span id="line-156"></span> |
| <span class="source-line-no">157</span><span id="line-157"> // Compare families.</span> |
| <span class="source-line-no">158</span><span id="line-158"> int leftFamilyPosition = left.getFamilyOffset(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">159</span><span id="line-159"> int rightFamilyPosition = right.getFamilyOffset(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">160</span><span id="line-160"> diff = compareFamilies(left, leftFamilyPosition, leftFamilyLength, right, rightFamilyPosition,</span> |
| <span class="source-line-no">161</span><span id="line-161"> rightFamilyLength);</span> |
| <span class="source-line-no">162</span><span id="line-162"> if (diff != 0) {</span> |
| <span class="source-line-no">163</span><span id="line-163"> return diff;</span> |
| <span class="source-line-no">164</span><span id="line-164"> }</span> |
| <span class="source-line-no">165</span><span id="line-165"></span> |
| <span class="source-line-no">166</span><span id="line-166"> // Compare qualifiers</span> |
| <span class="source-line-no">167</span><span id="line-167"> diff = Bytes.compareTo(left.getQualifierArray(),</span> |
| <span class="source-line-no">168</span><span id="line-168"> left.getQualifierOffset(leftFamilyPosition, leftFamilyLength), leftQualifierLength,</span> |
| <span class="source-line-no">169</span><span id="line-169"> right.getQualifierArray(), right.getQualifierOffset(rightFamilyPosition, rightFamilyLength),</span> |
| <span class="source-line-no">170</span><span id="line-170"> rightQualifierLength);</span> |
| <span class="source-line-no">171</span><span id="line-171"> if (diff != 0) {</span> |
| <span class="source-line-no">172</span><span id="line-172"> return diff;</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"> // Timestamps.</span> |
| <span class="source-line-no">176</span><span id="line-176"> // Swap order we pass into compare so we get DESCENDING order.</span> |
| <span class="source-line-no">177</span><span id="line-177"> // TODO : Ensure we read the bytes and do the compare instead of the value.</span> |
| <span class="source-line-no">178</span><span id="line-178"> diff = Long.compare(right.getTimestamp(rightKeyLength), left.getTimestamp(leftKeyLength));</span> |
| <span class="source-line-no">179</span><span id="line-179"> if (diff != 0) {</span> |
| <span class="source-line-no">180</span><span id="line-180"> return diff;</span> |
| <span class="source-line-no">181</span><span id="line-181"> }</span> |
| <span class="source-line-no">182</span><span id="line-182"></span> |
| <span class="source-line-no">183</span><span id="line-183"> // Compare types. Let the delete types sort ahead of puts; i.e. types</span> |
| <span class="source-line-no">184</span><span id="line-184"> // of higher numbers sort before those of lesser numbers. Maximum (255)</span> |
| <span class="source-line-no">185</span><span id="line-185"> // appears ahead of everything, and minimum (0) appears after</span> |
| <span class="source-line-no">186</span><span id="line-186"> // everything.</span> |
| <span class="source-line-no">187</span><span id="line-187"> return (0xff & rightType) - (0xff & leftType);</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"> private int compareBBKV(final ByteBufferKeyValue left, final ByteBufferKeyValue right) {</span> |
| <span class="source-line-no">191</span><span id="line-191"> int diff;</span> |
| <span class="source-line-no">192</span><span id="line-192"> // Compare Rows. Cache row length.</span> |
| <span class="source-line-no">193</span><span id="line-193"> int leftRowLength = left.getRowLength();</span> |
| <span class="source-line-no">194</span><span id="line-194"> int rightRowLength = right.getRowLength();</span> |
| <span class="source-line-no">195</span><span id="line-195"> diff = ByteBufferUtils.compareTo(left.getRowByteBuffer(), left.getRowPosition(), leftRowLength,</span> |
| <span class="source-line-no">196</span><span id="line-196"> right.getRowByteBuffer(), right.getRowPosition(), rightRowLength);</span> |
| <span class="source-line-no">197</span><span id="line-197"> if (diff != 0) {</span> |
| <span class="source-line-no">198</span><span id="line-198"> return diff;</span> |
| <span class="source-line-no">199</span><span id="line-199"> }</span> |
| <span class="source-line-no">200</span><span id="line-200"></span> |
| <span class="source-line-no">201</span><span id="line-201"> // If the column is not specified, the "minimum" key type appears as latest in the sorted</span> |
| <span class="source-line-no">202</span><span id="line-202"> // order, regardless of the timestamp. This is used for specifying the last key/value in a</span> |
| <span class="source-line-no">203</span><span id="line-203"> // given row, because there is no "lexicographically last column" (it would be infinitely</span> |
| <span class="source-line-no">204</span><span id="line-204"> // long).</span> |
| <span class="source-line-no">205</span><span id="line-205"> // The "maximum" key type does not need this behavior. Copied from KeyValue. This is bad in</span> |
| <span class="source-line-no">206</span><span id="line-206"> // that</span> |
| <span class="source-line-no">207</span><span id="line-207"> // we can't do memcmp w/ special rules like this.</span> |
| <span class="source-line-no">208</span><span id="line-208"> // TODO: Is there a test for this behavior?</span> |
| <span class="source-line-no">209</span><span id="line-209"> int leftFamilyLengthPosition = left.getFamilyLengthPosition(leftRowLength);</span> |
| <span class="source-line-no">210</span><span id="line-210"> int leftFamilyLength = left.getFamilyLength(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">211</span><span id="line-211"> int leftKeyLength = left.getKeyLength();</span> |
| <span class="source-line-no">212</span><span id="line-212"> int leftQualifierLength =</span> |
| <span class="source-line-no">213</span><span id="line-213"> left.getQualifierLength(leftKeyLength, leftRowLength, leftFamilyLength);</span> |
| <span class="source-line-no">214</span><span id="line-214"></span> |
| <span class="source-line-no">215</span><span id="line-215"> // No need of left row length below here.</span> |
| <span class="source-line-no">216</span><span id="line-216"></span> |
| <span class="source-line-no">217</span><span id="line-217"> byte leftType = left.getTypeByte(leftKeyLength);</span> |
| <span class="source-line-no">218</span><span id="line-218"> if (</span> |
| <span class="source-line-no">219</span><span id="line-219"> leftType == KeyValue.Type.Minimum.getCode() && leftFamilyLength + leftQualifierLength == 0</span> |
| <span class="source-line-no">220</span><span id="line-220"> ) {</span> |
| <span class="source-line-no">221</span><span id="line-221"> // left is "bigger", i.e. it appears later in the sorted order</span> |
| <span class="source-line-no">222</span><span id="line-222"> return 1;</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"> int rightFamilyLengthPosition = right.getFamilyLengthPosition(rightRowLength);</span> |
| <span class="source-line-no">226</span><span id="line-226"> int rightFamilyLength = right.getFamilyLength(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">227</span><span id="line-227"> int rightKeyLength = right.getKeyLength();</span> |
| <span class="source-line-no">228</span><span id="line-228"> int rightQualifierLength =</span> |
| <span class="source-line-no">229</span><span id="line-229"> right.getQualifierLength(rightKeyLength, rightRowLength, rightFamilyLength);</span> |
| <span class="source-line-no">230</span><span id="line-230"></span> |
| <span class="source-line-no">231</span><span id="line-231"> // No need of right row length below here.</span> |
| <span class="source-line-no">232</span><span id="line-232"></span> |
| <span class="source-line-no">233</span><span id="line-233"> byte rightType = right.getTypeByte(rightKeyLength);</span> |
| <span class="source-line-no">234</span><span id="line-234"> if (</span> |
| <span class="source-line-no">235</span><span id="line-235"> rightType == KeyValue.Type.Minimum.getCode() && rightFamilyLength + rightQualifierLength == 0</span> |
| <span class="source-line-no">236</span><span id="line-236"> ) {</span> |
| <span class="source-line-no">237</span><span id="line-237"> return -1;</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"> // Compare families.</span> |
| <span class="source-line-no">241</span><span id="line-241"> int leftFamilyPosition = left.getFamilyPosition(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">242</span><span id="line-242"> int rightFamilyPosition = right.getFamilyPosition(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">243</span><span id="line-243"> diff = compareFamilies(left, leftFamilyPosition, leftFamilyLength, right, rightFamilyPosition,</span> |
| <span class="source-line-no">244</span><span id="line-244"> rightFamilyLength);</span> |
| <span class="source-line-no">245</span><span id="line-245"> if (diff != 0) {</span> |
| <span class="source-line-no">246</span><span id="line-246"> return diff;</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"> // Compare qualifiers</span> |
| <span class="source-line-no">250</span><span id="line-250"> diff = ByteBufferUtils.compareTo(left.getQualifierByteBuffer(),</span> |
| <span class="source-line-no">251</span><span id="line-251"> left.getQualifierPosition(leftFamilyPosition, leftFamilyLength), leftQualifierLength,</span> |
| <span class="source-line-no">252</span><span id="line-252"> right.getQualifierByteBuffer(),</span> |
| <span class="source-line-no">253</span><span id="line-253"> right.getQualifierPosition(rightFamilyPosition, rightFamilyLength), rightQualifierLength);</span> |
| <span class="source-line-no">254</span><span id="line-254"> if (diff != 0) {</span> |
| <span class="source-line-no">255</span><span id="line-255"> return diff;</span> |
| <span class="source-line-no">256</span><span id="line-256"> }</span> |
| <span class="source-line-no">257</span><span id="line-257"></span> |
| <span class="source-line-no">258</span><span id="line-258"> // Timestamps.</span> |
| <span class="source-line-no">259</span><span id="line-259"> // Swap order we pass into compare so we get DESCENDING order.</span> |
| <span class="source-line-no">260</span><span id="line-260"> diff = Long.compare(right.getTimestamp(rightKeyLength), left.getTimestamp(leftKeyLength));</span> |
| <span class="source-line-no">261</span><span id="line-261"> if (diff != 0) {</span> |
| <span class="source-line-no">262</span><span id="line-262"> return diff;</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"> // Compare types. Let the delete types sort ahead of puts; i.e. types</span> |
| <span class="source-line-no">266</span><span id="line-266"> // of higher numbers sort before those of lesser numbers. Maximum (255)</span> |
| <span class="source-line-no">267</span><span id="line-267"> // appears ahead of everything, and minimum (0) appears after</span> |
| <span class="source-line-no">268</span><span id="line-268"> // everything.</span> |
| <span class="source-line-no">269</span><span id="line-269"> return (0xff & rightType) - (0xff & leftType);</span> |
| <span class="source-line-no">270</span><span id="line-270"> }</span> |
| <span class="source-line-no">271</span><span id="line-271"></span> |
| <span class="source-line-no">272</span><span id="line-272"> private int compareKVVsBBKV(final KeyValue left, final ByteBufferKeyValue right) {</span> |
| <span class="source-line-no">273</span><span id="line-273"> int diff;</span> |
| <span class="source-line-no">274</span><span id="line-274"> // Compare Rows. Cache row length.</span> |
| <span class="source-line-no">275</span><span id="line-275"> int leftRowLength = left.getRowLength();</span> |
| <span class="source-line-no">276</span><span id="line-276"> int rightRowLength = right.getRowLength();</span> |
| <span class="source-line-no">277</span><span id="line-277"> diff = ByteBufferUtils.compareTo(left.getRowArray(), left.getRowOffset(), leftRowLength,</span> |
| <span class="source-line-no">278</span><span id="line-278"> right.getRowByteBuffer(), right.getRowPosition(), rightRowLength);</span> |
| <span class="source-line-no">279</span><span id="line-279"> if (diff != 0) {</span> |
| <span class="source-line-no">280</span><span id="line-280"> return diff;</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> |
| <span class="source-line-no">283</span><span id="line-283"> // If the column is not specified, the "minimum" key type appears as latest in the sorted</span> |
| <span class="source-line-no">284</span><span id="line-284"> // order, regardless of the timestamp. This is used for specifying the last key/value in a</span> |
| <span class="source-line-no">285</span><span id="line-285"> // given row, because there is no "lexicographically last column" (it would be infinitely</span> |
| <span class="source-line-no">286</span><span id="line-286"> // long).</span> |
| <span class="source-line-no">287</span><span id="line-287"> // The "maximum" key type does not need this behavior. Copied from KeyValue. This is bad in</span> |
| <span class="source-line-no">288</span><span id="line-288"> // that</span> |
| <span class="source-line-no">289</span><span id="line-289"> // we can't do memcmp w/ special rules like this.</span> |
| <span class="source-line-no">290</span><span id="line-290"> // TODO: Is there a test for this behavior?</span> |
| <span class="source-line-no">291</span><span id="line-291"> int leftFamilyLengthPosition = left.getFamilyLengthPosition(leftRowLength);</span> |
| <span class="source-line-no">292</span><span id="line-292"> int leftFamilyLength = left.getFamilyLength(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">293</span><span id="line-293"> int leftKeyLength = left.getKeyLength();</span> |
| <span class="source-line-no">294</span><span id="line-294"> int leftQualifierLength =</span> |
| <span class="source-line-no">295</span><span id="line-295"> left.getQualifierLength(leftKeyLength, leftRowLength, leftFamilyLength);</span> |
| <span class="source-line-no">296</span><span id="line-296"></span> |
| <span class="source-line-no">297</span><span id="line-297"> // No need of left row length below here.</span> |
| <span class="source-line-no">298</span><span id="line-298"></span> |
| <span class="source-line-no">299</span><span id="line-299"> byte leftType = left.getTypeByte(leftKeyLength);</span> |
| <span class="source-line-no">300</span><span id="line-300"> if (</span> |
| <span class="source-line-no">301</span><span id="line-301"> leftType == KeyValue.Type.Minimum.getCode() && leftFamilyLength + leftQualifierLength == 0</span> |
| <span class="source-line-no">302</span><span id="line-302"> ) {</span> |
| <span class="source-line-no">303</span><span id="line-303"> // left is "bigger", i.e. it appears later in the sorted order</span> |
| <span class="source-line-no">304</span><span id="line-304"> return 1;</span> |
| <span class="source-line-no">305</span><span id="line-305"> }</span> |
| <span class="source-line-no">306</span><span id="line-306"></span> |
| <span class="source-line-no">307</span><span id="line-307"> int rightFamilyLengthPosition = right.getFamilyLengthPosition(rightRowLength);</span> |
| <span class="source-line-no">308</span><span id="line-308"> int rightFamilyLength = right.getFamilyLength(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">309</span><span id="line-309"> int rightKeyLength = right.getKeyLength();</span> |
| <span class="source-line-no">310</span><span id="line-310"> int rightQualifierLength =</span> |
| <span class="source-line-no">311</span><span id="line-311"> right.getQualifierLength(rightKeyLength, rightRowLength, rightFamilyLength);</span> |
| <span class="source-line-no">312</span><span id="line-312"></span> |
| <span class="source-line-no">313</span><span id="line-313"> // No need of right row length below here.</span> |
| <span class="source-line-no">314</span><span id="line-314"></span> |
| <span class="source-line-no">315</span><span id="line-315"> byte rightType = right.getTypeByte(rightKeyLength);</span> |
| <span class="source-line-no">316</span><span id="line-316"> if (</span> |
| <span class="source-line-no">317</span><span id="line-317"> rightType == KeyValue.Type.Minimum.getCode() && rightFamilyLength + rightQualifierLength == 0</span> |
| <span class="source-line-no">318</span><span id="line-318"> ) {</span> |
| <span class="source-line-no">319</span><span id="line-319"> return -1;</span> |
| <span class="source-line-no">320</span><span id="line-320"> }</span> |
| <span class="source-line-no">321</span><span id="line-321"></span> |
| <span class="source-line-no">322</span><span id="line-322"> // Compare families.</span> |
| <span class="source-line-no">323</span><span id="line-323"> int leftFamilyPosition = left.getFamilyOffset(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">324</span><span id="line-324"> int rightFamilyPosition = right.getFamilyPosition(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">325</span><span id="line-325"> diff = compareFamilies(left, leftFamilyPosition, leftFamilyLength, right, rightFamilyPosition,</span> |
| <span class="source-line-no">326</span><span id="line-326"> rightFamilyLength);</span> |
| <span class="source-line-no">327</span><span id="line-327"> if (diff != 0) {</span> |
| <span class="source-line-no">328</span><span id="line-328"> return diff;</span> |
| <span class="source-line-no">329</span><span id="line-329"> }</span> |
| <span class="source-line-no">330</span><span id="line-330"></span> |
| <span class="source-line-no">331</span><span id="line-331"> // Compare qualifiers</span> |
| <span class="source-line-no">332</span><span id="line-332"> diff = ByteBufferUtils.compareTo(left.getQualifierArray(),</span> |
| <span class="source-line-no">333</span><span id="line-333"> left.getQualifierOffset(leftFamilyPosition, leftFamilyLength), leftQualifierLength,</span> |
| <span class="source-line-no">334</span><span id="line-334"> right.getQualifierByteBuffer(),</span> |
| <span class="source-line-no">335</span><span id="line-335"> right.getQualifierPosition(rightFamilyPosition, rightFamilyLength), rightQualifierLength);</span> |
| <span class="source-line-no">336</span><span id="line-336"> if (diff != 0) {</span> |
| <span class="source-line-no">337</span><span id="line-337"> return diff;</span> |
| <span class="source-line-no">338</span><span id="line-338"> }</span> |
| <span class="source-line-no">339</span><span id="line-339"></span> |
| <span class="source-line-no">340</span><span id="line-340"> // Timestamps.</span> |
| <span class="source-line-no">341</span><span id="line-341"> // Swap order we pass into compare so we get DESCENDING order.</span> |
| <span class="source-line-no">342</span><span id="line-342"> diff = Long.compare(right.getTimestamp(rightKeyLength), left.getTimestamp(leftKeyLength));</span> |
| <span class="source-line-no">343</span><span id="line-343"> if (diff != 0) {</span> |
| <span class="source-line-no">344</span><span id="line-344"> return diff;</span> |
| <span class="source-line-no">345</span><span id="line-345"> }</span> |
| <span class="source-line-no">346</span><span id="line-346"></span> |
| <span class="source-line-no">347</span><span id="line-347"> // Compare types. Let the delete types sort ahead of puts; i.e. types</span> |
| <span class="source-line-no">348</span><span id="line-348"> // of higher numbers sort before those of lesser numbers. Maximum (255)</span> |
| <span class="source-line-no">349</span><span id="line-349"> // appears ahead of everything, and minimum (0) appears after</span> |
| <span class="source-line-no">350</span><span id="line-350"> // everything.</span> |
| <span class="source-line-no">351</span><span id="line-351"> return (0xff & rightType) - (0xff & leftType);</span> |
| <span class="source-line-no">352</span><span id="line-352"> }</span> |
| <span class="source-line-no">353</span><span id="line-353"></span> |
| <span class="source-line-no">354</span><span id="line-354"> /**</span> |
| <span class="source-line-no">355</span><span id="line-355"> * Compares the family and qualifier part of the cell</span> |
| <span class="source-line-no">356</span><span id="line-356"> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise</span> |
| <span class="source-line-no">357</span><span id="line-357"> */</span> |
| <span class="source-line-no">358</span><span id="line-358"> public final int compareColumns(final Cell left, final Cell right) {</span> |
| <span class="source-line-no">359</span><span id="line-359"> int diff = compareFamilies(left, right);</span> |
| <span class="source-line-no">360</span><span id="line-360"> if (diff != 0) {</span> |
| <span class="source-line-no">361</span><span id="line-361"> return diff;</span> |
| <span class="source-line-no">362</span><span id="line-362"> }</span> |
| <span class="source-line-no">363</span><span id="line-363"> return compareQualifiers(left, right);</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"> private int compareColumns(final Cell left, final int leftFamLen, final int leftQualLen,</span> |
| <span class="source-line-no">367</span><span id="line-367"> final Cell right, final int rightFamLen, final int rightQualLen) {</span> |
| <span class="source-line-no">368</span><span id="line-368"> int diff = compareFamilies(left, leftFamLen, right, rightFamLen);</span> |
| <span class="source-line-no">369</span><span id="line-369"> if (diff != 0) {</span> |
| <span class="source-line-no">370</span><span id="line-370"> return diff;</span> |
| <span class="source-line-no">371</span><span id="line-371"> }</span> |
| <span class="source-line-no">372</span><span id="line-372"> return compareQualifiers(left, leftQualLen, right, rightQualLen);</span> |
| <span class="source-line-no">373</span><span id="line-373"> }</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"> * This method will be overridden when we compare cells inner store to bypass family comparing.</span> |
| <span class="source-line-no">377</span><span id="line-377"> */</span> |
| <span class="source-line-no">378</span><span id="line-378"> protected int compareFamilies(Cell left, int leftFamLen, Cell right, int rightFamLen) {</span> |
| <span class="source-line-no">379</span><span id="line-379"> if (left instanceof ByteBufferExtendedCell && right instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">380</span><span id="line-380"> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getFamilyByteBuffer(),</span> |
| <span class="source-line-no">381</span><span id="line-381"> ((ByteBufferExtendedCell) left).getFamilyPosition(), leftFamLen,</span> |
| <span class="source-line-no">382</span><span id="line-382"> ((ByteBufferExtendedCell) right).getFamilyByteBuffer(),</span> |
| <span class="source-line-no">383</span><span id="line-383"> ((ByteBufferExtendedCell) right).getFamilyPosition(), rightFamLen);</span> |
| <span class="source-line-no">384</span><span id="line-384"> }</span> |
| <span class="source-line-no">385</span><span id="line-385"> if (left instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">386</span><span id="line-386"> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getFamilyByteBuffer(),</span> |
| <span class="source-line-no">387</span><span id="line-387"> ((ByteBufferExtendedCell) left).getFamilyPosition(), leftFamLen, right.getFamilyArray(),</span> |
| <span class="source-line-no">388</span><span id="line-388"> right.getFamilyOffset(), rightFamLen);</span> |
| <span class="source-line-no">389</span><span id="line-389"> }</span> |
| <span class="source-line-no">390</span><span id="line-390"> if (right instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">391</span><span id="line-391"> // Notice how we flip the order of the compare here. We used to negate the return value but</span> |
| <span class="source-line-no">392</span><span id="line-392"> // see what FindBugs says</span> |
| <span class="source-line-no">393</span><span id="line-393"> // http://findbugs.sourceforge.net/bugDescriptions.html#RV_NEGATING_RESULT_OF_COMPARETO</span> |
| <span class="source-line-no">394</span><span id="line-394"> // It suggest flipping the order to get same effect and 'safer'.</span> |
| <span class="source-line-no">395</span><span id="line-395"> return ByteBufferUtils.compareTo(left.getFamilyArray(), left.getFamilyOffset(), leftFamLen,</span> |
| <span class="source-line-no">396</span><span id="line-396"> ((ByteBufferExtendedCell) right).getFamilyByteBuffer(),</span> |
| <span class="source-line-no">397</span><span id="line-397"> ((ByteBufferExtendedCell) right).getFamilyPosition(), rightFamLen);</span> |
| <span class="source-line-no">398</span><span id="line-398"> }</span> |
| <span class="source-line-no">399</span><span id="line-399"> return Bytes.compareTo(left.getFamilyArray(), left.getFamilyOffset(), leftFamLen,</span> |
| <span class="source-line-no">400</span><span id="line-400"> right.getFamilyArray(), right.getFamilyOffset(), rightFamLen);</span> |
| <span class="source-line-no">401</span><span id="line-401"> }</span> |
| <span class="source-line-no">402</span><span id="line-402"></span> |
| <span class="source-line-no">403</span><span id="line-403"> private final int compareQualifiers(Cell left, int leftQualLen, Cell right, int rightQualLen) {</span> |
| <span class="source-line-no">404</span><span id="line-404"> if (left instanceof ByteBufferExtendedCell && right instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">405</span><span id="line-405"> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getQualifierByteBuffer(),</span> |
| <span class="source-line-no">406</span><span id="line-406"> ((ByteBufferExtendedCell) left).getQualifierPosition(), leftQualLen,</span> |
| <span class="source-line-no">407</span><span id="line-407"> ((ByteBufferExtendedCell) right).getQualifierByteBuffer(),</span> |
| <span class="source-line-no">408</span><span id="line-408"> ((ByteBufferExtendedCell) right).getQualifierPosition(), rightQualLen);</span> |
| <span class="source-line-no">409</span><span id="line-409"> }</span> |
| <span class="source-line-no">410</span><span id="line-410"> if (left instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">411</span><span id="line-411"> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getQualifierByteBuffer(),</span> |
| <span class="source-line-no">412</span><span id="line-412"> ((ByteBufferExtendedCell) left).getQualifierPosition(), leftQualLen,</span> |
| <span class="source-line-no">413</span><span id="line-413"> right.getQualifierArray(), right.getQualifierOffset(), rightQualLen);</span> |
| <span class="source-line-no">414</span><span id="line-414"> }</span> |
| <span class="source-line-no">415</span><span id="line-415"> if (right instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">416</span><span id="line-416"> // Notice how we flip the order of the compare here. We used to negate the return value but</span> |
| <span class="source-line-no">417</span><span id="line-417"> // see what FindBugs says</span> |
| <span class="source-line-no">418</span><span id="line-418"> // http://findbugs.sourceforge.net/bugDescriptions.html#RV_NEGATING_RESULT_OF_COMPARETO</span> |
| <span class="source-line-no">419</span><span id="line-419"> // It suggest flipping the order to get same effect and 'safer'.</span> |
| <span class="source-line-no">420</span><span id="line-420"> return ByteBufferUtils.compareTo(left.getQualifierArray(), left.getQualifierOffset(),</span> |
| <span class="source-line-no">421</span><span id="line-421"> leftQualLen, ((ByteBufferExtendedCell) right).getQualifierByteBuffer(),</span> |
| <span class="source-line-no">422</span><span id="line-422"> ((ByteBufferExtendedCell) right).getQualifierPosition(), rightQualLen);</span> |
| <span class="source-line-no">423</span><span id="line-423"> }</span> |
| <span class="source-line-no">424</span><span id="line-424"> return Bytes.compareTo(left.getQualifierArray(), left.getQualifierOffset(), leftQualLen,</span> |
| <span class="source-line-no">425</span><span id="line-425"> right.getQualifierArray(), right.getQualifierOffset(), rightQualLen);</span> |
| <span class="source-line-no">426</span><span id="line-426"> }</span> |
| <span class="source-line-no">427</span><span id="line-427"></span> |
| <span class="source-line-no">428</span><span id="line-428"> /**</span> |
| <span class="source-line-no">429</span><span id="line-429"> * Compare the families of left and right cell</span> |
| <span class="source-line-no">430</span><span id="line-430"> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise</span> |
| <span class="source-line-no">431</span><span id="line-431"> */</span> |
| <span class="source-line-no">432</span><span id="line-432"> @Override</span> |
| <span class="source-line-no">433</span><span id="line-433"> public final int compareFamilies(Cell left, Cell right) {</span> |
| <span class="source-line-no">434</span><span id="line-434"> if (left instanceof ByteBufferExtendedCell && right instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">435</span><span id="line-435"> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getFamilyByteBuffer(),</span> |
| <span class="source-line-no">436</span><span id="line-436"> ((ByteBufferExtendedCell) left).getFamilyPosition(), left.getFamilyLength(),</span> |
| <span class="source-line-no">437</span><span id="line-437"> ((ByteBufferExtendedCell) right).getFamilyByteBuffer(),</span> |
| <span class="source-line-no">438</span><span id="line-438"> ((ByteBufferExtendedCell) right).getFamilyPosition(), right.getFamilyLength());</span> |
| <span class="source-line-no">439</span><span id="line-439"> }</span> |
| <span class="source-line-no">440</span><span id="line-440"> if (left instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">441</span><span id="line-441"> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getFamilyByteBuffer(),</span> |
| <span class="source-line-no">442</span><span id="line-442"> ((ByteBufferExtendedCell) left).getFamilyPosition(), left.getFamilyLength(),</span> |
| <span class="source-line-no">443</span><span id="line-443"> right.getFamilyArray(), right.getFamilyOffset(), right.getFamilyLength());</span> |
| <span class="source-line-no">444</span><span id="line-444"> }</span> |
| <span class="source-line-no">445</span><span id="line-445"> if (right instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">446</span><span id="line-446"> // Notice how we flip the order of the compare here. We used to negate the return value but</span> |
| <span class="source-line-no">447</span><span id="line-447"> // see what FindBugs says</span> |
| <span class="source-line-no">448</span><span id="line-448"> // http://findbugs.sourceforge.net/bugDescriptions.html#RV_NEGATING_RESULT_OF_COMPARETO</span> |
| <span class="source-line-no">449</span><span id="line-449"> // It suggest flipping the order to get same effect and 'safer'.</span> |
| <span class="source-line-no">450</span><span id="line-450"> return ByteBufferUtils.compareTo(left.getFamilyArray(), left.getFamilyOffset(),</span> |
| <span class="source-line-no">451</span><span id="line-451"> left.getFamilyLength(), ((ByteBufferExtendedCell) right).getFamilyByteBuffer(),</span> |
| <span class="source-line-no">452</span><span id="line-452"> ((ByteBufferExtendedCell) right).getFamilyPosition(), right.getFamilyLength());</span> |
| <span class="source-line-no">453</span><span id="line-453"> }</span> |
| <span class="source-line-no">454</span><span id="line-454"> return Bytes.compareTo(left.getFamilyArray(), left.getFamilyOffset(), left.getFamilyLength(),</span> |
| <span class="source-line-no">455</span><span id="line-455"> right.getFamilyArray(), right.getFamilyOffset(), right.getFamilyLength());</span> |
| <span class="source-line-no">456</span><span id="line-456"> }</span> |
| <span class="source-line-no">457</span><span id="line-457"></span> |
| <span class="source-line-no">458</span><span id="line-458"> /**</span> |
| <span class="source-line-no">459</span><span id="line-459"> * This method will be overridden when we compare cells inner store to bypass family comparing.</span> |
| <span class="source-line-no">460</span><span id="line-460"> */</span> |
| <span class="source-line-no">461</span><span id="line-461"> protected int compareFamilies(KeyValue left, int leftFamilyPosition, int leftFamilyLength,</span> |
| <span class="source-line-no">462</span><span id="line-462"> KeyValue right, int rightFamilyPosition, int rightFamilyLength) {</span> |
| <span class="source-line-no">463</span><span id="line-463"> return Bytes.compareTo(left.getFamilyArray(), leftFamilyPosition, leftFamilyLength,</span> |
| <span class="source-line-no">464</span><span id="line-464"> right.getFamilyArray(), rightFamilyPosition, rightFamilyLength);</span> |
| <span class="source-line-no">465</span><span id="line-465"> }</span> |
| <span class="source-line-no">466</span><span id="line-466"></span> |
| <span class="source-line-no">467</span><span id="line-467"> /**</span> |
| <span class="source-line-no">468</span><span id="line-468"> * This method will be overridden when we compare cells inner store to bypass family comparing.</span> |
| <span class="source-line-no">469</span><span id="line-469"> */</span> |
| <span class="source-line-no">470</span><span id="line-470"> protected int compareFamilies(ByteBufferKeyValue left, int leftFamilyPosition,</span> |
| <span class="source-line-no">471</span><span id="line-471"> int leftFamilyLength, ByteBufferKeyValue right, int rightFamilyPosition,</span> |
| <span class="source-line-no">472</span><span id="line-472"> int rightFamilyLength) {</span> |
| <span class="source-line-no">473</span><span id="line-473"> return ByteBufferUtils.compareTo(left.getFamilyByteBuffer(), leftFamilyPosition,</span> |
| <span class="source-line-no">474</span><span id="line-474"> leftFamilyLength, right.getFamilyByteBuffer(), rightFamilyPosition, rightFamilyLength);</span> |
| <span class="source-line-no">475</span><span id="line-475"> }</span> |
| <span class="source-line-no">476</span><span id="line-476"></span> |
| <span class="source-line-no">477</span><span id="line-477"> /**</span> |
| <span class="source-line-no">478</span><span id="line-478"> * This method will be overridden when we compare cells inner store to bypass family comparing.</span> |
| <span class="source-line-no">479</span><span id="line-479"> */</span> |
| <span class="source-line-no">480</span><span id="line-480"> protected int compareFamilies(KeyValue left, int leftFamilyPosition, int leftFamilyLength,</span> |
| <span class="source-line-no">481</span><span id="line-481"> ByteBufferKeyValue right, int rightFamilyPosition, int rightFamilyLength) {</span> |
| <span class="source-line-no">482</span><span id="line-482"> return ByteBufferUtils.compareTo(left.getFamilyArray(), leftFamilyPosition, leftFamilyLength,</span> |
| <span class="source-line-no">483</span><span id="line-483"> right.getFamilyByteBuffer(), rightFamilyPosition, rightFamilyLength);</span> |
| <span class="source-line-no">484</span><span id="line-484"> }</span> |
| <span class="source-line-no">485</span><span id="line-485"></span> |
| <span class="source-line-no">486</span><span id="line-486"> static int compareQualifiers(KeyValue left, KeyValue right) {</span> |
| <span class="source-line-no">487</span><span id="line-487"> // NOTE: Same method is in CellComparatorImpl, also private, not shared, intentionally. Not</span> |
| <span class="source-line-no">488</span><span id="line-488"> // sharing gets us a few percent more throughput in compares. If changes here or there, make</span> |
| <span class="source-line-no">489</span><span id="line-489"> // sure done in both places.</span> |
| <span class="source-line-no">490</span><span id="line-490"> // Compare Rows. Cache row length.</span> |
| <span class="source-line-no">491</span><span id="line-491"> int leftRowLength = left.getRowLength();</span> |
| <span class="source-line-no">492</span><span id="line-492"> int rightRowLength = right.getRowLength();</span> |
| <span class="source-line-no">493</span><span id="line-493"></span> |
| <span class="source-line-no">494</span><span id="line-494"> int leftFamilyLengthPosition = left.getFamilyLengthPosition(leftRowLength);</span> |
| <span class="source-line-no">495</span><span id="line-495"> byte leftFamilyLength = left.getFamilyLength(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">496</span><span id="line-496"> int leftKeyLength = left.getKeyLength();</span> |
| <span class="source-line-no">497</span><span id="line-497"> int leftQualifierLength =</span> |
| <span class="source-line-no">498</span><span id="line-498"> left.getQualifierLength(leftKeyLength, leftRowLength, leftFamilyLength);</span> |
| <span class="source-line-no">499</span><span id="line-499"></span> |
| <span class="source-line-no">500</span><span id="line-500"> // No need of left row length below here.</span> |
| <span class="source-line-no">501</span><span id="line-501"></span> |
| <span class="source-line-no">502</span><span id="line-502"> int rightFamilyLengthPosition = right.getFamilyLengthPosition(rightRowLength);</span> |
| <span class="source-line-no">503</span><span id="line-503"> byte rightFamilyLength = right.getFamilyLength(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">504</span><span id="line-504"> int rightKeyLength = right.getKeyLength();</span> |
| <span class="source-line-no">505</span><span id="line-505"> int rightQualifierLength =</span> |
| <span class="source-line-no">506</span><span id="line-506"> right.getQualifierLength(rightKeyLength, rightRowLength, rightFamilyLength);</span> |
| <span class="source-line-no">507</span><span id="line-507"></span> |
| <span class="source-line-no">508</span><span id="line-508"> // Compare families.</span> |
| <span class="source-line-no">509</span><span id="line-509"> int leftFamilyOffset = left.getFamilyOffset(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">510</span><span id="line-510"> int rightFamilyOffset = right.getFamilyOffset(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">511</span><span id="line-511"></span> |
| <span class="source-line-no">512</span><span id="line-512"> // Compare qualifiers</span> |
| <span class="source-line-no">513</span><span id="line-513"> return Bytes.compareTo(left.getQualifierArray(), leftFamilyOffset + leftFamilyLength,</span> |
| <span class="source-line-no">514</span><span id="line-514"> leftQualifierLength, right.getQualifierArray(), rightFamilyOffset + rightFamilyLength,</span> |
| <span class="source-line-no">515</span><span id="line-515"> rightQualifierLength);</span> |
| <span class="source-line-no">516</span><span id="line-516"> }</span> |
| <span class="source-line-no">517</span><span id="line-517"></span> |
| <span class="source-line-no">518</span><span id="line-518"> static int compareQualifiers(KeyValue left, ByteBufferKeyValue right) {</span> |
| <span class="source-line-no">519</span><span id="line-519"> // NOTE: Same method is in CellComparatorImpl, also private, not shared, intentionally. Not</span> |
| <span class="source-line-no">520</span><span id="line-520"> // sharing gets us a few percent more throughput in compares. If changes here or there, make</span> |
| <span class="source-line-no">521</span><span id="line-521"> // sure done in both places.</span> |
| <span class="source-line-no">522</span><span id="line-522"> // Compare Rows. Cache row length.</span> |
| <span class="source-line-no">523</span><span id="line-523"> int leftRowLength = left.getRowLength();</span> |
| <span class="source-line-no">524</span><span id="line-524"> int rightRowLength = right.getRowLength();</span> |
| <span class="source-line-no">525</span><span id="line-525"></span> |
| <span class="source-line-no">526</span><span id="line-526"> int leftFamilyLengthPosition = left.getFamilyLengthPosition(leftRowLength);</span> |
| <span class="source-line-no">527</span><span id="line-527"> byte leftFamilyLength = left.getFamilyLength(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">528</span><span id="line-528"> int leftKeyLength = left.getKeyLength();</span> |
| <span class="source-line-no">529</span><span id="line-529"> int leftQualifierLength =</span> |
| <span class="source-line-no">530</span><span id="line-530"> left.getQualifierLength(leftKeyLength, leftRowLength, leftFamilyLength);</span> |
| <span class="source-line-no">531</span><span id="line-531"></span> |
| <span class="source-line-no">532</span><span id="line-532"> // No need of left row length below here.</span> |
| <span class="source-line-no">533</span><span id="line-533"></span> |
| <span class="source-line-no">534</span><span id="line-534"> int rightFamilyLengthPosition = right.getFamilyLengthPosition(rightRowLength);</span> |
| <span class="source-line-no">535</span><span id="line-535"> byte rightFamilyLength = right.getFamilyLength(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">536</span><span id="line-536"> int rightKeyLength = right.getKeyLength();</span> |
| <span class="source-line-no">537</span><span id="line-537"> int rightQualifierLength =</span> |
| <span class="source-line-no">538</span><span id="line-538"> right.getQualifierLength(rightKeyLength, rightRowLength, rightFamilyLength);</span> |
| <span class="source-line-no">539</span><span id="line-539"></span> |
| <span class="source-line-no">540</span><span id="line-540"> // Compare families.</span> |
| <span class="source-line-no">541</span><span id="line-541"> int leftFamilyOffset = left.getFamilyOffset(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">542</span><span id="line-542"> int rightFamilyPosition = right.getFamilyPosition(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">543</span><span id="line-543"></span> |
| <span class="source-line-no">544</span><span id="line-544"> // Compare qualifiers</span> |
| <span class="source-line-no">545</span><span id="line-545"> return ByteBufferUtils.compareTo(left.getQualifierArray(), leftFamilyOffset + leftFamilyLength,</span> |
| <span class="source-line-no">546</span><span id="line-546"> leftQualifierLength, right.getQualifierByteBuffer(), rightFamilyPosition + rightFamilyLength,</span> |
| <span class="source-line-no">547</span><span id="line-547"> rightQualifierLength);</span> |
| <span class="source-line-no">548</span><span id="line-548"> }</span> |
| <span class="source-line-no">549</span><span id="line-549"></span> |
| <span class="source-line-no">550</span><span id="line-550"> static int compareQualifiers(ByteBufferKeyValue left, KeyValue right) {</span> |
| <span class="source-line-no">551</span><span id="line-551"> // NOTE: Same method is in CellComparatorImpl, also private, not shared, intentionally. Not</span> |
| <span class="source-line-no">552</span><span id="line-552"> // sharing gets us a few percent more throughput in compares. If changes here or there, make</span> |
| <span class="source-line-no">553</span><span id="line-553"> // sure done in both places.</span> |
| <span class="source-line-no">554</span><span id="line-554"> // Compare Rows. Cache row length.</span> |
| <span class="source-line-no">555</span><span id="line-555"> int leftRowLength = left.getRowLength();</span> |
| <span class="source-line-no">556</span><span id="line-556"> int rightRowLength = right.getRowLength();</span> |
| <span class="source-line-no">557</span><span id="line-557"></span> |
| <span class="source-line-no">558</span><span id="line-558"> int leftFamilyLengthPosition = left.getFamilyLengthPosition(leftRowLength);</span> |
| <span class="source-line-no">559</span><span id="line-559"> byte leftFamilyLength = left.getFamilyLength(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">560</span><span id="line-560"> int leftKeyLength = left.getKeyLength();</span> |
| <span class="source-line-no">561</span><span id="line-561"> int leftQualifierLength =</span> |
| <span class="source-line-no">562</span><span id="line-562"> left.getQualifierLength(leftKeyLength, leftRowLength, leftFamilyLength);</span> |
| <span class="source-line-no">563</span><span id="line-563"></span> |
| <span class="source-line-no">564</span><span id="line-564"> // No need of left row length below here.</span> |
| <span class="source-line-no">565</span><span id="line-565"></span> |
| <span class="source-line-no">566</span><span id="line-566"> int rightFamilyLengthPosition = right.getFamilyLengthPosition(rightRowLength);</span> |
| <span class="source-line-no">567</span><span id="line-567"> byte rightFamilyLength = right.getFamilyLength(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">568</span><span id="line-568"> int rightKeyLength = right.getKeyLength();</span> |
| <span class="source-line-no">569</span><span id="line-569"> int rightQualifierLength =</span> |
| <span class="source-line-no">570</span><span id="line-570"> right.getQualifierLength(rightKeyLength, rightRowLength, rightFamilyLength);</span> |
| <span class="source-line-no">571</span><span id="line-571"></span> |
| <span class="source-line-no">572</span><span id="line-572"> // Compare families.</span> |
| <span class="source-line-no">573</span><span id="line-573"> int leftFamilyPosition = left.getFamilyPosition(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">574</span><span id="line-574"> int rightFamilyOffset = right.getFamilyOffset(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">575</span><span id="line-575"></span> |
| <span class="source-line-no">576</span><span id="line-576"> // Compare qualifiers</span> |
| <span class="source-line-no">577</span><span id="line-577"> return ByteBufferUtils.compareTo(left.getQualifierByteBuffer(),</span> |
| <span class="source-line-no">578</span><span id="line-578"> leftFamilyPosition + leftFamilyLength, leftQualifierLength, right.getQualifierArray(),</span> |
| <span class="source-line-no">579</span><span id="line-579"> rightFamilyOffset + rightFamilyLength, rightQualifierLength);</span> |
| <span class="source-line-no">580</span><span id="line-580"> }</span> |
| <span class="source-line-no">581</span><span id="line-581"></span> |
| <span class="source-line-no">582</span><span id="line-582"> static int compareQualifiers(ByteBufferKeyValue left, ByteBufferKeyValue right) {</span> |
| <span class="source-line-no">583</span><span id="line-583"> // NOTE: Same method is in CellComparatorImpl, also private, not shared, intentionally. Not</span> |
| <span class="source-line-no">584</span><span id="line-584"> // sharing gets us a few percent more throughput in compares. If changes here or there, make</span> |
| <span class="source-line-no">585</span><span id="line-585"> // sure done in both places.</span> |
| <span class="source-line-no">586</span><span id="line-586"> // Compare Rows. Cache row length.</span> |
| <span class="source-line-no">587</span><span id="line-587"> int leftRowLength = left.getRowLength();</span> |
| <span class="source-line-no">588</span><span id="line-588"> int rightRowLength = right.getRowLength();</span> |
| <span class="source-line-no">589</span><span id="line-589"></span> |
| <span class="source-line-no">590</span><span id="line-590"> int leftFamilyLengthPosition = left.getFamilyLengthPosition(leftRowLength);</span> |
| <span class="source-line-no">591</span><span id="line-591"> byte leftFamilyLength = left.getFamilyLength(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">592</span><span id="line-592"> int leftKeyLength = left.getKeyLength();</span> |
| <span class="source-line-no">593</span><span id="line-593"> int leftQualifierLength =</span> |
| <span class="source-line-no">594</span><span id="line-594"> left.getQualifierLength(leftKeyLength, leftRowLength, leftFamilyLength);</span> |
| <span class="source-line-no">595</span><span id="line-595"></span> |
| <span class="source-line-no">596</span><span id="line-596"> // No need of left row length below here.</span> |
| <span class="source-line-no">597</span><span id="line-597"></span> |
| <span class="source-line-no">598</span><span id="line-598"> int rightFamilyLengthPosition = right.getFamilyLengthPosition(rightRowLength);</span> |
| <span class="source-line-no">599</span><span id="line-599"> byte rightFamilyLength = right.getFamilyLength(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">600</span><span id="line-600"> int rightKeyLength = right.getKeyLength();</span> |
| <span class="source-line-no">601</span><span id="line-601"> int rightQualifierLength =</span> |
| <span class="source-line-no">602</span><span id="line-602"> right.getQualifierLength(rightKeyLength, rightRowLength, rightFamilyLength);</span> |
| <span class="source-line-no">603</span><span id="line-603"></span> |
| <span class="source-line-no">604</span><span id="line-604"> // Compare families.</span> |
| <span class="source-line-no">605</span><span id="line-605"> int leftFamilyPosition = left.getFamilyPosition(leftFamilyLengthPosition);</span> |
| <span class="source-line-no">606</span><span id="line-606"> int rightFamilyPosition = right.getFamilyPosition(rightFamilyLengthPosition);</span> |
| <span class="source-line-no">607</span><span id="line-607"></span> |
| <span class="source-line-no">608</span><span id="line-608"> // Compare qualifiers</span> |
| <span class="source-line-no">609</span><span id="line-609"> return ByteBufferUtils.compareTo(left.getQualifierByteBuffer(),</span> |
| <span class="source-line-no">610</span><span id="line-610"> leftFamilyPosition + leftFamilyLength, leftQualifierLength, right.getQualifierByteBuffer(),</span> |
| <span class="source-line-no">611</span><span id="line-611"> rightFamilyPosition + rightFamilyLength, rightQualifierLength);</span> |
| <span class="source-line-no">612</span><span id="line-612"> }</span> |
| <span class="source-line-no">613</span><span id="line-613"></span> |
| <span class="source-line-no">614</span><span id="line-614"> /**</span> |
| <span class="source-line-no">615</span><span id="line-615"> * Compare the qualifiers part of the left and right cells.</span> |
| <span class="source-line-no">616</span><span id="line-616"> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise</span> |
| <span class="source-line-no">617</span><span id="line-617"> */</span> |
| <span class="source-line-no">618</span><span id="line-618"> @Override</span> |
| <span class="source-line-no">619</span><span id="line-619"> public final int compareQualifiers(Cell left, Cell right) {</span> |
| <span class="source-line-no">620</span><span id="line-620"> if ((left instanceof ByteBufferKeyValue) && (right instanceof ByteBufferKeyValue)) {</span> |
| <span class="source-line-no">621</span><span id="line-621"> return compareQualifiers((ByteBufferKeyValue) left, (ByteBufferKeyValue) right);</span> |
| <span class="source-line-no">622</span><span id="line-622"> } else if ((left instanceof KeyValue) && (right instanceof KeyValue)) {</span> |
| <span class="source-line-no">623</span><span id="line-623"> return compareQualifiers((KeyValue) left, (KeyValue) right);</span> |
| <span class="source-line-no">624</span><span id="line-624"> } else if ((left instanceof KeyValue) && (right instanceof ByteBufferKeyValue)) {</span> |
| <span class="source-line-no">625</span><span id="line-625"> return compareQualifiers((KeyValue) left, (ByteBufferKeyValue) right);</span> |
| <span class="source-line-no">626</span><span id="line-626"> } else if ((left instanceof ByteBufferKeyValue) && (right instanceof KeyValue)) {</span> |
| <span class="source-line-no">627</span><span id="line-627"> return compareQualifiers((ByteBufferKeyValue) left, (KeyValue) right);</span> |
| <span class="source-line-no">628</span><span id="line-628"> } else {</span> |
| <span class="source-line-no">629</span><span id="line-629"> if (left instanceof ByteBufferExtendedCell && right instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">630</span><span id="line-630"> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getQualifierByteBuffer(),</span> |
| <span class="source-line-no">631</span><span id="line-631"> ((ByteBufferExtendedCell) left).getQualifierPosition(), left.getQualifierLength(),</span> |
| <span class="source-line-no">632</span><span id="line-632"> ((ByteBufferExtendedCell) right).getQualifierByteBuffer(),</span> |
| <span class="source-line-no">633</span><span id="line-633"> ((ByteBufferExtendedCell) right).getQualifierPosition(), right.getQualifierLength());</span> |
| <span class="source-line-no">634</span><span id="line-634"> }</span> |
| <span class="source-line-no">635</span><span id="line-635"> if (left instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">636</span><span id="line-636"> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getQualifierByteBuffer(),</span> |
| <span class="source-line-no">637</span><span id="line-637"> ((ByteBufferExtendedCell) left).getQualifierPosition(), left.getQualifierLength(),</span> |
| <span class="source-line-no">638</span><span id="line-638"> right.getQualifierArray(), right.getQualifierOffset(), right.getQualifierLength());</span> |
| <span class="source-line-no">639</span><span id="line-639"> }</span> |
| <span class="source-line-no">640</span><span id="line-640"> if (right instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">641</span><span id="line-641"> // Notice how we flip the order of the compare here. We used to negate the return value but</span> |
| <span class="source-line-no">642</span><span id="line-642"> // see what FindBugs says</span> |
| <span class="source-line-no">643</span><span id="line-643"> // http://findbugs.sourceforge.net/bugDescriptions.html#RV_NEGATING_RESULT_OF_COMPARETO</span> |
| <span class="source-line-no">644</span><span id="line-644"> // It suggest flipping the order to get same effect and 'safer'.</span> |
| <span class="source-line-no">645</span><span id="line-645"> return ByteBufferUtils.compareTo(left.getQualifierArray(), left.getQualifierOffset(),</span> |
| <span class="source-line-no">646</span><span id="line-646"> left.getQualifierLength(), ((ByteBufferExtendedCell) right).getQualifierByteBuffer(),</span> |
| <span class="source-line-no">647</span><span id="line-647"> ((ByteBufferExtendedCell) right).getQualifierPosition(), right.getQualifierLength());</span> |
| <span class="source-line-no">648</span><span id="line-648"> }</span> |
| <span class="source-line-no">649</span><span id="line-649"> return Bytes.compareTo(left.getQualifierArray(), left.getQualifierOffset(),</span> |
| <span class="source-line-no">650</span><span id="line-650"> left.getQualifierLength(), right.getQualifierArray(), right.getQualifierOffset(),</span> |
| <span class="source-line-no">651</span><span id="line-651"> right.getQualifierLength());</span> |
| <span class="source-line-no">652</span><span id="line-652"> }</span> |
| <span class="source-line-no">653</span><span id="line-653"></span> |
| <span class="source-line-no">654</span><span id="line-654"> }</span> |
| <span class="source-line-no">655</span><span id="line-655"></span> |
| <span class="source-line-no">656</span><span id="line-656"> /**</span> |
| <span class="source-line-no">657</span><span id="line-657"> * Compares the rows of the left and right cell. For the hbase:meta case this method is overridden</span> |
| <span class="source-line-no">658</span><span id="line-658"> * such that it can handle hbase:meta cells. The caller should ensure using the appropriate</span> |
| <span class="source-line-no">659</span><span id="line-659"> * comparator for hbase:meta.</span> |
| <span class="source-line-no">660</span><span id="line-660"> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise</span> |
| <span class="source-line-no">661</span><span id="line-661"> */</span> |
| <span class="source-line-no">662</span><span id="line-662"> @Override</span> |
| <span class="source-line-no">663</span><span id="line-663"> public int compareRows(final Cell left, final Cell right) {</span> |
| <span class="source-line-no">664</span><span id="line-664"> return compareRows(left, left.getRowLength(), right, right.getRowLength());</span> |
| <span class="source-line-no">665</span><span id="line-665"> }</span> |
| <span class="source-line-no">666</span><span id="line-666"></span> |
| <span class="source-line-no">667</span><span id="line-667"> static int compareRows(final Cell left, int leftRowLength, final Cell right, int rightRowLength) {</span> |
| <span class="source-line-no">668</span><span id="line-668"> // left and right can be exactly the same at the beginning of a row</span> |
| <span class="source-line-no">669</span><span id="line-669"> if (left == right) {</span> |
| <span class="source-line-no">670</span><span id="line-670"> return 0;</span> |
| <span class="source-line-no">671</span><span id="line-671"> }</span> |
| <span class="source-line-no">672</span><span id="line-672"> if (left instanceof ByteBufferExtendedCell && right instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">673</span><span id="line-673"> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getRowByteBuffer(),</span> |
| <span class="source-line-no">674</span><span id="line-674"> ((ByteBufferExtendedCell) left).getRowPosition(), leftRowLength,</span> |
| <span class="source-line-no">675</span><span id="line-675"> ((ByteBufferExtendedCell) right).getRowByteBuffer(),</span> |
| <span class="source-line-no">676</span><span id="line-676"> ((ByteBufferExtendedCell) right).getRowPosition(), rightRowLength);</span> |
| <span class="source-line-no">677</span><span id="line-677"> }</span> |
| <span class="source-line-no">678</span><span id="line-678"> if (left instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">679</span><span id="line-679"> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getRowByteBuffer(),</span> |
| <span class="source-line-no">680</span><span id="line-680"> ((ByteBufferExtendedCell) left).getRowPosition(), leftRowLength, right.getRowArray(),</span> |
| <span class="source-line-no">681</span><span id="line-681"> right.getRowOffset(), rightRowLength);</span> |
| <span class="source-line-no">682</span><span id="line-682"> }</span> |
| <span class="source-line-no">683</span><span id="line-683"> if (right instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">684</span><span id="line-684"> // Notice how we flip the order of the compare here. We used to negate the return value but</span> |
| <span class="source-line-no">685</span><span id="line-685"> // see what FindBugs says</span> |
| <span class="source-line-no">686</span><span id="line-686"> // http://findbugs.sourceforge.net/bugDescriptions.html#RV_NEGATING_RESULT_OF_COMPARETO</span> |
| <span class="source-line-no">687</span><span id="line-687"> // It suggest flipping the order to get same effect and 'safer'.</span> |
| <span class="source-line-no">688</span><span id="line-688"> return ByteBufferUtils.compareTo(left.getRowArray(), left.getRowOffset(), leftRowLength,</span> |
| <span class="source-line-no">689</span><span id="line-689"> ((ByteBufferExtendedCell) right).getRowByteBuffer(),</span> |
| <span class="source-line-no">690</span><span id="line-690"> ((ByteBufferExtendedCell) right).getRowPosition(), rightRowLength);</span> |
| <span class="source-line-no">691</span><span id="line-691"> }</span> |
| <span class="source-line-no">692</span><span id="line-692"> return Bytes.compareTo(left.getRowArray(), left.getRowOffset(), leftRowLength,</span> |
| <span class="source-line-no">693</span><span id="line-693"> right.getRowArray(), right.getRowOffset(), rightRowLength);</span> |
| <span class="source-line-no">694</span><span id="line-694"> }</span> |
| <span class="source-line-no">695</span><span id="line-695"></span> |
| <span class="source-line-no">696</span><span id="line-696"> /**</span> |
| <span class="source-line-no">697</span><span id="line-697"> * Compares the row part of the cell with a simple plain byte[] like the stopRow in Scan. This</span> |
| <span class="source-line-no">698</span><span id="line-698"> * should be used with context where for hbase:meta cells the</span> |
| <span class="source-line-no">699</span><span id="line-699"> * {{@link MetaCellComparator#META_COMPARATOR} should be used the cell to be compared the kv</span> |
| <span class="source-line-no">700</span><span id="line-700"> * serialized byte[] to be compared with the offset in the byte[] the length in the byte[]</span> |
| <span class="source-line-no">701</span><span id="line-701"> * @return 0 if both cell and the byte[] are equal, 1 if the cell is bigger than byte[], -1</span> |
| <span class="source-line-no">702</span><span id="line-702"> * otherwise</span> |
| <span class="source-line-no">703</span><span id="line-703"> */</span> |
| <span class="source-line-no">704</span><span id="line-704"> @Override</span> |
| <span class="source-line-no">705</span><span id="line-705"> public int compareRows(Cell left, byte[] right, int roffset, int rlength) {</span> |
| <span class="source-line-no">706</span><span id="line-706"> if (left instanceof ByteBufferExtendedCell) {</span> |
| <span class="source-line-no">707</span><span id="line-707"> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getRowByteBuffer(),</span> |
| <span class="source-line-no">708</span><span id="line-708"> ((ByteBufferExtendedCell) left).getRowPosition(), left.getRowLength(), right, roffset,</span> |
| <span class="source-line-no">709</span><span id="line-709"> rlength);</span> |
| <span class="source-line-no">710</span><span id="line-710"> }</span> |
| <span class="source-line-no">711</span><span id="line-711"> return Bytes.compareTo(left.getRowArray(), left.getRowOffset(), left.getRowLength(), right,</span> |
| <span class="source-line-no">712</span><span id="line-712"> roffset, rlength);</span> |
| <span class="source-line-no">713</span><span id="line-713"> }</span> |
| <span class="source-line-no">714</span><span id="line-714"></span> |
| <span class="source-line-no">715</span><span id="line-715"> @Override</span> |
| <span class="source-line-no">716</span><span id="line-716"> public final int compareWithoutRow(final Cell left, final Cell right) {</span> |
| <span class="source-line-no">717</span><span id="line-717"> // If the column is not specified, the "minimum" key type appears the</span> |
| <span class="source-line-no">718</span><span id="line-718"> // latest in the sorted order, regardless of the timestamp. This is used</span> |
| <span class="source-line-no">719</span><span id="line-719"> // for specifying the last key/value in a given row, because there is no</span> |
| <span class="source-line-no">720</span><span id="line-720"> // "lexicographically last column" (it would be infinitely long). The</span> |
| <span class="source-line-no">721</span><span id="line-721"> // "maximum" key type does not need this behavior.</span> |
| <span class="source-line-no">722</span><span id="line-722"> // Copied from KeyValue. This is bad in that we can't do memcmp w/ special rules like this.</span> |
| <span class="source-line-no">723</span><span id="line-723"> int lFamLength = left.getFamilyLength();</span> |
| <span class="source-line-no">724</span><span id="line-724"> int rFamLength = right.getFamilyLength();</span> |
| <span class="source-line-no">725</span><span id="line-725"> int lQualLength = left.getQualifierLength();</span> |
| <span class="source-line-no">726</span><span id="line-726"> int rQualLength = right.getQualifierLength();</span> |
| <span class="source-line-no">727</span><span id="line-727"> byte leftType = PrivateCellUtil.getTypeByte(left);</span> |
| <span class="source-line-no">728</span><span id="line-728"> byte rightType = PrivateCellUtil.getTypeByte(right);</span> |
| <span class="source-line-no">729</span><span id="line-729"> if (lFamLength + lQualLength == 0 && leftType == KeyValue.Type.Minimum.getCode()) {</span> |
| <span class="source-line-no">730</span><span id="line-730"> // left is "bigger", i.e. it appears later in the sorted order</span> |
| <span class="source-line-no">731</span><span id="line-731"> return 1;</span> |
| <span class="source-line-no">732</span><span id="line-732"> }</span> |
| <span class="source-line-no">733</span><span id="line-733"> if (rFamLength + rQualLength == 0 && rightType == KeyValue.Type.Minimum.getCode()) {</span> |
| <span class="source-line-no">734</span><span id="line-734"> return -1;</span> |
| <span class="source-line-no">735</span><span id="line-735"> }</span> |
| <span class="source-line-no">736</span><span id="line-736"> if (lFamLength != rFamLength) {</span> |
| <span class="source-line-no">737</span><span id="line-737"> // comparing column family is enough.</span> |
| <span class="source-line-no">738</span><span id="line-738"> return compareFamilies(left, lFamLength, right, rFamLength);</span> |
| <span class="source-line-no">739</span><span id="line-739"> }</span> |
| <span class="source-line-no">740</span><span id="line-740"> // Compare cf:qualifier</span> |
| <span class="source-line-no">741</span><span id="line-741"> int diff = compareColumns(left, lFamLength, lQualLength, right, rFamLength, rQualLength);</span> |
| <span class="source-line-no">742</span><span id="line-742"> if (diff != 0) {</span> |
| <span class="source-line-no">743</span><span id="line-743"> return diff;</span> |
| <span class="source-line-no">744</span><span id="line-744"> }</span> |
| <span class="source-line-no">745</span><span id="line-745"></span> |
| <span class="source-line-no">746</span><span id="line-746"> diff = compareTimestamps(left.getTimestamp(), right.getTimestamp());</span> |
| <span class="source-line-no">747</span><span id="line-747"> if (diff != 0) {</span> |
| <span class="source-line-no">748</span><span id="line-748"> return diff;</span> |
| <span class="source-line-no">749</span><span id="line-749"> }</span> |
| <span class="source-line-no">750</span><span id="line-750"></span> |
| <span class="source-line-no">751</span><span id="line-751"> // Compare types. Let the delete types sort ahead of puts; i.e. types</span> |
| <span class="source-line-no">752</span><span id="line-752"> // of higher numbers sort before those of lesser numbers. Maximum (255)</span> |
| <span class="source-line-no">753</span><span id="line-753"> // appears ahead of everything, and minimum (0) appears after</span> |
| <span class="source-line-no">754</span><span id="line-754"> // everything.</span> |
| <span class="source-line-no">755</span><span id="line-755"> return (0xff & rightType) - (0xff & leftType);</span> |
| <span class="source-line-no">756</span><span id="line-756"> }</span> |
| <span class="source-line-no">757</span><span id="line-757"></span> |
| <span class="source-line-no">758</span><span id="line-758"> @Override</span> |
| <span class="source-line-no">759</span><span id="line-759"> public int compareTimestamps(final Cell left, final Cell right) {</span> |
| <span class="source-line-no">760</span><span id="line-760"> return compareTimestamps(left.getTimestamp(), right.getTimestamp());</span> |
| <span class="source-line-no">761</span><span id="line-761"> }</span> |
| <span class="source-line-no">762</span><span id="line-762"></span> |
| <span class="source-line-no">763</span><span id="line-763"> @Override</span> |
| <span class="source-line-no">764</span><span id="line-764"> public int compareTimestamps(final long ltimestamp, final long rtimestamp) {</span> |
| <span class="source-line-no">765</span><span id="line-765"> // Swap order we pass into compare so we get DESCENDING order.</span> |
| <span class="source-line-no">766</span><span id="line-766"> return Long.compare(rtimestamp, ltimestamp);</span> |
| <span class="source-line-no">767</span><span id="line-767"> }</span> |
| <span class="source-line-no">768</span><span id="line-768"></span> |
| <span class="source-line-no">769</span><span id="line-769"> @Override</span> |
| <span class="source-line-no">770</span><span id="line-770"> public Comparator<Cell> getSimpleComparator() {</span> |
| <span class="source-line-no">771</span><span id="line-771"> return this;</span> |
| <span class="source-line-no">772</span><span id="line-772"> }</span> |
| <span class="source-line-no">773</span><span id="line-773"></span> |
| <span class="source-line-no">774</span><span id="line-774"> /**</span> |
| <span class="source-line-no">775</span><span id="line-775"> * Utility method that makes a guess at comparator to use based off passed tableName. Use in</span> |
| <span class="source-line-no">776</span><span id="line-776"> * extreme when no comparator specified.</span> |
| <span class="source-line-no">777</span><span id="line-777"> * @return CellComparator to use going off the {@code tableName} passed.</span> |
| <span class="source-line-no">778</span><span id="line-778"> */</span> |
| <span class="source-line-no">779</span><span id="line-779"> public static CellComparator getCellComparator(TableName tableName) {</span> |
| <span class="source-line-no">780</span><span id="line-780"> return getCellComparator(tableName.toBytes());</span> |
| <span class="source-line-no">781</span><span id="line-781"> }</span> |
| <span class="source-line-no">782</span><span id="line-782"></span> |
| <span class="source-line-no">783</span><span id="line-783"> /**</span> |
| <span class="source-line-no">784</span><span id="line-784"> * Utility method that makes a guess at comparator to use based off passed tableName. Use in</span> |
| <span class="source-line-no">785</span><span id="line-785"> * extreme when no comparator specified.</span> |
| <span class="source-line-no">786</span><span id="line-786"> * @return CellComparator to use going off the {@code tableName} passed.</span> |
| <span class="source-line-no">787</span><span id="line-787"> */</span> |
| <span class="source-line-no">788</span><span id="line-788"> public static CellComparator getCellComparator(byte[] tableName) {</span> |
| <span class="source-line-no">789</span><span id="line-789"> // FYI, TableName.toBytes does not create an array; just returns existing array pointer.</span> |
| <span class="source-line-no">790</span><span id="line-790"> return Bytes.equals(tableName, TableName.META_TABLE_NAME.toBytes())</span> |
| <span class="source-line-no">791</span><span id="line-791"> ? MetaCellComparator.META_COMPARATOR</span> |
| <span class="source-line-no">792</span><span id="line-792"> : CellComparatorImpl.COMPARATOR;</span> |
| <span class="source-line-no">793</span><span id="line-793"> }</span> |
| <span class="source-line-no">794</span><span id="line-794">}</span> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </pre> |
| </div> |
| </main> |
| </body> |
| </html> |