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