hbase-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From mi...@apache.org
Subject [26/51] [partial] hbase-site git commit: Published site at eea8b38dfa0180d3e6f93d3e8055d5d4fbf673c3.
Date Fri, 11 Mar 2016 17:00:00 GMT
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/0b785cb2/devapidocs/src-html/org/apache/hadoop/hbase/filter/FuzzyRowFilter.SatisfiesCode.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/filter/FuzzyRowFilter.SatisfiesCode.html b/devapidocs/src-html/org/apache/hadoop/hbase/filter/FuzzyRowFilter.SatisfiesCode.html
index bdbf7f6..4a638ab 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/filter/FuzzyRowFilter.SatisfiesCode.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/filter/FuzzyRowFilter.SatisfiesCode.html
@@ -43,588 +43,590 @@
 <span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.35"></a>
 <span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.util.Pair;<a name="line.36"></a>
 <span class="sourceLineNo">037</span>import org.apache.hadoop.hbase.util.UnsafeAccess;<a name="line.37"></a>
-<span class="sourceLineNo">038</span><a name="line.38"></a>
-<span class="sourceLineNo">039</span>import com.google.common.annotations.VisibleForTesting;<a name="line.39"></a>
-<span class="sourceLineNo">040</span>import com.google.protobuf.InvalidProtocolBufferException;<a name="line.40"></a>
-<span class="sourceLineNo">041</span><a name="line.41"></a>
-<span class="sourceLineNo">042</span>/**<a name="line.42"></a>
-<span class="sourceLineNo">043</span> * This is optimized version of a standard FuzzyRowFilter Filters data based on fuzzy row key.<a name="line.43"></a>
-<span class="sourceLineNo">044</span> * Performs fast-forwards during scanning. It takes pairs (row key, fuzzy info) to match row keys.<a name="line.44"></a>
-<span class="sourceLineNo">045</span> * Where fuzzy info is a byte array with 0 or 1 as its values:<a name="line.45"></a>
-<span class="sourceLineNo">046</span> * &lt;ul&gt;<a name="line.46"></a>
-<span class="sourceLineNo">047</span> * &lt;li&gt;0 - means that this byte in provided row key is fixed, i.e. row key's byte at same position<a name="line.47"></a>
-<span class="sourceLineNo">048</span> * must match&lt;/li&gt;<a name="line.48"></a>
-<span class="sourceLineNo">049</span> * &lt;li&gt;1 - means that this byte in provided row key is NOT fixed, i.e. row key's byte at this<a name="line.49"></a>
-<span class="sourceLineNo">050</span> * position can be different from the one in provided row key&lt;/li&gt;<a name="line.50"></a>
-<span class="sourceLineNo">051</span> * &lt;/ul&gt;<a name="line.51"></a>
-<span class="sourceLineNo">052</span> * Example: Let's assume row key format is userId_actionId_year_month. Length of userId is fixed and<a name="line.52"></a>
-<span class="sourceLineNo">053</span> * is 4, length of actionId is 2 and year and month are 4 and 2 bytes long respectively. Let's<a name="line.53"></a>
-<span class="sourceLineNo">054</span> * assume that we need to fetch all users that performed certain action (encoded as "99") in Jan of<a name="line.54"></a>
-<span class="sourceLineNo">055</span> * any year. Then the pair (row key, fuzzy info) would be the following: row key = "????_99_????_01"<a name="line.55"></a>
-<span class="sourceLineNo">056</span> * (one can use any value instead of "?") fuzzy info =<a name="line.56"></a>
-<span class="sourceLineNo">057</span> * "\x01\x01\x01\x01\x00\x00\x00\x00\x01\x01\x01\x01\x00\x00\x00" I.e. fuzzy info tells the matching<a name="line.57"></a>
-<span class="sourceLineNo">058</span> * mask is "????_99_????_01", where at ? can be any value.<a name="line.58"></a>
-<span class="sourceLineNo">059</span> */<a name="line.59"></a>
-<span class="sourceLineNo">060</span>@InterfaceAudience.Public<a name="line.60"></a>
-<span class="sourceLineNo">061</span>@InterfaceStability.Evolving<a name="line.61"></a>
-<span class="sourceLineNo">062</span>public class FuzzyRowFilter extends FilterBase {<a name="line.62"></a>
-<span class="sourceLineNo">063</span>  private List&lt;Pair&lt;byte[], byte[]&gt;&gt; fuzzyKeysData;<a name="line.63"></a>
-<span class="sourceLineNo">064</span>  private boolean done = false;<a name="line.64"></a>
-<span class="sourceLineNo">065</span><a name="line.65"></a>
-<span class="sourceLineNo">066</span>  /**<a name="line.66"></a>
-<span class="sourceLineNo">067</span>   * The index of a last successfully found matching fuzzy string (in fuzzyKeysData). We will start<a name="line.67"></a>
-<span class="sourceLineNo">068</span>   * matching next KV with this one. If they do not match then we will return back to the one-by-one<a name="line.68"></a>
-<span class="sourceLineNo">069</span>   * iteration over fuzzyKeysData.<a name="line.69"></a>
-<span class="sourceLineNo">070</span>   */<a name="line.70"></a>
-<span class="sourceLineNo">071</span>  private int lastFoundIndex = -1;<a name="line.71"></a>
-<span class="sourceLineNo">072</span><a name="line.72"></a>
-<span class="sourceLineNo">073</span>  /**<a name="line.73"></a>
-<span class="sourceLineNo">074</span>   * Row tracker (keeps all next rows after SEEK_NEXT_USING_HINT was returned)<a name="line.74"></a>
-<span class="sourceLineNo">075</span>   */<a name="line.75"></a>
-<span class="sourceLineNo">076</span>  private RowTracker tracker;<a name="line.76"></a>
-<span class="sourceLineNo">077</span><a name="line.77"></a>
-<span class="sourceLineNo">078</span>  public FuzzyRowFilter(List&lt;Pair&lt;byte[], byte[]&gt;&gt; fuzzyKeysData) {<a name="line.78"></a>
-<span class="sourceLineNo">079</span>    Pair&lt;byte[], byte[]&gt; p;<a name="line.79"></a>
-<span class="sourceLineNo">080</span>    for (int i = 0; i &lt; fuzzyKeysData.size(); i++) {<a name="line.80"></a>
-<span class="sourceLineNo">081</span>      p = fuzzyKeysData.get(i);<a name="line.81"></a>
-<span class="sourceLineNo">082</span>      if (p.getFirst().length != p.getSecond().length) {<a name="line.82"></a>
-<span class="sourceLineNo">083</span>        Pair&lt;String, String&gt; readable =<a name="line.83"></a>
-<span class="sourceLineNo">084</span>            new Pair&lt;String, String&gt;(Bytes.toStringBinary(p.getFirst()), Bytes.toStringBinary(p<a name="line.84"></a>
-<span class="sourceLineNo">085</span>                .getSecond()));<a name="line.85"></a>
-<span class="sourceLineNo">086</span>        throw new IllegalArgumentException("Fuzzy pair lengths do not match: " + readable);<a name="line.86"></a>
-<span class="sourceLineNo">087</span>      }<a name="line.87"></a>
-<span class="sourceLineNo">088</span>      // update mask ( 0 -&gt; -1 (0xff), 1 -&gt; 0)<a name="line.88"></a>
-<span class="sourceLineNo">089</span>      p.setSecond(preprocessMask(p.getSecond()));<a name="line.89"></a>
-<span class="sourceLineNo">090</span>      preprocessSearchKey(p);<a name="line.90"></a>
-<span class="sourceLineNo">091</span>    }<a name="line.91"></a>
-<span class="sourceLineNo">092</span>    this.fuzzyKeysData = fuzzyKeysData;<a name="line.92"></a>
-<span class="sourceLineNo">093</span>    this.tracker = new RowTracker();<a name="line.93"></a>
-<span class="sourceLineNo">094</span>  }<a name="line.94"></a>
-<span class="sourceLineNo">095</span><a name="line.95"></a>
-<span class="sourceLineNo">096</span>  private void preprocessSearchKey(Pair&lt;byte[], byte[]&gt; p) {<a name="line.96"></a>
-<span class="sourceLineNo">097</span>    if (UnsafeAccess.unaligned() == false) {<a name="line.97"></a>
-<span class="sourceLineNo">098</span>      // do nothing<a name="line.98"></a>
-<span class="sourceLineNo">099</span>      return;<a name="line.99"></a>
-<span class="sourceLineNo">100</span>    }<a name="line.100"></a>
-<span class="sourceLineNo">101</span>    byte[] key = p.getFirst();<a name="line.101"></a>
-<span class="sourceLineNo">102</span>    byte[] mask = p.getSecond();<a name="line.102"></a>
-<span class="sourceLineNo">103</span>    for (int i = 0; i &lt; mask.length; i++) {<a name="line.103"></a>
-<span class="sourceLineNo">104</span>      // set non-fixed part of a search key to 0.<a name="line.104"></a>
-<span class="sourceLineNo">105</span>      if (mask[i] == 0) key[i] = 0;<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>  /**<a name="line.109"></a>
-<span class="sourceLineNo">110</span>   * We need to preprocess mask array, as since we treat 0's as unfixed positions and -1 (0xff) as<a name="line.110"></a>
-<span class="sourceLineNo">111</span>   * fixed positions<a name="line.111"></a>
-<span class="sourceLineNo">112</span>   * @param mask<a name="line.112"></a>
-<span class="sourceLineNo">113</span>   * @return mask array<a name="line.113"></a>
-<span class="sourceLineNo">114</span>   */<a name="line.114"></a>
-<span class="sourceLineNo">115</span>  private byte[] preprocessMask(byte[] mask) {<a name="line.115"></a>
-<span class="sourceLineNo">116</span>    if (UnsafeAccess.unaligned() == false) {<a name="line.116"></a>
-<span class="sourceLineNo">117</span>      // do nothing<a name="line.117"></a>
-<span class="sourceLineNo">118</span>      return mask;<a name="line.118"></a>
-<span class="sourceLineNo">119</span>    }<a name="line.119"></a>
-<span class="sourceLineNo">120</span>    if (isPreprocessedMask(mask)) return mask;<a name="line.120"></a>
-<span class="sourceLineNo">121</span>    for (int i = 0; i &lt; mask.length; i++) {<a name="line.121"></a>
-<span class="sourceLineNo">122</span>      if (mask[i] == 0) {<a name="line.122"></a>
-<span class="sourceLineNo">123</span>        mask[i] = -1; // 0 -&gt; -1<a name="line.123"></a>
-<span class="sourceLineNo">124</span>      } else if (mask[i] == 1) {<a name="line.124"></a>
-<span class="sourceLineNo">125</span>        mask[i] = 0;// 1 -&gt; 0<a name="line.125"></a>
-<span class="sourceLineNo">126</span>      }<a name="line.126"></a>
-<span class="sourceLineNo">127</span>    }<a name="line.127"></a>
-<span class="sourceLineNo">128</span>    return mask;<a name="line.128"></a>
-<span class="sourceLineNo">129</span>  }<a name="line.129"></a>
-<span class="sourceLineNo">130</span><a name="line.130"></a>
-<span class="sourceLineNo">131</span>  private boolean isPreprocessedMask(byte[] mask) {<a name="line.131"></a>
-<span class="sourceLineNo">132</span>    for (int i = 0; i &lt; mask.length; i++) {<a name="line.132"></a>
-<span class="sourceLineNo">133</span>      if (mask[i] != -1 &amp;&amp; mask[i] != 0) {<a name="line.133"></a>
-<span class="sourceLineNo">134</span>        return false;<a name="line.134"></a>
-<span class="sourceLineNo">135</span>      }<a name="line.135"></a>
-<span class="sourceLineNo">136</span>    }<a name="line.136"></a>
-<span class="sourceLineNo">137</span>    return true;<a name="line.137"></a>
-<span class="sourceLineNo">138</span>  }<a name="line.138"></a>
-<span class="sourceLineNo">139</span><a name="line.139"></a>
-<span class="sourceLineNo">140</span>  @Override<a name="line.140"></a>
-<span class="sourceLineNo">141</span>  public ReturnCode filterKeyValue(Cell c) {<a name="line.141"></a>
-<span class="sourceLineNo">142</span>    final int startIndex = lastFoundIndex &gt;= 0 ? lastFoundIndex : 0;<a name="line.142"></a>
-<span class="sourceLineNo">143</span>    final int size = fuzzyKeysData.size();<a name="line.143"></a>
-<span class="sourceLineNo">144</span>    for (int i = startIndex; i &lt; size + startIndex; i++) {<a name="line.144"></a>
-<span class="sourceLineNo">145</span>      final int index = i % size;<a name="line.145"></a>
-<span class="sourceLineNo">146</span>      Pair&lt;byte[], byte[]&gt; fuzzyData = fuzzyKeysData.get(index);<a name="line.146"></a>
-<span class="sourceLineNo">147</span>      SatisfiesCode satisfiesCode =<a name="line.147"></a>
-<span class="sourceLineNo">148</span>          satisfies(isReversed(), c.getRowArray(), c.getRowOffset(), c.getRowLength(),<a name="line.148"></a>
-<span class="sourceLineNo">149</span>            fuzzyData.getFirst(), fuzzyData.getSecond());<a name="line.149"></a>
-<span class="sourceLineNo">150</span>      if (satisfiesCode == SatisfiesCode.YES) {<a name="line.150"></a>
-<span class="sourceLineNo">151</span>        lastFoundIndex = index;<a name="line.151"></a>
-<span class="sourceLineNo">152</span>        return ReturnCode.INCLUDE;<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>    // NOT FOUND -&gt; seek next using hint<a name="line.155"></a>
-<span class="sourceLineNo">156</span>    lastFoundIndex = -1;<a name="line.156"></a>
-<span class="sourceLineNo">157</span><a name="line.157"></a>
-<span class="sourceLineNo">158</span>    return ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.158"></a>
+<span class="sourceLineNo">038</span>import org.apache.hadoop.hbase.util.UnsafeAvailChecker;<a name="line.38"></a>
+<span class="sourceLineNo">039</span><a name="line.39"></a>
+<span class="sourceLineNo">040</span>import com.google.common.annotations.VisibleForTesting;<a name="line.40"></a>
+<span class="sourceLineNo">041</span>import com.google.protobuf.InvalidProtocolBufferException;<a name="line.41"></a>
+<span class="sourceLineNo">042</span><a name="line.42"></a>
+<span class="sourceLineNo">043</span>/**<a name="line.43"></a>
+<span class="sourceLineNo">044</span> * This is optimized version of a standard FuzzyRowFilter Filters data based on fuzzy row key.<a name="line.44"></a>
+<span class="sourceLineNo">045</span> * Performs fast-forwards during scanning. It takes pairs (row key, fuzzy info) to match row keys.<a name="line.45"></a>
+<span class="sourceLineNo">046</span> * Where fuzzy info is a byte array with 0 or 1 as its values:<a name="line.46"></a>
+<span class="sourceLineNo">047</span> * &lt;ul&gt;<a name="line.47"></a>
+<span class="sourceLineNo">048</span> * &lt;li&gt;0 - means that this byte in provided row key is fixed, i.e. row key's byte at same position<a name="line.48"></a>
+<span class="sourceLineNo">049</span> * must match&lt;/li&gt;<a name="line.49"></a>
+<span class="sourceLineNo">050</span> * &lt;li&gt;1 - means that this byte in provided row key is NOT fixed, i.e. row key's byte at this<a name="line.50"></a>
+<span class="sourceLineNo">051</span> * position can be different from the one in provided row key&lt;/li&gt;<a name="line.51"></a>
+<span class="sourceLineNo">052</span> * &lt;/ul&gt;<a name="line.52"></a>
+<span class="sourceLineNo">053</span> * Example: Let's assume row key format is userId_actionId_year_month. Length of userId is fixed and<a name="line.53"></a>
+<span class="sourceLineNo">054</span> * is 4, length of actionId is 2 and year and month are 4 and 2 bytes long respectively. Let's<a name="line.54"></a>
+<span class="sourceLineNo">055</span> * assume that we need to fetch all users that performed certain action (encoded as "99") in Jan of<a name="line.55"></a>
+<span class="sourceLineNo">056</span> * any year. Then the pair (row key, fuzzy info) would be the following: row key = "????_99_????_01"<a name="line.56"></a>
+<span class="sourceLineNo">057</span> * (one can use any value instead of "?") fuzzy info =<a name="line.57"></a>
+<span class="sourceLineNo">058</span> * "\x01\x01\x01\x01\x00\x00\x00\x00\x01\x01\x01\x01\x00\x00\x00" I.e. fuzzy info tells the matching<a name="line.58"></a>
+<span class="sourceLineNo">059</span> * mask is "????_99_????_01", where at ? can be any value.<a name="line.59"></a>
+<span class="sourceLineNo">060</span> */<a name="line.60"></a>
+<span class="sourceLineNo">061</span>@InterfaceAudience.Public<a name="line.61"></a>
+<span class="sourceLineNo">062</span>@InterfaceStability.Evolving<a name="line.62"></a>
+<span class="sourceLineNo">063</span>public class FuzzyRowFilter extends FilterBase {<a name="line.63"></a>
+<span class="sourceLineNo">064</span>  private static final boolean UNSAFE_UNALIGNED = UnsafeAvailChecker.unaligned();<a name="line.64"></a>
+<span class="sourceLineNo">065</span>  private List&lt;Pair&lt;byte[], byte[]&gt;&gt; fuzzyKeysData;<a name="line.65"></a>
+<span class="sourceLineNo">066</span>  private boolean done = false;<a name="line.66"></a>
+<span class="sourceLineNo">067</span><a name="line.67"></a>
+<span class="sourceLineNo">068</span>  /**<a name="line.68"></a>
+<span class="sourceLineNo">069</span>   * The index of a last successfully found matching fuzzy string (in fuzzyKeysData). We will start<a name="line.69"></a>
+<span class="sourceLineNo">070</span>   * matching next KV with this one. If they do not match then we will return back to the one-by-one<a name="line.70"></a>
+<span class="sourceLineNo">071</span>   * iteration over fuzzyKeysData.<a name="line.71"></a>
+<span class="sourceLineNo">072</span>   */<a name="line.72"></a>
+<span class="sourceLineNo">073</span>  private int lastFoundIndex = -1;<a name="line.73"></a>
+<span class="sourceLineNo">074</span><a name="line.74"></a>
+<span class="sourceLineNo">075</span>  /**<a name="line.75"></a>
+<span class="sourceLineNo">076</span>   * Row tracker (keeps all next rows after SEEK_NEXT_USING_HINT was returned)<a name="line.76"></a>
+<span class="sourceLineNo">077</span>   */<a name="line.77"></a>
+<span class="sourceLineNo">078</span>  private RowTracker tracker;<a name="line.78"></a>
+<span class="sourceLineNo">079</span><a name="line.79"></a>
+<span class="sourceLineNo">080</span>  public FuzzyRowFilter(List&lt;Pair&lt;byte[], byte[]&gt;&gt; fuzzyKeysData) {<a name="line.80"></a>
+<span class="sourceLineNo">081</span>    Pair&lt;byte[], byte[]&gt; p;<a name="line.81"></a>
+<span class="sourceLineNo">082</span>    for (int i = 0; i &lt; fuzzyKeysData.size(); i++) {<a name="line.82"></a>
+<span class="sourceLineNo">083</span>      p = fuzzyKeysData.get(i);<a name="line.83"></a>
+<span class="sourceLineNo">084</span>      if (p.getFirst().length != p.getSecond().length) {<a name="line.84"></a>
+<span class="sourceLineNo">085</span>        Pair&lt;String, String&gt; readable =<a name="line.85"></a>
+<span class="sourceLineNo">086</span>            new Pair&lt;String, String&gt;(Bytes.toStringBinary(p.getFirst()), Bytes.toStringBinary(p<a name="line.86"></a>
+<span class="sourceLineNo">087</span>                .getSecond()));<a name="line.87"></a>
+<span class="sourceLineNo">088</span>        throw new IllegalArgumentException("Fuzzy pair lengths do not match: " + readable);<a name="line.88"></a>
+<span class="sourceLineNo">089</span>      }<a name="line.89"></a>
+<span class="sourceLineNo">090</span>      // update mask ( 0 -&gt; -1 (0xff), 1 -&gt; 0)<a name="line.90"></a>
+<span class="sourceLineNo">091</span>      p.setSecond(preprocessMask(p.getSecond()));<a name="line.91"></a>
+<span class="sourceLineNo">092</span>      preprocessSearchKey(p);<a name="line.92"></a>
+<span class="sourceLineNo">093</span>    }<a name="line.93"></a>
+<span class="sourceLineNo">094</span>    this.fuzzyKeysData = fuzzyKeysData;<a name="line.94"></a>
+<span class="sourceLineNo">095</span>    this.tracker = new RowTracker();<a name="line.95"></a>
+<span class="sourceLineNo">096</span>  }<a name="line.96"></a>
+<span class="sourceLineNo">097</span><a name="line.97"></a>
+<span class="sourceLineNo">098</span>  private void preprocessSearchKey(Pair&lt;byte[], byte[]&gt; p) {<a name="line.98"></a>
+<span class="sourceLineNo">099</span>    if (!UNSAFE_UNALIGNED) {<a name="line.99"></a>
+<span class="sourceLineNo">100</span>      // do nothing<a name="line.100"></a>
+<span class="sourceLineNo">101</span>      return;<a name="line.101"></a>
+<span class="sourceLineNo">102</span>    }<a name="line.102"></a>
+<span class="sourceLineNo">103</span>    byte[] key = p.getFirst();<a name="line.103"></a>
+<span class="sourceLineNo">104</span>    byte[] mask = p.getSecond();<a name="line.104"></a>
+<span class="sourceLineNo">105</span>    for (int i = 0; i &lt; mask.length; i++) {<a name="line.105"></a>
+<span class="sourceLineNo">106</span>      // set non-fixed part of a search key to 0.<a name="line.106"></a>
+<span class="sourceLineNo">107</span>      if (mask[i] == 0) key[i] = 0;<a name="line.107"></a>
+<span class="sourceLineNo">108</span>    }<a name="line.108"></a>
+<span class="sourceLineNo">109</span>  }<a name="line.109"></a>
+<span class="sourceLineNo">110</span><a name="line.110"></a>
+<span class="sourceLineNo">111</span>  /**<a name="line.111"></a>
+<span class="sourceLineNo">112</span>   * We need to preprocess mask array, as since we treat 0's as unfixed positions and -1 (0xff) as<a name="line.112"></a>
+<span class="sourceLineNo">113</span>   * fixed positions<a name="line.113"></a>
+<span class="sourceLineNo">114</span>   * @param mask<a name="line.114"></a>
+<span class="sourceLineNo">115</span>   * @return mask array<a name="line.115"></a>
+<span class="sourceLineNo">116</span>   */<a name="line.116"></a>
+<span class="sourceLineNo">117</span>  private byte[] preprocessMask(byte[] mask) {<a name="line.117"></a>
+<span class="sourceLineNo">118</span>    if (!UNSAFE_UNALIGNED) {<a name="line.118"></a>
+<span class="sourceLineNo">119</span>      // do nothing<a name="line.119"></a>
+<span class="sourceLineNo">120</span>      return mask;<a name="line.120"></a>
+<span class="sourceLineNo">121</span>    }<a name="line.121"></a>
+<span class="sourceLineNo">122</span>    if (isPreprocessedMask(mask)) return mask;<a name="line.122"></a>
+<span class="sourceLineNo">123</span>    for (int i = 0; i &lt; mask.length; i++) {<a name="line.123"></a>
+<span class="sourceLineNo">124</span>      if (mask[i] == 0) {<a name="line.124"></a>
+<span class="sourceLineNo">125</span>        mask[i] = -1; // 0 -&gt; -1<a name="line.125"></a>
+<span class="sourceLineNo">126</span>      } else if (mask[i] == 1) {<a name="line.126"></a>
+<span class="sourceLineNo">127</span>        mask[i] = 0;// 1 -&gt; 0<a name="line.127"></a>
+<span class="sourceLineNo">128</span>      }<a name="line.128"></a>
+<span class="sourceLineNo">129</span>    }<a name="line.129"></a>
+<span class="sourceLineNo">130</span>    return mask;<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>  private boolean isPreprocessedMask(byte[] mask) {<a name="line.133"></a>
+<span class="sourceLineNo">134</span>    for (int i = 0; i &lt; mask.length; i++) {<a name="line.134"></a>
+<span class="sourceLineNo">135</span>      if (mask[i] != -1 &amp;&amp; mask[i] != 0) {<a name="line.135"></a>
+<span class="sourceLineNo">136</span>        return false;<a name="line.136"></a>
+<span class="sourceLineNo">137</span>      }<a name="line.137"></a>
+<span class="sourceLineNo">138</span>    }<a name="line.138"></a>
+<span class="sourceLineNo">139</span>    return true;<a name="line.139"></a>
+<span class="sourceLineNo">140</span>  }<a name="line.140"></a>
+<span class="sourceLineNo">141</span><a name="line.141"></a>
+<span class="sourceLineNo">142</span>  @Override<a name="line.142"></a>
+<span class="sourceLineNo">143</span>  public ReturnCode filterKeyValue(Cell c) {<a name="line.143"></a>
+<span class="sourceLineNo">144</span>    final int startIndex = lastFoundIndex &gt;= 0 ? lastFoundIndex : 0;<a name="line.144"></a>
+<span class="sourceLineNo">145</span>    final int size = fuzzyKeysData.size();<a name="line.145"></a>
+<span class="sourceLineNo">146</span>    for (int i = startIndex; i &lt; size + startIndex; i++) {<a name="line.146"></a>
+<span class="sourceLineNo">147</span>      final int index = i % size;<a name="line.147"></a>
+<span class="sourceLineNo">148</span>      Pair&lt;byte[], byte[]&gt; fuzzyData = fuzzyKeysData.get(index);<a name="line.148"></a>
+<span class="sourceLineNo">149</span>      SatisfiesCode satisfiesCode =<a name="line.149"></a>
+<span class="sourceLineNo">150</span>          satisfies(isReversed(), c.getRowArray(), c.getRowOffset(), c.getRowLength(),<a name="line.150"></a>
+<span class="sourceLineNo">151</span>            fuzzyData.getFirst(), fuzzyData.getSecond());<a name="line.151"></a>
+<span class="sourceLineNo">152</span>      if (satisfiesCode == SatisfiesCode.YES) {<a name="line.152"></a>
+<span class="sourceLineNo">153</span>        lastFoundIndex = index;<a name="line.153"></a>
+<span class="sourceLineNo">154</span>        return ReturnCode.INCLUDE;<a name="line.154"></a>
+<span class="sourceLineNo">155</span>      }<a name="line.155"></a>
+<span class="sourceLineNo">156</span>    }<a name="line.156"></a>
+<span class="sourceLineNo">157</span>    // NOT FOUND -&gt; seek next using hint<a name="line.157"></a>
+<span class="sourceLineNo">158</span>    lastFoundIndex = -1;<a name="line.158"></a>
 <span class="sourceLineNo">159</span><a name="line.159"></a>
-<span class="sourceLineNo">160</span>  }<a name="line.160"></a>
+<span class="sourceLineNo">160</span>    return ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.160"></a>
 <span class="sourceLineNo">161</span><a name="line.161"></a>
-<span class="sourceLineNo">162</span>  @Override<a name="line.162"></a>
-<span class="sourceLineNo">163</span>  public Cell getNextCellHint(Cell currentCell) {<a name="line.163"></a>
-<span class="sourceLineNo">164</span>    boolean result = tracker.updateTracker(currentCell);<a name="line.164"></a>
-<span class="sourceLineNo">165</span>    if (result == false) {<a name="line.165"></a>
-<span class="sourceLineNo">166</span>      done = true;<a name="line.166"></a>
-<span class="sourceLineNo">167</span>      return null;<a name="line.167"></a>
-<span class="sourceLineNo">168</span>    }<a name="line.168"></a>
-<span class="sourceLineNo">169</span>    byte[] nextRowKey = tracker.nextRow();<a name="line.169"></a>
-<span class="sourceLineNo">170</span>    return KeyValueUtil.createFirstOnRow(nextRowKey);<a name="line.170"></a>
-<span class="sourceLineNo">171</span>  }<a name="line.171"></a>
-<span class="sourceLineNo">172</span><a name="line.172"></a>
-<span class="sourceLineNo">173</span>  /**<a name="line.173"></a>
-<span class="sourceLineNo">174</span>   * If we have multiple fuzzy keys, row tracker should improve overall performance. It calculates<a name="line.174"></a>
-<span class="sourceLineNo">175</span>   * all next rows (one per every fuzzy key) and put them (the fuzzy key is bundled) into a priority<a name="line.175"></a>
-<span class="sourceLineNo">176</span>   * queue so that the smallest row key always appears at queue head, which helps to decide the<a name="line.176"></a>
-<span class="sourceLineNo">177</span>   * "Next Cell Hint". As scanning going on, the number of candidate rows in the RowTracker will<a name="line.177"></a>
-<span class="sourceLineNo">178</span>   * remain the size of fuzzy keys until some of the fuzzy keys won't possibly have matches any<a name="line.178"></a>
-<span class="sourceLineNo">179</span>   * more.<a name="line.179"></a>
-<span class="sourceLineNo">180</span>   */<a name="line.180"></a>
-<span class="sourceLineNo">181</span>  private class RowTracker {<a name="line.181"></a>
-<span class="sourceLineNo">182</span>    private final PriorityQueue&lt;Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt;&gt; nextRows;<a name="line.182"></a>
-<span class="sourceLineNo">183</span>    private boolean initialized = false;<a name="line.183"></a>
-<span class="sourceLineNo">184</span><a name="line.184"></a>
-<span class="sourceLineNo">185</span>    RowTracker() {<a name="line.185"></a>
-<span class="sourceLineNo">186</span>      nextRows =<a name="line.186"></a>
-<span class="sourceLineNo">187</span>          new PriorityQueue&lt;Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt;&gt;(fuzzyKeysData.size(),<a name="line.187"></a>
-<span class="sourceLineNo">188</span>              new Comparator&lt;Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt;&gt;() {<a name="line.188"></a>
-<span class="sourceLineNo">189</span>                @Override<a name="line.189"></a>
-<span class="sourceLineNo">190</span>                public int compare(Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt; o1,<a name="line.190"></a>
-<span class="sourceLineNo">191</span>                    Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt; o2) {<a name="line.191"></a>
-<span class="sourceLineNo">192</span>                  return isReversed()? Bytes.compareTo(o2.getFirst(), o1.getFirst()):<a name="line.192"></a>
-<span class="sourceLineNo">193</span>                    Bytes.compareTo(o1.getFirst(), o2.getFirst());<a name="line.193"></a>
-<span class="sourceLineNo">194</span>                }<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>    byte[] nextRow() {<a name="line.198"></a>
-<span class="sourceLineNo">199</span>      if (nextRows.isEmpty()) {<a name="line.199"></a>
-<span class="sourceLineNo">200</span>        throw new IllegalStateException(<a name="line.200"></a>
-<span class="sourceLineNo">201</span>            "NextRows should not be empty, make sure to call nextRow() after updateTracker() return true");<a name="line.201"></a>
-<span class="sourceLineNo">202</span>      } else {<a name="line.202"></a>
-<span class="sourceLineNo">203</span>        return nextRows.peek().getFirst();<a name="line.203"></a>
-<span class="sourceLineNo">204</span>      }<a name="line.204"></a>
-<span class="sourceLineNo">205</span>    }<a name="line.205"></a>
-<span class="sourceLineNo">206</span><a name="line.206"></a>
-<span class="sourceLineNo">207</span>    boolean updateTracker(Cell currentCell) {<a name="line.207"></a>
-<span class="sourceLineNo">208</span>      if (!initialized) {<a name="line.208"></a>
-<span class="sourceLineNo">209</span>        for (Pair&lt;byte[], byte[]&gt; fuzzyData : fuzzyKeysData) {<a name="line.209"></a>
-<span class="sourceLineNo">210</span>          updateWith(currentCell, fuzzyData);<a name="line.210"></a>
-<span class="sourceLineNo">211</span>        }<a name="line.211"></a>
-<span class="sourceLineNo">212</span>        initialized = true;<a name="line.212"></a>
-<span class="sourceLineNo">213</span>      } else {<a name="line.213"></a>
-<span class="sourceLineNo">214</span>        while (!nextRows.isEmpty() &amp;&amp; !lessThan(currentCell, nextRows.peek().getFirst())) {<a name="line.214"></a>
-<span class="sourceLineNo">215</span>          Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt; head = nextRows.poll();<a name="line.215"></a>
-<span class="sourceLineNo">216</span>          Pair&lt;byte[], byte[]&gt; fuzzyData = head.getSecond();<a name="line.216"></a>
-<span class="sourceLineNo">217</span>          updateWith(currentCell, fuzzyData);<a name="line.217"></a>
-<span class="sourceLineNo">218</span>        }<a name="line.218"></a>
-<span class="sourceLineNo">219</span>      }<a name="line.219"></a>
-<span class="sourceLineNo">220</span>      return !nextRows.isEmpty();<a name="line.220"></a>
-<span class="sourceLineNo">221</span>    }<a name="line.221"></a>
-<span class="sourceLineNo">222</span><a name="line.222"></a>
-<span class="sourceLineNo">223</span>    boolean lessThan(Cell currentCell, byte[] nextRowKey) {<a name="line.223"></a>
-<span class="sourceLineNo">224</span>      int compareResult =<a name="line.224"></a>
-<span class="sourceLineNo">225</span>          CellComparator.COMPARATOR.compareRows(currentCell, nextRowKey, 0, nextRowKey.length);<a name="line.225"></a>
-<span class="sourceLineNo">226</span>      return (!isReversed() &amp;&amp; compareResult &lt; 0) || (isReversed() &amp;&amp; compareResult &gt; 0);<a name="line.226"></a>
-<span class="sourceLineNo">227</span>    }<a name="line.227"></a>
-<span class="sourceLineNo">228</span><a name="line.228"></a>
-<span class="sourceLineNo">229</span>    void updateWith(Cell currentCell, Pair&lt;byte[], byte[]&gt; fuzzyData) {<a name="line.229"></a>
-<span class="sourceLineNo">230</span>      byte[] nextRowKeyCandidate =<a name="line.230"></a>
-<span class="sourceLineNo">231</span>          getNextForFuzzyRule(isReversed(), currentCell.getRowArray(), currentCell.getRowOffset(),<a name="line.231"></a>
-<span class="sourceLineNo">232</span>            currentCell.getRowLength(), fuzzyData.getFirst(), fuzzyData.getSecond());<a name="line.232"></a>
-<span class="sourceLineNo">233</span>      if (nextRowKeyCandidate != null) {<a name="line.233"></a>
-<span class="sourceLineNo">234</span>        nextRows.add(new Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt;(nextRowKeyCandidate, fuzzyData));<a name="line.234"></a>
-<span class="sourceLineNo">235</span>      }<a name="line.235"></a>
-<span class="sourceLineNo">236</span>    }<a name="line.236"></a>
-<span class="sourceLineNo">237</span><a name="line.237"></a>
-<span class="sourceLineNo">238</span>  }<a name="line.238"></a>
+<span class="sourceLineNo">162</span>  }<a name="line.162"></a>
+<span class="sourceLineNo">163</span><a name="line.163"></a>
+<span class="sourceLineNo">164</span>  @Override<a name="line.164"></a>
+<span class="sourceLineNo">165</span>  public Cell getNextCellHint(Cell currentCell) {<a name="line.165"></a>
+<span class="sourceLineNo">166</span>    boolean result = tracker.updateTracker(currentCell);<a name="line.166"></a>
+<span class="sourceLineNo">167</span>    if (result == false) {<a name="line.167"></a>
+<span class="sourceLineNo">168</span>      done = true;<a name="line.168"></a>
+<span class="sourceLineNo">169</span>      return null;<a name="line.169"></a>
+<span class="sourceLineNo">170</span>    }<a name="line.170"></a>
+<span class="sourceLineNo">171</span>    byte[] nextRowKey = tracker.nextRow();<a name="line.171"></a>
+<span class="sourceLineNo">172</span>    return KeyValueUtil.createFirstOnRow(nextRowKey);<a name="line.172"></a>
+<span class="sourceLineNo">173</span>  }<a name="line.173"></a>
+<span class="sourceLineNo">174</span><a name="line.174"></a>
+<span class="sourceLineNo">175</span>  /**<a name="line.175"></a>
+<span class="sourceLineNo">176</span>   * If we have multiple fuzzy keys, row tracker should improve overall performance. It calculates<a name="line.176"></a>
+<span class="sourceLineNo">177</span>   * all next rows (one per every fuzzy key) and put them (the fuzzy key is bundled) into a priority<a name="line.177"></a>
+<span class="sourceLineNo">178</span>   * queue so that the smallest row key always appears at queue head, which helps to decide the<a name="line.178"></a>
+<span class="sourceLineNo">179</span>   * "Next Cell Hint". As scanning going on, the number of candidate rows in the RowTracker will<a name="line.179"></a>
+<span class="sourceLineNo">180</span>   * remain the size of fuzzy keys until some of the fuzzy keys won't possibly have matches any<a name="line.180"></a>
+<span class="sourceLineNo">181</span>   * more.<a name="line.181"></a>
+<span class="sourceLineNo">182</span>   */<a name="line.182"></a>
+<span class="sourceLineNo">183</span>  private class RowTracker {<a name="line.183"></a>
+<span class="sourceLineNo">184</span>    private final PriorityQueue&lt;Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt;&gt; nextRows;<a name="line.184"></a>
+<span class="sourceLineNo">185</span>    private boolean initialized = false;<a name="line.185"></a>
+<span class="sourceLineNo">186</span><a name="line.186"></a>
+<span class="sourceLineNo">187</span>    RowTracker() {<a name="line.187"></a>
+<span class="sourceLineNo">188</span>      nextRows =<a name="line.188"></a>
+<span class="sourceLineNo">189</span>          new PriorityQueue&lt;Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt;&gt;(fuzzyKeysData.size(),<a name="line.189"></a>
+<span class="sourceLineNo">190</span>              new Comparator&lt;Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt;&gt;() {<a name="line.190"></a>
+<span class="sourceLineNo">191</span>                @Override<a name="line.191"></a>
+<span class="sourceLineNo">192</span>                public int compare(Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt; o1,<a name="line.192"></a>
+<span class="sourceLineNo">193</span>                    Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt; o2) {<a name="line.193"></a>
+<span class="sourceLineNo">194</span>                  return isReversed()? Bytes.compareTo(o2.getFirst(), o1.getFirst()):<a name="line.194"></a>
+<span class="sourceLineNo">195</span>                    Bytes.compareTo(o1.getFirst(), o2.getFirst());<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>    }<a name="line.198"></a>
+<span class="sourceLineNo">199</span><a name="line.199"></a>
+<span class="sourceLineNo">200</span>    byte[] nextRow() {<a name="line.200"></a>
+<span class="sourceLineNo">201</span>      if (nextRows.isEmpty()) {<a name="line.201"></a>
+<span class="sourceLineNo">202</span>        throw new IllegalStateException(<a name="line.202"></a>
+<span class="sourceLineNo">203</span>            "NextRows should not be empty, make sure to call nextRow() after updateTracker() return true");<a name="line.203"></a>
+<span class="sourceLineNo">204</span>      } else {<a name="line.204"></a>
+<span class="sourceLineNo">205</span>        return nextRows.peek().getFirst();<a name="line.205"></a>
+<span class="sourceLineNo">206</span>      }<a name="line.206"></a>
+<span class="sourceLineNo">207</span>    }<a name="line.207"></a>
+<span class="sourceLineNo">208</span><a name="line.208"></a>
+<span class="sourceLineNo">209</span>    boolean updateTracker(Cell currentCell) {<a name="line.209"></a>
+<span class="sourceLineNo">210</span>      if (!initialized) {<a name="line.210"></a>
+<span class="sourceLineNo">211</span>        for (Pair&lt;byte[], byte[]&gt; fuzzyData : fuzzyKeysData) {<a name="line.211"></a>
+<span class="sourceLineNo">212</span>          updateWith(currentCell, fuzzyData);<a name="line.212"></a>
+<span class="sourceLineNo">213</span>        }<a name="line.213"></a>
+<span class="sourceLineNo">214</span>        initialized = true;<a name="line.214"></a>
+<span class="sourceLineNo">215</span>      } else {<a name="line.215"></a>
+<span class="sourceLineNo">216</span>        while (!nextRows.isEmpty() &amp;&amp; !lessThan(currentCell, nextRows.peek().getFirst())) {<a name="line.216"></a>
+<span class="sourceLineNo">217</span>          Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt; head = nextRows.poll();<a name="line.217"></a>
+<span class="sourceLineNo">218</span>          Pair&lt;byte[], byte[]&gt; fuzzyData = head.getSecond();<a name="line.218"></a>
+<span class="sourceLineNo">219</span>          updateWith(currentCell, fuzzyData);<a name="line.219"></a>
+<span class="sourceLineNo">220</span>        }<a name="line.220"></a>
+<span class="sourceLineNo">221</span>      }<a name="line.221"></a>
+<span class="sourceLineNo">222</span>      return !nextRows.isEmpty();<a name="line.222"></a>
+<span class="sourceLineNo">223</span>    }<a name="line.223"></a>
+<span class="sourceLineNo">224</span><a name="line.224"></a>
+<span class="sourceLineNo">225</span>    boolean lessThan(Cell currentCell, byte[] nextRowKey) {<a name="line.225"></a>
+<span class="sourceLineNo">226</span>      int compareResult =<a name="line.226"></a>
+<span class="sourceLineNo">227</span>          CellComparator.COMPARATOR.compareRows(currentCell, nextRowKey, 0, nextRowKey.length);<a name="line.227"></a>
+<span class="sourceLineNo">228</span>      return (!isReversed() &amp;&amp; compareResult &lt; 0) || (isReversed() &amp;&amp; compareResult &gt; 0);<a name="line.228"></a>
+<span class="sourceLineNo">229</span>    }<a name="line.229"></a>
+<span class="sourceLineNo">230</span><a name="line.230"></a>
+<span class="sourceLineNo">231</span>    void updateWith(Cell currentCell, Pair&lt;byte[], byte[]&gt; fuzzyData) {<a name="line.231"></a>
+<span class="sourceLineNo">232</span>      byte[] nextRowKeyCandidate =<a name="line.232"></a>
+<span class="sourceLineNo">233</span>          getNextForFuzzyRule(isReversed(), currentCell.getRowArray(), currentCell.getRowOffset(),<a name="line.233"></a>
+<span class="sourceLineNo">234</span>            currentCell.getRowLength(), fuzzyData.getFirst(), fuzzyData.getSecond());<a name="line.234"></a>
+<span class="sourceLineNo">235</span>      if (nextRowKeyCandidate != null) {<a name="line.235"></a>
+<span class="sourceLineNo">236</span>        nextRows.add(new Pair&lt;byte[], Pair&lt;byte[], byte[]&gt;&gt;(nextRowKeyCandidate, fuzzyData));<a name="line.236"></a>
+<span class="sourceLineNo">237</span>      }<a name="line.237"></a>
+<span class="sourceLineNo">238</span>    }<a name="line.238"></a>
 <span class="sourceLineNo">239</span><a name="line.239"></a>
-<span class="sourceLineNo">240</span>  @Override<a name="line.240"></a>
-<span class="sourceLineNo">241</span>  public boolean filterAllRemaining() {<a name="line.241"></a>
-<span class="sourceLineNo">242</span>    return done;<a name="line.242"></a>
-<span class="sourceLineNo">243</span>  }<a name="line.243"></a>
-<span class="sourceLineNo">244</span><a name="line.244"></a>
-<span class="sourceLineNo">245</span>  /**<a name="line.245"></a>
-<span class="sourceLineNo">246</span>   * @return The filter serialized using pb<a name="line.246"></a>
-<span class="sourceLineNo">247</span>   */<a name="line.247"></a>
-<span class="sourceLineNo">248</span>  public byte[] toByteArray() {<a name="line.248"></a>
-<span class="sourceLineNo">249</span>    FilterProtos.FuzzyRowFilter.Builder builder = FilterProtos.FuzzyRowFilter.newBuilder();<a name="line.249"></a>
-<span class="sourceLineNo">250</span>    for (Pair&lt;byte[], byte[]&gt; fuzzyData : fuzzyKeysData) {<a name="line.250"></a>
-<span class="sourceLineNo">251</span>      BytesBytesPair.Builder bbpBuilder = BytesBytesPair.newBuilder();<a name="line.251"></a>
-<span class="sourceLineNo">252</span>      bbpBuilder.setFirst(ByteStringer.wrap(fuzzyData.getFirst()));<a name="line.252"></a>
-<span class="sourceLineNo">253</span>      bbpBuilder.setSecond(ByteStringer.wrap(fuzzyData.getSecond()));<a name="line.253"></a>
-<span class="sourceLineNo">254</span>      builder.addFuzzyKeysData(bbpBuilder);<a name="line.254"></a>
-<span class="sourceLineNo">255</span>    }<a name="line.255"></a>
-<span class="sourceLineNo">256</span>    return builder.build().toByteArray();<a name="line.256"></a>
-<span class="sourceLineNo">257</span>  }<a name="line.257"></a>
-<span class="sourceLineNo">258</span><a name="line.258"></a>
-<span class="sourceLineNo">259</span>  /**<a name="line.259"></a>
-<span class="sourceLineNo">260</span>   * @param pbBytes A pb serialized {@link FuzzyRowFilter} instance<a name="line.260"></a>
-<span class="sourceLineNo">261</span>   * @return An instance of {@link FuzzyRowFilter} made from &lt;code&gt;bytes&lt;/code&gt;<a name="line.261"></a>
-<span class="sourceLineNo">262</span>   * @throws DeserializationException<a name="line.262"></a>
-<span class="sourceLineNo">263</span>   * @see #toByteArray<a name="line.263"></a>
-<span class="sourceLineNo">264</span>   */<a name="line.264"></a>
-<span class="sourceLineNo">265</span>  public static FuzzyRowFilter parseFrom(final byte[] pbBytes) throws DeserializationException {<a name="line.265"></a>
-<span class="sourceLineNo">266</span>    FilterProtos.FuzzyRowFilter proto;<a name="line.266"></a>
-<span class="sourceLineNo">267</span>    try {<a name="line.267"></a>
-<span class="sourceLineNo">268</span>      proto = FilterProtos.FuzzyRowFilter.parseFrom(pbBytes);<a name="line.268"></a>
-<span class="sourceLineNo">269</span>    } catch (InvalidProtocolBufferException e) {<a name="line.269"></a>
-<span class="sourceLineNo">270</span>      throw new DeserializationException(e);<a name="line.270"></a>
-<span class="sourceLineNo">271</span>    }<a name="line.271"></a>
-<span class="sourceLineNo">272</span>    int count = proto.getFuzzyKeysDataCount();<a name="line.272"></a>
-<span class="sourceLineNo">273</span>    ArrayList&lt;Pair&lt;byte[], byte[]&gt;&gt; fuzzyKeysData = new ArrayList&lt;Pair&lt;byte[], byte[]&gt;&gt;(count);<a name="line.273"></a>
-<span class="sourceLineNo">274</span>    for (int i = 0; i &lt; count; ++i) {<a name="line.274"></a>
-<span class="sourceLineNo">275</span>      BytesBytesPair current = proto.getFuzzyKeysData(i);<a name="line.275"></a>
-<span class="sourceLineNo">276</span>      byte[] keyBytes = current.getFirst().toByteArray();<a name="line.276"></a>
-<span class="sourceLineNo">277</span>      byte[] keyMeta = current.getSecond().toByteArray();<a name="line.277"></a>
-<span class="sourceLineNo">278</span>      fuzzyKeysData.add(new Pair&lt;byte[], byte[]&gt;(keyBytes, keyMeta));<a name="line.278"></a>
-<span class="sourceLineNo">279</span>    }<a name="line.279"></a>
-<span class="sourceLineNo">280</span>    return new FuzzyRowFilter(fuzzyKeysData);<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>  @Override<a name="line.283"></a>
-<span class="sourceLineNo">284</span>  public String toString() {<a name="line.284"></a>
-<span class="sourceLineNo">285</span>    final StringBuilder sb = new StringBuilder();<a name="line.285"></a>
-<span class="sourceLineNo">286</span>    sb.append("FuzzyRowFilter");<a name="line.286"></a>
-<span class="sourceLineNo">287</span>    sb.append("{fuzzyKeysData=");<a name="line.287"></a>
-<span class="sourceLineNo">288</span>    for (Pair&lt;byte[], byte[]&gt; fuzzyData : fuzzyKeysData) {<a name="line.288"></a>
-<span class="sourceLineNo">289</span>      sb.append('{').append(Bytes.toStringBinary(fuzzyData.getFirst())).append(":");<a name="line.289"></a>
-<span class="sourceLineNo">290</span>      sb.append(Bytes.toStringBinary(fuzzyData.getSecond())).append('}');<a name="line.290"></a>
-<span class="sourceLineNo">291</span>    }<a name="line.291"></a>
-<span class="sourceLineNo">292</span>    sb.append("}, ");<a name="line.292"></a>
-<span class="sourceLineNo">293</span>    return sb.toString();<a name="line.293"></a>
-<span class="sourceLineNo">294</span>  }<a name="line.294"></a>
-<span class="sourceLineNo">295</span><a name="line.295"></a>
-<span class="sourceLineNo">296</span>  // Utility methods<a name="line.296"></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>  @Override<a name="line.242"></a>
+<span class="sourceLineNo">243</span>  public boolean filterAllRemaining() {<a name="line.243"></a>
+<span class="sourceLineNo">244</span>    return done;<a name="line.244"></a>
+<span class="sourceLineNo">245</span>  }<a name="line.245"></a>
+<span class="sourceLineNo">246</span><a name="line.246"></a>
+<span class="sourceLineNo">247</span>  /**<a name="line.247"></a>
+<span class="sourceLineNo">248</span>   * @return The filter serialized using pb<a name="line.248"></a>
+<span class="sourceLineNo">249</span>   */<a name="line.249"></a>
+<span class="sourceLineNo">250</span>  public byte[] toByteArray() {<a name="line.250"></a>
+<span class="sourceLineNo">251</span>    FilterProtos.FuzzyRowFilter.Builder builder = FilterProtos.FuzzyRowFilter.newBuilder();<a name="line.251"></a>
+<span class="sourceLineNo">252</span>    for (Pair&lt;byte[], byte[]&gt; fuzzyData : fuzzyKeysData) {<a name="line.252"></a>
+<span class="sourceLineNo">253</span>      BytesBytesPair.Builder bbpBuilder = BytesBytesPair.newBuilder();<a name="line.253"></a>
+<span class="sourceLineNo">254</span>      bbpBuilder.setFirst(ByteStringer.wrap(fuzzyData.getFirst()));<a name="line.254"></a>
+<span class="sourceLineNo">255</span>      bbpBuilder.setSecond(ByteStringer.wrap(fuzzyData.getSecond()));<a name="line.255"></a>
+<span class="sourceLineNo">256</span>      builder.addFuzzyKeysData(bbpBuilder);<a name="line.256"></a>
+<span class="sourceLineNo">257</span>    }<a name="line.257"></a>
+<span class="sourceLineNo">258</span>    return builder.build().toByteArray();<a name="line.258"></a>
+<span class="sourceLineNo">259</span>  }<a name="line.259"></a>
+<span class="sourceLineNo">260</span><a name="line.260"></a>
+<span class="sourceLineNo">261</span>  /**<a name="line.261"></a>
+<span class="sourceLineNo">262</span>   * @param pbBytes A pb serialized {@link FuzzyRowFilter} instance<a name="line.262"></a>
+<span class="sourceLineNo">263</span>   * @return An instance of {@link FuzzyRowFilter} made from &lt;code&gt;bytes&lt;/code&gt;<a name="line.263"></a>
+<span class="sourceLineNo">264</span>   * @throws DeserializationException<a name="line.264"></a>
+<span class="sourceLineNo">265</span>   * @see #toByteArray<a name="line.265"></a>
+<span class="sourceLineNo">266</span>   */<a name="line.266"></a>
+<span class="sourceLineNo">267</span>  public static FuzzyRowFilter parseFrom(final byte[] pbBytes) throws DeserializationException {<a name="line.267"></a>
+<span class="sourceLineNo">268</span>    FilterProtos.FuzzyRowFilter proto;<a name="line.268"></a>
+<span class="sourceLineNo">269</span>    try {<a name="line.269"></a>
+<span class="sourceLineNo">270</span>      proto = FilterProtos.FuzzyRowFilter.parseFrom(pbBytes);<a name="line.270"></a>
+<span class="sourceLineNo">271</span>    } catch (InvalidProtocolBufferException e) {<a name="line.271"></a>
+<span class="sourceLineNo">272</span>      throw new DeserializationException(e);<a name="line.272"></a>
+<span class="sourceLineNo">273</span>    }<a name="line.273"></a>
+<span class="sourceLineNo">274</span>    int count = proto.getFuzzyKeysDataCount();<a name="line.274"></a>
+<span class="sourceLineNo">275</span>    ArrayList&lt;Pair&lt;byte[], byte[]&gt;&gt; fuzzyKeysData = new ArrayList&lt;Pair&lt;byte[], byte[]&gt;&gt;(count);<a name="line.275"></a>
+<span class="sourceLineNo">276</span>    for (int i = 0; i &lt; count; ++i) {<a name="line.276"></a>
+<span class="sourceLineNo">277</span>      BytesBytesPair current = proto.getFuzzyKeysData(i);<a name="line.277"></a>
+<span class="sourceLineNo">278</span>      byte[] keyBytes = current.getFirst().toByteArray();<a name="line.278"></a>
+<span class="sourceLineNo">279</span>      byte[] keyMeta = current.getSecond().toByteArray();<a name="line.279"></a>
+<span class="sourceLineNo">280</span>      fuzzyKeysData.add(new Pair&lt;byte[], byte[]&gt;(keyBytes, keyMeta));<a name="line.280"></a>
+<span class="sourceLineNo">281</span>    }<a name="line.281"></a>
+<span class="sourceLineNo">282</span>    return new FuzzyRowFilter(fuzzyKeysData);<a name="line.282"></a>
+<span class="sourceLineNo">283</span>  }<a name="line.283"></a>
+<span class="sourceLineNo">284</span><a name="line.284"></a>
+<span class="sourceLineNo">285</span>  @Override<a name="line.285"></a>
+<span class="sourceLineNo">286</span>  public String toString() {<a name="line.286"></a>
+<span class="sourceLineNo">287</span>    final StringBuilder sb = new StringBuilder();<a name="line.287"></a>
+<span class="sourceLineNo">288</span>    sb.append("FuzzyRowFilter");<a name="line.288"></a>
+<span class="sourceLineNo">289</span>    sb.append("{fuzzyKeysData=");<a name="line.289"></a>
+<span class="sourceLineNo">290</span>    for (Pair&lt;byte[], byte[]&gt; fuzzyData : fuzzyKeysData) {<a name="line.290"></a>
+<span class="sourceLineNo">291</span>      sb.append('{').append(Bytes.toStringBinary(fuzzyData.getFirst())).append(":");<a name="line.291"></a>
+<span class="sourceLineNo">292</span>      sb.append(Bytes.toStringBinary(fuzzyData.getSecond())).append('}');<a name="line.292"></a>
+<span class="sourceLineNo">293</span>    }<a name="line.293"></a>
+<span class="sourceLineNo">294</span>    sb.append("}, ");<a name="line.294"></a>
+<span class="sourceLineNo">295</span>    return sb.toString();<a name="line.295"></a>
+<span class="sourceLineNo">296</span>  }<a name="line.296"></a>
 <span class="sourceLineNo">297</span><a name="line.297"></a>
-<span class="sourceLineNo">298</span>  static enum SatisfiesCode {<a name="line.298"></a>
-<span class="sourceLineNo">299</span>    /** row satisfies fuzzy rule */<a name="line.299"></a>
-<span class="sourceLineNo">300</span>    YES,<a name="line.300"></a>
-<span class="sourceLineNo">301</span>    /** row doesn't satisfy fuzzy rule, but there's possible greater row that does */<a name="line.301"></a>
-<span class="sourceLineNo">302</span>    NEXT_EXISTS,<a name="line.302"></a>
-<span class="sourceLineNo">303</span>    /** row doesn't satisfy fuzzy rule and there's no greater row that does */<a name="line.303"></a>
-<span class="sourceLineNo">304</span>    NO_NEXT<a name="line.304"></a>
-<span class="sourceLineNo">305</span>  }<a name="line.305"></a>
-<span class="sourceLineNo">306</span><a name="line.306"></a>
-<span class="sourceLineNo">307</span>  @VisibleForTesting<a name="line.307"></a>
-<span class="sourceLineNo">308</span>  static SatisfiesCode satisfies(byte[] row, byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.308"></a>
-<span class="sourceLineNo">309</span>    return satisfies(false, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.309"></a>
-<span class="sourceLineNo">310</span>  }<a name="line.310"></a>
-<span class="sourceLineNo">311</span><a name="line.311"></a>
-<span class="sourceLineNo">312</span>  @VisibleForTesting<a name="line.312"></a>
-<span class="sourceLineNo">313</span>  static SatisfiesCode satisfies(boolean reverse, byte[] row, byte[] fuzzyKeyBytes,<a name="line.313"></a>
-<span class="sourceLineNo">314</span>      byte[] fuzzyKeyMeta) {<a name="line.314"></a>
-<span class="sourceLineNo">315</span>    return satisfies(reverse, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<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>  static SatisfiesCode satisfies(boolean reverse, byte[] row, int offset, int length,<a name="line.318"></a>
-<span class="sourceLineNo">319</span>      byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.319"></a>
-<span class="sourceLineNo">320</span><a name="line.320"></a>
-<span class="sourceLineNo">321</span>    if (UnsafeAccess.unaligned() == false) {<a name="line.321"></a>
-<span class="sourceLineNo">322</span>      return satisfiesNoUnsafe(reverse, row, offset, length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.322"></a>
-<span class="sourceLineNo">323</span>    }<a name="line.323"></a>
-<span class="sourceLineNo">324</span><a name="line.324"></a>
-<span class="sourceLineNo">325</span>    if (row == null) {<a name="line.325"></a>
-<span class="sourceLineNo">326</span>      // do nothing, let scan to proceed<a name="line.326"></a>
-<span class="sourceLineNo">327</span>      return SatisfiesCode.YES;<a name="line.327"></a>
-<span class="sourceLineNo">328</span>    }<a name="line.328"></a>
-<span class="sourceLineNo">329</span>    length = Math.min(length, fuzzyKeyBytes.length);<a name="line.329"></a>
-<span class="sourceLineNo">330</span>    int numWords = length / Bytes.SIZEOF_LONG;<a name="line.330"></a>
-<span class="sourceLineNo">331</span><a name="line.331"></a>
-<span class="sourceLineNo">332</span>    int j = numWords &lt;&lt; 3; // numWords * SIZEOF_LONG;<a name="line.332"></a>
+<span class="sourceLineNo">298</span>  // Utility methods<a name="line.298"></a>
+<span class="sourceLineNo">299</span><a name="line.299"></a>
+<span class="sourceLineNo">300</span>  static enum SatisfiesCode {<a name="line.300"></a>
+<span class="sourceLineNo">301</span>    /** row satisfies fuzzy rule */<a name="line.301"></a>
+<span class="sourceLineNo">302</span>    YES,<a name="line.302"></a>
+<span class="sourceLineNo">303</span>    /** row doesn't satisfy fuzzy rule, but there's possible greater row that does */<a name="line.303"></a>
+<span class="sourceLineNo">304</span>    NEXT_EXISTS,<a name="line.304"></a>
+<span class="sourceLineNo">305</span>    /** row doesn't satisfy fuzzy rule and there's no greater row that does */<a name="line.305"></a>
+<span class="sourceLineNo">306</span>    NO_NEXT<a name="line.306"></a>
+<span class="sourceLineNo">307</span>  }<a name="line.307"></a>
+<span class="sourceLineNo">308</span><a name="line.308"></a>
+<span class="sourceLineNo">309</span>  @VisibleForTesting<a name="line.309"></a>
+<span class="sourceLineNo">310</span>  static SatisfiesCode satisfies(byte[] row, byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.310"></a>
+<span class="sourceLineNo">311</span>    return satisfies(false, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.311"></a>
+<span class="sourceLineNo">312</span>  }<a name="line.312"></a>
+<span class="sourceLineNo">313</span><a name="line.313"></a>
+<span class="sourceLineNo">314</span>  @VisibleForTesting<a name="line.314"></a>
+<span class="sourceLineNo">315</span>  static SatisfiesCode satisfies(boolean reverse, byte[] row, byte[] fuzzyKeyBytes,<a name="line.315"></a>
+<span class="sourceLineNo">316</span>      byte[] fuzzyKeyMeta) {<a name="line.316"></a>
+<span class="sourceLineNo">317</span>    return satisfies(reverse, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.317"></a>
+<span class="sourceLineNo">318</span>  }<a name="line.318"></a>
+<span class="sourceLineNo">319</span><a name="line.319"></a>
+<span class="sourceLineNo">320</span>  static SatisfiesCode satisfies(boolean reverse, byte[] row, int offset, int length,<a name="line.320"></a>
+<span class="sourceLineNo">321</span>      byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.321"></a>
+<span class="sourceLineNo">322</span><a name="line.322"></a>
+<span class="sourceLineNo">323</span>    if (!UNSAFE_UNALIGNED) {<a name="line.323"></a>
+<span class="sourceLineNo">324</span>      return satisfiesNoUnsafe(reverse, row, offset, length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.324"></a>
+<span class="sourceLineNo">325</span>    }<a name="line.325"></a>
+<span class="sourceLineNo">326</span><a name="line.326"></a>
+<span class="sourceLineNo">327</span>    if (row == null) {<a name="line.327"></a>
+<span class="sourceLineNo">328</span>      // do nothing, let scan to proceed<a name="line.328"></a>
+<span class="sourceLineNo">329</span>      return SatisfiesCode.YES;<a name="line.329"></a>
+<span class="sourceLineNo">330</span>    }<a name="line.330"></a>
+<span class="sourceLineNo">331</span>    length = Math.min(length, fuzzyKeyBytes.length);<a name="line.331"></a>
+<span class="sourceLineNo">332</span>    int numWords = length / Bytes.SIZEOF_LONG;<a name="line.332"></a>
 <span class="sourceLineNo">333</span><a name="line.333"></a>
-<span class="sourceLineNo">334</span>    for (int i = 0; i &lt; j; i += Bytes.SIZEOF_LONG) {<a name="line.334"></a>
-<span class="sourceLineNo">335</span>      long fuzzyBytes = UnsafeAccess.toLong(fuzzyKeyBytes, i);<a name="line.335"></a>
-<span class="sourceLineNo">336</span>      long fuzzyMeta = UnsafeAccess.toLong(fuzzyKeyMeta, i);<a name="line.336"></a>
-<span class="sourceLineNo">337</span>      long rowValue = UnsafeAccess.toLong(row, offset + i);<a name="line.337"></a>
-<span class="sourceLineNo">338</span>      if ((rowValue &amp; fuzzyMeta) != (fuzzyBytes)) {<a name="line.338"></a>
-<span class="sourceLineNo">339</span>        // We always return NEXT_EXISTS<a name="line.339"></a>
-<span class="sourceLineNo">340</span>        return SatisfiesCode.NEXT_EXISTS;<a name="line.340"></a>
-<span class="sourceLineNo">341</span>      }<a name="line.341"></a>
-<span class="sourceLineNo">342</span>    }<a name="line.342"></a>
-<span class="sourceLineNo">343</span><a name="line.343"></a>
-<span class="sourceLineNo">344</span>    int off = j;<a name="line.344"></a>
+<span class="sourceLineNo">334</span>    int j = numWords &lt;&lt; 3; // numWords * SIZEOF_LONG;<a name="line.334"></a>
+<span class="sourceLineNo">335</span><a name="line.335"></a>
+<span class="sourceLineNo">336</span>    for (int i = 0; i &lt; j; i += Bytes.SIZEOF_LONG) {<a name="line.336"></a>
+<span class="sourceLineNo">337</span>      long fuzzyBytes = UnsafeAccess.toLong(fuzzyKeyBytes, i);<a name="line.337"></a>
+<span class="sourceLineNo">338</span>      long fuzzyMeta = UnsafeAccess.toLong(fuzzyKeyMeta, i);<a name="line.338"></a>
+<span class="sourceLineNo">339</span>      long rowValue = UnsafeAccess.toLong(row, offset + i);<a name="line.339"></a>
+<span class="sourceLineNo">340</span>      if ((rowValue &amp; fuzzyMeta) != (fuzzyBytes)) {<a name="line.340"></a>
+<span class="sourceLineNo">341</span>        // We always return NEXT_EXISTS<a name="line.341"></a>
+<span class="sourceLineNo">342</span>        return SatisfiesCode.NEXT_EXISTS;<a name="line.342"></a>
+<span class="sourceLineNo">343</span>      }<a name="line.343"></a>
+<span class="sourceLineNo">344</span>    }<a name="line.344"></a>
 <span class="sourceLineNo">345</span><a name="line.345"></a>
-<span class="sourceLineNo">346</span>    if (length - off &gt;= Bytes.SIZEOF_INT) {<a name="line.346"></a>
-<span class="sourceLineNo">347</span>      int fuzzyBytes = UnsafeAccess.toInt(fuzzyKeyBytes, off);<a name="line.347"></a>
-<span class="sourceLineNo">348</span>      int fuzzyMeta = UnsafeAccess.toInt(fuzzyKeyMeta, off);<a name="line.348"></a>
-<span class="sourceLineNo">349</span>      int rowValue = UnsafeAccess.toInt(row, offset + off);<a name="line.349"></a>
-<span class="sourceLineNo">350</span>      if ((rowValue &amp; fuzzyMeta) != (fuzzyBytes)) {<a name="line.350"></a>
-<span class="sourceLineNo">351</span>        // We always return NEXT_EXISTS<a name="line.351"></a>
-<span class="sourceLineNo">352</span>        return SatisfiesCode.NEXT_EXISTS;<a name="line.352"></a>
-<span class="sourceLineNo">353</span>      }<a name="line.353"></a>
-<span class="sourceLineNo">354</span>      off += Bytes.SIZEOF_INT;<a name="line.354"></a>
-<span class="sourceLineNo">355</span>    }<a name="line.355"></a>
-<span class="sourceLineNo">356</span><a name="line.356"></a>
-<span class="sourceLineNo">357</span>    if (length - off &gt;= Bytes.SIZEOF_SHORT) {<a name="line.357"></a>
-<span class="sourceLineNo">358</span>      short fuzzyBytes = UnsafeAccess.toShort(fuzzyKeyBytes, off);<a name="line.358"></a>
-<span class="sourceLineNo">359</span>      short fuzzyMeta = UnsafeAccess.toShort(fuzzyKeyMeta, off);<a name="line.359"></a>
-<span class="sourceLineNo">360</span>      short rowValue = UnsafeAccess.toShort(row, offset + off);<a name="line.360"></a>
-<span class="sourceLineNo">361</span>      if ((rowValue &amp; fuzzyMeta) != (fuzzyBytes)) {<a name="line.361"></a>
-<span class="sourceLineNo">362</span>        // We always return NEXT_EXISTS<a name="line.362"></a>
-<span class="sourceLineNo">363</span>        // even if it does not (in this case getNextForFuzzyRule<a name="line.363"></a>
-<span class="sourceLineNo">364</span>        // will return null)<a name="line.364"></a>
-<span class="sourceLineNo">365</span>        return SatisfiesCode.NEXT_EXISTS;<a name="line.365"></a>
-<span class="sourceLineNo">366</span>      }<a name="line.366"></a>
-<span class="sourceLineNo">367</span>      off += Bytes.SIZEOF_SHORT;<a name="line.367"></a>
-<span class="sourceLineNo">368</span>    }<a name="line.368"></a>
-<span class="sourceLineNo">369</span><a name="line.369"></a>
-<span class="sourceLineNo">370</span>    if (length - off &gt;= Bytes.SIZEOF_BYTE) {<a name="line.370"></a>
-<span class="sourceLineNo">371</span>      int fuzzyBytes = fuzzyKeyBytes[off] &amp; 0xff;<a name="line.371"></a>
-<span class="sourceLineNo">372</span>      int fuzzyMeta = fuzzyKeyMeta[off] &amp; 0xff;<a name="line.372"></a>
-<span class="sourceLineNo">373</span>      int rowValue = row[offset + off] &amp; 0xff;<a name="line.373"></a>
-<span class="sourceLineNo">374</span>      if ((rowValue &amp; fuzzyMeta) != (fuzzyBytes)) {<a name="line.374"></a>
-<span class="sourceLineNo">375</span>        // We always return NEXT_EXISTS<a name="line.375"></a>
-<span class="sourceLineNo">376</span>        return SatisfiesCode.NEXT_EXISTS;<a name="line.376"></a>
-<span class="sourceLineNo">377</span>      }<a name="line.377"></a>
-<span class="sourceLineNo">378</span>    }<a name="line.378"></a>
-<span class="sourceLineNo">379</span>    return SatisfiesCode.YES;<a name="line.379"></a>
-<span class="sourceLineNo">380</span>  }<a name="line.380"></a>
-<span class="sourceLineNo">381</span><a name="line.381"></a>
-<span class="sourceLineNo">382</span>  static SatisfiesCode satisfiesNoUnsafe(boolean reverse, byte[] row, int offset, int length,<a name="line.382"></a>
-<span class="sourceLineNo">383</span>      byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.383"></a>
-<span class="sourceLineNo">384</span>    if (row == null) {<a name="line.384"></a>
-<span class="sourceLineNo">385</span>      // do nothing, let scan to proceed<a name="line.385"></a>
-<span class="sourceLineNo">386</span>      return SatisfiesCode.YES;<a name="line.386"></a>
-<span class="sourceLineNo">387</span>    }<a name="line.387"></a>
-<span class="sourceLineNo">388</span><a name="line.388"></a>
-<span class="sourceLineNo">389</span>    Order order = Order.orderFor(reverse);<a name="line.389"></a>
-<span class="sourceLineNo">390</span>    boolean nextRowKeyCandidateExists = false;<a name="line.390"></a>
-<span class="sourceLineNo">391</span><a name="line.391"></a>
-<span class="sourceLineNo">392</span>    for (int i = 0; i &lt; fuzzyKeyMeta.length &amp;&amp; i &lt; length; i++) {<a name="line.392"></a>
-<span class="sourceLineNo">393</span>      // First, checking if this position is fixed and not equals the given one<a name="line.393"></a>
-<span class="sourceLineNo">394</span>      boolean byteAtPositionFixed = fuzzyKeyMeta[i] == 0;<a name="line.394"></a>
-<span class="sourceLineNo">395</span>      boolean fixedByteIncorrect = byteAtPositionFixed &amp;&amp; fuzzyKeyBytes[i] != row[i + offset];<a name="line.395"></a>
-<span class="sourceLineNo">396</span>      if (fixedByteIncorrect) {<a name="line.396"></a>
-<span class="sourceLineNo">397</span>        // in this case there's another row that satisfies fuzzy rule and bigger than this row<a name="line.397"></a>
-<span class="sourceLineNo">398</span>        if (nextRowKeyCandidateExists) {<a name="line.398"></a>
-<span class="sourceLineNo">399</span>          return SatisfiesCode.NEXT_EXISTS;<a name="line.399"></a>
-<span class="sourceLineNo">400</span>        }<a name="line.400"></a>
-<span class="sourceLineNo">401</span><a name="line.401"></a>
-<span class="sourceLineNo">402</span>        // If this row byte is less than fixed then there's a byte array bigger than<a name="line.402"></a>
-<span class="sourceLineNo">403</span>        // this row and which satisfies the fuzzy rule. Otherwise there's no such byte array:<a name="line.403"></a>
-<span class="sourceLineNo">404</span>        // this row is simply bigger than any byte array that satisfies the fuzzy rule<a name="line.404"></a>
-<span class="sourceLineNo">405</span>        boolean rowByteLessThanFixed = (row[i + offset] &amp; 0xFF) &lt; (fuzzyKeyBytes[i] &amp; 0xFF);<a name="line.405"></a>
-<span class="sourceLineNo">406</span>        if (rowByteLessThanFixed &amp;&amp; !reverse) {<a name="line.406"></a>
-<span class="sourceLineNo">407</span>          return SatisfiesCode.NEXT_EXISTS;<a name="line.407"></a>
-<span class="sourceLineNo">408</span>        } else if (!rowByteLessThanFixed &amp;&amp; reverse) {<a name="line.408"></a>
+<span class="sourceLineNo">346</span>    int off = j;<a name="line.346"></a>
+<span class="sourceLineNo">347</span><a name="line.347"></a>
+<span class="sourceLineNo">348</span>    if (length - off &gt;= Bytes.SIZEOF_INT) {<a name="line.348"></a>
+<span class="sourceLineNo">349</span>      int fuzzyBytes = UnsafeAccess.toInt(fuzzyKeyBytes, off);<a name="line.349"></a>
+<span class="sourceLineNo">350</span>      int fuzzyMeta = UnsafeAccess.toInt(fuzzyKeyMeta, off);<a name="line.350"></a>
+<span class="sourceLineNo">351</span>      int rowValue = UnsafeAccess.toInt(row, offset + off);<a name="line.351"></a>
+<span class="sourceLineNo">352</span>      if ((rowValue &amp; fuzzyMeta) != (fuzzyBytes)) {<a name="line.352"></a>
+<span class="sourceLineNo">353</span>        // We always return NEXT_EXISTS<a name="line.353"></a>
+<span class="sourceLineNo">354</span>        return SatisfiesCode.NEXT_EXISTS;<a name="line.354"></a>
+<span class="sourceLineNo">355</span>      }<a name="line.355"></a>
+<span class="sourceLineNo">356</span>      off += Bytes.SIZEOF_INT;<a name="line.356"></a>
+<span class="sourceLineNo">357</span>    }<a name="line.357"></a>
+<span class="sourceLineNo">358</span><a name="line.358"></a>
+<span class="sourceLineNo">359</span>    if (length - off &gt;= Bytes.SIZEOF_SHORT) {<a name="line.359"></a>
+<span class="sourceLineNo">360</span>      short fuzzyBytes = UnsafeAccess.toShort(fuzzyKeyBytes, off);<a name="line.360"></a>
+<span class="sourceLineNo">361</span>      short fuzzyMeta = UnsafeAccess.toShort(fuzzyKeyMeta, off);<a name="line.361"></a>
+<span class="sourceLineNo">362</span>      short rowValue = UnsafeAccess.toShort(row, offset + off);<a name="line.362"></a>
+<span class="sourceLineNo">363</span>      if ((rowValue &amp; fuzzyMeta) != (fuzzyBytes)) {<a name="line.363"></a>
+<span class="sourceLineNo">364</span>        // We always return NEXT_EXISTS<a name="line.364"></a>
+<span class="sourceLineNo">365</span>        // even if it does not (in this case getNextForFuzzyRule<a name="line.365"></a>
+<span class="sourceLineNo">366</span>        // will return null)<a name="line.366"></a>
+<span class="sourceLineNo">367</span>        return SatisfiesCode.NEXT_EXISTS;<a name="line.367"></a>
+<span class="sourceLineNo">368</span>      }<a name="line.368"></a>
+<span class="sourceLineNo">369</span>      off += Bytes.SIZEOF_SHORT;<a name="line.369"></a>
+<span class="sourceLineNo">370</span>    }<a name="line.370"></a>
+<span class="sourceLineNo">371</span><a name="line.371"></a>
+<span class="sourceLineNo">372</span>    if (length - off &gt;= Bytes.SIZEOF_BYTE) {<a name="line.372"></a>
+<span class="sourceLineNo">373</span>      int fuzzyBytes = fuzzyKeyBytes[off] &amp; 0xff;<a name="line.373"></a>
+<span class="sourceLineNo">374</span>      int fuzzyMeta = fuzzyKeyMeta[off] &amp; 0xff;<a name="line.374"></a>
+<span class="sourceLineNo">375</span>      int rowValue = row[offset + off] &amp; 0xff;<a name="line.375"></a>
+<span class="sourceLineNo">376</span>      if ((rowValue &amp; fuzzyMeta) != (fuzzyBytes)) {<a name="line.376"></a>
+<span class="sourceLineNo">377</span>        // We always return NEXT_EXISTS<a name="line.377"></a>
+<span class="sourceLineNo">378</span>        return SatisfiesCode.NEXT_EXISTS;<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>    return SatisfiesCode.YES;<a name="line.381"></a>
+<span class="sourceLineNo">382</span>  }<a name="line.382"></a>
+<span class="sourceLineNo">383</span><a name="line.383"></a>
+<span class="sourceLineNo">384</span>  static SatisfiesCode satisfiesNoUnsafe(boolean reverse, byte[] row, int offset, int length,<a name="line.384"></a>
+<span class="sourceLineNo">385</span>      byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.385"></a>
+<span class="sourceLineNo">386</span>    if (row == null) {<a name="line.386"></a>
+<span class="sourceLineNo">387</span>      // do nothing, let scan to proceed<a name="line.387"></a>
+<span class="sourceLineNo">388</span>      return SatisfiesCode.YES;<a name="line.388"></a>
+<span class="sourceLineNo">389</span>    }<a name="line.389"></a>
+<span class="sourceLineNo">390</span><a name="line.390"></a>
+<span class="sourceLineNo">391</span>    Order order = Order.orderFor(reverse);<a name="line.391"></a>
+<span class="sourceLineNo">392</span>    boolean nextRowKeyCandidateExists = false;<a name="line.392"></a>
+<span class="sourceLineNo">393</span><a name="line.393"></a>
+<span class="sourceLineNo">394</span>    for (int i = 0; i &lt; fuzzyKeyMeta.length &amp;&amp; i &lt; length; i++) {<a name="line.394"></a>
+<span class="sourceLineNo">395</span>      // First, checking if this position is fixed and not equals the given one<a name="line.395"></a>
+<span class="sourceLineNo">396</span>      boolean byteAtPositionFixed = fuzzyKeyMeta[i] == 0;<a name="line.396"></a>
+<span class="sourceLineNo">397</span>      boolean fixedByteIncorrect = byteAtPositionFixed &amp;&amp; fuzzyKeyBytes[i] != row[i + offset];<a name="line.397"></a>
+<span class="sourceLineNo">398</span>      if (fixedByteIncorrect) {<a name="line.398"></a>
+<span class="sourceLineNo">399</span>        // in this case there's another row that satisfies fuzzy rule and bigger than this row<a name="line.399"></a>
+<span class="sourceLineNo">400</span>        if (nextRowKeyCandidateExists) {<a name="line.400"></a>
+<span class="sourceLineNo">401</span>          return SatisfiesCode.NEXT_EXISTS;<a name="line.401"></a>
+<span class="sourceLineNo">402</span>        }<a name="line.402"></a>
+<span class="sourceLineNo">403</span><a name="line.403"></a>
+<span class="sourceLineNo">404</span>        // If this row byte is less than fixed then there's a byte array bigger than<a name="line.404"></a>
+<span class="sourceLineNo">405</span>        // this row and which satisfies the fuzzy rule. Otherwise there's no such byte array:<a name="line.405"></a>
+<span class="sourceLineNo">406</span>        // this row is simply bigger than any byte array that satisfies the fuzzy rule<a name="line.406"></a>
+<span class="sourceLineNo">407</span>        boolean rowByteLessThanFixed = (row[i + offset] &amp; 0xFF) &lt; (fuzzyKeyBytes[i] &amp; 0xFF);<a name="line.407"></a>
+<span class="sourceLineNo">408</span>        if (rowByteLessThanFixed &amp;&amp; !reverse) {<a name="line.408"></a>
 <span class="sourceLineNo">409</span>          return SatisfiesCode.NEXT_EXISTS;<a name="line.409"></a>
-<span class="sourceLineNo">410</span>        } else {<a name="line.410"></a>
-<span class="sourceLineNo">411</span>          return SatisfiesCode.NO_NEXT;<a name="line.411"></a>
-<span class="sourceLineNo">412</span>        }<a name="line.412"></a>
-<span class="sourceLineNo">413</span>      }<a name="line.413"></a>
-<span class="sourceLineNo">414</span><a name="line.414"></a>
-<span class="sourceLineNo">415</span>      // Second, checking if this position is not fixed and byte value is not the biggest. In this<a name="line.415"></a>
-<span class="sourceLineNo">416</span>      // case there's a byte array bigger than this row and which satisfies the fuzzy rule. To get<a name="line.416"></a>
-<span class="sourceLineNo">417</span>      // bigger byte array that satisfies the rule we need to just increase this byte<a name="line.417"></a>
-<span class="sourceLineNo">418</span>      // (see the code of getNextForFuzzyRule below) by one.<a name="line.418"></a>
-<span class="sourceLineNo">419</span>      // Note: if non-fixed byte is already at biggest value, this doesn't allow us to say there's<a name="line.419"></a>
-<span class="sourceLineNo">420</span>      // bigger one that satisfies the rule as it can't be increased.<a name="line.420"></a>
-<span class="sourceLineNo">421</span>      if (fuzzyKeyMeta[i] == 1 &amp;&amp; !order.isMax(fuzzyKeyBytes[i])) {<a name="line.421"></a>
-<span class="sourceLineNo">422</span>        nextRowKeyCandidateExists = true;<a name="line.422"></a>
-<span class="sourceLineNo">423</span>      }<a name="line.423"></a>
-<span class="sourceLineNo">424</span>    }<a name="line.424"></a>
-<span class="sourceLineNo">425</span>    return SatisfiesCode.YES;<a name="line.425"></a>
-<span class="sourceLineNo">426</span>  }<a name="line.426"></a>
-<span class="sourceLineNo">427</span><a name="line.427"></a>
-<span class="sourceLineNo">428</span>  @VisibleForTesting<a name="line.428"></a>
-<span class="sourceLineNo">429</span>  static byte[] getNextForFuzzyRule(byte[] row, byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.429"></a>
-<span class="sourceLineNo">430</span>    return getNextForFuzzyRule(false, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<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>  @VisibleForTesting<a name="line.433"></a>
-<span class="sourceLineNo">434</span>  static byte[] getNextForFuzzyRule(boolean reverse, byte[] row, byte[] fuzzyKeyBytes,<a name="line.434"></a>
-<span class="sourceLineNo">435</span>      byte[] fuzzyKeyMeta) {<a name="line.435"></a>
-<span class="sourceLineNo">436</span>    return getNextForFuzzyRule(reverse, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.436"></a>
-<span class="sourceLineNo">437</span>  }<a name="line.437"></a>
-<span class="sourceLineNo">438</span><a name="line.438"></a>
-<span class="sourceLineNo">439</span>  /** Abstracts directional comparisons based on scan direction. */<a name="line.439"></a>
-<span class="sourceLineNo">440</span>  private enum Order {<a name="line.440"></a>
-<span class="sourceLineNo">441</span>    ASC {<a name="line.441"></a>
-<span class="sourceLineNo">442</span>      public boolean lt(int lhs, int rhs) {<a name="line.442"></a>
-<span class="sourceLineNo">443</span>        return lhs &lt; rhs;<a name="line.443"></a>
-<span class="sourceLineNo">444</span>      }<a name="line.444"></a>
-<span class="sourceLineNo">445</span><a name="line.445"></a>
-<span class="sourceLineNo">446</span>      public boolean gt(int lhs, int rhs) {<a name="line.446"></a>
-<span class="sourceLineNo">447</span>        return lhs &gt; rhs;<a name="line.447"></a>
-<span class="sourceLineNo">448</span>      }<a name="line.448"></a>
-<span class="sourceLineNo">449</span><a name="line.449"></a>
-<span class="sourceLineNo">450</span>      public byte inc(byte val) {<a name="line.450"></a>
-<span class="sourceLineNo">451</span>        // TODO: what about over/underflow?<a name="line.451"></a>
-<span class="sourceLineNo">452</span>        return (byte) (val + 1);<a name="line.452"></a>
-<span class="sourceLineNo">453</span>      }<a name="line.453"></a>
-<span class="sourceLineNo">454</span><a name="line.454"></a>
-<span class="sourceLineNo">455</span>      public boolean isMax(byte val) {<a name="line.455"></a>
-<span class="sourceLineNo">456</span>        return val == (byte) 0xff;<a name="line.456"></a>
-<span class="sourceLineNo">457</span>      }<a name="line.457"></a>
-<span class="sourceLineNo">458</span><a name="line.458"></a>
-<span class="sourceLineNo">459</span>      public byte min() {<a name="line.459"></a>
-<span class="sourceLineNo">460</span>        return 0;<a name="line.460"></a>
-<span class="sourceLineNo">461</span>      }<a name="line.461"></a>
-<span class="sourceLineNo">462</span>    },<a name="line.462"></a>
-<span class="sourceLineNo">463</span>    DESC {<a name="line.463"></a>
-<span class="sourceLineNo">464</span>      public boolean lt(int lhs, int rhs) {<a name="line.464"></a>
-<span class="sourceLineNo">465</span>        return lhs &gt; rhs;<a name="line.465"></a>
-<span class="sourceLineNo">466</span>      }<a name="line.466"></a>
-<span class="sourceLineNo">467</span><a name="line.467"></a>
-<span class="sourceLineNo">468</span>      public boolean gt(int lhs, int rhs) {<a name="line.468"></a>
-<span class="sourceLineNo">469</span>        return lhs &lt; rhs;<a name="line.469"></a>
-<span class="sourceLineNo">470</span>      }<a name="line.470"></a>
-<span class="sourceLineNo">471</span><a name="line.471"></a>
-<span class="sourceLineNo">472</span>      public byte inc(byte val) {<a name="line.472"></a>
-<span class="sourceLineNo">473</span>        // TODO: what about over/underflow?<a name="line.473"></a>
-<span class="sourceLineNo">474</span>        return (byte) (val - 1);<a name="line.474"></a>
-<span class="sourceLineNo">475</span>      }<a name="line.475"></a>
-<span class="sourceLineNo">476</span><a name="line.476"></a>
-<span class="sourceLineNo">477</span>      public boolean isMax(byte val) {<a name="line.477"></a>
-<span class="sourceLineNo">478</span>        return val == 0;<a name="line.478"></a>
-<span class="sourceLineNo">479</span>      }<a name="line.479"></a>
-<span class="sourceLineNo">480</span><a name="line.480"></a>
-<span class="sourceLineNo">481</span>      public byte min() {<a name="line.481"></a>
-<span class="sourceLineNo">482</span>        return (byte) 0xFF;<a name="line.482"></a>
-<span class="sourceLineNo">483</span>      }<a name="line.483"></a>
-<span class="sourceLineNo">484</span>    };<a name="line.484"></a>
-<span class="sourceLineNo">485</span><a name="line.485"></a>
-<span class="sourceLineNo">486</span>    public static Order orderFor(boolean reverse) {<a name="line.486"></a>
-<span class="sourceLineNo">487</span>      return reverse ? DESC : ASC;<a name="line.487"></a>
-<span class="sourceLineNo">488</span>    }<a name="line.488"></a>
-<span class="sourceLineNo">489</span><a name="line.489"></a>
-<span class="sourceLineNo">490</span>    /** Returns true when {@code lhs &lt; rhs}. */<a name="line.490"></a>
-<span class="sourceLineNo">491</span>    public abstract boolean lt(int lhs, int rhs);<a name="line.491"></a>
-<span class="sourceLineNo">492</span><a name="line.492"></a>
-<span class="sourceLineNo">493</span>    /** Returns true when {@code lhs &gt; rhs}. */<a name="line.493"></a>
-<span class="sourceLineNo">494</span>    public abstract boolean gt(int lhs, int rhs);<a name="line.494"></a>
-<span class="sourceLineNo">495</span><a name="line.495"></a>
-<span class="sourceLineNo">496</span>    /** Returns {@code val} incremented by 1. */<a name="line.496"></a>
-<span class="sourceLineNo">497</span>    public abstract byte inc(byte val);<a name="line.497"></a>
-<span class="sourceLineNo">498</span><a name="line.498"></a>
-<span class="sourceLineNo">499</span>    /** Return true when {@code val} is the maximum value */<a name="line.499"></a>
-<span class="sourceLineNo">500</span>    public abstract boolean isMax(byte val);<a name="line.500"></a>
-<span class="sourceLineNo">501</span><a name="line.501"></a>
-<span class="sourceLineNo">502</span>    /** Return the minimum value according to this ordering scheme. */<a name="line.502"></a>
-<span class="sourceLineNo">503</span>    public abstract byte min();<a name="line.503"></a>
-<span class="sourceLineNo">504</span>  }<a name="line.504"></a>
-<span class="sourceLineNo">505</span><a name="line.505"></a>
-<span class="sourceLineNo">506</span>  /**<a name="line.506"></a>
-<span class="sourceLineNo">507</span>   * @return greater byte array than given (row) which satisfies the fuzzy rule if it exists, null<a name="line.507"></a>
-<span class="sourceLineNo">508</span>   *         otherwise<a name="line.508"></a>
-<span class="sourceLineNo">509</span>   */<a name="line.509"></a>
-<span class="sourceLineNo">510</span>  @VisibleForTesting<a name="line.510"></a>
-<span class="sourceLineNo">511</span>  static byte[] getNextForFuzzyRule(boolean reverse, byte[] row, int offset, int length,<a name="line.511"></a>
-<span class="sourceLineNo">512</span>      byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.512"></a>
-<span class="sourceLineNo">513</span>    // To find out the next "smallest" byte array that satisfies fuzzy rule and "greater" than<a name="line.513"></a>
-<span class="sourceLineNo">514</span>    // the given one we do the following:<a name="line.514"></a>
-<span class="sourceLineNo">515</span>    // 1. setting values on all "fixed" positions to the values from fuzzyKeyBytes<a name="line.515"></a>
-<span class="sourceLineNo">516</span>    // 2. if during the first step given row did not increase, then we increase the value at<a name="line.516"></a>
-<span class="sourceLineNo">517</span>    // the first "non-fixed" position (where it is not maximum already)<a name="line.517"></a>
-<span class="sourceLineNo">518</span><a name="line.518"></a>
-<span class="sourceLineNo">519</span>    // It is easier to perform this by using fuzzyKeyBytes copy and setting "non-fixed" position<a name="line.519"></a>
-<span class="sourceLineNo">520</span>    // values than otherwise.<a name="line.520"></a>
-<span class="sourceLineNo">521</span>    byte[] result =<a name="line.521"></a>
-<span class="sourceLineNo">522</span>        Arrays.copyOf(fuzzyKeyBytes, length &gt; fuzzyKeyBytes.length ? length : fuzzyKeyBytes.length);<a name="line.522"></a>
-<span class="sourceLineNo">523</span>    if (reverse &amp;&amp; length &gt; fuzzyKeyBytes.length) {<a name="line.523"></a>
-<span class="sourceLineNo">524</span>      // we need trailing 0xff's instead of trailing 0x00's<a name="line.524"></a>
-<span class="sourceLineNo">525</span>      for (int i = fuzzyKeyBytes.length; i &lt; result.length; i++) {<a name="line.525"></a>
-<span class="sourceLineNo">526</span>        result[i] = (byte) 0xFF;<a name="line.526"></a>
-<span class="sourceLineNo">527</span>      }<a name="line.527"></a>
-<span class="sourceLineNo">528</span>    }<a name="line.528"></a>
-<span class="sourceLineNo">529</span>    int toInc = -1;<a name="line.529"></a>
-<span class="sourceLineNo">530</span>    final Order order = Order.orderFor(reverse);<a name="line.530"></a>
-<span class="sourceLineNo">531</span><a name="line.531"></a>
-<span class="sourceLineNo">532</span>    boolean increased = false;<a name="line.532"></a>
-<span class="sourceLineNo">533</span>    for (int i = 0; i &lt; result.length; i++) {<a name="line.533"></a>
-<span class="sourceLineNo">534</span>      if (i &gt;= fuzzyKeyMeta.length || fuzzyKeyMeta[i] == 0 /* non-fixed */) {<a name="line.534"></a>
-<span class="sourceLineNo">535</span>        result[i] = row[offset + i];<a name="line.535"></a>
-<span class="sourceLineNo">536</span>        if (!order.isMax(row[offset + i])) {<a name="line.536"></a>
-<span class="sourceLineNo">537</span>          // this is "non-fixed" position and is not at max value, hence we can increase it<a name="line.537"></a>
-<span class="sourceLineNo">538</span>          toInc = i;<a name="line.538"></a>
-<span class="sourceLineNo">539</span>        }<a name="line.539"></a>
-<span class="sourceLineNo">540</span>      } else if (i &lt; fuzzyKeyMeta.length &amp;&amp; fuzzyKeyMeta[i] == -1 /* fixed */) {<a name="line.540"></a>
-<span class="sourceLineNo">541</span>        if (order.lt((row[i + offset] &amp; 0xFF), (fuzzyKeyBytes[i] &amp; 0xFF))) {<a name="line.541"></a>
-<span class="sourceLineNo">542</span>          // if setting value for any fixed position increased the original array,<a name="line.542"></a>
-<span class="sourceLineNo">543</span>          // we are OK<a name="line.543"></a>
-<span class="sourceLineNo">544</span>          increased = true;<a name="line.544"></a>
-<span class="sourceLineNo">545</span>          break;<a name="line.545"></a>
-<span class="sourceLineNo">546</span>        }<a name="line.546"></a>
-<span class="sourceLineNo">547</span><a name="line.547"></a>
-<span class="sourceLineNo">548</span>        if (order.gt((row[i + offset] &amp; 0xFF), (fuzzyKeyBytes[i] &amp; 0xFF))) {<a name="line.548"></a>
-<span class="sourceLineNo">549</span>          // if setting value for any fixed position makes array "smaller", then just stop:<a name="line.549"></a>
-<span class="sourceLineNo">550</span>          // in case we found some non-fixed position to increase we will do it, otherwise<a name="line.550"></a>
-<span class="sourceLineNo">551</span>          // there's no "next" row key that satisfies fuzzy rule and "greater" than given row<a name="line.551"></a>
-<span class="sourceLineNo">552</span>          break;<a name="line.552"></a>
-<span class="sourceLineNo">553</span>        }<a name="line.553"></a>
-<span class="sourceLineNo">554</span>      }<a name="line.554"></a>
-<span class="sourceLineNo">555</span>    }<a name="line.555"></a>
-<span class="sourceLineNo">556</span><a name="line.556"></a>
-<span class="sourceLineNo">557</span>    if (!increased) {<a name="line.557"></a>
-<span class="sourceLineNo">558</span>      if (toInc &lt; 0) {<a name="line.558"></a>
-<span class="sourceLineNo">559</span>        return null;<a name="line.559"></a>
-<span class="sourceLineNo">560</span>      }<a name="line.560"></a>
-<span class="sourceLineNo">561</span>      result[toInc] = order.inc(result[toInc]);<a name="line.561"></a>
-<span class="sourceLineNo">562</span><a name="line.562"></a>
-<span class="sourceLineNo">563</span>      // Setting all "non-fixed" positions to zeroes to the right of the one we increased so<a name="line.563"></a>
-<span class="sourceLineNo">564</span>      // that found "next" row key is the smallest possible<a name="line.564"></a>
-<span class="sourceLineNo">565</span>      for (int i = toInc + 1; i &lt; result.length; i++) {<a name="line.565"></a>
-<span class="s

<TRUNCATED>

Mime
View raw message