| <!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><a name="line.18"></a> |
| <span class="sourceLineNo">019</span>package org.apache.hadoop.hbase;<a name="line.19"></a> |
| <span class="sourceLineNo">020</span><a name="line.20"></a> |
| <span class="sourceLineNo">021</span>import java.util.Comparator;<a name="line.21"></a> |
| <span class="sourceLineNo">022</span><a name="line.22"></a> |
| <span class="sourceLineNo">023</span>import org.apache.hadoop.hbase.KeyValue.Type;<a name="line.23"></a> |
| <span class="sourceLineNo">024</span>import org.apache.hadoop.hbase.util.ByteBufferUtils;<a name="line.24"></a> |
| <span class="sourceLineNo">025</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.25"></a> |
| <span class="sourceLineNo">026</span>import org.apache.hbase.thirdparty.com.google.common.primitives.Longs;<a name="line.26"></a> |
| <span class="sourceLineNo">027</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.27"></a> |
| <span class="sourceLineNo">028</span>import org.apache.yetus.audience.InterfaceStability;<a name="line.28"></a> |
| <span class="sourceLineNo">029</span>import org.slf4j.Logger;<a name="line.29"></a> |
| <span class="sourceLineNo">030</span>import org.slf4j.LoggerFactory;<a name="line.30"></a> |
| <span class="sourceLineNo">031</span><a name="line.31"></a> |
| <span class="sourceLineNo">032</span><a name="line.32"></a> |
| <span class="sourceLineNo">033</span><a name="line.33"></a> |
| <span class="sourceLineNo">034</span>/**<a name="line.34"></a> |
| <span class="sourceLineNo">035</span> * Compare two HBase cells. Do not use this method comparing <code>-ROOT-</code> or<a name="line.35"></a> |
| <span class="sourceLineNo">036</span> * <code>hbase:meta</code> cells. Cells from these tables need a specialized comparator, one that<a name="line.36"></a> |
| <span class="sourceLineNo">037</span> * takes account of the special formatting of the row where we have commas to delimit table from<a name="line.37"></a> |
| <span class="sourceLineNo">038</span> * regionname, from row. See KeyValue for how it has a special comparator to do hbase:meta cells<a name="line.38"></a> |
| <span class="sourceLineNo">039</span> * and yet another for -ROOT-.<a name="line.39"></a> |
| <span class="sourceLineNo">040</span> * <p>While using this comparator for {{@link #compareRows(Cell, Cell)} et al, the hbase:meta cells<a name="line.40"></a> |
| <span class="sourceLineNo">041</span> * format should be taken into consideration, for which the instance of this comparator<a name="line.41"></a> |
| <span class="sourceLineNo">042</span> * should be used. In all other cases the static APIs in this comparator would be enough<a name="line.42"></a> |
| <span class="sourceLineNo">043</span> * <p>HOT methods. We spend a good portion of CPU comparing. Anything that makes the compare<a name="line.43"></a> |
| <span class="sourceLineNo">044</span> * faster will likely manifest at the macro level. See also<a name="line.44"></a> |
| <span class="sourceLineNo">045</span> * {@link BBKVComparator}. Use it when mostly {@link ByteBufferKeyValue}s.<a name="line.45"></a> |
| <span class="sourceLineNo">046</span> * </p><a name="line.46"></a> |
| <span class="sourceLineNo">047</span> */<a name="line.47"></a> |
| <span class="sourceLineNo">048</span>@edu.umd.cs.findbugs.annotations.SuppressWarnings(<a name="line.48"></a> |
| <span class="sourceLineNo">049</span> value="UNKNOWN",<a name="line.49"></a> |
| <span class="sourceLineNo">050</span> justification="Findbugs doesn't like the way we are negating the result of a compare in below")<a name="line.50"></a> |
| <span class="sourceLineNo">051</span>@InterfaceAudience.Private<a name="line.51"></a> |
| <span class="sourceLineNo">052</span>@InterfaceStability.Evolving<a name="line.52"></a> |
| <span class="sourceLineNo">053</span>public class CellComparatorImpl implements CellComparator {<a name="line.53"></a> |
| <span class="sourceLineNo">054</span> static final Logger LOG = LoggerFactory.getLogger(CellComparatorImpl.class);<a name="line.54"></a> |
| <span class="sourceLineNo">055</span> /**<a name="line.55"></a> |
| <span class="sourceLineNo">056</span> * Comparator for plain key/values; i.e. non-catalog table key/values. Works on Key portion<a name="line.56"></a> |
| <span class="sourceLineNo">057</span> * of KeyValue only.<a name="line.57"></a> |
| <span class="sourceLineNo">058</span> */<a name="line.58"></a> |
| <span class="sourceLineNo">059</span> public static final CellComparatorImpl COMPARATOR = new CellComparatorImpl();<a name="line.59"></a> |
| <span class="sourceLineNo">060</span> /**<a name="line.60"></a> |
| <span class="sourceLineNo">061</span> * A {@link CellComparatorImpl} for <code>hbase:meta</code> catalog table<a name="line.61"></a> |
| <span class="sourceLineNo">062</span> * {@link KeyValue}s.<a name="line.62"></a> |
| <span class="sourceLineNo">063</span> */<a name="line.63"></a> |
| <span class="sourceLineNo">064</span> public static final CellComparatorImpl META_COMPARATOR = new MetaCellComparator();<a name="line.64"></a> |
| <span class="sourceLineNo">065</span><a name="line.65"></a> |
| <span class="sourceLineNo">066</span> @Override<a name="line.66"></a> |
| <span class="sourceLineNo">067</span> public final int compare(final Cell a, final Cell b) {<a name="line.67"></a> |
| <span class="sourceLineNo">068</span> return compare(a, b, false);<a name="line.68"></a> |
| <span class="sourceLineNo">069</span> }<a name="line.69"></a> |
| <span class="sourceLineNo">070</span><a name="line.70"></a> |
| <span class="sourceLineNo">071</span> @Override<a name="line.71"></a> |
| <span class="sourceLineNo">072</span> public int compare(final Cell a, final Cell b, boolean ignoreSequenceid) {<a name="line.72"></a> |
| <span class="sourceLineNo">073</span><a name="line.73"></a> |
| <span class="sourceLineNo">074</span> int diff = 0;<a name="line.74"></a> |
| <span class="sourceLineNo">075</span> // "Peel off" the most common path.<a name="line.75"></a> |
| <span class="sourceLineNo">076</span> if (a instanceof ByteBufferKeyValue && b instanceof ByteBufferKeyValue) {<a name="line.76"></a> |
| <span class="sourceLineNo">077</span> diff = BBKVComparator.compare((ByteBufferKeyValue)a, (ByteBufferKeyValue)b, ignoreSequenceid);<a name="line.77"></a> |
| <span class="sourceLineNo">078</span> if (diff != 0) {<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 {<a name="line.81"></a> |
| <span class="sourceLineNo">082</span> diff = compareRows(a, b);<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><a name="line.86"></a> |
| <span class="sourceLineNo">087</span> diff = compareWithoutRow(a, b);<a name="line.87"></a> |
| <span class="sourceLineNo">088</span> if (diff != 0) {<a name="line.88"></a> |
| <span class="sourceLineNo">089</span> return diff;<a name="line.89"></a> |
| <span class="sourceLineNo">090</span> }<a name="line.90"></a> |
| <span class="sourceLineNo">091</span> }<a name="line.91"></a> |
| <span class="sourceLineNo">092</span><a name="line.92"></a> |
| <span class="sourceLineNo">093</span> // Negate following comparisons so later edits show up first mvccVersion: later sorts first<a name="line.93"></a> |
| <span class="sourceLineNo">094</span> return ignoreSequenceid? diff: Long.compare(b.getSequenceId(), a.getSequenceId());<a name="line.94"></a> |
| <span class="sourceLineNo">095</span> }<a name="line.95"></a> |
| <span class="sourceLineNo">096</span><a name="line.96"></a> |
| <span class="sourceLineNo">097</span> /**<a name="line.97"></a> |
| <span class="sourceLineNo">098</span> * Compares the family and qualifier part of the cell<a name="line.98"></a> |
| <span class="sourceLineNo">099</span> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise<a name="line.99"></a> |
| <span class="sourceLineNo">100</span> */<a name="line.100"></a> |
| <span class="sourceLineNo">101</span> public final int compareColumns(final Cell left, final Cell right) {<a name="line.101"></a> |
| <span class="sourceLineNo">102</span> int diff = compareFamilies(left, right);<a name="line.102"></a> |
| <span class="sourceLineNo">103</span> if (diff != 0) {<a name="line.103"></a> |
| <span class="sourceLineNo">104</span> return diff;<a name="line.104"></a> |
| <span class="sourceLineNo">105</span> }<a name="line.105"></a> |
| <span class="sourceLineNo">106</span> return compareQualifiers(left, right);<a name="line.106"></a> |
| <span class="sourceLineNo">107</span> }<a name="line.107"></a> |
| <span class="sourceLineNo">108</span><a name="line.108"></a> |
| <span class="sourceLineNo">109</span> /**<a name="line.109"></a> |
| <span class="sourceLineNo">110</span> * Compare the families of left and right cell<a name="line.110"></a> |
| <span class="sourceLineNo">111</span> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise<a name="line.111"></a> |
| <span class="sourceLineNo">112</span> */<a name="line.112"></a> |
| <span class="sourceLineNo">113</span> @Override<a name="line.113"></a> |
| <span class="sourceLineNo">114</span> public final int compareFamilies(Cell left, Cell right) {<a name="line.114"></a> |
| <span class="sourceLineNo">115</span> if (left instanceof ByteBufferExtendedCell && right instanceof ByteBufferExtendedCell) {<a name="line.115"></a> |
| <span class="sourceLineNo">116</span> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getFamilyByteBuffer(),<a name="line.116"></a> |
| <span class="sourceLineNo">117</span> ((ByteBufferExtendedCell) left).getFamilyPosition(), left.getFamilyLength(),<a name="line.117"></a> |
| <span class="sourceLineNo">118</span> ((ByteBufferExtendedCell) right).getFamilyByteBuffer(),<a name="line.118"></a> |
| <span class="sourceLineNo">119</span> ((ByteBufferExtendedCell) right).getFamilyPosition(), right.getFamilyLength());<a name="line.119"></a> |
| <span class="sourceLineNo">120</span> }<a name="line.120"></a> |
| <span class="sourceLineNo">121</span> if (left instanceof ByteBufferExtendedCell) {<a name="line.121"></a> |
| <span class="sourceLineNo">122</span> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getFamilyByteBuffer(),<a name="line.122"></a> |
| <span class="sourceLineNo">123</span> ((ByteBufferExtendedCell) left).getFamilyPosition(), left.getFamilyLength(),<a name="line.123"></a> |
| <span class="sourceLineNo">124</span> right.getFamilyArray(), right.getFamilyOffset(), right.getFamilyLength());<a name="line.124"></a> |
| <span class="sourceLineNo">125</span> }<a name="line.125"></a> |
| <span class="sourceLineNo">126</span> if (right instanceof ByteBufferExtendedCell) {<a name="line.126"></a> |
| <span class="sourceLineNo">127</span> // Notice how we flip the order of the compare here. We used to negate the return value but<a name="line.127"></a> |
| <span class="sourceLineNo">128</span> // see what FindBugs says<a name="line.128"></a> |
| <span class="sourceLineNo">129</span> // http://findbugs.sourceforge.net/bugDescriptions.html#RV_NEGATING_RESULT_OF_COMPARETO<a name="line.129"></a> |
| <span class="sourceLineNo">130</span> // It suggest flipping the order to get same effect and 'safer'.<a name="line.130"></a> |
| <span class="sourceLineNo">131</span> return ByteBufferUtils.compareTo(<a name="line.131"></a> |
| <span class="sourceLineNo">132</span> left.getFamilyArray(), left.getFamilyOffset(), left.getFamilyLength(),<a name="line.132"></a> |
| <span class="sourceLineNo">133</span> ((ByteBufferExtendedCell)right).getFamilyByteBuffer(),<a name="line.133"></a> |
| <span class="sourceLineNo">134</span> ((ByteBufferExtendedCell)right).getFamilyPosition(), right.getFamilyLength());<a name="line.134"></a> |
| <span class="sourceLineNo">135</span> }<a name="line.135"></a> |
| <span class="sourceLineNo">136</span> return Bytes.compareTo(left.getFamilyArray(), left.getFamilyOffset(), left.getFamilyLength(),<a name="line.136"></a> |
| <span class="sourceLineNo">137</span> right.getFamilyArray(), right.getFamilyOffset(), right.getFamilyLength());<a name="line.137"></a> |
| <span class="sourceLineNo">138</span> }<a name="line.138"></a> |
| <span class="sourceLineNo">139</span><a name="line.139"></a> |
| <span class="sourceLineNo">140</span> /**<a name="line.140"></a> |
| <span class="sourceLineNo">141</span> * Compare the qualifiers part of the left and right cells.<a name="line.141"></a> |
| <span class="sourceLineNo">142</span> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise<a name="line.142"></a> |
| <span class="sourceLineNo">143</span> */<a name="line.143"></a> |
| <span class="sourceLineNo">144</span> @Override<a name="line.144"></a> |
| <span class="sourceLineNo">145</span> public final int compareQualifiers(Cell left, Cell right) {<a name="line.145"></a> |
| <span class="sourceLineNo">146</span> if (left instanceof ByteBufferExtendedCell && right instanceof ByteBufferExtendedCell) {<a name="line.146"></a> |
| <span class="sourceLineNo">147</span> return ByteBufferUtils<a name="line.147"></a> |
| <span class="sourceLineNo">148</span> .compareTo(((ByteBufferExtendedCell) left).getQualifierByteBuffer(),<a name="line.148"></a> |
| <span class="sourceLineNo">149</span> ((ByteBufferExtendedCell) left).getQualifierPosition(),<a name="line.149"></a> |
| <span class="sourceLineNo">150</span> left.getQualifierLength(), ((ByteBufferExtendedCell) right).getQualifierByteBuffer(),<a name="line.150"></a> |
| <span class="sourceLineNo">151</span> ((ByteBufferExtendedCell) right).getQualifierPosition(),<a name="line.151"></a> |
| <span class="sourceLineNo">152</span> right.getQualifierLength());<a name="line.152"></a> |
| <span class="sourceLineNo">153</span> }<a name="line.153"></a> |
| <span class="sourceLineNo">154</span> if (left instanceof ByteBufferExtendedCell) {<a name="line.154"></a> |
| <span class="sourceLineNo">155</span> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getQualifierByteBuffer(),<a name="line.155"></a> |
| <span class="sourceLineNo">156</span> ((ByteBufferExtendedCell) left).getQualifierPosition(), left.getQualifierLength(),<a name="line.156"></a> |
| <span class="sourceLineNo">157</span> right.getQualifierArray(), right.getQualifierOffset(), right.getQualifierLength());<a name="line.157"></a> |
| <span class="sourceLineNo">158</span> }<a name="line.158"></a> |
| <span class="sourceLineNo">159</span> if (right instanceof ByteBufferExtendedCell) {<a name="line.159"></a> |
| <span class="sourceLineNo">160</span> // Notice how we flip the order of the compare here. We used to negate the return value but<a name="line.160"></a> |
| <span class="sourceLineNo">161</span> // see what FindBugs says<a name="line.161"></a> |
| <span class="sourceLineNo">162</span> // http://findbugs.sourceforge.net/bugDescriptions.html#RV_NEGATING_RESULT_OF_COMPARETO<a name="line.162"></a> |
| <span class="sourceLineNo">163</span> // It suggest flipping the order to get same effect and 'safer'.<a name="line.163"></a> |
| <span class="sourceLineNo">164</span> return ByteBufferUtils.compareTo(left.getQualifierArray(),<a name="line.164"></a> |
| <span class="sourceLineNo">165</span> left.getQualifierOffset(), left.getQualifierLength(),<a name="line.165"></a> |
| <span class="sourceLineNo">166</span> ((ByteBufferExtendedCell)right).getQualifierByteBuffer(),<a name="line.166"></a> |
| <span class="sourceLineNo">167</span> ((ByteBufferExtendedCell)right).getQualifierPosition(), right.getQualifierLength());<a name="line.167"></a> |
| <span class="sourceLineNo">168</span> }<a name="line.168"></a> |
| <span class="sourceLineNo">169</span> return Bytes.compareTo(left.getQualifierArray(), left.getQualifierOffset(),<a name="line.169"></a> |
| <span class="sourceLineNo">170</span> left.getQualifierLength(), right.getQualifierArray(), right.getQualifierOffset(),<a name="line.170"></a> |
| <span class="sourceLineNo">171</span> right.getQualifierLength());<a name="line.171"></a> |
| <span class="sourceLineNo">172</span> }<a name="line.172"></a> |
| <span class="sourceLineNo">173</span><a name="line.173"></a> |
| <span class="sourceLineNo">174</span> /**<a name="line.174"></a> |
| <span class="sourceLineNo">175</span> * Compares the rows of the left and right cell.<a name="line.175"></a> |
| <span class="sourceLineNo">176</span> * For the hbase:meta case this method is overridden such that it can handle hbase:meta cells.<a name="line.176"></a> |
| <span class="sourceLineNo">177</span> * The caller should ensure using the appropriate comparator for hbase:meta.<a name="line.177"></a> |
| <span class="sourceLineNo">178</span> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise<a name="line.178"></a> |
| <span class="sourceLineNo">179</span> */<a name="line.179"></a> |
| <span class="sourceLineNo">180</span> @Override<a name="line.180"></a> |
| <span class="sourceLineNo">181</span> public int compareRows(final Cell left, final Cell right) {<a name="line.181"></a> |
| <span class="sourceLineNo">182</span> return compareRows(left, left.getRowLength(), right, right.getRowLength());<a name="line.182"></a> |
| <span class="sourceLineNo">183</span> }<a name="line.183"></a> |
| <span class="sourceLineNo">184</span><a name="line.184"></a> |
| <span class="sourceLineNo">185</span> static int compareRows(final Cell left, int leftRowLength, final Cell right, int rightRowLength) {<a name="line.185"></a> |
| <span class="sourceLineNo">186</span> // left and right can be exactly the same at the beginning of a row<a name="line.186"></a> |
| <span class="sourceLineNo">187</span> if (left == right) {<a name="line.187"></a> |
| <span class="sourceLineNo">188</span> return 0;<a name="line.188"></a> |
| <span class="sourceLineNo">189</span> }<a name="line.189"></a> |
| <span class="sourceLineNo">190</span> if (left instanceof ByteBufferExtendedCell && right instanceof ByteBufferExtendedCell) {<a name="line.190"></a> |
| <span class="sourceLineNo">191</span> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getRowByteBuffer(),<a name="line.191"></a> |
| <span class="sourceLineNo">192</span> ((ByteBufferExtendedCell) left).getRowPosition(), leftRowLength,<a name="line.192"></a> |
| <span class="sourceLineNo">193</span> ((ByteBufferExtendedCell) right).getRowByteBuffer(),<a name="line.193"></a> |
| <span class="sourceLineNo">194</span> ((ByteBufferExtendedCell) right).getRowPosition(), rightRowLength);<a name="line.194"></a> |
| <span class="sourceLineNo">195</span> }<a name="line.195"></a> |
| <span class="sourceLineNo">196</span> if (left instanceof ByteBufferExtendedCell) {<a name="line.196"></a> |
| <span class="sourceLineNo">197</span> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getRowByteBuffer(),<a name="line.197"></a> |
| <span class="sourceLineNo">198</span> ((ByteBufferExtendedCell) left).getRowPosition(), leftRowLength,<a name="line.198"></a> |
| <span class="sourceLineNo">199</span> right.getRowArray(), right.getRowOffset(), rightRowLength);<a name="line.199"></a> |
| <span class="sourceLineNo">200</span> }<a name="line.200"></a> |
| <span class="sourceLineNo">201</span> if (right instanceof ByteBufferExtendedCell) {<a name="line.201"></a> |
| <span class="sourceLineNo">202</span> // Notice how we flip the order of the compare here. We used to negate the return value but<a name="line.202"></a> |
| <span class="sourceLineNo">203</span> // see what FindBugs says<a name="line.203"></a> |
| <span class="sourceLineNo">204</span> // http://findbugs.sourceforge.net/bugDescriptions.html#RV_NEGATING_RESULT_OF_COMPARETO<a name="line.204"></a> |
| <span class="sourceLineNo">205</span> // It suggest flipping the order to get same effect and 'safer'.<a name="line.205"></a> |
| <span class="sourceLineNo">206</span> return ByteBufferUtils.compareTo(left.getRowArray(), left.getRowOffset(), leftRowLength,<a name="line.206"></a> |
| <span class="sourceLineNo">207</span> ((ByteBufferExtendedCell)right).getRowByteBuffer(),<a name="line.207"></a> |
| <span class="sourceLineNo">208</span> ((ByteBufferExtendedCell)right).getRowPosition(), rightRowLength);<a name="line.208"></a> |
| <span class="sourceLineNo">209</span> }<a name="line.209"></a> |
| <span class="sourceLineNo">210</span> return Bytes.compareTo(left.getRowArray(), left.getRowOffset(), left.getRowLength(),<a name="line.210"></a> |
| <span class="sourceLineNo">211</span> right.getRowArray(), right.getRowOffset(), right.getRowLength());<a name="line.211"></a> |
| <span class="sourceLineNo">212</span> }<a name="line.212"></a> |
| <span class="sourceLineNo">213</span><a name="line.213"></a> |
| <span class="sourceLineNo">214</span> /**<a name="line.214"></a> |
| <span class="sourceLineNo">215</span> * Compares the row part of the cell with a simple plain byte[] like the<a name="line.215"></a> |
| <span class="sourceLineNo">216</span> * stopRow in Scan. This should be used with context where for hbase:meta<a name="line.216"></a> |
| <span class="sourceLineNo">217</span> * cells the {{@link #META_COMPARATOR} should be used<a name="line.217"></a> |
| <span class="sourceLineNo">218</span> *<a name="line.218"></a> |
| <span class="sourceLineNo">219</span> * @param left<a name="line.219"></a> |
| <span class="sourceLineNo">220</span> * the cell to be compared<a name="line.220"></a> |
| <span class="sourceLineNo">221</span> * @param right<a name="line.221"></a> |
| <span class="sourceLineNo">222</span> * the kv serialized byte[] to be compared with<a name="line.222"></a> |
| <span class="sourceLineNo">223</span> * @param roffset<a name="line.223"></a> |
| <span class="sourceLineNo">224</span> * the offset in the byte[]<a name="line.224"></a> |
| <span class="sourceLineNo">225</span> * @param rlength<a name="line.225"></a> |
| <span class="sourceLineNo">226</span> * the length in the byte[]<a name="line.226"></a> |
| <span class="sourceLineNo">227</span> * @return 0 if both cell and the byte[] are equal, 1 if the cell is bigger<a name="line.227"></a> |
| <span class="sourceLineNo">228</span> * than byte[], -1 otherwise<a name="line.228"></a> |
| <span class="sourceLineNo">229</span> */<a name="line.229"></a> |
| <span class="sourceLineNo">230</span> @Override<a name="line.230"></a> |
| <span class="sourceLineNo">231</span> public int compareRows(Cell left, byte[] right, int roffset, int rlength) {<a name="line.231"></a> |
| <span class="sourceLineNo">232</span> if (left instanceof ByteBufferExtendedCell) {<a name="line.232"></a> |
| <span class="sourceLineNo">233</span> return ByteBufferUtils.compareTo(((ByteBufferExtendedCell) left).getRowByteBuffer(),<a name="line.233"></a> |
| <span class="sourceLineNo">234</span> ((ByteBufferExtendedCell) left).getRowPosition(), left.getRowLength(), right,<a name="line.234"></a> |
| <span class="sourceLineNo">235</span> roffset, rlength);<a name="line.235"></a> |
| <span class="sourceLineNo">236</span> }<a name="line.236"></a> |
| <span class="sourceLineNo">237</span> return Bytes.compareTo(left.getRowArray(), left.getRowOffset(), left.getRowLength(), right,<a name="line.237"></a> |
| <span class="sourceLineNo">238</span> roffset, rlength);<a name="line.238"></a> |
| <span class="sourceLineNo">239</span> }<a name="line.239"></a> |
| <span class="sourceLineNo">240</span><a name="line.240"></a> |
| <span class="sourceLineNo">241</span> @Override<a name="line.241"></a> |
| <span class="sourceLineNo">242</span> public final int compareWithoutRow(final Cell left, final Cell right) {<a name="line.242"></a> |
| <span class="sourceLineNo">243</span> // If the column is not specified, the "minimum" key type appears the<a name="line.243"></a> |
| <span class="sourceLineNo">244</span> // latest in the sorted order, regardless of the timestamp. This is used<a name="line.244"></a> |
| <span class="sourceLineNo">245</span> // for specifying the last key/value in a given row, because there is no<a name="line.245"></a> |
| <span class="sourceLineNo">246</span> // "lexicographically last column" (it would be infinitely long). The<a name="line.246"></a> |
| <span class="sourceLineNo">247</span> // "maximum" key type does not need this behavior.<a name="line.247"></a> |
| <span class="sourceLineNo">248</span> // Copied from KeyValue. This is bad in that we can't do memcmp w/ special rules like this.<a name="line.248"></a> |
| <span class="sourceLineNo">249</span> int lFamLength = left.getFamilyLength();<a name="line.249"></a> |
| <span class="sourceLineNo">250</span> int rFamLength = right.getFamilyLength();<a name="line.250"></a> |
| <span class="sourceLineNo">251</span> int lQualLength = left.getQualifierLength();<a name="line.251"></a> |
| <span class="sourceLineNo">252</span> int rQualLength = right.getQualifierLength();<a name="line.252"></a> |
| <span class="sourceLineNo">253</span> if (lFamLength + lQualLength == 0<a name="line.253"></a> |
| <span class="sourceLineNo">254</span> && left.getTypeByte() == Type.Minimum.getCode()) {<a name="line.254"></a> |
| <span class="sourceLineNo">255</span> // left is "bigger", i.e. it appears later in the sorted order<a name="line.255"></a> |
| <span class="sourceLineNo">256</span> return 1;<a name="line.256"></a> |
| <span class="sourceLineNo">257</span> }<a name="line.257"></a> |
| <span class="sourceLineNo">258</span> if (rFamLength + rQualLength == 0<a name="line.258"></a> |
| <span class="sourceLineNo">259</span> && right.getTypeByte() == Type.Minimum.getCode()) {<a name="line.259"></a> |
| <span class="sourceLineNo">260</span> return -1;<a name="line.260"></a> |
| <span class="sourceLineNo">261</span> }<a name="line.261"></a> |
| <span class="sourceLineNo">262</span> if (lFamLength != rFamLength) {<a name="line.262"></a> |
| <span class="sourceLineNo">263</span> // comparing column family is enough.<a name="line.263"></a> |
| <span class="sourceLineNo">264</span> return compareFamilies(left, right);<a name="line.264"></a> |
| <span class="sourceLineNo">265</span> }<a name="line.265"></a> |
| <span class="sourceLineNo">266</span> // Compare cf:qualifier<a name="line.266"></a> |
| <span class="sourceLineNo">267</span> int diff = compareColumns(left, right);<a name="line.267"></a> |
| <span class="sourceLineNo">268</span> if (diff != 0) {<a name="line.268"></a> |
| <span class="sourceLineNo">269</span> return diff;<a name="line.269"></a> |
| <span class="sourceLineNo">270</span> }<a name="line.270"></a> |
| <span class="sourceLineNo">271</span><a name="line.271"></a> |
| <span class="sourceLineNo">272</span> diff = compareTimestamps(left.getTimestamp(), right.getTimestamp());<a name="line.272"></a> |
| <span class="sourceLineNo">273</span> if (diff != 0) {<a name="line.273"></a> |
| <span class="sourceLineNo">274</span> return diff;<a name="line.274"></a> |
| <span class="sourceLineNo">275</span> }<a name="line.275"></a> |
| <span class="sourceLineNo">276</span><a name="line.276"></a> |
| <span class="sourceLineNo">277</span> // Compare types. Let the delete types sort ahead of puts; i.e. types<a name="line.277"></a> |
| <span class="sourceLineNo">278</span> // of higher numbers sort before those of lesser numbers. Maximum (255)<a name="line.278"></a> |
| <span class="sourceLineNo">279</span> // appears ahead of everything, and minimum (0) appears after<a name="line.279"></a> |
| <span class="sourceLineNo">280</span> // everything.<a name="line.280"></a> |
| <span class="sourceLineNo">281</span> return (0xff & right.getTypeByte()) - (0xff & left.getTypeByte());<a name="line.281"></a> |
| <span class="sourceLineNo">282</span> }<a name="line.282"></a> |
| <span class="sourceLineNo">283</span><a name="line.283"></a> |
| <span class="sourceLineNo">284</span> @Override<a name="line.284"></a> |
| <span class="sourceLineNo">285</span> public int compareTimestamps(final Cell left, final Cell right) {<a name="line.285"></a> |
| <span class="sourceLineNo">286</span> return compareTimestamps(left.getTimestamp(), right.getTimestamp());<a name="line.286"></a> |
| <span class="sourceLineNo">287</span> }<a name="line.287"></a> |
| <span class="sourceLineNo">288</span><a name="line.288"></a> |
| <span class="sourceLineNo">289</span> @Override<a name="line.289"></a> |
| <span class="sourceLineNo">290</span> public int compareTimestamps(final long ltimestamp, final long rtimestamp) {<a name="line.290"></a> |
| <span class="sourceLineNo">291</span> // Swap order we pass into compare so we get DESCENDING order.<a name="line.291"></a> |
| <span class="sourceLineNo">292</span> return Long.compare(rtimestamp, ltimestamp);<a name="line.292"></a> |
| <span class="sourceLineNo">293</span> }<a name="line.293"></a> |
| <span class="sourceLineNo">294</span><a name="line.294"></a> |
| <span class="sourceLineNo">295</span> /**<a name="line.295"></a> |
| <span class="sourceLineNo">296</span> * A {@link CellComparatorImpl} for <code>hbase:meta</code> catalog table<a name="line.296"></a> |
| <span class="sourceLineNo">297</span> * {@link KeyValue}s.<a name="line.297"></a> |
| <span class="sourceLineNo">298</span> */<a name="line.298"></a> |
| <span class="sourceLineNo">299</span> public static class MetaCellComparator extends CellComparatorImpl {<a name="line.299"></a> |
| <span class="sourceLineNo">300</span> // TODO: Do we need a ByteBufferKeyValue version of this?<a name="line.300"></a> |
| <span class="sourceLineNo">301</span> @Override<a name="line.301"></a> |
| <span class="sourceLineNo">302</span> public int compareRows(final Cell left, final Cell right) {<a name="line.302"></a> |
| <span class="sourceLineNo">303</span> return compareRows(left.getRowArray(), left.getRowOffset(), left.getRowLength(),<a name="line.303"></a> |
| <span class="sourceLineNo">304</span> right.getRowArray(), right.getRowOffset(), right.getRowLength());<a name="line.304"></a> |
| <span class="sourceLineNo">305</span> }<a name="line.305"></a> |
| <span class="sourceLineNo">306</span><a name="line.306"></a> |
| <span class="sourceLineNo">307</span> @Override<a name="line.307"></a> |
| <span class="sourceLineNo">308</span> public int compareRows(Cell left, byte[] right, int roffset, int rlength) {<a name="line.308"></a> |
| <span class="sourceLineNo">309</span> return compareRows(left.getRowArray(), left.getRowOffset(), left.getRowLength(), right,<a name="line.309"></a> |
| <span class="sourceLineNo">310</span> roffset, rlength);<a name="line.310"></a> |
| <span class="sourceLineNo">311</span> }<a name="line.311"></a> |
| <span class="sourceLineNo">312</span><a name="line.312"></a> |
| <span class="sourceLineNo">313</span> @Override<a name="line.313"></a> |
| <span class="sourceLineNo">314</span> public int compare(final Cell a, final Cell b, boolean ignoreSequenceid) {<a name="line.314"></a> |
| <span class="sourceLineNo">315</span> int diff = compareRows(a, b);<a name="line.315"></a> |
| <span class="sourceLineNo">316</span> if (diff != 0) {<a name="line.316"></a> |
| <span class="sourceLineNo">317</span> return diff;<a name="line.317"></a> |
| <span class="sourceLineNo">318</span> }<a name="line.318"></a> |
| <span class="sourceLineNo">319</span><a name="line.319"></a> |
| <span class="sourceLineNo">320</span> diff = compareWithoutRow(a, b);<a name="line.320"></a> |
| <span class="sourceLineNo">321</span> if (diff != 0) {<a name="line.321"></a> |
| <span class="sourceLineNo">322</span> return diff;<a name="line.322"></a> |
| <span class="sourceLineNo">323</span> }<a name="line.323"></a> |
| <span class="sourceLineNo">324</span><a name="line.324"></a> |
| <span class="sourceLineNo">325</span> // Negate following comparisons so later edits show up first mvccVersion: later sorts first<a name="line.325"></a> |
| <span class="sourceLineNo">326</span> return ignoreSequenceid? diff: Longs.compare(b.getSequenceId(), a.getSequenceId());<a name="line.326"></a> |
| <span class="sourceLineNo">327</span> }<a name="line.327"></a> |
| <span class="sourceLineNo">328</span><a name="line.328"></a> |
| <span class="sourceLineNo">329</span> private static int compareRows(byte[] left, int loffset, int llength, byte[] right, int roffset,<a name="line.329"></a> |
| <span class="sourceLineNo">330</span> int rlength) {<a name="line.330"></a> |
| <span class="sourceLineNo">331</span> int leftDelimiter = Bytes.searchDelimiterIndex(left, loffset, llength, HConstants.DELIMITER);<a name="line.331"></a> |
| <span class="sourceLineNo">332</span> int rightDelimiter = Bytes<a name="line.332"></a> |
| <span class="sourceLineNo">333</span> .searchDelimiterIndex(right, roffset, rlength, HConstants.DELIMITER);<a name="line.333"></a> |
| <span class="sourceLineNo">334</span> // Compare up to the delimiter<a name="line.334"></a> |
| <span class="sourceLineNo">335</span> int lpart = (leftDelimiter < 0 ? llength : leftDelimiter - loffset);<a name="line.335"></a> |
| <span class="sourceLineNo">336</span> int rpart = (rightDelimiter < 0 ? rlength : rightDelimiter - roffset);<a name="line.336"></a> |
| <span class="sourceLineNo">337</span> int result = Bytes.compareTo(left, loffset, lpart, right, roffset, rpart);<a name="line.337"></a> |
| <span class="sourceLineNo">338</span> if (result != 0) {<a name="line.338"></a> |
| <span class="sourceLineNo">339</span> return result;<a name="line.339"></a> |
| <span class="sourceLineNo">340</span> } else {<a name="line.340"></a> |
| <span class="sourceLineNo">341</span> if (leftDelimiter < 0 && rightDelimiter >= 0) {<a name="line.341"></a> |
| <span class="sourceLineNo">342</span> return -1;<a name="line.342"></a> |
| <span class="sourceLineNo">343</span> } else if (rightDelimiter < 0 && leftDelimiter >= 0) {<a name="line.343"></a> |
| <span class="sourceLineNo">344</span> return 1;<a name="line.344"></a> |
| <span class="sourceLineNo">345</span> } else if (leftDelimiter < 0 && rightDelimiter < 0) {<a name="line.345"></a> |
| <span class="sourceLineNo">346</span> return 0;<a name="line.346"></a> |
| <span class="sourceLineNo">347</span> }<a name="line.347"></a> |
| <span class="sourceLineNo">348</span> }<a name="line.348"></a> |
| <span class="sourceLineNo">349</span> // Compare middle bit of the row.<a name="line.349"></a> |
| <span class="sourceLineNo">350</span> // Move past delimiter<a name="line.350"></a> |
| <span class="sourceLineNo">351</span> leftDelimiter++;<a name="line.351"></a> |
| <span class="sourceLineNo">352</span> rightDelimiter++;<a name="line.352"></a> |
| <span class="sourceLineNo">353</span> int leftFarDelimiter = Bytes.searchDelimiterIndexInReverse(left, leftDelimiter, llength<a name="line.353"></a> |
| <span class="sourceLineNo">354</span> - (leftDelimiter - loffset), HConstants.DELIMITER);<a name="line.354"></a> |
| <span class="sourceLineNo">355</span> int rightFarDelimiter = Bytes.searchDelimiterIndexInReverse(right, rightDelimiter, rlength<a name="line.355"></a> |
| <span class="sourceLineNo">356</span> - (rightDelimiter - roffset), HConstants.DELIMITER);<a name="line.356"></a> |
| <span class="sourceLineNo">357</span> // Now compare middlesection of row.<a name="line.357"></a> |
| <span class="sourceLineNo">358</span> lpart = (leftFarDelimiter < 0 ? llength + loffset : leftFarDelimiter) - leftDelimiter;<a name="line.358"></a> |
| <span class="sourceLineNo">359</span> rpart = (rightFarDelimiter < 0 ? rlength + roffset : rightFarDelimiter) - rightDelimiter;<a name="line.359"></a> |
| <span class="sourceLineNo">360</span> result = Bytes.compareTo(left, leftDelimiter, lpart, right, rightDelimiter, rpart);<a name="line.360"></a> |
| <span class="sourceLineNo">361</span> if (result != 0) {<a name="line.361"></a> |
| <span class="sourceLineNo">362</span> return result;<a name="line.362"></a> |
| <span class="sourceLineNo">363</span> } else {<a name="line.363"></a> |
| <span class="sourceLineNo">364</span> if (leftDelimiter < 0 && rightDelimiter >= 0) {<a name="line.364"></a> |
| <span class="sourceLineNo">365</span> return -1;<a name="line.365"></a> |
| <span class="sourceLineNo">366</span> } else if (rightDelimiter < 0 && leftDelimiter >= 0) {<a name="line.366"></a> |
| <span class="sourceLineNo">367</span> return 1;<a name="line.367"></a> |
| <span class="sourceLineNo">368</span> } else if (leftDelimiter < 0 && rightDelimiter < 0) {<a name="line.368"></a> |
| <span class="sourceLineNo">369</span> return 0;<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> // Compare last part of row, the rowid.<a name="line.372"></a> |
| <span class="sourceLineNo">373</span> leftFarDelimiter++;<a name="line.373"></a> |
| <span class="sourceLineNo">374</span> rightFarDelimiter++;<a name="line.374"></a> |
| <span class="sourceLineNo">375</span> result = Bytes.compareTo(left, leftFarDelimiter, llength - (leftFarDelimiter - loffset),<a name="line.375"></a> |
| <span class="sourceLineNo">376</span> right, rightFarDelimiter, rlength - (rightFarDelimiter - roffset));<a name="line.376"></a> |
| <span class="sourceLineNo">377</span> return result;<a name="line.377"></a> |
| <span class="sourceLineNo">378</span> }<a name="line.378"></a> |
| <span class="sourceLineNo">379</span><a name="line.379"></a> |
| <span class="sourceLineNo">380</span> @Override<a name="line.380"></a> |
| <span class="sourceLineNo">381</span> public Comparator getSimpleComparator() {<a name="line.381"></a> |
| <span class="sourceLineNo">382</span> return this;<a name="line.382"></a> |
| <span class="sourceLineNo">383</span> }<a name="line.383"></a> |
| <span class="sourceLineNo">384</span> }<a name="line.384"></a> |
| <span class="sourceLineNo">385</span><a name="line.385"></a> |
| <span class="sourceLineNo">386</span> @Override<a name="line.386"></a> |
| <span class="sourceLineNo">387</span> public Comparator getSimpleComparator() {<a name="line.387"></a> |
| <span class="sourceLineNo">388</span> return new BBKVComparator(this);<a name="line.388"></a> |
| <span class="sourceLineNo">389</span> }<a name="line.389"></a> |
| <span class="sourceLineNo">390</span>}<a name="line.390"></a> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </pre> |
| </div> |
| </body> |
| </html> |
