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 2018/05/16 18:49:59 UTC
[18/21] hbase-site git commit: Published site at
2c32272dfa40dbf574343901c2ddea9319ca0bd5.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/ec5d5242/apidocs/src-html/org/apache/hadoop/hbase/CellComparator.html
----------------------------------------------------------------------
diff --git a/apidocs/src-html/org/apache/hadoop/hbase/CellComparator.html b/apidocs/src-html/org/apache/hadoop/hbase/CellComparator.html
index 5685dfa..31cd218 100644
--- a/apidocs/src-html/org/apache/hadoop/hbase/CellComparator.html
+++ b/apidocs/src-html/org/apache/hadoop/hbase/CellComparator.html
@@ -59,78 +59,86 @@
<span class="sourceLineNo">051</span> int compare(Cell leftCell, Cell rightCell);<a name="line.51"></a>
<span class="sourceLineNo">052</span><a name="line.52"></a>
<span class="sourceLineNo">053</span> /**<a name="line.53"></a>
-<span class="sourceLineNo">054</span> * Lexographically compares the rows of two cells.<a name="line.54"></a>
-<span class="sourceLineNo">055</span> * @param leftCell the left hand side cell<a name="line.55"></a>
-<span class="sourceLineNo">056</span> * @param rightCell the right hand side cell<a name="line.56"></a>
-<span class="sourceLineNo">057</span> * @return greater than 0 if leftCell is bigger, less than 0 if rightCell is bigger, 0 if both<a name="line.57"></a>
-<span class="sourceLineNo">058</span> * cells are equal<a name="line.58"></a>
-<span class="sourceLineNo">059</span> */<a name="line.59"></a>
-<span class="sourceLineNo">060</span> int compareRows(Cell leftCell, Cell rightCell);<a name="line.60"></a>
-<span class="sourceLineNo">061</span><a name="line.61"></a>
-<span class="sourceLineNo">062</span> /**<a name="line.62"></a>
-<span class="sourceLineNo">063</span> * Compares the row part of the cell with a simple plain byte[] like the<a name="line.63"></a>
-<span class="sourceLineNo">064</span> * stopRow in Scan.<a name="line.64"></a>
-<span class="sourceLineNo">065</span> * @param cell the cell<a name="line.65"></a>
-<span class="sourceLineNo">066</span> * @param bytes the byte[] representing the row to be compared with<a name="line.66"></a>
-<span class="sourceLineNo">067</span> * @param offset the offset of the byte[]<a name="line.67"></a>
-<span class="sourceLineNo">068</span> * @param length the length of the byte[]<a name="line.68"></a>
-<span class="sourceLineNo">069</span> * @return greater than 0 if leftCell is bigger, less than 0 if rightCell is bigger, 0 if both<a name="line.69"></a>
-<span class="sourceLineNo">070</span> * cells are equal<a name="line.70"></a>
-<span class="sourceLineNo">071</span> */<a name="line.71"></a>
-<span class="sourceLineNo">072</span> int compareRows(Cell cell, byte[] bytes, int offset, int length);<a name="line.72"></a>
-<span class="sourceLineNo">073</span><a name="line.73"></a>
-<span class="sourceLineNo">074</span> /**<a name="line.74"></a>
-<span class="sourceLineNo">075</span> * Lexographically compares the two cells excluding the row part. It compares family, qualifier,<a name="line.75"></a>
-<span class="sourceLineNo">076</span> * timestamp and the type<a name="line.76"></a>
-<span class="sourceLineNo">077</span> * @param leftCell the left hand side cell<a name="line.77"></a>
-<span class="sourceLineNo">078</span> * @param rightCell the right hand side cell<a name="line.78"></a>
-<span class="sourceLineNo">079</span> * @return greater than 0 if leftCell is bigger, less than 0 if rightCell is bigger, 0 if both<a name="line.79"></a>
-<span class="sourceLineNo">080</span> * cells are equal<a name="line.80"></a>
-<span class="sourceLineNo">081</span> */<a name="line.81"></a>
-<span class="sourceLineNo">082</span> int compareWithoutRow(Cell leftCell, Cell rightCell);<a name="line.82"></a>
-<span class="sourceLineNo">083</span><a name="line.83"></a>
-<span class="sourceLineNo">084</span> /**<a name="line.84"></a>
-<span class="sourceLineNo">085</span> * Lexographically compares the families of the two cells<a name="line.85"></a>
-<span class="sourceLineNo">086</span> * @param leftCell the left hand side cell<a name="line.86"></a>
-<span class="sourceLineNo">087</span> * @param rightCell the right hand side cell<a name="line.87"></a>
-<span class="sourceLineNo">088</span> * @return greater than 0 if leftCell is bigger, less than 0 if rightCell is bigger, 0 if both<a name="line.88"></a>
-<span class="sourceLineNo">089</span> * cells are equal<a name="line.89"></a>
-<span class="sourceLineNo">090</span> */<a name="line.90"></a>
-<span class="sourceLineNo">091</span> int compareFamilies(Cell leftCell, Cell rightCell);<a name="line.91"></a>
-<span class="sourceLineNo">092</span><a name="line.92"></a>
-<span class="sourceLineNo">093</span> /**<a name="line.93"></a>
-<span class="sourceLineNo">094</span> * Lexographically compares the qualifiers of the two cells<a name="line.94"></a>
-<span class="sourceLineNo">095</span> * @param leftCell the left hand side cell<a name="line.95"></a>
-<span class="sourceLineNo">096</span> * @param rightCell the right hand side cell<a name="line.96"></a>
-<span class="sourceLineNo">097</span> * @return greater than 0 if leftCell is bigger, less than 0 if rightCell is bigger, 0 if both<a name="line.97"></a>
-<span class="sourceLineNo">098</span> * cells are equal<a name="line.98"></a>
-<span class="sourceLineNo">099</span> */<a name="line.99"></a>
-<span class="sourceLineNo">100</span> int compareQualifiers(Cell leftCell, Cell rightCell);<a name="line.100"></a>
-<span class="sourceLineNo">101</span><a name="line.101"></a>
-<span class="sourceLineNo">102</span> /**<a name="line.102"></a>
-<span class="sourceLineNo">103</span> * Compares cell's timestamps in DESCENDING order. The below older timestamps sorting ahead of<a name="line.103"></a>
-<span class="sourceLineNo">104</span> * newer timestamps looks wrong but it is intentional. This way, newer timestamps are first found<a name="line.104"></a>
-<span class="sourceLineNo">105</span> * when we iterate over a memstore and newer versions are the first we trip over when reading from<a name="line.105"></a>
-<span class="sourceLineNo">106</span> * a store file.<a name="line.106"></a>
-<span class="sourceLineNo">107</span> * @param leftCell the left hand side cell<a name="line.107"></a>
-<span class="sourceLineNo">108</span> * @param rightCell the right hand side cell<a name="line.108"></a>
-<span class="sourceLineNo">109</span> * @return 1 if left's timestamp &lt; right's timestamp -1 if left's timestamp &gt; right's<a name="line.109"></a>
-<span class="sourceLineNo">110</span> * timestamp 0 if both timestamps are equal<a name="line.110"></a>
-<span class="sourceLineNo">111</span> */<a name="line.111"></a>
-<span class="sourceLineNo">112</span> int compareTimestamps(Cell leftCell, Cell rightCell);<a name="line.112"></a>
-<span class="sourceLineNo">113</span><a name="line.113"></a>
-<span class="sourceLineNo">114</span> /**<a name="line.114"></a>
-<span class="sourceLineNo">115</span> * Compares cell's timestamps in DESCENDING order. The below older timestamps sorting ahead of<a name="line.115"></a>
-<span class="sourceLineNo">116</span> * newer timestamps looks wrong but it is intentional. This way, newer timestamps are first found<a name="line.116"></a>
-<span class="sourceLineNo">117</span> * when we iterate over a memstore and newer versions are the first we trip over when reading from<a name="line.117"></a>
-<span class="sourceLineNo">118</span> * a store file.<a name="line.118"></a>
-<span class="sourceLineNo">119</span> * @param leftCellts the left cell's timestamp<a name="line.119"></a>
-<span class="sourceLineNo">120</span> * @param rightCellts the right cell's timestamp<a name="line.120"></a>
-<span class="sourceLineNo">121</span> * @return 1 if left's timestamp &lt; right's timestamp -1 if left's timestamp &gt; right's<a name="line.121"></a>
-<span class="sourceLineNo">122</span> * timestamp 0 if both timestamps are equal<a name="line.122"></a>
-<span class="sourceLineNo">123</span> */<a name="line.123"></a>
-<span class="sourceLineNo">124</span> int compareTimestamps(long leftCellts, long rightCellts);<a name="line.124"></a>
-<span class="sourceLineNo">125</span>}<a name="line.125"></a>
+<span class="sourceLineNo">054</span> * Compare cells.<a name="line.54"></a>
+<span class="sourceLineNo">055</span> * @param ignoreSequenceid True if we are to compare the key portion only and ignore<a name="line.55"></a>
+<span class="sourceLineNo">056</span> * the sequenceid. Set to false to compare key and consider sequenceid.<a name="line.56"></a>
+<span class="sourceLineNo">057</span> * @return 0 if equal, -1 if a &lt; b, and +1 if a &gt; b.<a name="line.57"></a>
+<span class="sourceLineNo">058</span> */<a name="line.58"></a>
+<span class="sourceLineNo">059</span> int compare(Cell leftCell, Cell rightCell, boolean ignoreSequenceid);<a name="line.59"></a>
+<span class="sourceLineNo">060</span><a name="line.60"></a>
+<span class="sourceLineNo">061</span> /**<a name="line.61"></a>
+<span class="sourceLineNo">062</span> * Lexographically compares the rows of two cells.<a name="line.62"></a>
+<span class="sourceLineNo">063</span> * @param leftCell the left hand side cell<a name="line.63"></a>
+<span class="sourceLineNo">064</span> * @param rightCell the right hand side cell<a name="line.64"></a>
+<span class="sourceLineNo">065</span> * @return greater than 0 if leftCell is bigger, less than 0 if rightCell is bigger, 0 if both<a name="line.65"></a>
+<span class="sourceLineNo">066</span> * cells are equal<a name="line.66"></a>
+<span class="sourceLineNo">067</span> */<a name="line.67"></a>
+<span class="sourceLineNo">068</span> int compareRows(Cell leftCell, Cell rightCell);<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 the row part of the cell with a simple plain byte[] like the<a name="line.71"></a>
+<span class="sourceLineNo">072</span> * stopRow in Scan.<a name="line.72"></a>
+<span class="sourceLineNo">073</span> * @param cell the cell<a name="line.73"></a>
+<span class="sourceLineNo">074</span> * @param bytes the byte[] representing the row to be compared with<a name="line.74"></a>
+<span class="sourceLineNo">075</span> * @param offset the offset of the byte[]<a name="line.75"></a>
+<span class="sourceLineNo">076</span> * @param length the length of the byte[]<a name="line.76"></a>
+<span class="sourceLineNo">077</span> * @return greater than 0 if leftCell is bigger, less than 0 if rightCell is bigger, 0 if both<a name="line.77"></a>
+<span class="sourceLineNo">078</span> * cells are equal<a name="line.78"></a>
+<span class="sourceLineNo">079</span> */<a name="line.79"></a>
+<span class="sourceLineNo">080</span> int compareRows(Cell cell, byte[] bytes, int offset, int length);<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> * Lexographically compares the two cells excluding the row part. It compares family, qualifier,<a name="line.83"></a>
+<span class="sourceLineNo">084</span> * timestamp and the type<a name="line.84"></a>
+<span class="sourceLineNo">085</span> * @param leftCell the left hand side cell<a name="line.85"></a>
+<span class="sourceLineNo">086</span> * @param rightCell the right hand side cell<a name="line.86"></a>
+<span class="sourceLineNo">087</span> * @return greater than 0 if leftCell is bigger, less than 0 if rightCell is bigger, 0 if both<a name="line.87"></a>
+<span class="sourceLineNo">088</span> * cells are equal<a name="line.88"></a>
+<span class="sourceLineNo">089</span> */<a name="line.89"></a>
+<span class="sourceLineNo">090</span> int compareWithoutRow(Cell leftCell, Cell rightCell);<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> * Lexographically compares the families of the two cells<a name="line.93"></a>
+<span class="sourceLineNo">094</span> * @param leftCell the left hand side cell<a name="line.94"></a>
+<span class="sourceLineNo">095</span> * @param rightCell the right hand side cell<a name="line.95"></a>
+<span class="sourceLineNo">096</span> * @return greater than 0 if leftCell is bigger, less than 0 if rightCell is bigger, 0 if both<a name="line.96"></a>
+<span class="sourceLineNo">097</span> * cells are equal<a name="line.97"></a>
+<span class="sourceLineNo">098</span> */<a name="line.98"></a>
+<span class="sourceLineNo">099</span> int compareFamilies(Cell leftCell, Cell rightCell);<a name="line.99"></a>
+<span class="sourceLineNo">100</span><a name="line.100"></a>
+<span class="sourceLineNo">101</span> /**<a name="line.101"></a>
+<span class="sourceLineNo">102</span> * Lexographically compares the qualifiers of the two cells<a name="line.102"></a>
+<span class="sourceLineNo">103</span> * @param leftCell the left hand side cell<a name="line.103"></a>
+<span class="sourceLineNo">104</span> * @param rightCell the right hand side cell<a name="line.104"></a>
+<span class="sourceLineNo">105</span> * @return greater than 0 if leftCell is bigger, less than 0 if rightCell is bigger, 0 if both<a name="line.105"></a>
+<span class="sourceLineNo">106</span> * cells are equal<a name="line.106"></a>
+<span class="sourceLineNo">107</span> */<a name="line.107"></a>
+<span class="sourceLineNo">108</span> int compareQualifiers(Cell leftCell, Cell rightCell);<a name="line.108"></a>
+<span class="sourceLineNo">109</span><a name="line.109"></a>
+<span class="sourceLineNo">110</span> /**<a name="line.110"></a>
+<span class="sourceLineNo">111</span> * Compares cell's timestamps in DESCENDING order. The below older timestamps sorting ahead of<a name="line.111"></a>
+<span class="sourceLineNo">112</span> * newer timestamps looks wrong but it is intentional. This way, newer timestamps are first found<a name="line.112"></a>
+<span class="sourceLineNo">113</span> * when we iterate over a memstore and newer versions are the first we trip over when reading from<a name="line.113"></a>
+<span class="sourceLineNo">114</span> * a store file.<a name="line.114"></a>
+<span class="sourceLineNo">115</span> * @param leftCell the left hand side cell<a name="line.115"></a>
+<span class="sourceLineNo">116</span> * @param rightCell the right hand side cell<a name="line.116"></a>
+<span class="sourceLineNo">117</span> * @return 1 if left's timestamp &lt; right's timestamp -1 if left's timestamp &gt; right's<a name="line.117"></a>
+<span class="sourceLineNo">118</span> * timestamp 0 if both timestamps are equal<a name="line.118"></a>
+<span class="sourceLineNo">119</span> */<a name="line.119"></a>
+<span class="sourceLineNo">120</span> int compareTimestamps(Cell leftCell, Cell rightCell);<a name="line.120"></a>
+<span class="sourceLineNo">121</span><a name="line.121"></a>
+<span class="sourceLineNo">122</span> /**<a name="line.122"></a>
+<span class="sourceLineNo">123</span> * Compares cell's timestamps in DESCENDING order. The below older timestamps sorting ahead of<a name="line.123"></a>
+<span class="sourceLineNo">124</span> * newer timestamps looks wrong but it is intentional. This way, newer timestamps are first found<a name="line.124"></a>
+<span class="sourceLineNo">125</span> * when we iterate over a memstore and newer versions are the first we trip over when reading from<a name="line.125"></a>
+<span class="sourceLineNo">126</span> * a store file.<a name="line.126"></a>
+<span class="sourceLineNo">127</span> * @param leftCellts the left cell's timestamp<a name="line.127"></a>
+<span class="sourceLineNo">128</span> * @param rightCellts the right cell's timestamp<a name="line.128"></a>
+<span class="sourceLineNo">129</span> * @return 1 if left's timestamp &lt; right's timestamp -1 if left's timestamp &gt; right's<a name="line.129"></a>
+<span class="sourceLineNo">130</span> * timestamp 0 if both timestamps are equal<a name="line.130"></a>
+<span class="sourceLineNo">131</span> */<a name="line.131"></a>
+<span class="sourceLineNo">132</span> int compareTimestamps(long leftCellts, long rightCellts);<a name="line.132"></a>
+<span class="sourceLineNo">133</span>}<a name="line.133"></a>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/ec5d5242/book.html
----------------------------------------------------------------------
diff --git a/book.html b/book.html
index b1f062c..2b38a02 100644
--- a/book.html
+++ b/book.html
@@ -6725,7 +6725,7 @@ Quitting...</code></pre>
<p>hbase.master.fileSplitTimeout is now set to 10 minutes. Previously it was 30 seconds.</p>
</li>
<li>
-<p>hbase.regionserver.logroll.multiplier is now set to 0.5. Previously it was 0.95.</p>
+<p>hbase.regionserver.logroll.multiplier is now set to 0.5. Previously it was 0.95. This change is tied with the following doubling of block size. Combined, these two configuration changes should make for WALs of about the same size as those in hbase-1.x but there should be less incidence of small blocks because we fail to roll the WAL before we hit the blocksize threshold. See <a href="https://issues.apache.org/jira/browse/HBASE-19148">HBASE-19148</a> for discussion.</p>
</li>
<li>
<p>hbase.regionserver.hlog.blocksize defaults to 2x the HDFS default block size for the WAL dir. Previously it was equal to the HDFS default block size for the WAL dir.</p>
@@ -37873,7 +37873,7 @@ The server will return cellblocks compressed using this same compressor as long
<div id="footer">
<div id="footer-text">
Version 3.0.0-SNAPSHOT<br>
-Last updated 2018-05-16 14:29:52 UTC
+Last updated 2018-05-16 18:31:46 UTC
</div>
</div>
</body>