You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@hbase.apache.org by gi...@apache.org on 2017/09/01 15:14:02 UTC
[11/51] [partial] hbase-site git commit: Published site at .
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/7ebe345d/devapidocs/src-html/org/apache/hadoop/hbase/CellComparator.RowComparator.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/CellComparator.RowComparator.html b/devapidocs/src-html/org/apache/hadoop/hbase/CellComparator.RowComparator.html
deleted file mode 100644
index 965fa83..0000000
--- a/devapidocs/src-html/org/apache/hadoop/hbase/CellComparator.RowComparator.html
+++ /dev/null
@@ -1,726 +0,0 @@
-<!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.io.Serializable;<a name="line.21"></a>
-<span class="sourceLineNo">022</span>import java.util.Comparator;<a name="line.22"></a>
-<span class="sourceLineNo">023</span><a name="line.23"></a>
-<span class="sourceLineNo">024</span>import org.apache.commons.logging.Log;<a name="line.24"></a>
-<span class="sourceLineNo">025</span>import org.apache.commons.logging.LogFactory;<a name="line.25"></a>
-<span class="sourceLineNo">026</span>import org.apache.hadoop.hbase.KeyValue.Type;<a name="line.26"></a>
-<span class="sourceLineNo">027</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.27"></a>
-<span class="sourceLineNo">028</span>import org.apache.hadoop.hbase.classification.InterfaceStability;<a name="line.28"></a>
-<span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.filter.ByteArrayComparable;<a name="line.29"></a>
-<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.util.ByteBufferUtils;<a name="line.30"></a>
-<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.31"></a>
-<span class="sourceLineNo">032</span><a name="line.32"></a>
-<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.shaded.com.google.common.primitives.Longs;<a name="line.33"></a>
-<span class="sourceLineNo">034</span><a name="line.34"></a>
-<span class="sourceLineNo">035</span>/**<a name="line.35"></a>
-<span class="sourceLineNo">036</span> * Compare two HBase cells. Do not use this method comparing <code>-ROOT-</code> or<a name="line.36"></a>
-<span class="sourceLineNo">037</span> * <code>hbase:meta</code> cells. Cells from these tables need a specialized comparator, one that<a name="line.37"></a>
-<span class="sourceLineNo">038</span> * takes account of the special formatting of the row where we have commas to delimit table from<a name="line.38"></a>
-<span class="sourceLineNo">039</span> * regionname, from row. See KeyValue for how it has a special comparator to do hbase:meta cells<a name="line.39"></a>
-<span class="sourceLineNo">040</span> * and yet another for -ROOT-.<a name="line.40"></a>
-<span class="sourceLineNo">041</span> * While using this comparator for {{@link #compareRows(Cell, Cell)} et al, the hbase:meta cells<a name="line.41"></a>
-<span class="sourceLineNo">042</span> * format should be taken into consideration, for which the instance of this comparator<a name="line.42"></a>
-<span class="sourceLineNo">043</span> * should be used. In all other cases the static APIs in this comparator would be enough<a name="line.43"></a>
-<span class="sourceLineNo">044</span> */<a name="line.44"></a>
-<span class="sourceLineNo">045</span>@edu.umd.cs.findbugs.annotations.SuppressWarnings(<a name="line.45"></a>
-<span class="sourceLineNo">046</span> value="UNKNOWN",<a name="line.46"></a>
-<span class="sourceLineNo">047</span> justification="Findbugs doesn't like the way we are negating the result of a compare in below")<a name="line.47"></a>
-<span class="sourceLineNo">048</span>@InterfaceAudience.Private<a name="line.48"></a>
-<span class="sourceLineNo">049</span>@InterfaceStability.Evolving<a name="line.49"></a>
-<span class="sourceLineNo">050</span>public class CellComparator implements Comparator<Cell>, Serializable {<a name="line.50"></a>
-<span class="sourceLineNo">051</span> static final Log LOG = LogFactory.getLog(CellComparator.class);<a name="line.51"></a>
-<span class="sourceLineNo">052</span> private static final long serialVersionUID = -8760041766259623329L;<a name="line.52"></a>
-<span class="sourceLineNo">053</span><a name="line.53"></a>
-<span class="sourceLineNo">054</span> /**<a name="line.54"></a>
-<span class="sourceLineNo">055</span> * Comparator for plain key/values; i.e. non-catalog table key/values. Works on Key portion<a name="line.55"></a>
-<span class="sourceLineNo">056</span> * of KeyValue only.<a name="line.56"></a>
-<span class="sourceLineNo">057</span> */<a name="line.57"></a>
-<span class="sourceLineNo">058</span> public static final CellComparator COMPARATOR = new CellComparator();<a name="line.58"></a>
-<span class="sourceLineNo">059</span> /**<a name="line.59"></a>
-<span class="sourceLineNo">060</span> * A {@link CellComparator} for <code>hbase:meta</code> catalog table<a name="line.60"></a>
-<span class="sourceLineNo">061</span> * {@link KeyValue}s.<a name="line.61"></a>
-<span class="sourceLineNo">062</span> */<a name="line.62"></a>
-<span class="sourceLineNo">063</span> public static final CellComparator META_COMPARATOR = new MetaCellComparator();<a name="line.63"></a>
-<span class="sourceLineNo">064</span><a name="line.64"></a>
-<span class="sourceLineNo">065</span> @Override<a name="line.65"></a>
-<span class="sourceLineNo">066</span> public int compare(Cell a, Cell b) {<a name="line.66"></a>
-<span class="sourceLineNo">067</span> return compare(a, b, false);<a name="line.67"></a>
-<span class="sourceLineNo">068</span> }<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> * Compares only the key portion of a cell. It does not include the sequence id/mvcc of the<a name="line.71"></a>
-<span class="sourceLineNo">072</span> * cell <a name="line.72"></a>
-<span class="sourceLineNo">073</span> * @param left<a name="line.73"></a>
-<span class="sourceLineNo">074</span> * @param right<a name="line.74"></a>
-<span class="sourceLineNo">075</span> * @return an int greater than 0 if left &gt; than right<a name="line.75"></a>
-<span class="sourceLineNo">076</span> * lesser than 0 if left &lt; than right<a name="line.76"></a>
-<span class="sourceLineNo">077</span> * equal to 0 if left is equal to right<a name="line.77"></a>
-<span class="sourceLineNo">078</span> */<a name="line.78"></a>
-<span class="sourceLineNo">079</span> public final int compareKeyIgnoresMvcc(Cell left, Cell right) {<a name="line.79"></a>
-<span class="sourceLineNo">080</span> return compare(left, right, true);<a name="line.80"></a>
-<span class="sourceLineNo">081</span> }<a name="line.81"></a>
-<span class="sourceLineNo">082</span><a name="line.82"></a>
-<span class="sourceLineNo">083</span> /**<a name="line.83"></a>
-<span class="sourceLineNo">084</span> * Used when a cell needs to be compared with a key byte[] such as cases of<a name="line.84"></a>
-<span class="sourceLineNo">085</span> * finding the index from the index block, bloom keys from the bloom blocks<a name="line.85"></a>
-<span class="sourceLineNo">086</span> * This byte[] is expected to be serialized in the KeyValue serialization format<a name="line.86"></a>
-<span class="sourceLineNo">087</span> * If the KeyValue (Cell's) serialization format changes this method cannot be used.<a name="line.87"></a>
-<span class="sourceLineNo">088</span> * @param left the cell to be compared<a name="line.88"></a>
-<span class="sourceLineNo">089</span> * @param key the serialized key part of a KeyValue<a name="line.89"></a>
-<span class="sourceLineNo">090</span> * @param offset the offset in the key byte[]<a name="line.90"></a>
-<span class="sourceLineNo">091</span> * @param length the length of the key byte[]<a name="line.91"></a>
-<span class="sourceLineNo">092</span> * @return an int greater than 0 if left is greater than right<a name="line.92"></a>
-<span class="sourceLineNo">093</span> * lesser than 0 if left is lesser than right<a name="line.93"></a>
-<span class="sourceLineNo">094</span> * equal to 0 if left is equal to right<a name="line.94"></a>
-<span class="sourceLineNo">095</span> */<a name="line.95"></a>
-<span class="sourceLineNo">096</span> public final int compare(Cell left, byte[] key, int offset, int length) {<a name="line.96"></a>
-<span class="sourceLineNo">097</span> // row<a name="line.97"></a>
-<span class="sourceLineNo">098</span> short rrowlength = Bytes.toShort(key, offset);<a name="line.98"></a>
-<span class="sourceLineNo">099</span> int c = compareRows(left, key, offset + Bytes.SIZEOF_SHORT, rrowlength);<a name="line.99"></a>
-<span class="sourceLineNo">100</span> if (c != 0) return c;<a name="line.100"></a>
-<span class="sourceLineNo">101</span><a name="line.101"></a>
-<span class="sourceLineNo">102</span> // Compare the rest of the two KVs without making any assumptions about<a name="line.102"></a>
-<span class="sourceLineNo">103</span> // the common prefix. This function will not compare rows anyway, so we<a name="line.103"></a>
-<span class="sourceLineNo">104</span> // don't need to tell it that the common prefix includes the row.<a name="line.104"></a>
-<span class="sourceLineNo">105</span> return compareWithoutRow(left, key, offset, length, rrowlength);<a name="line.105"></a>
-<span class="sourceLineNo">106</span> }<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> * Compare cells.<a name="line.109"></a>
-<span class="sourceLineNo">110</span> * @param a<a name="line.110"></a>
-<span class="sourceLineNo">111</span> * @param b<a name="line.111"></a>
-<span class="sourceLineNo">112</span> * @param ignoreSequenceid True if we are to compare the key portion only and ignore<a name="line.112"></a>
-<span class="sourceLineNo">113</span> * the sequenceid. Set to false to compare key and consider sequenceid.<a name="line.113"></a>
-<span class="sourceLineNo">114</span> * @return 0 if equal, -1 if a &lt; b, and +1 if a &gt; b.<a name="line.114"></a>
-<span class="sourceLineNo">115</span> */<a name="line.115"></a>
-<span class="sourceLineNo">116</span> private final int compare(final Cell a, final Cell b, boolean ignoreSequenceid) {<a name="line.116"></a>
-<span class="sourceLineNo">117</span> // row<a name="line.117"></a>
-<span class="sourceLineNo">118</span> int c = compareRows(a, b);<a name="line.118"></a>
-<span class="sourceLineNo">119</span> if (c != 0) return c;<a name="line.119"></a>
-<span class="sourceLineNo">120</span><a name="line.120"></a>
-<span class="sourceLineNo">121</span> c = compareWithoutRow(a, b);<a name="line.121"></a>
-<span class="sourceLineNo">122</span> if(c != 0) return c;<a name="line.122"></a>
-<span class="sourceLineNo">123</span><a name="line.123"></a>
-<span class="sourceLineNo">124</span> if (!ignoreSequenceid) {<a name="line.124"></a>
-<span class="sourceLineNo">125</span> // Negate following comparisons so later edits show up first<a name="line.125"></a>
-<span class="sourceLineNo">126</span> // mvccVersion: later sorts first<a name="line.126"></a>
-<span class="sourceLineNo">127</span> return Longs.compare(b.getSequenceId(), a.getSequenceId());<a name="line.127"></a>
-<span class="sourceLineNo">128</span> } else {<a name="line.128"></a>
-<span class="sourceLineNo">129</span> return c;<a name="line.129"></a>
-<span class="sourceLineNo">130</span> }<a name="line.130"></a>
-<span class="sourceLineNo">131</span> }<a name="line.131"></a>
-<span class="sourceLineNo">132</span><a name="line.132"></a>
-<span class="sourceLineNo">133</span> /**<a name="line.133"></a>
-<span class="sourceLineNo">134</span> * Compares the family and qualifier part of the cell<a name="line.134"></a>
-<span class="sourceLineNo">135</span> * @param left the left cell<a name="line.135"></a>
-<span class="sourceLineNo">136</span> * @param right the right cell<a name="line.136"></a>
-<span class="sourceLineNo">137</span> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise<a name="line.137"></a>
-<span class="sourceLineNo">138</span> */<a name="line.138"></a>
-<span class="sourceLineNo">139</span> public final static int compareColumns(final Cell left, final Cell right) {<a name="line.139"></a>
-<span class="sourceLineNo">140</span> int diff = compareFamilies(left, right);<a name="line.140"></a>
-<span class="sourceLineNo">141</span> if (diff != 0) {<a name="line.141"></a>
-<span class="sourceLineNo">142</span> return diff;<a name="line.142"></a>
-<span class="sourceLineNo">143</span> }<a name="line.143"></a>
-<span class="sourceLineNo">144</span> return compareQualifiers(left, right);<a name="line.144"></a>
-<span class="sourceLineNo">145</span> }<a name="line.145"></a>
-<span class="sourceLineNo">146</span><a name="line.146"></a>
-<span class="sourceLineNo">147</span> private final static int compareColumns(Cell left, byte[] right, int rfoffset, int rflength,<a name="line.147"></a>
-<span class="sourceLineNo">148</span> int rqoffset, int rqlength) {<a name="line.148"></a>
-<span class="sourceLineNo">149</span> int diff = compareFamilies(left, right, rfoffset, rflength);<a name="line.149"></a>
-<span class="sourceLineNo">150</span> if (diff != 0)<a name="line.150"></a>
-<span class="sourceLineNo">151</span> return diff;<a name="line.151"></a>
-<span class="sourceLineNo">152</span> return compareQualifiers(left, right, rqoffset, rqlength);<a name="line.152"></a>
-<span class="sourceLineNo">153</span> }<a name="line.153"></a>
-<span class="sourceLineNo">154</span><a name="line.154"></a>
-<span class="sourceLineNo">155</span> /**<a name="line.155"></a>
-<span class="sourceLineNo">156</span> * Compare the families of left and right cell<a name="line.156"></a>
-<span class="sourceLineNo">157</span> * @param left<a name="line.157"></a>
-<span class="sourceLineNo">158</span> * @param right<a name="line.158"></a>
-<span class="sourceLineNo">159</span> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise<a name="line.159"></a>
-<span class="sourceLineNo">160</span> */<a name="line.160"></a>
-<span class="sourceLineNo">161</span> public final static int compareFamilies(Cell left, Cell right) {<a name="line.161"></a>
-<span class="sourceLineNo">162</span> if (left instanceof ByteBufferCell && right instanceof ByteBufferCell) {<a name="line.162"></a>
-<span class="sourceLineNo">163</span> return ByteBufferUtils.compareTo(((ByteBufferCell) left).getFamilyByteBuffer(),<a name="line.163"></a>
-<span class="sourceLineNo">164</span> ((ByteBufferCell) left).getFamilyPosition(), left.getFamilyLength(),<a name="line.164"></a>
-<span class="sourceLineNo">165</span> ((ByteBufferCell) right).getFamilyByteBuffer(),<a name="line.165"></a>
-<span class="sourceLineNo">166</span> ((ByteBufferCell) right).getFamilyPosition(), right.getFamilyLength());<a name="line.166"></a>
-<span class="sourceLineNo">167</span> }<a name="line.167"></a>
-<span class="sourceLineNo">168</span> if (left instanceof ByteBufferCell) {<a name="line.168"></a>
-<span class="sourceLineNo">169</span> return ByteBufferUtils.compareTo(((ByteBufferCell) left).getFamilyByteBuffer(),<a name="line.169"></a>
-<span class="sourceLineNo">170</span> ((ByteBufferCell) left).getFamilyPosition(), left.getFamilyLength(),<a name="line.170"></a>
-<span class="sourceLineNo">171</span> right.getFamilyArray(), right.getFamilyOffset(), right.getFamilyLength());<a name="line.171"></a>
-<span class="sourceLineNo">172</span> }<a name="line.172"></a>
-<span class="sourceLineNo">173</span> if (right instanceof ByteBufferCell) {<a name="line.173"></a>
-<span class="sourceLineNo">174</span> // Notice how we flip the order of the compare here. We used to negate the return value but<a name="line.174"></a>
-<span class="sourceLineNo">175</span> // see what FindBugs says<a name="line.175"></a>
-<span class="sourceLineNo">176</span> // http://findbugs.sourceforge.net/bugDescriptions.html#RV_NEGATING_RESULT_OF_COMPARETO<a name="line.176"></a>
-<span class="sourceLineNo">177</span> // It suggest flipping the order to get same effect and 'safer'.<a name="line.177"></a>
-<span class="sourceLineNo">178</span> return ByteBufferUtils.compareTo(<a name="line.178"></a>
-<span class="sourceLineNo">179</span> left.getFamilyArray(), left.getFamilyOffset(), left.getFamilyLength(),<a name="line.179"></a>
-<span class="sourceLineNo">180</span> ((ByteBufferCell)right).getFamilyByteBuffer(),<a name="line.180"></a>
-<span class="sourceLineNo">181</span> ((ByteBufferCell)right).getFamilyPosition(), right.getFamilyLength());<a name="line.181"></a>
-<span class="sourceLineNo">182</span> }<a name="line.182"></a>
-<span class="sourceLineNo">183</span> return Bytes.compareTo(left.getFamilyArray(), left.getFamilyOffset(), left.getFamilyLength(),<a name="line.183"></a>
-<span class="sourceLineNo">184</span> right.getFamilyArray(), right.getFamilyOffset(), right.getFamilyLength());<a name="line.184"></a>
-<span class="sourceLineNo">185</span> }<a name="line.185"></a>
-<span class="sourceLineNo">186</span><a name="line.186"></a>
-<span class="sourceLineNo">187</span> private final static int compareFamilies(Cell left, byte[] right, int roffset, int rlength) {<a name="line.187"></a>
-<span class="sourceLineNo">188</span> if (left instanceof ByteBufferCell) {<a name="line.188"></a>
-<span class="sourceLineNo">189</span> return ByteBufferUtils.compareTo(((ByteBufferCell) left).getFamilyByteBuffer(),<a name="line.189"></a>
-<span class="sourceLineNo">190</span> ((ByteBufferCell) left).getFamilyPosition(), left.getFamilyLength(), right,<a name="line.190"></a>
-<span class="sourceLineNo">191</span> roffset, rlength);<a name="line.191"></a>
-<span class="sourceLineNo">192</span> }<a name="line.192"></a>
-<span class="sourceLineNo">193</span> return Bytes.compareTo(left.getFamilyArray(), left.getFamilyOffset(), left.getFamilyLength(),<a name="line.193"></a>
-<span class="sourceLineNo">194</span> right, roffset, rlength);<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> /**<a name="line.197"></a>
-<span class="sourceLineNo">198</span> * Compare the qualifiers part of the left and right cells.<a name="line.198"></a>
-<span class="sourceLineNo">199</span> * @param left<a name="line.199"></a>
-<span class="sourceLineNo">200</span> * @param right<a name="line.200"></a>
-<span class="sourceLineNo">201</span> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise<a name="line.201"></a>
-<span class="sourceLineNo">202</span> */<a name="line.202"></a>
-<span class="sourceLineNo">203</span> public final static int compareQualifiers(Cell left, Cell right) {<a name="line.203"></a>
-<span class="sourceLineNo">204</span> if (left instanceof ByteBufferCell && right instanceof ByteBufferCell) {<a name="line.204"></a>
-<span class="sourceLineNo">205</span> return ByteBufferUtils<a name="line.205"></a>
-<span class="sourceLineNo">206</span> .compareTo(((ByteBufferCell) left).getQualifierByteBuffer(),<a name="line.206"></a>
-<span class="sourceLineNo">207</span> ((ByteBufferCell) left).getQualifierPosition(),<a name="line.207"></a>
-<span class="sourceLineNo">208</span> left.getQualifierLength(), ((ByteBufferCell) right).getQualifierByteBuffer(),<a name="line.208"></a>
-<span class="sourceLineNo">209</span> ((ByteBufferCell) right).getQualifierPosition(),<a name="line.209"></a>
-<span class="sourceLineNo">210</span> right.getQualifierLength());<a name="line.210"></a>
-<span class="sourceLineNo">211</span> }<a name="line.211"></a>
-<span class="sourceLineNo">212</span> if (left instanceof ByteBufferCell) {<a name="line.212"></a>
-<span class="sourceLineNo">213</span> return ByteBufferUtils.compareTo(((ByteBufferCell) left).getQualifierByteBuffer(),<a name="line.213"></a>
-<span class="sourceLineNo">214</span> ((ByteBufferCell) left).getQualifierPosition(), left.getQualifierLength(),<a name="line.214"></a>
-<span class="sourceLineNo">215</span> right.getQualifierArray(), right.getQualifierOffset(), right.getQualifierLength());<a name="line.215"></a>
-<span class="sourceLineNo">216</span> }<a name="line.216"></a>
-<span class="sourceLineNo">217</span> if (right instanceof ByteBufferCell) {<a name="line.217"></a>
-<span class="sourceLineNo">218</span> // Notice how we flip the order of the compare here. We used to negate the return value but<a name="line.218"></a>
-<span class="sourceLineNo">219</span> // see what FindBugs says<a name="line.219"></a>
-<span class="sourceLineNo">220</span> // http://findbugs.sourceforge.net/bugDescriptions.html#RV_NEGATING_RESULT_OF_COMPARETO<a name="line.220"></a>
-<span class="sourceLineNo">221</span> // It suggest flipping the order to get same effect and 'safer'.<a name="line.221"></a>
-<span class="sourceLineNo">222</span> return ByteBufferUtils.compareTo(left.getQualifierArray(),<a name="line.222"></a>
-<span class="sourceLineNo">223</span> left.getQualifierOffset(), left.getQualifierLength(),<a name="line.223"></a>
-<span class="sourceLineNo">224</span> ((ByteBufferCell)right).getQualifierByteBuffer(),<a name="line.224"></a>
-<span class="sourceLineNo">225</span> ((ByteBufferCell)right).getQualifierPosition(), right.getQualifierLength());<a name="line.225"></a>
-<span class="sourceLineNo">226</span> }<a name="line.226"></a>
-<span class="sourceLineNo">227</span> return Bytes.compareTo(left.getQualifierArray(), left.getQualifierOffset(),<a name="line.227"></a>
-<span class="sourceLineNo">228</span> left.getQualifierLength(), right.getQualifierArray(), right.getQualifierOffset(),<a name="line.228"></a>
-<span class="sourceLineNo">229</span> right.getQualifierLength());<a name="line.229"></a>
-<span class="sourceLineNo">230</span> }<a name="line.230"></a>
-<span class="sourceLineNo">231</span><a name="line.231"></a>
-<span class="sourceLineNo">232</span> public final static int compareQualifiers(Cell left, byte[] right, int rOffset, int rLength) {<a name="line.232"></a>
-<span class="sourceLineNo">233</span> if (left instanceof ByteBufferCell) {<a name="line.233"></a>
-<span class="sourceLineNo">234</span> return ByteBufferUtils.compareTo(((ByteBufferCell) left).getQualifierByteBuffer(),<a name="line.234"></a>
-<span class="sourceLineNo">235</span> ((ByteBufferCell) left).getQualifierPosition(), left.getQualifierLength(),<a name="line.235"></a>
-<span class="sourceLineNo">236</span> right, rOffset, rLength);<a name="line.236"></a>
-<span class="sourceLineNo">237</span> }<a name="line.237"></a>
-<span class="sourceLineNo">238</span> return Bytes.compareTo(left.getQualifierArray(), left.getQualifierOffset(),<a name="line.238"></a>
-<span class="sourceLineNo">239</span> left.getQualifierLength(), right, rOffset, rLength);<a name="line.239"></a>
-<span class="sourceLineNo">240</span> }<a name="line.240"></a>
-<span class="sourceLineNo">241</span><a name="line.241"></a>
-<span class="sourceLineNo">242</span> /**<a name="line.242"></a>
-<span class="sourceLineNo">243</span> * Compare columnFamily, qualifier, timestamp, and key type (everything<a name="line.243"></a>
-<span class="sourceLineNo">244</span> * except the row). This method is used both in the normal comparator and<a name="line.244"></a>
-<span class="sourceLineNo">245</span> * the "same-prefix" comparator. Note that we are assuming that row portions<a name="line.245"></a>
-<span class="sourceLineNo">246</span> * of both KVs have already been parsed and found identical, and we don't<a name="line.246"></a>
-<span class="sourceLineNo">247</span> * validate that assumption here.<a name="line.247"></a>
-<span class="sourceLineNo">248</span> * @param commonPrefix<a name="line.248"></a>
-<span class="sourceLineNo">249</span> * the length of the common prefix of the two key-values being<a name="line.249"></a>
-<span class="sourceLineNo">250</span> * compared, including row length and row<a name="line.250"></a>
-<span class="sourceLineNo">251</span> */<a name="line.251"></a>
-<span class="sourceLineNo">252</span> private final int compareWithoutRow(Cell left,<a name="line.252"></a>
-<span class="sourceLineNo">253</span> byte[] right, int roffset, int rlength, short rowlength) {<a name="line.253"></a>
-<span class="sourceLineNo">254</span> /***<a name="line.254"></a>
-<span class="sourceLineNo">255</span> * KeyValue Format and commonLength:<a name="line.255"></a>
-<span class="sourceLineNo">256</span> * |_keyLen_|_valLen_|_rowLen_|_rowKey_|_famiLen_|_fami_|_Quali_|....<a name="line.256"></a>
-<span class="sourceLineNo">257</span> * ------------------|-------commonLength--------|--------------<a name="line.257"></a>
-<span class="sourceLineNo">258</span> */<a name="line.258"></a>
-<span class="sourceLineNo">259</span> int commonLength = KeyValue.ROW_LENGTH_SIZE + KeyValue.FAMILY_LENGTH_SIZE + rowlength;<a name="line.259"></a>
-<span class="sourceLineNo">260</span><a name="line.260"></a>
-<span class="sourceLineNo">261</span> // commonLength + TIMESTAMP_TYPE_SIZE<a name="line.261"></a>
-<span class="sourceLineNo">262</span> int commonLengthWithTSAndType = KeyValue.TIMESTAMP_TYPE_SIZE + commonLength;<a name="line.262"></a>
-<span class="sourceLineNo">263</span> // ColumnFamily + Qualifier length.<a name="line.263"></a>
-<span class="sourceLineNo">264</span> int lcolumnlength = left.getFamilyLength() + left.getQualifierLength();<a name="line.264"></a>
-<span class="sourceLineNo">265</span> int rcolumnlength = rlength - commonLengthWithTSAndType;<a name="line.265"></a>
-<span class="sourceLineNo">266</span><a name="line.266"></a>
-<span class="sourceLineNo">267</span> byte ltype = left.getTypeByte();<a name="line.267"></a>
-<span class="sourceLineNo">268</span> byte rtype = right[roffset + (rlength - 1)];<a name="line.268"></a>
-<span class="sourceLineNo">269</span><a name="line.269"></a>
-<span class="sourceLineNo">270</span> // If the column is not specified, the "minimum" key type appears the<a name="line.270"></a>
-<span class="sourceLineNo">271</span> // latest in the sorted order, regardless of the timestamp. This is used<a name="line.271"></a>
-<span class="sourceLineNo">272</span> // for specifying the last key/value in a given row, because there is no<a name="line.272"></a>
-<span class="sourceLineNo">273</span> // "lexicographically last column" (it would be infinitely long). The<a name="line.273"></a>
-<span class="sourceLineNo">274</span> // "maximum" key type does not need this behavior.<a name="line.274"></a>
-<span class="sourceLineNo">275</span> if (lcolumnlength == 0 && ltype == Type.Minimum.getCode()) {<a name="line.275"></a>
-<span class="sourceLineNo">276</span> // left is "bigger", i.e. it appears later in the sorted order<a name="line.276"></a>
-<span class="sourceLineNo">277</span> return 1;<a name="line.277"></a>
-<span class="sourceLineNo">278</span> }<a name="line.278"></a>
-<span class="sourceLineNo">279</span> if (rcolumnlength == 0 && rtype == Type.Minimum.getCode()) {<a name="line.279"></a>
-<span class="sourceLineNo">280</span> return -1;<a name="line.280"></a>
-<span class="sourceLineNo">281</span> }<a name="line.281"></a>
-<span class="sourceLineNo">282</span><a name="line.282"></a>
-<span class="sourceLineNo">283</span> int rfamilyoffset = commonLength + roffset;<a name="line.283"></a>
-<span class="sourceLineNo">284</span><a name="line.284"></a>
-<span class="sourceLineNo">285</span> // Column family length.<a name="line.285"></a>
-<span class="sourceLineNo">286</span> int lfamilylength = left.getFamilyLength();<a name="line.286"></a>
-<span class="sourceLineNo">287</span> int rfamilylength = right[rfamilyoffset - 1];<a name="line.287"></a>
-<span class="sourceLineNo">288</span> // If left family size is not equal to right family size, we need not<a name="line.288"></a>
-<span class="sourceLineNo">289</span> // compare the qualifiers.<a name="line.289"></a>
-<span class="sourceLineNo">290</span> boolean sameFamilySize = (lfamilylength == rfamilylength);<a name="line.290"></a>
-<span class="sourceLineNo">291</span> if (!sameFamilySize) {<a name="line.291"></a>
-<span class="sourceLineNo">292</span> // comparing column family is enough.<a name="line.292"></a>
-<span class="sourceLineNo">293</span> return compareFamilies(left, right, rfamilyoffset, rfamilylength);<a name="line.293"></a>
-<span class="sourceLineNo">294</span> }<a name="line.294"></a>
-<span class="sourceLineNo">295</span> // Compare family & qualifier together.<a name="line.295"></a>
-<span class="sourceLineNo">296</span> // Families are same. Compare on qualifiers.<a name="line.296"></a>
-<span class="sourceLineNo">297</span> int comparison = compareColumns(left, right, rfamilyoffset, rfamilylength, rfamilyoffset<a name="line.297"></a>
-<span class="sourceLineNo">298</span> + rfamilylength, (rcolumnlength - rfamilylength));<a name="line.298"></a>
-<span class="sourceLineNo">299</span> if (comparison != 0) {<a name="line.299"></a>
-<span class="sourceLineNo">300</span> return comparison;<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> // //<a name="line.303"></a>
-<span class="sourceLineNo">304</span> // Next compare timestamps.<a name="line.304"></a>
-<span class="sourceLineNo">305</span> long rtimestamp = Bytes.toLong(right, roffset + (rlength - KeyValue.TIMESTAMP_TYPE_SIZE));<a name="line.305"></a>
-<span class="sourceLineNo">306</span> int compare = compareTimestamps(left.getTimestamp(), rtimestamp);<a name="line.306"></a>
-<span class="sourceLineNo">307</span> if (compare != 0) {<a name="line.307"></a>
-<span class="sourceLineNo">308</span> return compare;<a name="line.308"></a>
-<span class="sourceLineNo">309</span> }<a name="line.309"></a>
-<span class="sourceLineNo">310</span><a name="line.310"></a>
-<span class="sourceLineNo">311</span> // Compare types. Let the delete types sort ahead of puts; i.e. types<a name="line.311"></a>
-<span class="sourceLineNo">312</span> // of higher numbers sort before those of lesser numbers. Maximum (255)<a name="line.312"></a>
-<span class="sourceLineNo">313</span> // appears ahead of everything, and minimum (0) appears after<a name="line.313"></a>
-<span class="sourceLineNo">314</span> // everything.<a name="line.314"></a>
-<span class="sourceLineNo">315</span> return (0xff & rtype) - (0xff & ltype);<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> /**<a name="line.318"></a>
-<span class="sourceLineNo">319</span> * Compares the rows of the left and right cell.<a name="line.319"></a>
-<span class="sourceLineNo">320</span> * For the hbase:meta case this method is overridden such that it can handle hbase:meta cells.<a name="line.320"></a>
-<span class="sourceLineNo">321</span> * The caller should ensure using the appropriate comparator for hbase:meta.<a name="line.321"></a>
-<span class="sourceLineNo">322</span> * @param left<a name="line.322"></a>
-<span class="sourceLineNo">323</span> * @param right<a name="line.323"></a>
-<span class="sourceLineNo">324</span> * @return 0 if both cells are equal, 1 if left cell is bigger than right, -1 otherwise<a name="line.324"></a>
-<span class="sourceLineNo">325</span> */<a name="line.325"></a>
-<span class="sourceLineNo">326</span> public int compareRows(final Cell left, final Cell right) {<a name="line.326"></a>
-<span class="sourceLineNo">327</span> // left and right can be exactly the same at the beginning of a row<a name="line.327"></a>
-<span class="sourceLineNo">328</span> if (left == right) {<a name="line.328"></a>
-<span class="sourceLineNo">329</span> return 0;<a name="line.329"></a>
-<span class="sourceLineNo">330</span> }<a name="line.330"></a>
-<span class="sourceLineNo">331</span> if (left instanceof ByteBufferCell && right instanceof ByteBufferCell) {<a name="line.331"></a>
-<span class="sourceLineNo">332</span> return ByteBufferUtils.compareTo(((ByteBufferCell) left).getRowByteBuffer(),<a name="line.332"></a>
-<span class="sourceLineNo">333</span> ((ByteBufferCell) left).getRowPosition(), left.getRowLength(),<a name="line.333"></a>
-<span class="sourceLineNo">334</span> ((ByteBufferCell) right).getRowByteBuffer(),<a name="line.334"></a>
-<span class="sourceLineNo">335</span> ((ByteBufferCell) right).getRowPosition(), right.getRowLength());<a name="line.335"></a>
-<span class="sourceLineNo">336</span> }<a name="line.336"></a>
-<span class="sourceLineNo">337</span> if (left instanceof ByteBufferCell) {<a name="line.337"></a>
-<span class="sourceLineNo">338</span> return ByteBufferUtils.compareTo(((ByteBufferCell) left).getRowByteBuffer(),<a name="line.338"></a>
-<span class="sourceLineNo">339</span> ((ByteBufferCell) left).getRowPosition(), left.getRowLength(),<a name="line.339"></a>
-<span class="sourceLineNo">340</span> right.getRowArray(), right.getRowOffset(), right.getRowLength());<a name="line.340"></a>
-<span class="sourceLineNo">341</span> }<a name="line.341"></a>
-<span class="sourceLineNo">342</span> if (right instanceof ByteBufferCell) {<a name="line.342"></a>
-<span class="sourceLineNo">343</span> // Notice how we flip the order of the compare here. We used to negate the return value but<a name="line.343"></a>
-<span class="sourceLineNo">344</span> // see what FindBugs says<a name="line.344"></a>
-<span class="sourceLineNo">345</span> // http://findbugs.sourceforge.net/bugDescriptions.html#RV_NEGATING_RESULT_OF_COMPARETO<a name="line.345"></a>
-<span class="sourceLineNo">346</span> // It suggest flipping the order to get same effect and 'safer'.<a name="line.346"></a>
-<span class="sourceLineNo">347</span> return ByteBufferUtils.compareTo(left.getRowArray(), left.getRowOffset(), left.getRowLength(),<a name="line.347"></a>
-<span class="sourceLineNo">348</span> ((ByteBufferCell)right).getRowByteBuffer(),<a name="line.348"></a>
-<span class="sourceLineNo">349</span> ((ByteBufferCell)right).getRowPosition(), right.getRowLength());<a name="line.349"></a>
-<span class="sourceLineNo">350</span> }<a name="line.350"></a>
-<span class="sourceLineNo">351</span> return Bytes.compareTo(left.getRowArray(), left.getRowOffset(), left.getRowLength(),<a name="line.351"></a>
-<span class="sourceLineNo">352</span> right.getRowArray(), right.getRowOffset(), right.getRowLength());<a name="line.352"></a>
-<span class="sourceLineNo">353</span> }<a name="line.353"></a>
-<span class="sourceLineNo">354</span><a name="line.354"></a>
-<span class="sourceLineNo">355</span> /**<a name="line.355"></a>
-<span class="sourceLineNo">356</span> * Compares the row part of the cell with a simple plain byte[] like the<a name="line.356"></a>
-<span class="sourceLineNo">357</span> * stopRow in Scan. This should be used with context where for hbase:meta<a name="line.357"></a>
-<span class="sourceLineNo">358</span> * cells the {{@link #META_COMPARATOR} should be used<a name="line.358"></a>
-<span class="sourceLineNo">359</span> *<a name="line.359"></a>
-<span class="sourceLineNo">360</span> * @param left<a name="line.360"></a>
-<span class="sourceLineNo">361</span> * the cell to be compared<a name="line.361"></a>
-<span class="sourceLineNo">362</span> * @param right<a name="line.362"></a>
-<span class="sourceLineNo">363</span> * the kv serialized byte[] to be compared with<a name="line.363"></a>
-<span class="sourceLineNo">364</span> * @param roffset<a name="line.364"></a>
-<span class="sourceLineNo">365</span> * the offset in the byte[]<a name="line.365"></a>
-<span class="sourceLineNo">366</span> * @param rlength<a name="line.366"></a>
-<span class="sourceLineNo">367</span> * the length in the byte[]<a name="line.367"></a>
-<span class="sourceLineNo">368</span> * @return 0 if both cell and the byte[] are equal, 1 if the cell is bigger<a name="line.368"></a>
-<span class="sourceLineNo">369</span> * than byte[], -1 otherwise<a name="line.369"></a>
-<span class="sourceLineNo">370</span> */<a name="line.370"></a>
-<span class="sourceLineNo">371</span> public int compareRows(Cell left, byte[] right, int roffset, int rlength) {<a name="line.371"></a>
-<span class="sourceLineNo">372</span> if (left instanceof ByteBufferCell) {<a name="line.372"></a>
-<span class="sourceLineNo">373</span> return ByteBufferUtils.compareTo(((ByteBufferCell) left).getRowByteBuffer(),<a name="line.373"></a>
-<span class="sourceLineNo">374</span> ((ByteBufferCell) left).getRowPosition(), left.getRowLength(), right,<a name="line.374"></a>
-<span class="sourceLineNo">375</span> roffset, rlength);<a name="line.375"></a>
-<span class="sourceLineNo">376</span> }<a name="line.376"></a>
-<span class="sourceLineNo">377</span> return Bytes.compareTo(left.getRowArray(), left.getRowOffset(), left.getRowLength(), right,<a name="line.377"></a>
-<span class="sourceLineNo">378</span> roffset, rlength);<a name="line.378"></a>
-<span class="sourceLineNo">379</span> }<a name="line.379"></a>
-<span class="sourceLineNo">380</span><a name="line.380"></a>
-<span class="sourceLineNo">381</span> public static int compareWithoutRow(final Cell left, final Cell right) {<a name="line.381"></a>
-<span class="sourceLineNo">382</span> // If the column is not specified, the "minimum" key type appears the<a name="line.382"></a>
-<span class="sourceLineNo">383</span> // latest in the sorted order, regardless of the timestamp. This is used<a name="line.383"></a>
-<span class="sourceLineNo">384</span> // for specifying the last key/value in a given row, because there is no<a name="line.384"></a>
-<span class="sourceLineNo">385</span> // "lexicographically last column" (it would be infinitely long). The<a name="line.385"></a>
-<span class="sourceLineNo">386</span> // "maximum" key type does not need this behavior.<a name="line.386"></a>
-<span class="sourceLineNo">387</span> // Copied from KeyValue. This is bad in that we can't do memcmp w/ special rules like this.<a name="line.387"></a>
-<span class="sourceLineNo">388</span> int lFamLength = left.getFamilyLength();<a name="line.388"></a>
-<span class="sourceLineNo">389</span> int rFamLength = right.getFamilyLength();<a name="line.389"></a>
-<span class="sourceLineNo">390</span> int lQualLength = left.getQualifierLength();<a name="line.390"></a>
-<span class="sourceLineNo">391</span> int rQualLength = right.getQualifierLength();<a name="line.391"></a>
-<span class="sourceLineNo">392</span> if (lFamLength + lQualLength == 0<a name="line.392"></a>
-<span class="sourceLineNo">393</span> && left.getTypeByte() == Type.Minimum.getCode()) {<a name="line.393"></a>
-<span class="sourceLineNo">394</span> // left is "bigger", i.e. it appears later in the sorted order<a name="line.394"></a>
-<span class="sourceLineNo">395</span> return 1;<a name="line.395"></a>
-<span class="sourceLineNo">396</span> }<a name="line.396"></a>
-<span class="sourceLineNo">397</span> if (rFamLength + rQualLength == 0<a name="line.397"></a>
-<span class="sourceLineNo">398</span> && right.getTypeByte() == Type.Minimum.getCode()) {<a name="line.398"></a>
-<span class="sourceLineNo">399</span> return -1;<a name="line.399"></a>
-<span class="sourceLineNo">400</span> }<a name="line.400"></a>
-<span class="sourceLineNo">401</span> if (lFamLength != rFamLength) {<a name="line.401"></a>
-<span class="sourceLineNo">402</span> // comparing column family is enough.<a name="line.402"></a>
-<span class="sourceLineNo">403</span> return compareFamilies(left, right);<a name="line.403"></a>
-<span class="sourceLineNo">404</span> }<a name="line.404"></a>
-<span class="sourceLineNo">405</span> // Compare cf:qualifier<a name="line.405"></a>
-<span class="sourceLineNo">406</span> int diff = compareColumns(left, right);<a name="line.406"></a>
-<span class="sourceLineNo">407</span> if (diff != 0) return diff;<a name="line.407"></a>
-<span class="sourceLineNo">408</span><a name="line.408"></a>
-<span class="sourceLineNo">409</span> diff = compareTimestamps(left, right);<a name="line.409"></a>
-<span class="sourceLineNo">410</span> if (diff != 0) return diff;<a name="line.410"></a>
-<span class="sourceLineNo">411</span><a name="line.411"></a>
-<span class="sourceLineNo">412</span> // Compare types. Let the delete types sort ahead of puts; i.e. types<a name="line.412"></a>
-<span class="sourceLineNo">413</span> // of higher numbers sort before those of lesser numbers. Maximum (255)<a name="line.413"></a>
-<span class="sourceLineNo">414</span> // appears ahead of everything, and minimum (0) appears after<a name="line.414"></a>
-<span class="sourceLineNo">415</span> // everything.<a name="line.415"></a>
-<span class="sourceLineNo">416</span> return (0xff & right.getTypeByte()) - (0xff & left.getTypeByte());<a name="line.416"></a>
-<span class="sourceLineNo">417</span> }<a name="line.417"></a>
-<span class="sourceLineNo">418</span><a name="line.418"></a>
-<span class="sourceLineNo">419</span> /**<a name="line.419"></a>
-<span class="sourceLineNo">420</span> * Compares cell's timestamps in DESCENDING order.<a name="line.420"></a>
-<span class="sourceLineNo">421</span> * The below older timestamps sorting ahead of newer timestamps looks<a name="line.421"></a>
-<span class="sourceLineNo">422</span> * wrong but it is intentional. This way, newer timestamps are first<a name="line.422"></a>
-<span class="sourceLineNo">423</span> * found when we iterate over a memstore and newer versions are the<a name="line.423"></a>
-<span class="sourceLineNo">424</span> * first we trip over when reading from a store file.<a name="line.424"></a>
-<span class="sourceLineNo">425</span> * @return 1 if left's timestamp &lt; right's timestamp<a name="line.425"></a>
-<span class="sourceLineNo">426</span> * -1 if left's timestamp &gt; right's timestamp<a name="line.426"></a>
-<span class="sourceLineNo">427</span> * 0 if both timestamps are equal<a name="line.427"></a>
-<span class="sourceLineNo">428</span> */<a name="line.428"></a>
-<span class="sourceLineNo">429</span> public static int compareTimestamps(final Cell left, final Cell right) {<a name="line.429"></a>
-<span class="sourceLineNo">430</span> return compareTimestamps(left.getTimestamp(), right.getTimestamp());<a name="line.430"></a>
-<span class="sourceLineNo">431</span> }<a name="line.431"></a>
-<span class="sourceLineNo">432</span><a name="line.432"></a>
-<span class="sourceLineNo">433</span> /**<a name="line.433"></a>
-<span class="sourceLineNo">434</span> * Used to compare two cells based on the column hint provided. This is specifically<a name="line.434"></a>
-<span class="sourceLineNo">435</span> * used when we need to optimize the seeks based on the next indexed key. This is an<a name="line.435"></a>
-<span class="sourceLineNo">436</span> * advanced usage API specifically needed for some optimizations.<a name="line.436"></a>
-<span class="sourceLineNo">437</span> * @param nextIndexedCell the next indexed cell <a name="line.437"></a>
-<span class="sourceLineNo">438</span> * @param currentCell the cell to be compared<a name="line.438"></a>
-<span class="sourceLineNo">439</span> * @param foff the family offset of the currentCell<a name="line.439"></a>
-<span class="sourceLineNo">440</span> * @param flen the family length of the currentCell<a name="line.440"></a>
-<span class="sourceLineNo">441</span> * @param colHint the column hint provided - could be null<a name="line.441"></a>
-<span class="sourceLineNo">442</span> * @param coff the offset of the column hint if provided, if not offset of the currentCell's<a name="line.442"></a>
-<span class="sourceLineNo">443</span> * qualifier<a name="line.443"></a>
-<span class="sourceLineNo">444</span> * @param clen the length of the column hint if provided, if not length of the currentCell's<a name="line.444"></a>
-<span class="sourceLineNo">445</span> * qualifier<a name="line.445"></a>
-<span class="sourceLineNo">446</span> * @param ts the timestamp to be seeked<a name="line.446"></a>
-<span class="sourceLineNo">447</span> * @param type the type to be seeked<a name="line.447"></a>
-<span class="sourceLineNo">448</span> * @return an int based on the given column hint<a name="line.448"></a>
-<span class="sourceLineNo">449</span> * TODO : To be moved out of here because this is a special API used in scan<a name="line.449"></a>
-<span class="sourceLineNo">450</span> * optimization.<a name="line.450"></a>
-<span class="sourceLineNo">451</span> */<a name="line.451"></a>
-<span class="sourceLineNo">452</span> // compare a key against row/fam/qual/ts/type<a name="line.452"></a>
-<span class="sourceLineNo">453</span> public final int compareKeyBasedOnColHint(Cell nextIndexedCell, Cell currentCell, int foff,<a name="line.453"></a>
-<span class="sourceLineNo">454</span> int flen, byte[] colHint, int coff, int clen, long ts, byte type) {<a name="line.454"></a>
-<span class="sourceLineNo">455</span> int compare = compareRows(nextIndexedCell, currentCell);<a name="line.455"></a>
-<span class="sourceLineNo">456</span> if (compare != 0) {<a name="line.456"></a>
-<span class="sourceLineNo">457</span> return compare;<a name="line.457"></a>
-<span class="sourceLineNo">458</span> }<a name="line.458"></a>
-<span class="sourceLineNo">459</span> // If the column is not specified, the "minimum" key type appears the<a name="line.459"></a>
-<span class="sourceLineNo">460</span> // latest in the sorted order, regardless of the timestamp. This is used<a name="line.460"></a>
-<span class="sourceLineNo">461</span> // for specifying the last key/value in a given row, because there is no<a name="line.461"></a>
-<span class="sourceLineNo">462</span> // "lexicographically last column" (it would be infinitely long). The<a name="line.462"></a>
-<span class="sourceLineNo">463</span> // "maximum" key type does not need this behavior.<a name="line.463"></a>
-<span class="sourceLineNo">464</span> if (nextIndexedCell.getFamilyLength() + nextIndexedCell.getQualifierLength() == 0<a name="line.464"></a>
-<span class="sourceLineNo">465</span> && nextIndexedCell.getTypeByte() == Type.Minimum.getCode()) {<a name="line.465"></a>
-<span class="sourceLineNo">466</span> // left is "bigger", i.e. it appears later in the sorted order<a name="line.466"></a>
-<span class="sourceLineNo">467</span> return 1;<a name="line.467"></a>
-<span class="sourceLineNo">468</span> }<a name="line.468"></a>
-<span class="sourceLineNo">469</span> if (flen + clen == 0 && type == Type.Minimum.getCode()) {<a name="line.469"></a>
-<span class="sourceLineNo">470</span> return -1;<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> compare = compareFamilies(nextIndexedCell, currentCell);<a name="line.473"></a>
-<span class="sourceLineNo">474</span> if (compare != 0) {<a name="line.474"></a>
-<span class="sourceLineNo">475</span> return compare;<a name="line.475"></a>
-<span class="sourceLineNo">476</span> }<a name="line.476"></a>
-<span class="sourceLineNo">477</span> if (colHint == null) {<a name="line.477"></a>
-<span class="sourceLineNo">478</span> compare = compareQualifiers(nextIndexedCell, currentCell);<a name="line.478"></a>
-<span class="sourceLineNo">479</span> } else {<a name="line.479"></a>
-<span class="sourceLineNo">480</span> compare = compareQualifiers(nextIndexedCell, colHint, coff, clen);<a name="line.480"></a>
-<span class="sourceLineNo">481</span> }<a name="line.481"></a>
-<span class="sourceLineNo">482</span> if (compare != 0) {<a name="line.482"></a>
-<span class="sourceLineNo">483</span> return compare;<a name="line.483"></a>
-<span class="sourceLineNo">484</span> }<a name="line.484"></a>
-<span class="sourceLineNo">485</span> // Next compare timestamps.<a name="line.485"></a>
-<span class="sourceLineNo">486</span> compare = compareTimestamps(nextIndexedCell.getTimestamp(), ts);<a name="line.486"></a>
-<span class="sourceLineNo">487</span> if (compare != 0) {<a name="line.487"></a>
-<span class="sourceLineNo">488</span> return compare;<a name="line.488"></a>
-<span class="sourceLineNo">489</span> }<a name="line.489"></a>
-<span class="sourceLineNo">490</span><a name="line.490"></a>
-<span class="sourceLineNo">491</span> // Compare types. Let the delete types sort ahead of puts; i.e. types<a name="line.491"></a>
-<span class="sourceLineNo">492</span> // of higher numbers sort before those of lesser numbers. Maximum (255)<a name="line.492"></a>
-<span class="sourceLineNo">493</span> // appears ahead of everything, and minimum (0) appears after<a name="line.493"></a>
-<span class="sourceLineNo">494</span> // everything.<a name="line.494"></a>
-<span class="sourceLineNo">495</span> return (0xff & type) - (0xff & nextIndexedCell.getTypeByte());<a name="line.495"></a>
-<span class="sourceLineNo">496</span> }<a name="line.496"></a>
-<span class="sourceLineNo">497</span><a name="line.497"></a>
-<span class="sourceLineNo">498</span> /**<a name="line.498"></a>
-<span class="sourceLineNo">499</span> * Compares timestamps in DESCENDING order.<a name="line.499"></a>
-<span class="sourceLineNo">500</span> * The below older timestamps sorting ahead of newer timestamps looks<a name="line.500"></a>
-<span class="sourceLineNo">501</span> * wrong but it is intentional. This way, newer timestamps are first<a name="line.501"></a>
-<span class="sourceLineNo">502</span> * found when we iterate over a memstore and newer versions are the<a name="line.502"></a>
-<span class="sourceLineNo">503</span> * first we trip over when reading from a store file.<a name="line.503"></a>
-<span class="sourceLineNo">504</span> * @return 1 if left timestamp &lt; right timestamp<a name="line.504"></a>
-<span class="sourceLineNo">505</span> * -1 if left timestamp &gt; right timestamp<a name="line.505"></a>
-<span class="sourceLineNo">506</span> * 0 if both timestamps are equal<a name="line.506"></a>
-<span class="sourceLineNo">507</span> */<a name="line.507"></a>
-<span class="sourceLineNo">508</span> public static int compareTimestamps(final long ltimestamp, final long rtimestamp) {<a name="line.508"></a>
-<span class="sourceLineNo">509</span> if (ltimestamp < rtimestamp) {<a name="line.509"></a>
-<span class="sourceLineNo">510</span> return 1;<a name="line.510"></a>
-<span class="sourceLineNo">511</span> } else if (ltimestamp > rtimestamp) {<a name="line.511"></a>
-<span class="sourceLineNo">512</span> return -1;<a name="line.512"></a>
-<span class="sourceLineNo">513</span> }<a name="line.513"></a>
-<span class="sourceLineNo">514</span> return 0;<a name="line.514"></a>
-<span class="sourceLineNo">515</span> }<a name="line.515"></a>
-<span class="sourceLineNo">516</span><a name="line.516"></a>
-<span class="sourceLineNo">517</span> /**<a name="line.517"></a>
-<span class="sourceLineNo">518</span> * Compare cell's row against given comparator<a name="line.518"></a>
-<span class="sourceLineNo">519</span> * @param cell<a name="line.519"></a>
-<span class="sourceLineNo">520</span> * @param comparator<a name="line.520"></a>
-<span class="sourceLineNo">521</span> * @return result comparing cell's row<a name="line.521"></a>
-<span class="sourceLineNo">522</span> */<a name="line.522"></a>
-<span class="sourceLineNo">523</span> public static int compareRow(Cell cell, ByteArrayComparable comparator) {<a name="line.523"></a>
-<span class="sourceLineNo">524</span> if (cell instanceof ByteBufferCell) {<a name="line.524"></a>
-<span class="sourceLineNo">525</span> return comparator.compareTo(((ByteBufferCell) cell).getRowByteBuffer(),<a name="line.525"></a>
-<span class="sourceLineNo">526</span> ((ByteBufferCell) cell).getRowPosition(), cell.getRowLength());<a name="line.526"></a>
-<span class="sourceLineNo">527</span> }<a name="line.527"></a>
-<span class="sourceLineNo">528</span> return comparator.compareTo(cell.getRowArray(), cell.getRowOffset(), cell.getRowLength());<a name="line.528"></a>
-<span class="sourceLineNo">529</span> }<a name="line.529"></a>
-<span class="sourceLineNo">530</span><a name="line.530"></a>
-<span class="sourceLineNo">531</span> /**<a name="line.531"></a>
-<span class="sourceLineNo">532</span> * Compare cell's column family against given comparator<a name="line.532"></a>
-<span class="sourceLineNo">533</span> * @param cell<a name="line.533"></a>
-<span class="sourceLineNo">534</span> * @param comparator<a name="line.534"></a>
-<span class="sourceLineNo">535</span> * @return result comparing cell's column family<a name="line.535"></a>
-<span class="sourceLineNo">536</span> */<a name="line.536"></a>
-<span class="sourceLineNo">537</span> public static int compareFamily(Cell cell, ByteArrayComparable comparator) {<a name="line.537"></a>
-<span class="sourceLineNo">538</span> if (cell instanceof ByteBufferCell) {<a name="line.538"></a>
-<span class="sourceLineNo">539</span> return comparator.compareTo(((ByteBufferCell) cell).getFamilyByteBuffer(),<a name="line.539"></a>
-<span class="sourceLineNo">540</span> ((ByteBufferCell) cell).getFamilyPosition(), cell.getFamilyLength());<a name="line.540"></a>
-<span class="sourceLineNo">541</span> }<a name="line.541"></a>
-<span class="sourceLineNo">542</span> return comparator.compareTo(cell.getFamilyArray(), cell.getFamilyOffset(),<a name="line.542"></a>
-<span class="sourceLineNo">543</span> cell.getFamilyLength());<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> /**<a name="line.546"></a>
-<span class="sourceLineNo">547</span> * Compare cell's qualifier against given comparator<a name="line.547"></a>
-<span class="sourceLineNo">548</span> * @param cell<a name="line.548"></a>
-<span class="sourceLineNo">549</span> * @param comparator<a name="line.549"></a>
-<span class="sourceLineNo">550</span> * @return result comparing cell's qualifier<a name="line.550"></a>
-<span class="sourceLineNo">551</span> */<a name="line.551"></a>
-<span class="sourceLineNo">552</span> public static int compareQualifier(Cell cell, ByteArrayComparable comparator) {<a name="line.552"></a>
-<span class="sourceLineNo">553</span> if (cell instanceof ByteBufferCell) {<a name="line.553"></a>
-<span class="sourceLineNo">554</span> return comparator.compareTo(((ByteBufferCell) cell).getQualifierByteBuffer(),<a name="line.554"></a>
-<span class="sourceLineNo">555</span> ((ByteBufferCell) cell).getQualifierPosition(), cell.getQualifierLength());<a name="line.555"></a>
-<span class="sourceLineNo">556</span> }<a name="line.556"></a>
-<span class="sourceLineNo">557</span> return comparator.compareTo(cell.getQualifierArray(), cell.getQualifierOffset(),<a name="line.557"></a>
-<span class="sourceLineNo">558</span> cell.getQualifierLength());<a name="line.558"></a>
-<span class="sourceLineNo">559</span> }<a name="line.559"></a>
-<span class="sourceLineNo">560</span><a name="line.560"></a>
-<span class="sourceLineNo">561</span> /**<a name="line.561"></a>
-<span class="sourceLineNo">562</span> * Compare cell's value against given comparator<a name="line.562"></a>
-<span class="sourceLineNo">563</span> * @param cell<a name="line.563"></a>
-<span class="sourceLineNo">564</span> * @param comparator<a name="line.564"></a>
-<span class="sourceLineNo">565</span> * @return result comparing cell's value<a name="line.565"></a>
-<span class="sourceLineNo">566</span> */<a name="line.566"></a>
-<span class="sourceLineNo">567</span> public static int compareValue(Cell cell, ByteArrayComparable comparator) {<a name="line.567"></a>
-<span class="sourceLineNo">568</span> if (cell instanceof ByteBufferCell) {<a name="line.568"></a>
-<span class="sourceLineNo">569</span> return comparator.compareTo(((ByteBufferCell) cell).getValueByteBuffer(),<a name="line.569"></a>
-<span class="sourceLineNo">570</span> ((ByteBufferCell) cell).getValuePosition(), cell.getValueLength());<a name="line.570"></a>
-<span class="sourceLineNo">571</span> }<a name="line.571"></a>
-<span class="sourceLineNo">572</span> return comparator.compareTo(cell.getValueArray(), cell.getValueOffset(), cell.getValueLength());<a name="line.572"></a>
-<span class="sourceLineNo">573</span> }<a name="line.573"></a>
-<span class="sourceLineNo">574</span><a name="line.574"></a>
-<span class="sourceLineNo">575</span> /**<a name="line.575"></a>
-<span class="sourceLineNo">576</span> * Comparator that compares row component only of a Cell<a name="line.576"></a>
-<span class="sourceLineNo">577</span> */<a name="line.577"></a>
-<span class="sourceLineNo">578</span> public static class RowComparator extends CellComparator {<a name="line.578"></a>
-<span class="sourceLineNo">579</span> @Override<a name="line.579"></a>
-<span class="sourceLineNo">580</span> public int compare(Cell a, Cell b) {<a name="line.580"></a>
-<span class="sourceLineNo">581</span> return compareRows(a, b);<a name="line.581"></a>
-<span class="sourceLineNo">582</span> }<a name="line.582"></a>
-<span class="sourceLineNo">583</span> }<a name="line.583"></a>
-<span class="sourceLineNo">584</span><a name="line.584"></a>
-<span class="sourceLineNo">585</span> /**<a name="line.585"></a>
-<span class="sourceLineNo">586</span> * A {@link CellComparator} for <code>hbase:meta</code> catalog table<a name="line.586"></a>
-<span class="sourceLineNo">587</span> * {@link KeyValue}s.<a name="line.587"></a>
-<span class="sourceLineNo">588</span> */<a name="line.588"></a>
-<span class="sourceLineNo">589</span> public static class MetaCellComparator extends CellComparator {<a name="line.589"></a>
-<span class="sourceLineNo">590</span><a name="line.590"></a>
-<span class="sourceLineNo">591</span> @Override<a name="line.591"></a>
-<span class="sourceLineNo">592</span> public int compareRows(final Cell left, final Cell right) {<a name="line.592"></a>
-<span class="sourceLineNo">593</span> return compareRows(left.getRowArray(), left.getRowOffset(), left.getRowLength(),<a name="line.593"></a>
-<span class="sourceLineNo">594</span> right.getRowArray(), right.getRowOffset(), right.getRowLength());<a name="line.594"></a>
-<span class="sourceLineNo">595</span> }<a name="line.595"></a>
-<span class="sourceLineNo">596</span><a name="line.596"></a>
-<span class="sourceLineNo">597</span> @Override<a name="line.597"></a>
-<span class="sourceLineNo">598</span> public int compareRows(Cell left, byte[] right, int roffset, int rlength) {<a name="line.598"></a>
-<span class="sourceLineNo">599</span> return compareRows(left.getRowArray(), left.getRowOffset(), left.getRowLength(), right,<a name="line.599"></a>
-<span class="sourceLineNo">600</span> roffset, rlength);<a name="line.600"></a>
-<span class="sourceLineNo">601</span> }<a name="line.601"></a>
-<span class="sourceLineNo">602</span><a name="line.602"></a>
-<span class="sourceLineNo">603</span> private int compareRows(byte[] left, int loffset, int llength, byte[] right, int roffset,<a name="line.603"></a>
-<span class="sourceLineNo">604</span> int rlength) {<a name="line.604"></a>
-<span class="sourceLineNo">605</span> int leftDelimiter = Bytes.searchDelimiterIndex(left, loffset, llength, HConstants.DELIMITER);<a name="line.605"></a>
-<span class="sourceLineNo">606</span> int rightDelimiter = Bytes<a name="line.606"></a>
-<span class="sourceLineNo">607</span> .searchDelimiterIndex(right, roffset, rlength, HConstants.DELIMITER);<a name="line.607"></a>
-<span class="sourceLineNo">608</span> // Compare up to the delimiter<a name="line.608"></a>
-<span class="sourceLineNo">609</span> int lpart = (leftDelimiter < 0 ? llength : leftDelimiter - loffset);<a name="line.609"></a>
-<span class="sourceLineNo">610</span> int rpart = (rightDelimiter < 0 ? rlength : rightDelimiter - roffset);<a name="line.610"></a>
-<span class="sourceLineNo">611</span> int result = Bytes.compareTo(left, loffset, lpart, right, roffset, rpart);<a name="line.611"></a>
-<span class="sourceLineNo">612</span> if (result != 0) {<a name="line.612"></a>
-<span class="sourceLineNo">613</span> return result;<a name="line.613"></a>
-<span class="sourceLineNo">614</span> } else {<a name="line.614"></a>
-<span class="sourceLineNo">615</span> if (leftDelimiter < 0 && rightDelimiter >= 0) {<a name="line.615"></a>
-<span class="sourceLineNo">616</span> return -1;<a name="line.616"></a>
-<span class="sourceLineNo">617</span> } else if (rightDelimiter < 0 && leftDelimiter >= 0) {<a name="line.617"></a>
-<span class="sourceLineNo">618</span> return 1;<a name="line.618"></a>
-<span class="sourceLineNo">619</span> } else if (leftDelimiter < 0 && rightDelimiter < 0) {<a name="line.619"></a>
-<span class="sourceLineNo">620</span> return 0;<a name="line.620"></a>
-<span class="sourceLineNo">621</span> }<a name="line.621"></a>
-<span class="sourceLineNo">622</span> }<a name="line.622"></a>
-<span class="sourceLineNo">623</span> // Compare middle bit of the row.<a name="line.623"></a>
-<span class="sourceLineNo">624</span> // Move past delimiter<a name="line.624"></a>
-<span class="sourceLineNo">625</span> leftDelimiter++;<a name="line.625"></a>
-<span class="sourceLineNo">626</span> rightDelimiter++;<a name="line.626"></a>
-<span class="sourceLineNo">627</span> int leftFarDelimiter = Bytes.searchDelimiterIndexInReverse(left, leftDelimiter, llength<a name="line.627"></a>
-<span class="sourceLineNo">628</span> - (leftDelimiter - loffset), HConstants.DELIMITER);<a name="line.628"></a>
-<span class="sourceLineNo">629</span> int rightFarDelimiter = Bytes.searchDelimiterIndexInReverse(right, rightDelimiter, rlength<a name="line.629"></a>
-<span class="sourceLineNo">630</span> - (rightDelimiter - roffset), HConstants.DELIMITER);<a name="line.630"></a>
-<span class="sourceLineNo">631</span> // Now compare middlesection of row.<a name="line.631"></a>
-<span class="sourceLineNo">632</span> lpart = (leftFarDelimiter < 0 ? llength + loffset : leftFarDelimiter) - leftDelimiter;<a name="line.632"></a>
-<span class="sourceLineNo">633</span> rpart = (rightFarDelimiter < 0 ? rlength + roffset : rightFarDelimiter) - rightDelimiter;<a name="line.633"></a>
-<span class="sourceLineNo">634</span> result = Bytes.compareTo(left, leftDelimiter, lpart, right, rightDelimiter, rpart);<a name="line.634"></a>
-<span class="sourceLineNo">635</span> if (result != 0) {<a name="line.635"></a>
-<span class="sourceLineNo">636</span> return result;<a name="line.636"></a>
-<span class="sourceLineNo">637</span> } else {<a name="line.637"></a>
-<span class="sourceLineNo">638</span> if (leftDelimiter < 0 && rightDelimiter >= 0) {<a name="line.638"></a>
-<span class="sourceLineNo">639</span> return -1;<a name="line.639"></a>
-<span class="sourceLineNo">640</span> } else if (rightDelimiter < 0 && leftDelimiter >= 0) {<a name="line.640"></a>
-<span class="sourceLineNo">641</span> return 1;<a name="line.641"></a>
-<span class="sourceLineNo">642</span> } else if (leftDelimiter < 0 && rightDelimiter < 0) {<a name="line.642"></a>
-<span class="sourceLineNo">643</span> return 0;<a name="line.643"></a>
-<span class="sourceLineNo">644</span> }<a name="line.644"></a>
-<span class="sourceLineNo">645</span> }<a name="line.645"></a>
-<span class="sourceLineNo">646</span> // Compare last part of row, the rowid.<a name="line.646"></a>
-<span class="sourceLineNo">647</span> leftFarDelimiter++;<a name="line.647"></a>
-<span class="sourceLineNo">648</span> rightFarDelimiter++;<a name="line.648"></a>
-<span class="sourceLineNo">649</span> result = Bytes.compareTo(left, leftFarDelimiter, llength - (leftFarDelimiter - loffset),<a name="line.649"></a>
-<span class="sourceLineNo">650</span> right, rightFarDelimiter, rlength - (rightFarDelimiter - roffset));<a name="line.650"></a>
-<span class="sourceLineNo">651</span> return result;<a name="line.651"></a>
-<span class="sourceLineNo">652</span> }<a name="line.652"></a>
-<span class="sourceLineNo">653</span> }<a name="line.653"></a>
-<span class="sourceLineNo">654</span>}<a name="line.654"></a>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-</pre>
-</div>
-</body>
-</html>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/7ebe345d/devapidocs/src-html/org/apache/hadoop/hbase/CellComparator.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/CellComparator.html b/devapidocs/src-html/org/apache/hadoop/hbase/CellComparator.html
index 965fa83..8bf2804 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/CellComparator.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/CellComparator.html
@@ -581,85 +581,75 @@
<span class="sourceLineNo">573</span> }<a name="line.573"></a>
<span class="sourceLineNo">574</span><a name="line.574"></a>
<span class="sourceLineNo">575</span> /**<a name="line.575"></a>
-<span class="sourceLineNo">576</span> * Comparator that compares row component only of a Cell<a name="line.576"></a>
-<span class="sourceLineNo">577</span> */<a name="line.577"></a>
-<span class="sourceLineNo">578</span> public static class RowComparator extends CellComparator {<a name="line.578"></a>
-<span class="sourceLineNo">579</span> @Override<a name="line.579"></a>
-<span class="sourceLineNo">580</span> public int compare(Cell a, Cell b) {<a name="line.580"></a>
-<span class="sourceLineNo">581</span> return compareRows(a, b);<a name="line.581"></a>
-<span class="sourceLineNo">582</span> }<a name="line.582"></a>
-<span class="sourceLineNo">583</span> }<a name="line.583"></a>
-<span class="sourceLineNo">584</span><a name="line.584"></a>
-<span class="sourceLineNo">585</span> /**<a name="line.585"></a>
-<span class="sourceLineNo">586</span> * A {@link CellComparator} for <code>hbase:meta</code> catalog table<a name="line.586"></a>
-<span class="sourceLineNo">587</span> * {@link KeyValue}s.<a name="line.587"></a>
-<span class="sourceLineNo">588</span> */<a name="line.588"></a>
-<span class="sourceLineNo">589</span> public static class MetaCellComparator extends CellComparator {<a name="line.589"></a>
-<span class="sourceLineNo">590</span><a name="line.590"></a>
-<span class="sourceLineNo">591</span> @Override<a name="line.591"></a>
-<span class="sourceLineNo">592</span> public int compareRows(final Cell left, final Cell right) {<a name="line.592"></a>
-<span class="sourceLineNo">593</span> return compareRows(left.getRowArray(), left.getRowOffset(), left.getRowLength(),<a name="line.593"></a>
-<span class="sourceLineNo">594</span> right.getRowArray(), right.getRowOffset(), right.getRowLength());<a name="line.594"></a>
-<span class="sourceLineNo">595</span> }<a name="line.595"></a>
-<span class="sourceLineNo">596</span><a name="line.596"></a>
-<span class="sourceLineNo">597</span> @Override<a name="line.597"></a>
-<span class="sourceLineNo">598</span> public int compareRows(Cell left, byte[] right, int roffset, int rlength) {<a name="line.598"></a>
-<span class="sourceLineNo">599</span> return compareRows(left.getRowArray(), left.getRowOffset(), left.getRowLength(), right,<a name="line.599"></a>
-<span class="sourceLineNo">600</span> roffset, rlength);<a name="line.600"></a>
-<span class="sourceLineNo">601</span> }<a name="line.601"></a>
-<span class="sourceLineNo">602</span><a name="line.602"></a>
-<span class="sourceLineNo">603</span> private int compareRows(byte[] left, int loffset, int llength, byte[] right, int roffset,<a name="line.603"></a>
-<span class="sourceLineNo">604</span> int rlength) {<a name="line.604"></a>
-<span class="sourceLineNo">605</span> int leftDelimiter = Bytes.searchDelimiterIndex(left, loffset, llength, HConstants.DELIMITER);<a name="line.605"></a>
-<span class="sourceLineNo">606</span> int rightDelimiter = Bytes<a name="line.606"></a>
-<span class="sourceLineNo">607</span> .searchDelimiterIndex(right, roffset, rlength, HConstants.DELIMITER);<a name="line.607"></a>
-<span class="sourceLineNo">608</span> // Compare up to the delimiter<a name="line.608"></a>
-<span class="sourceLineNo">609</span> int lpart = (leftDelimiter < 0 ? llength : leftDelimiter - loffset);<a name="line.609"></a>
-<span class="sourceLineNo">610</span> int rpart = (rightDelimiter < 0 ? rlength : rightDelimiter - roffset);<a name="line.610"></a>
-<span class="sourceLineNo">611</span> int result = Bytes.compareTo(left, loffset, lpart, right, roffset, rpart);<a name="line.611"></a>
-<span class="sourceLineNo">612</span> if (result != 0) {<a name="line.612"></a>
-<span class="sourceLineNo">613</span> return result;<a name="line.613"></a>
-<span class="sourceLineNo">614</span> } else {<a name="line.614"></a>
-<span class="sourceLineNo">615</span> if (leftDelimiter < 0 && rightDelimiter >= 0) {<a name="line.615"></a>
-<span class="sourceLineNo">616</span> return -1;<a name="line.616"></a>
-<span class="sourceLineNo">617</span> } else if (rightDelimiter < 0 && leftDelimiter >= 0) {<a name="line.617"></a>
-<span class="sourceLineNo">618</span> return 1;<a name="line.618"></a>
-<span class="sourceLineNo">619</span> } else if (leftDelimiter < 0 && rightDelimiter < 0) {<a name="line.619"></a>
-<span class="sourceLineNo">620</span> return 0;<a name="line.620"></a>
-<span class="sourceLineNo">621</span> }<a name="line.621"></a>
-<span class="sourceLineNo">622</span> }<a name="line.622"></a>
-<span class="sourceLineNo">623</span> // Compare middle bit of the row.<a name="line.623"></a>
-<span class="sourceLineNo">624</span> // Move past delimiter<a name="line.624"></a>
-<span class="sourceLineNo">625</span> leftDelimiter++;<a name="line.625"></a>
-<span class="sourceLineNo">626</span> rightDelimiter++;<a name="line.626"></a>
-<span class="sourceLineNo">627</span> int leftFarDelimiter = Bytes.searchDelimiterIndexInReverse(left, leftDelimiter, llength<a name="line.627"></a>
-<span class="sourceLineNo">628</span> - (leftDelimiter - loffset), HConstants.DELIMITER);<a name="line.628"></a>
-<span class="sourceLineNo">629</span> int rightFarDelimiter = Bytes.searchDelimiterIndexInReverse(right, rightDelimiter, rlength<a name="line.629"></a>
-<span class="sourceLineNo">630</span> - (rightDelimiter - roffset), HConstants.DELIMITER);<a name="line.630"></a>
-<span class="sourceLineNo">631</span> // Now compare middlesection of row.<a name="line.631"></a>
-<span class="sourceLineNo">632</span> lpart = (leftFarDelimiter < 0 ? llength + loffset : leftFarDelimiter) - leftDelimiter;<a name="line.632"></a>
-<span class="sourceLineNo">633</span> rpart = (rightFarDelimiter < 0 ? rlength + roffset : rightFarDelimiter) - rightDelimiter;<a name="line.633"></a>
-<span class="sourceLineNo">634</span> result = Bytes.compareTo(left, leftDelimiter, lpart, right, rightDelimiter, rpart);<a name="line.634"></a>
-<span class="sourceLineNo">635</span> if (result != 0) {<a name="line.635"></a>
-<span class="sourceLineNo">636</span> return result;<a name="line.636"></a>
-<span class="sourceLineNo">637</span> } else {<a name="line.637"></a>
-<span class="sourceLineNo">638</span> if (leftDelimiter < 0 && rightDelimiter >= 0) {<a name="line.638"></a>
-<span class="sourceLineNo">639</span> return -1;<a name="line.639"></a>
-<span class="sourceLineNo">640</span> } else if (rightDelimiter < 0 && leftDelimiter >= 0) {<a name="line.640"></a>
-<span class="sourceLineNo">641</span> return 1;<a name="line.641"></a>
-<span class="sourceLineNo">642</span> } else if (leftDelimiter < 0 && rightDelimiter < 0) {<a name="line.642"></a>
-<span class="sourceLineNo">643</span> return 0;<a name="line.643"></a>
-<span class="sourceLineNo">644</span> }<a name="line.644"></a>
-<span class="sourceLineNo">645</span> }<a name="line.645"></a>
-<span class="sourceLineNo">646</span> // Compare last part of row, the rowid.<a name="line.646"></a>
-<span class="sourceLineNo">647</span> leftFarDelimiter++;<a name="line.647"></a>
-<span class="sourceLineNo">648</span> rightFarDelimiter++;<a name="line.648"></a>
-<span class="sourceLineNo">649</span> result = Bytes.compareTo(left, leftFarDelimiter, llength - (leftFarDelimiter - loffset),<a name="line.649"></a>
-<span class="sourceLineNo">650</span> right, rightFarDelimiter, rlength - (rightFarDelimiter - roffset));<a name="line.650"></a>
-<span class="sourceLineNo">651</span> return result;<a name="line.651"></a>
-<span class="sourceLineNo">652</span> }<a name="line.652"></a>
-<span class="sourceLineNo">653</span> }<a name="line.653"></a>
-<span class="sourceLineNo">654</span>}<a name="line.654"></a>
+<span class="sourceLineNo">576</span> * A {@link CellComparator} for <code>hbase:meta</code> catalog table<a name="line.576"></a>
+<span class="sourceLineNo">577</span> * {@link KeyValue}s.<a name="line.577"></a>
+<span class="sourceLineNo">578</span> */<a name="line.578"></a>
+<span class="sourceLineNo">579</span> public static class MetaCellComparator extends CellComparator {<a name="line.579"></a>
+<span class="sourceLineNo">580</span><a name="line.580"></a>
+<span class="sourceLineNo">581</span> @Override<a name="line.581"></a>
+<span class="sourceLineNo">582</span> public int compareRows(final Cell left, final Cell right) {<a name="line.582"></a>
+<span class="sourceLineNo">583</span> return compareRows(left.getRowArray(), left.getRowOffset(), left.getRowLength(),<a name="line.583"></a>
+<span class="sourceLineNo">584</span> right.getRowArray(), right.getRowOffset(), right.getRowLength());<a name="line.584"></a>
+<span class="sourceLineNo">585</span> }<a name="line.585"></a>
+<span class="sourceLineNo">586</span><a name="line.586"></a>
+<span class="sourceLineNo">587</span> @Override<a name="line.587"></a>
+<span class="sourceLineNo">588</span> public int compareRows(Cell left, byte[] right, int roffset, int rlength) {<a name="line.588"></a>
+<span class="sourceLineNo">589</span> return compareRows(left.getRowArray(), left.getRowOffset(), left.getRowLength(), right,<a name="line.589"></a>
+<span class="sourceLineNo">590</span> roffset, rlength);<a name="line.590"></a>
+<span class="sourceLineNo">591</span> }<a name="line.591"></a>
+<span class="sourceLineNo">592</span><a name="line.592"></a>
+<span class="sourceLineNo">593</span> private int compareRows(byte[] left, int loffset, int llength, byte[] right, int roffset,<a name="line.593"></a>
+<span class="sourceLineNo">594</span> int rlength) {<a name="line.594"></a>
+<span class="sourceLineNo">595</span> int leftDelimiter = Bytes.searchDelimiterIndex(left, loffset, llength, HConstants.DELIMITER);<a name="line.595"></a>
+<span class="sourceLineNo">596</span> int rightDelimiter = Bytes<a name="line.596"></a>
+<span class="sourceLineNo">597</span> .searchDelimiterIndex(right, roffset, rlength, HConstants.DELIMITER);<a name="line.597"></a>
+<span class="sourceLineNo">598</span> // Compare up to the delimiter<a name="line.598"></a>
+<span class="sourceLineNo">599</span> int lpart = (leftDelimiter < 0 ? llength : leftDelimiter - loffset);<a name="line.599"></a>
+<span class="sourceLineNo">600</span> int rpart = (rightDelimiter < 0 ? rlength : rightDelimiter - roffset);<a name="line.600"></a>
+<span class="sourceLineNo">601</span> int result = Bytes.compareTo(left, loffset, lpart, right, roffset, rpart);<a name="line.601"></a>
+<span class="sourceLineNo">602</span> if (result != 0) {<a name="line.602"></a>
+<span class="sourceLineNo">603</span> return result;<a name="line.603"></a>
+<span class="sourceLineNo">604</span> } else {<a name="line.604"></a>
+<span class="sourceLineNo">605</span> if (leftDelimiter < 0 && rightDelimiter >= 0) {<a name="line.605"></a>
+<span class="sourceLineNo">606</span> return -1;<a name="line.606"></a>
+<span class="sourceLineNo">607</span> } else if (rightDelimiter < 0 && leftDelimiter >= 0) {<a name="line.607"></a>
+<span class="sourceLineNo">608</span> return 1;<a name="line.608"></a>
+<span class="sourceLineNo">609</span> } else if (leftDelimiter < 0 && rightDelimiter < 0) {<a name="line.609"></a>
+<span class="sourceLineNo">610</span> return 0;<a name="line.610"></a>
+<span class="sourceLineNo">611</span> }<a name="line.611"></a>
+<span class="sourceLineNo">612</span> }<a name="line.612"></a>
+<span class="sourceLineNo">613</span> // Compare middle bit of the row.<a name="line.613"></a>
+<span class="sourceLineNo">614</span> // Move past delimiter<a name="line.614"></a>
+<span class="sourceLineNo">615</span> leftDelimiter++;<a name="line.615"></a>
+<span class="sourceLineNo">616</span> rightDelimiter++;<a name="line.616"></a>
+<span class="sourceLineNo">617</span> int leftFarDelimiter = Bytes.searchDelimiterIndexInReverse(left, leftDelimiter, llength<a name="line.617"></a>
+<span class="sourceLineNo">618</span> - (leftDelimiter - loffset), HConstants.DELIMITER);<a name="line.618"></a>
+<span class="sourceLineNo">619</span> int rightFarDelimiter = Bytes.searchDelimiterIndexInReverse(right, rightDelimiter, rlength<a name="line.619"></a>
+<span class="sourceLineNo">620</span> - (rightDelimiter - roffset), HConstants.DELIMITER);<a name="line.620"></a>
+<span class="sourceLineNo">621</span> // Now compare middlesection of row.<a name="line.621"></a>
+<span class="sourceLineNo">622</span> lpart = (leftFarDelimiter < 0 ? llength + loffset : leftFarDelimiter) - leftDelimiter;<a name="line.622"></a>
+<span class="sourceLineNo">623</span> rpart = (rightFarDelimiter < 0 ? rlength + roffset : rightFarDelimiter) - rightDelimiter;<a name="line.623"></a>
+<span class="sourceLineNo">624</span> result = Bytes.compareTo(left, leftDelimiter, lpart, right, rightDelimiter, rpart);<a name="line.624"></a>
+<span class="sourceLineNo">625</span> if (result != 0) {<a name="line.625"></a>
+<span class="sourceLineNo">626</span> return result;<a name="line.626"></a>
+<span class="sourceLineNo">627</span> } else {<a name="line.627"></a>
+<span class="sourceLineNo">628</span> if (leftDelimiter < 0 && rightDelimiter >= 0) {<a name="line.628"></a>
+<span class="sourceLineNo">629</span> return -1;<a name="line.629"></a>
+<span class="sourceLineNo">630</span> } else if (rightDelimiter < 0 && leftDelimiter >= 0) {<a name="line.630"></a>
+<span class="sourceLineNo">631</span> return 1;<a name="line.631"></a>
+<span class="sourceLineNo">632</span> } else if (leftDelimiter < 0 && rightDelimiter < 0) {<a name="line.632"></a>
+<span class="sourceLineNo">633</span> return 0;<a name="line.633"></a>
+<span class="sourceLineNo">634</span> }<a name="line.634"></a>
+<span class="sourceLineNo">635</span> }<a name="line.635"></a>
+<span class="sourceLineNo">636</span> // Compare last part of row, the rowid.<a name="line.636"></a>
+<span class="sourceLineNo">637</span> leftFarDelimiter++;<a name="line.637"></a>
+<span class="sourceLineNo">638</span> rightFarDelimiter++;<a name="line.638"></a>
+<span class="sourceLineNo">639</span> result = Bytes.compareTo(left, leftFarDelimiter, llength - (leftFarDelimiter - loffset),<a name="line.639"></a>
+<span class="sourceLineNo">640</span> right, rightFarDelimiter, rlength - (rightFarDelimiter - roffset));<a name="line.640"></a>
+<span class="sourceLineNo">641</span> return result;<a name="line.641"></a>
+<span class="sourceLineNo">642</span> }<a name="line.642"></a>
+<span class="sourceLineNo">643</span> }<a name="line.643"></a>
+<span class="sourceLineNo">644</span>}<a name="line.644"></a>