http://git-wip-us.apache.org/repos/asf/hbase-site/blob/2cef721c/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 aa5ad0d..30d80c0 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 @@ -32,619 +32,617 @@ <span class="sourceLineNo">024</span>import java.util.PriorityQueue;<a name="line.24"></a> <span class="sourceLineNo">025</span><a name="line.25"></a> <span class="sourceLineNo">026</span>import org.apache.hadoop.hbase.Cell;<a name="line.26"></a> -<span class="sourceLineNo">027</span>import org.apache.hadoop.hbase.CellComparatorImpl;<a name="line.27"></a> -<span class="sourceLineNo">028</span>import org.apache.hadoop.hbase.CellUtil;<a name="line.28"></a> -<span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.PrivateCellUtil;<a name="line.29"></a> -<span class="sourceLineNo">030</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.30"></a> -<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.exceptions.DeserializationException;<a name="line.31"></a> -<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.shaded.com.google.protobuf.InvalidProtocolBufferException;<a name="line.32"></a> -<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.shaded.com.google.protobuf.UnsafeByteOperations;<a name="line.33"></a> -<span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.FilterProtos;<a name="line.34"></a> -<span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.HBaseProtos.BytesBytesPair;<a name="line.35"></a> -<span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.36"></a> -<span class="sourceLineNo">037</span>import org.apache.hadoop.hbase.util.Pair;<a name="line.37"></a> -<span class="sourceLineNo">038</span>import org.apache.hadoop.hbase.util.UnsafeAccess;<a name="line.38"></a> -<span class="sourceLineNo">039</span>import org.apache.hadoop.hbase.util.UnsafeAvailChecker;<a name="line.39"></a> -<span class="sourceLineNo">040</span><a name="line.40"></a> -<span class="sourceLineNo">041</span>import org.apache.hadoop.hbase.shaded.com.google.common.annotations.VisibleForTesting;<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> * <ul><a name="line.47"></a> -<span class="sourceLineNo">048</span> * <li>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</li><a name="line.49"></a> -<span class="sourceLineNo">050</span> * <li>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</li><a name="line.51"></a> -<span class="sourceLineNo">052</span> * </ul><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>public class FuzzyRowFilter extends FilterBase {<a name="line.62"></a> -<span class="sourceLineNo">063</span> private static final boolean UNSAFE_UNALIGNED = UnsafeAvailChecker.unaligned();<a name="line.63"></a> -<span class="sourceLineNo">064</span> private List<Pair<byte[], byte[]>> fuzzyKeysData;<a name="line.64"></a> -<span class="sourceLineNo">065</span> private boolean done = false;<a name="line.65"></a> -<span class="sourceLineNo">066</span><a name="line.66"></a> -<span class="sourceLineNo">067</span> /**<a name="line.67"></a> -<span class="sourceLineNo">068</span> * The index of a last successfully found matching fuzzy string (in fuzzyKeysData). We will start<a name="line.68"></a> -<span class="sourceLineNo">069</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.69"></a> -<span class="sourceLineNo">070</span> * iteration over fuzzyKeysData.<a name="line.70"></a> -<span class="sourceLineNo">071</span> */<a name="line.71"></a> -<span class="sourceLineNo">072</span> private int lastFoundIndex = -1;<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> * Row tracker (keeps all next rows after SEEK_NEXT_USING_HINT was returned)<a name="line.75"></a> -<span class="sourceLineNo">076</span> */<a name="line.76"></a> -<span class="sourceLineNo">077</span> private RowTracker tracker;<a name="line.77"></a> -<span class="sourceLineNo">078</span><a name="line.78"></a> -<span class="sourceLineNo">079</span> public FuzzyRowFilter(List<Pair<byte[], byte[]>> fuzzyKeysData) {<a name="line.79"></a> -<span class="sourceLineNo">080</span> List<Pair<byte[], byte[]>> fuzzyKeyDataCopy = new ArrayList<>(fuzzyKeysData.size());<a name="line.80"></a> -<span class="sourceLineNo">081</span><a name="line.81"></a> -<span class="sourceLineNo">082</span> for (Pair<byte[], byte[]> aFuzzyKeysData : fuzzyKeysData) {<a name="line.82"></a> -<span class="sourceLineNo">083</span> if (aFuzzyKeysData.getFirst().length != aFuzzyKeysData.getSecond().length) {<a name="line.83"></a> -<span class="sourceLineNo">084</span> Pair<String, String> readable =<a name="line.84"></a> -<span class="sourceLineNo">085</span> new Pair<>(Bytes.toStringBinary(aFuzzyKeysData.getFirst()), Bytes.toStringBinary(aFuzzyKeysData.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><a name="line.88"></a> -<span class="sourceLineNo">089</span> Pair<byte[], byte[]> p = new Pair<>();<a name="line.89"></a> -<span class="sourceLineNo">090</span> // create a copy of pair bytes so that they are not modified by the filter.<a name="line.90"></a> -<span class="sourceLineNo">091</span> p.setFirst(Arrays.copyOf(aFuzzyKeysData.getFirst(), aFuzzyKeysData.getFirst().length));<a name="line.91"></a> -<span class="sourceLineNo">092</span> p.setSecond(Arrays.copyOf(aFuzzyKeysData.getSecond(), aFuzzyKeysData.getSecond().length));<a name="line.92"></a> -<span class="sourceLineNo">093</span><a name="line.93"></a> -<span class="sourceLineNo">094</span> // update mask ( 0 -> -1 (0xff), 1 -> 2)<a name="line.94"></a> -<span class="sourceLineNo">095</span> p.setSecond(preprocessMask(p.getSecond()));<a name="line.95"></a> -<span class="sourceLineNo">096</span> preprocessSearchKey(p);<a name="line.96"></a> -<span class="sourceLineNo">097</span><a name="line.97"></a> -<span class="sourceLineNo">098</span> fuzzyKeyDataCopy.add(p);<a name="line.98"></a> -<span class="sourceLineNo">099</span> }<a name="line.99"></a> -<span class="sourceLineNo">100</span> this.fuzzyKeysData = fuzzyKeyDataCopy;<a name="line.100"></a> -<span class="sourceLineNo">101</span> this.tracker = new RowTracker();<a name="line.101"></a> -<span class="sourceLineNo">102</span> }<a name="line.102"></a> +<span class="sourceLineNo">027</span>import org.apache.hadoop.hbase.CellComparator;<a name="line.27"></a> +<span class="sourceLineNo">028</span>import org.apache.hadoop.hbase.PrivateCellUtil;<a name="line.28"></a> +<span class="sourceLineNo">029</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.29"></a> +<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.exceptions.DeserializationException;<a name="line.30"></a> +<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.shaded.com.google.protobuf.InvalidProtocolBufferException;<a name="line.31"></a> +<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.shaded.com.google.protobuf.UnsafeByteOperations;<a name="line.32"></a> +<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.FilterProtos;<a name="line.33"></a> +<span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.HBaseProtos.BytesBytesPair;<a name="line.34"></a> +<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>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 org.apache.hadoop.hbase.shaded.com.google.common.annotations.VisibleForTesting;<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> * <ul><a name="line.46"></a> +<span class="sourceLineNo">047</span> * <li>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</li><a name="line.48"></a> +<span class="sourceLineNo">049</span> * <li>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</li><a name="line.50"></a> +<span class="sourceLineNo">051</span> * </ul><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>public class FuzzyRowFilter extends FilterBase {<a name="line.61"></a> +<span class="sourceLineNo">062</span> private static final boolean UNSAFE_UNALIGNED = UnsafeAvailChecker.unaligned();<a name="line.62"></a> +<span class="sourceLineNo">063</span> private List<Pair<byte[], byte[]>> 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<Pair<byte[], byte[]>> fuzzyKeysData) {<a name="line.78"></a> +<span class="sourceLineNo">079</span> List<Pair<byte[], byte[]>> fuzzyKeyDataCopy = new ArrayList<>(fuzzyKeysData.size());<a name="line.79"></a> +<span class="sourceLineNo">080</span><a name="line.80"></a> +<span class="sourceLineNo">081</span> for (Pair<byte[], byte[]> aFuzzyKeysData : fuzzyKeysData) {<a name="line.81"></a> +<span class="sourceLineNo">082</span> if (aFuzzyKeysData.getFirst().length != aFuzzyKeysData.getSecond().length) {<a name="line.82"></a> +<span class="sourceLineNo">083</span> Pair<String, String> readable =<a name="line.83"></a> +<span class="sourceLineNo">084</span> new Pair<>(Bytes.toStringBinary(aFuzzyKeysData.getFirst()), Bytes.toStringBinary(aFuzzyKeysData.getSecond()));<a name="line.84"></a> +<span class="sourceLineNo">085</span> throw new IllegalArgumentException("Fuzzy pair lengths do not match: " + readable);<a name="line.85"></a> +<span class="sourceLineNo">086</span> }<a name="line.86"></a> +<span class="sourceLineNo">087</span><a name="line.87"></a> +<span class="sourceLineNo">088</span> Pair<byte[], byte[]> p = new Pair<>();<a name="line.88"></a> +<span class="sourceLineNo">089</span> // create a copy of pair bytes so that they are not modified by the filter.<a name="line.89"></a> +<span class="sourceLineNo">090</span> p.setFirst(Arrays.copyOf(aFuzzyKeysData.getFirst(), aFuzzyKeysData.getFirst().length));<a name="line.90"></a> +<span class="sourceLineNo">091</span> p.setSecond(Arrays.copyOf(aFuzzyKeysData.getSecond(), aFuzzyKeysData.getSecond().length));<a name="line.91"></a> +<span class="sourceLineNo">092</span><a name="line.92"></a> +<span class="sourceLineNo">093</span> // update mask ( 0 -> -1 (0xff), 1 -> 2)<a name="line.93"></a> +<span class="sourceLineNo">094</span> p.setSecond(preprocessMask(p.getSecond()));<a name="line.94"></a> +<span class="sourceLineNo">095</span> preprocessSearchKey(p);<a name="line.95"></a> +<span class="sourceLineNo">096</span><a name="line.96"></a> +<span class="sourceLineNo">097</span> fuzzyKeyDataCopy.add(p);<a name="line.97"></a> +<span class="sourceLineNo">098</span> }<a name="line.98"></a> +<span class="sourceLineNo">099</span> this.fuzzyKeysData = fuzzyKeyDataCopy;<a name="line.99"></a> +<span class="sourceLineNo">100</span> this.tracker = new RowTracker();<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><a name="line.103"></a> -<span class="sourceLineNo">104</span><a name="line.104"></a> -<span class="sourceLineNo">105</span> private void preprocessSearchKey(Pair<byte[], byte[]> p) {<a name="line.105"></a> -<span class="sourceLineNo">106</span> if (!UNSAFE_UNALIGNED) {<a name="line.106"></a> -<span class="sourceLineNo">107</span> // do nothing<a name="line.107"></a> -<span class="sourceLineNo">108</span> return;<a name="line.108"></a> -<span class="sourceLineNo">109</span> }<a name="line.109"></a> -<span class="sourceLineNo">110</span> byte[] key = p.getFirst();<a name="line.110"></a> -<span class="sourceLineNo">111</span> byte[] mask = p.getSecond();<a name="line.111"></a> -<span class="sourceLineNo">112</span> for (int i = 0; i < mask.length; i++) {<a name="line.112"></a> -<span class="sourceLineNo">113</span> // set non-fixed part of a search key to 0.<a name="line.113"></a> -<span class="sourceLineNo">114</span> if (mask[i] == 2) {<a name="line.114"></a> -<span class="sourceLineNo">115</span> key[i] = 0;<a name="line.115"></a> -<span class="sourceLineNo">116</span> }<a name="line.116"></a> -<span class="sourceLineNo">117</span> }<a name="line.117"></a> -<span class="sourceLineNo">118</span> }<a name="line.118"></a> -<span class="sourceLineNo">119</span><a name="line.119"></a> -<span class="sourceLineNo">120</span> /**<a name="line.120"></a> -<span class="sourceLineNo">121</span> * We need to preprocess mask array, as since we treat 2's as unfixed positions and -1 (0xff) as<a name="line.121"></a> -<span class="sourceLineNo">122</span> * fixed positions<a name="line.122"></a> -<span class="sourceLineNo">123</span> * @param mask<a name="line.123"></a> -<span class="sourceLineNo">124</span> * @return mask array<a name="line.124"></a> -<span class="sourceLineNo">125</span> */<a name="line.125"></a> -<span class="sourceLineNo">126</span> private byte[] preprocessMask(byte[] mask) {<a name="line.126"></a> -<span class="sourceLineNo">127</span> if (!UNSAFE_UNALIGNED) {<a name="line.127"></a> -<span class="sourceLineNo">128</span> // do nothing<a name="line.128"></a> -<span class="sourceLineNo">129</span> return mask;<a name="line.129"></a> -<span class="sourceLineNo">130</span> }<a name="line.130"></a> -<span class="sourceLineNo">131</span> if (isPreprocessedMask(mask)) return mask;<a name="line.131"></a> -<span class="sourceLineNo">132</span> for (int i = 0; i < mask.length; i++) {<a name="line.132"></a> -<span class="sourceLineNo">133</span> if (mask[i] == 0) {<a name="line.133"></a> -<span class="sourceLineNo">134</span> mask[i] = -1; // 0 -> -1<a name="line.134"></a> -<span class="sourceLineNo">135</span> } else if (mask[i] == 1) {<a name="line.135"></a> -<span class="sourceLineNo">136</span> mask[i] = 2;// 1 -> 2<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 mask;<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> private boolean isPreprocessedMask(byte[] mask) {<a name="line.142"></a> -<span class="sourceLineNo">143</span> for (int i = 0; i < mask.length; i++) {<a name="line.143"></a> -<span class="sourceLineNo">144</span> if (mask[i] != -1 && mask[i] != 2) {<a name="line.144"></a> -<span class="sourceLineNo">145</span> return false;<a name="line.145"></a> -<span class="sourceLineNo">146</span> }<a name="line.146"></a> -<span class="sourceLineNo">147</span> }<a name="line.147"></a> -<span class="sourceLineNo">148</span> return true;<a name="line.148"></a> -<span class="sourceLineNo">149</span> }<a name="line.149"></a> -<span class="sourceLineNo">150</span><a name="line.150"></a> -<span class="sourceLineNo">151</span> @Deprecated<a name="line.151"></a> -<span class="sourceLineNo">152</span> @Override<a name="line.152"></a> -<span class="sourceLineNo">153</span> public ReturnCode filterKeyValue(final Cell c) {<a name="line.153"></a> -<span class="sourceLineNo">154</span> return filterCell(c);<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> @Override<a name="line.157"></a> -<span class="sourceLineNo">158</span> public ReturnCode filterCell(final Cell c) {<a name="line.158"></a> -<span class="sourceLineNo">159</span> final int startIndex = lastFoundIndex >= 0 ? lastFoundIndex : 0;<a name="line.159"></a> -<span class="sourceLineNo">160</span> final int size = fuzzyKeysData.size();<a name="line.160"></a> -<span class="sourceLineNo">161</span> for (int i = startIndex; i < size + startIndex; i++) {<a name="line.161"></a> -<span class="sourceLineNo">162</span> final int index = i % size;<a name="line.162"></a> -<span class="sourceLineNo">163</span> Pair<byte[], byte[]> fuzzyData = fuzzyKeysData.get(index);<a name="line.163"></a> -<span class="sourceLineNo">164</span> // This shift is idempotent - always end up with 0 and -1 as mask values.<a name="line.164"></a> -<span class="sourceLineNo">165</span> for (int j = 0; j < fuzzyData.getSecond().length; j++) {<a name="line.165"></a> -<span class="sourceLineNo">166</span> fuzzyData.getSecond()[j] >>= 2;<a name="line.166"></a> -<span class="sourceLineNo">167</span> }<a name="line.167"></a> -<span class="sourceLineNo">168</span> SatisfiesCode satisfiesCode =<a name="line.168"></a> -<span class="sourceLineNo">169</span> satisfies(isReversed(), c.getRowArray(), c.getRowOffset(), c.getRowLength(),<a name="line.169"></a> -<span class="sourceLineNo">170</span> fuzzyData.getFirst(), fuzzyData.getSecond());<a name="line.170"></a> -<span class="sourceLineNo">171</span> if (satisfiesCode == SatisfiesCode.YES) {<a name="line.171"></a> -<span class="sourceLineNo">172</span> lastFoundIndex = index;<a name="line.172"></a> -<span class="sourceLineNo">173</span> return ReturnCode.INCLUDE;<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> // NOT FOUND -> seek next using hint<a name="line.176"></a> -<span class="sourceLineNo">177</span> lastFoundIndex = -1;<a name="line.177"></a> -<span class="sourceLineNo">178</span><a name="line.178"></a> -<span class="sourceLineNo">179</span> return ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.179"></a> -<span class="sourceLineNo">180</span><a name="line.180"></a> -<span class="sourceLineNo">181</span> }<a name="line.181"></a> -<span class="sourceLineNo">182</span><a name="line.182"></a> -<span class="sourceLineNo">183</span> @Override<a name="line.183"></a> -<span class="sourceLineNo">184</span> public Cell getNextCellHint(Cell currentCell) {<a name="line.184"></a> -<span class="sourceLineNo">185</span> boolean result = tracker.updateTracker(currentCell);<a name="line.185"></a> -<span class="sourceLineNo">186</span> if (result == false) {<a name="line.186"></a> -<span class="sourceLineNo">187</span> done = true;<a name="line.187"></a> -<span class="sourceLineNo">188</span> return null;<a name="line.188"></a> -<span class="sourceLineNo">189</span> }<a name="line.189"></a> -<span class="sourceLineNo">190</span> byte[] nextRowKey = tracker.nextRow();<a name="line.190"></a> -<span class="sourceLineNo">191</span> return PrivateCellUtil.createFirstOnRow(nextRowKey, 0, (short) nextRowKey.length);<a name="line.191"></a> -<span class="sourceLineNo">192</span> }<a name="line.192"></a> -<span class="sourceLineNo">193</span><a name="line.193"></a> -<span class="sourceLineNo">194</span> /**<a name="line.194"></a> -<span class="sourceLineNo">195</span> * If we have multiple fuzzy keys, row tracker should improve overall performance. It calculates<a name="line.195"></a> -<span class="sourceLineNo">196</span> * all next rows (one per every fuzzy key) and put them (the fuzzy key is bundled) into a priority<a name="line.196"></a> -<span class="sourceLineNo">197</span> * queue so that the smallest row key always appears at queue head, which helps to decide the<a name="line.197"></a> -<span class="sourceLineNo">198</span> * "Next Cell Hint". As scanning going on, the number of candidate rows in the RowTracker will<a name="line.198"></a> -<span class="sourceLineNo">199</span> * remain the size of fuzzy keys until some of the fuzzy keys won't possibly have matches any<a name="line.199"></a> -<span class="sourceLineNo">200</span> * more.<a name="line.200"></a> -<span class="sourceLineNo">201</span> */<a name="line.201"></a> -<span class="sourceLineNo">202</span> private class RowTracker {<a name="line.202"></a> -<span class="sourceLineNo">203</span> private final PriorityQueue<Pair<byte[], Pair<byte[], byte[]>>> nextRows;<a name="line.203"></a> -<span class="sourceLineNo">204</span> private boolean initialized = false;<a name="line.204"></a> -<span class="sourceLineNo">205</span><a name="line.205"></a> -<span class="sourceLineNo">206</span> RowTracker() {<a name="line.206"></a> -<span class="sourceLineNo">207</span> nextRows = new PriorityQueue<>(fuzzyKeysData.size(),<a name="line.207"></a> -<span class="sourceLineNo">208</span> new Comparator<Pair<byte[], Pair<byte[], byte[]>>>() {<a name="line.208"></a> -<span class="sourceLineNo">209</span> @Override<a name="line.209"></a> -<span class="sourceLineNo">210</span> public int compare(Pair<byte[], Pair<byte[], byte[]>> o1,<a name="line.210"></a> -<span class="sourceLineNo">211</span> Pair<byte[], Pair<byte[], byte[]>> o2) {<a name="line.211"></a> -<span class="sourceLineNo">212</span> return isReversed()? Bytes.compareTo(o2.getFirst(), o1.getFirst()):<a name="line.212"></a> -<span class="sourceLineNo">213</span> Bytes.compareTo(o1.getFirst(), o2.getFirst());<a name="line.213"></a> -<span class="sourceLineNo">214</span> }<a name="line.214"></a> -<span class="sourceLineNo">215</span> });<a name="line.215"></a> -<span class="sourceLineNo">216</span> }<a name="line.216"></a> -<span class="sourceLineNo">217</span><a name="line.217"></a> -<span class="sourceLineNo">218</span> byte[] nextRow() {<a name="line.218"></a> -<span class="sourceLineNo">219</span> if (nextRows.isEmpty()) {<a name="line.219"></a> -<span class="sourceLineNo">220</span> throw new IllegalStateException(<a name="line.220"></a> -<span class="sourceLineNo">221</span> "NextRows should not be empty, make sure to call nextRow() after updateTracker() return true");<a name="line.221"></a> -<span class="sourceLineNo">222</span> } else {<a name="line.222"></a> -<span class="sourceLineNo">223</span> return nextRows.peek().getFirst();<a name="line.223"></a> -<span class="sourceLineNo">224</span> }<a name="line.224"></a> -<span class="sourceLineNo">225</span> }<a name="line.225"></a> -<span class="sourceLineNo">226</span><a name="line.226"></a> -<span class="sourceLineNo">227</span> boolean updateTracker(Cell currentCell) {<a name="line.227"></a> -<span class="sourceLineNo">228</span> if (!initialized) {<a name="line.228"></a> -<span class="sourceLineNo">229</span> for (Pair<byte[], byte[]> fuzzyData : fuzzyKeysData) {<a name="line.229"></a> -<span class="sourceLineNo">230</span> updateWith(currentCell, fuzzyData);<a name="line.230"></a> -<span class="sourceLineNo">231</span> }<a name="line.231"></a> -<span class="sourceLineNo">232</span> initialized = true;<a name="line.232"></a> -<span class="sourceLineNo">233</span> } else {<a name="line.233"></a> -<span class="sourceLineNo">234</span> while (!nextRows.isEmpty() && !lessThan(currentCell, nextRows.peek().getFirst())) {<a name="line.234"></a> -<span class="sourceLineNo">235</span> Pair<byte[], Pair<byte[], byte[]>> head = nextRows.poll();<a name="line.235"></a> -<span class="sourceLineNo">236</span> Pair<byte[], byte[]> fuzzyData = head.getSecond();<a name="line.236"></a> -<span class="sourceLineNo">237</span> updateWith(currentCell, fuzzyData);<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> return !nextRows.isEmpty();<a name="line.240"></a> -<span class="sourceLineNo">241</span> }<a name="line.241"></a> -<span class="sourceLineNo">242</span><a name="line.242"></a> -<span class="sourceLineNo">243</span> boolean lessThan(Cell currentCell, byte[] nextRowKey) {<a name="line.243"></a> -<span class="sourceLineNo">244</span> int compareResult =<a name="line.244"></a> -<span class="sourceLineNo">245</span> CellComparatorImpl.COMPARATOR.compareRows(currentCell, nextRowKey, 0, nextRowKey.length);<a name="line.245"></a> -<span class="sourceLineNo">246</span> return (!isReversed() && compareResult < 0) || (isReversed() && compareResult > 0);<a name="line.246"></a> -<span class="sourceLineNo">247</span> }<a name="line.247"></a> -<span class="sourceLineNo">248</span><a name="line.248"></a> -<span class="sourceLineNo">249</span> void updateWith(Cell currentCell, Pair<byte[], byte[]> fuzzyData) {<a name="line.249"></a> -<span class="sourceLineNo">250</span> byte[] nextRowKeyCandidate =<a name="line.250"></a> -<span class="sourceLineNo">251</span> getNextForFuzzyRule(isReversed(), currentCell.getRowArray(), currentCell.getRowOffset(),<a name="line.251"></a> -<span class="sourceLineNo">252</span> currentCell.getRowLength(), fuzzyData.getFirst(), fuzzyData.getSecond());<a name="line.252"></a> -<span class="sourceLineNo">253</span> if (nextRowKeyCandidate != null) {<a name="line.253"></a> -<span class="sourceLineNo">254</span> nextRows.add(new Pair<>(nextRowKeyCandidate, fuzzyData));<a name="line.254"></a> -<span class="sourceLineNo">255</span> }<a name="line.255"></a> -<span class="sourceLineNo">256</span> }<a name="line.256"></a> +<span class="sourceLineNo">104</span> private void preprocessSearchKey(Pair<byte[], byte[]> p) {<a name="line.104"></a> +<span class="sourceLineNo">105</span> if (!UNSAFE_UNALIGNED) {<a name="line.105"></a> +<span class="sourceLineNo">106</span> // do nothing<a name="line.106"></a> +<span class="sourceLineNo">107</span> return;<a name="line.107"></a> +<span class="sourceLineNo">108</span> }<a name="line.108"></a> +<span class="sourceLineNo">109</span> byte[] key = p.getFirst();<a name="line.109"></a> +<span class="sourceLineNo">110</span> byte[] mask = p.getSecond();<a name="line.110"></a> +<span class="sourceLineNo">111</span> for (int i = 0; i < mask.length; i++) {<a name="line.111"></a> +<span class="sourceLineNo">112</span> // set non-fixed part of a search key to 0.<a name="line.112"></a> +<span class="sourceLineNo">113</span> if (mask[i] == 2) {<a name="line.113"></a> +<span class="sourceLineNo">114</span> key[i] = 0;<a name="line.114"></a> +<span class="sourceLineNo">115</span> }<a name="line.115"></a> +<span class="sourceLineNo">116</span> }<a name="line.116"></a> +<span class="sourceLineNo">117</span> }<a name="line.117"></a> +<span class="sourceLineNo">118</span><a name="line.118"></a> +<span class="sourceLineNo">119</span> /**<a name="line.119"></a> +<span class="sourceLineNo">120</span> * We need to preprocess mask array, as since we treat 2's as unfixed positions and -1 (0xff) as<a name="line.120"></a> +<span class="sourceLineNo">121</span> * fixed positions<a name="line.121"></a> +<span class="sourceLineNo">122</span> * @param mask<a name="line.122"></a> +<span class="sourceLineNo">123</span> * @return mask array<a name="line.123"></a> +<span class="sourceLineNo">124</span> */<a name="line.124"></a> +<span class="sourceLineNo">125</span> private byte[] preprocessMask(byte[] mask) {<a name="line.125"></a> +<span class="sourceLineNo">126</span> if (!UNSAFE_UNALIGNED) {<a name="line.126"></a> +<span class="sourceLineNo">127</span> // do nothing<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> if (isPreprocessedMask(mask)) return mask;<a name="line.130"></a> +<span class="sourceLineNo">131</span> for (int i = 0; i < mask.length; i++) {<a name="line.131"></a> +<span class="sourceLineNo">132</span> if (mask[i] == 0) {<a name="line.132"></a> +<span class="sourceLineNo">133</span> mask[i] = -1; // 0 -> -1<a name="line.133"></a> +<span class="sourceLineNo">134</span> } else if (mask[i] == 1) {<a name="line.134"></a> +<span class="sourceLineNo">135</span> mask[i] = 2;// 1 -> 2<a name="line.135"></a> +<span class="sourceLineNo">136</span> }<a name="line.136"></a> +<span class="sourceLineNo">137</span> }<a name="line.137"></a> +<span class="sourceLineNo">138</span> return mask;<a name="line.138"></a> +<span class="sourceLineNo">139</span> }<a name="line.139"></a> +<span class="sourceLineNo">140</span><a name="line.140"></a> +<span class="sourceLineNo">141</span> private boolean isPreprocessedMask(byte[] mask) {<a name="line.141"></a> +<span class="sourceLineNo">142</span> for (int i = 0; i < mask.length; i++) {<a name="line.142"></a> +<span class="sourceLineNo">143</span> if (mask[i] != -1 && mask[i] != 2) {<a name="line.143"></a> +<span class="sourceLineNo">144</span> return false;<a name="line.144"></a> +<span class="sourceLineNo">145</span> }<a name="line.145"></a> +<span class="sourceLineNo">146</span> }<a name="line.146"></a> +<span class="sourceLineNo">147</span> return true;<a name="line.147"></a> +<span class="sourceLineNo">148</span> }<a name="line.148"></a> +<span class="sourceLineNo">149</span><a name="line.149"></a> +<span class="sourceLineNo">150</span> @Deprecated<a name="line.150"></a> +<span class="sourceLineNo">151</span> @Override<a name="line.151"></a> +<span class="sourceLineNo">152</span> public ReturnCode filterKeyValue(final Cell c) {<a name="line.152"></a> +<span class="sourceLineNo">153</span> return filterCell(c);<a name="line.153"></a> +<span class="sourceLineNo">154</span> }<a name="line.154"></a> +<span class="sourceLineNo">155</span><a name="line.155"></a> +<span class="sourceLineNo">156</span> @Override<a name="line.156"></a> +<span class="sourceLineNo">157</span> public ReturnCode filterCell(final Cell c) {<a name="line.157"></a> +<span class="sourceLineNo">158</span> final int startIndex = lastFoundIndex >= 0 ? lastFoundIndex : 0;<a name="line.158"></a> +<span class="sourceLineNo">159</span> final int size = fuzzyKeysData.size();<a name="line.159"></a> +<span class="sourceLineNo">160</span> for (int i = startIndex; i < size + startIndex; i++) {<a name="line.160"></a> +<span class="sourceLineNo">161</span> final int index = i % size;<a name="line.161"></a> +<span class="sourceLineNo">162</span> Pair<byte[], byte[]> fuzzyData = fuzzyKeysData.get(index);<a name="line.162"></a> +<span class="sourceLineNo">163</span> // This shift is idempotent - always end up with 0 and -1 as mask values.<a name="line.163"></a> +<span class="sourceLineNo">164</span> for (int j = 0; j < fuzzyData.getSecond().length; j++) {<a name="line.164"></a> +<span class="sourceLineNo">165</span> fuzzyData.getSecond()[j] >>= 2;<a name="line.165"></a> +<span class="sourceLineNo">166</span> }<a name="line.166"></a> +<span class="sourceLineNo">167</span> SatisfiesCode satisfiesCode =<a name="line.167"></a> +<span class="sourceLineNo">168</span> satisfies(isReversed(), c.getRowArray(), c.getRowOffset(), c.getRowLength(),<a name="line.168"></a> +<span class="sourceLineNo">169</span> fuzzyData.getFirst(), fuzzyData.getSecond());<a name="line.169"></a> +<span class="sourceLineNo">170</span> if (satisfiesCode == SatisfiesCode.YES) {<a name="line.170"></a> +<span class="sourceLineNo">171</span> lastFoundIndex = index;<a name="line.171"></a> +<span class="sourceLineNo">172</span> return ReturnCode.INCLUDE;<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> // NOT FOUND -> seek next using hint<a name="line.175"></a> +<span class="sourceLineNo">176</span> lastFoundIndex = -1;<a name="line.176"></a> +<span class="sourceLineNo">177</span><a name="line.177"></a> +<span class="sourceLineNo">178</span> return ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.178"></a> +<span class="sourceLineNo">179</span><a name="line.179"></a> +<span class="sourceLineNo">180</span> }<a name="line.180"></a> +<span class="sourceLineNo">181</span><a name="line.181"></a> +<span class="sourceLineNo">182</span> @Override<a name="line.182"></a> +<span class="sourceLineNo">183</span> public Cell getNextCellHint(Cell currentCell) {<a name="line.183"></a> +<span class="sourceLineNo">184</span> boolean result = tracker.updateTracker(currentCell);<a name="line.184"></a> +<span class="sourceLineNo">185</span> if (result == false) {<a name="line.185"></a> +<span class="sourceLineNo">186</span> done = true;<a name="line.186"></a> +<span class="sourceLineNo">187</span> return null;<a name="line.187"></a> +<span class="sourceLineNo">188</span> }<a name="line.188"></a> +<span class="sourceLineNo">189</span> byte[] nextRowKey = tracker.nextRow();<a name="line.189"></a> +<span class="sourceLineNo">190</span> return PrivateCellUtil.createFirstOnRow(nextRowKey, 0, (short) nextRowKey.length);<a name="line.190"></a> +<span class="sourceLineNo">191</span> }<a name="line.191"></a> +<span class="sourceLineNo">192</span><a name="line.192"></a> +<span class="sourceLineNo">193</span> /**<a name="line.193"></a> +<span class="sourceLineNo">194</span> * If we have multiple fuzzy keys, row tracker should improve overall performance. It calculates<a name="line.194"></a> +<span class="sourceLineNo">195</span> * all next rows (one per every fuzzy key) and put them (the fuzzy key is bundled) into a priority<a name="line.195"></a> +<span class="sourceLineNo">196</span> * queue so that the smallest row key always appears at queue head, which helps to decide the<a name="line.196"></a> +<span class="sourceLineNo">197</span> * "Next Cell Hint". As scanning going on, the number of candidate rows in the RowTracker will<a name="line.197"></a> +<span class="sourceLineNo">198</span> * remain the size of fuzzy keys until some of the fuzzy keys won't possibly have matches any<a name="line.198"></a> +<span class="sourceLineNo">199</span> * more.<a name="line.199"></a> +<span class="sourceLineNo">200</span> */<a name="line.200"></a> +<span class="sourceLineNo">201</span> private class RowTracker {<a name="line.201"></a> +<span class="sourceLineNo">202</span> private final PriorityQueue<Pair<byte[], Pair<byte[], byte[]>>> nextRows;<a name="line.202"></a> +<span class="sourceLineNo">203</span> private boolean initialized = false;<a name="line.203"></a> +<span class="sourceLineNo">204</span><a name="line.204"></a> +<span class="sourceLineNo">205</span> RowTracker() {<a name="line.205"></a> +<span class="sourceLineNo">206</span> nextRows = new PriorityQueue<>(fuzzyKeysData.size(),<a name="line.206"></a> +<span class="sourceLineNo">207</span> new Comparator<Pair<byte[], Pair<byte[], byte[]>>>() {<a name="line.207"></a> +<span class="sourceLineNo">208</span> @Override<a name="line.208"></a> +<span class="sourceLineNo">209</span> public int compare(Pair<byte[], Pair<byte[], byte[]>> o1,<a name="line.209"></a> +<span class="sourceLineNo">210</span> Pair<byte[], Pair<byte[], byte[]>> o2) {<a name="line.210"></a> +<span class="sourceLineNo">211</span> return isReversed()? Bytes.compareTo(o2.getFirst(), o1.getFirst()):<a name="line.211"></a> +<span class="sourceLineNo">212</span> Bytes.compareTo(o1.getFirst(), o2.getFirst());<a name="line.212"></a> +<span class="sourceLineNo">213</span> }<a name="line.213"></a> +<span class="sourceLineNo">214</span> });<a name="line.214"></a> +<span class="sourceLineNo">215</span> }<a name="line.215"></a> +<span class="sourceLineNo">216</span><a name="line.216"></a> +<span class="sourceLineNo">217</span> byte[] nextRow() {<a name="line.217"></a> +<span class="sourceLineNo">218</span> if (nextRows.isEmpty()) {<a name="line.218"></a> +<span class="sourceLineNo">219</span> throw new IllegalStateException(<a name="line.219"></a> +<span class="sourceLineNo">220</span> "NextRows should not be empty, make sure to call nextRow() after updateTracker() return true");<a name="line.220"></a> +<span class="sourceLineNo">221</span> } else {<a name="line.221"></a> +<span class="sourceLineNo">222</span> return nextRows.peek().getFirst();<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><a name="line.225"></a> +<span class="sourceLineNo">226</span> boolean updateTracker(Cell currentCell) {<a name="line.226"></a> +<span class="sourceLineNo">227</span> if (!initialized) {<a name="line.227"></a> +<span class="sourceLineNo">228</span> for (Pair<byte[], byte[]> fuzzyData : fuzzyKeysData) {<a name="line.228"></a> +<span class="sourceLineNo">229</span> updateWith(currentCell, fuzzyData);<a name="line.229"></a> +<span class="sourceLineNo">230</span> }<a name="line.230"></a> +<span class="sourceLineNo">231</span> initialized = true;<a name="line.231"></a> +<span class="sourceLineNo">232</span> } else {<a name="line.232"></a> +<span class="sourceLineNo">233</span> while (!nextRows.isEmpty() && !lessThan(currentCell, nextRows.peek().getFirst())) {<a name="line.233"></a> +<span class="sourceLineNo">234</span> Pair<byte[], Pair<byte[], byte[]>> head = nextRows.poll();<a name="line.234"></a> +<span class="sourceLineNo">235</span> Pair<byte[], byte[]> fuzzyData = head.getSecond();<a name="line.235"></a> +<span class="sourceLineNo">236</span> updateWith(currentCell, 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> return !nextRows.isEmpty();<a name="line.239"></a> +<span class="sourceLineNo">240</span> }<a name="line.240"></a> +<span class="sourceLineNo">241</span><a name="line.241"></a> +<span class="sourceLineNo">242</span> boolean lessThan(Cell currentCell, byte[] nextRowKey) {<a name="line.242"></a> +<span class="sourceLineNo">243</span> int compareResult = CellComparator.getInstance().compareRows(currentCell, nextRowKey, 0, nextRowKey.length);<a name="line.243"></a> +<span class="sourceLineNo">244</span> return (!isReversed() && compareResult < 0) || (isReversed() && compareResult > 0);<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> void updateWith(Cell currentCell, Pair<byte[], byte[]> fuzzyData) {<a name="line.247"></a> +<span class="sourceLineNo">248</span> byte[] nextRowKeyCandidate =<a name="line.248"></a> +<span class="sourceLineNo">249</span> getNextForFuzzyRule(isReversed(), currentCell.getRowArray(), currentCell.getRowOffset(),<a name="line.249"></a> +<span class="sourceLineNo">250</span> currentCell.getRowLength(), fuzzyData.getFirst(), fuzzyData.getSecond());<a name="line.250"></a> +<span class="sourceLineNo">251</span> if (nextRowKeyCandidate != null) {<a name="line.251"></a> +<span class="sourceLineNo">252</span> nextRows.add(new Pair<>(nextRowKeyCandidate, fuzzyData));<a name="line.252"></a> +<span class="sourceLineNo">253</span> }<a name="line.253"></a> +<span class="sourceLineNo">254</span> }<a name="line.254"></a> +<span class="sourceLineNo">255</span><a name="line.255"></a> +<span class="sourceLineNo">256</span> }<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> @Override<a name="line.260"></a> -<span class="sourceLineNo">261</span> public boolean filterAllRemaining() {<a name="line.261"></a> -<span class="sourceLineNo">262</span> return done;<a name="line.262"></a> -<span class="sourceLineNo">263</span> }<a name="line.263"></a> -<span class="sourceLineNo">264</span><a name="line.264"></a> -<span class="sourceLineNo">265</span> /**<a name="line.265"></a> -<span class="sourceLineNo">266</span> * @return The filter serialized using pb<a name="line.266"></a> -<span class="sourceLineNo">267</span> */<a name="line.267"></a> -<span class="sourceLineNo">268</span> public byte[] toByteArray() {<a name="line.268"></a> -<span class="sourceLineNo">269</span> FilterProtos.FuzzyRowFilter.Builder builder = FilterProtos.FuzzyRowFilter.newBuilder();<a name="line.269"></a> -<span class="sourceLineNo">270</span> for (Pair<byte[], byte[]> fuzzyData : fuzzyKeysData) {<a name="line.270"></a> -<span class="sourceLineNo">271</span> BytesBytesPair.Builder bbpBuilder = BytesBytesPair.newBuilder();<a name="line.271"></a> -<span class="sourceLineNo">272</span> bbpBuilder.setFirst(UnsafeByteOperations.unsafeWrap(fuzzyData.getFirst()));<a name="line.272"></a> -<span class="sourceLineNo">273</span> bbpBuilder.setSecond(UnsafeByteOperations.unsafeWrap(fuzzyData.getSecond()));<a name="line.273"></a> -<span class="sourceLineNo">274</span> builder.addFuzzyKeysData(bbpBuilder);<a name="line.274"></a> -<span class="sourceLineNo">275</span> }<a name="line.275"></a> -<span class="sourceLineNo">276</span> return builder.build().toByteArray();<a name="line.276"></a> -<span class="sourceLineNo">277</span> }<a name="line.277"></a> -<span class="sourceLineNo">278</span><a name="line.278"></a> -<span class="sourceLineNo">279</span> /**<a name="line.279"></a> -<span class="sourceLineNo">280</span> * @param pbBytes A pb serialized {@link FuzzyRowFilter} instance<a name="line.280"></a> -<span class="sourceLineNo">281</span> * @return An instance of {@link FuzzyRowFilter} made from <code>bytes</code><a name="line.281"></a> -<span class="sourceLineNo">282</span> * @throws DeserializationException<a name="line.282"></a> -<span class="sourceLineNo">283</span> * @see #toByteArray<a name="line.283"></a> -<span class="sourceLineNo">284</span> */<a name="line.284"></a> -<span class="sourceLineNo">285</span> public static FuzzyRowFilter parseFrom(final byte[] pbBytes) throws DeserializationException {<a name="line.285"></a> -<span class="sourceLineNo">286</span> FilterProtos.FuzzyRowFilter proto;<a name="line.286"></a> -<span class="sourceLineNo">287</span> try {<a name="line.287"></a> -<span class="sourceLineNo">288</span> proto = FilterProtos.FuzzyRowFilter.parseFrom(pbBytes);<a name="line.288"></a> -<span class="sourceLineNo">289</span> } catch (InvalidProtocolBufferException e) {<a name="line.289"></a> -<span class="sourceLineNo">290</span> throw new DeserializationException(e);<a name="line.290"></a> -<span class="sourceLineNo">291</span> }<a name="line.291"></a> -<span class="sourceLineNo">292</span> int count = proto.getFuzzyKeysDataCount();<a name="line.292"></a> -<span class="sourceLineNo">293</span> ArrayList<Pair<byte[], byte[]>> fuzzyKeysData = new ArrayList<>(count);<a name="line.293"></a> -<span class="sourceLineNo">294</span> for (int i = 0; i < count; ++i) {<a name="line.294"></a> -<span class="sourceLineNo">295</span> BytesBytesPair current = proto.getFuzzyKeysData(i);<a name="line.295"></a> -<span class="sourceLineNo">296</span> byte[] keyBytes = current.getFirst().toByteArray();<a name="line.296"></a> -<span class="sourceLineNo">297</span> byte[] keyMeta = current.getSecond().toByteArray();<a name="line.297"></a> -<span class="sourceLineNo">298</span> fuzzyKeysData.add(new Pair<>(keyBytes, keyMeta));<a name="line.298"></a> -<span class="sourceLineNo">299</span> }<a name="line.299"></a> -<span class="sourceLineNo">300</span> return new FuzzyRowFilter(fuzzyKeysData);<a name="line.300"></a> -<span class="sourceLineNo">301</span> }<a name="line.301"></a> -<span class="sourceLineNo">302</span><a name="line.302"></a> -<span class="sourceLineNo">303</span> @Override<a name="line.303"></a> -<span class="sourceLineNo">304</span> public String toString() {<a name="line.304"></a> -<span class="sourceLineNo">305</span> final StringBuilder sb = new StringBuilder();<a name="line.305"></a> -<span class="sourceLineNo">306</span> sb.append("FuzzyRowFilter");<a name="line.306"></a> -<span class="sourceLineNo">307</span> sb.append("{fuzzyKeysData=");<a name="line.307"></a> -<span class="sourceLineNo">308</span> for (Pair<byte[], byte[]> fuzzyData : fuzzyKeysData) {<a name="line.308"></a> -<span class="sourceLineNo">309</span> sb.append('{').append(Bytes.toStringBinary(fuzzyData.getFirst())).append(":");<a name="line.309"></a> -<span class="sourceLineNo">310</span> sb.append(Bytes.toStringBinary(fuzzyData.getSecond())).append('}');<a name="line.310"></a> -<span class="sourceLineNo">311</span> }<a name="line.311"></a> -<span class="sourceLineNo">312</span> sb.append("}, ");<a name="line.312"></a> -<span class="sourceLineNo">313</span> return sb.toString();<a name="line.313"></a> -<span class="sourceLineNo">314</span> }<a name="line.314"></a> +<span class="sourceLineNo">258</span> @Override<a name="line.258"></a> +<span class="sourceLineNo">259</span> public boolean filterAllRemaining() {<a name="line.259"></a> +<span class="sourceLineNo">260</span> return done;<a name="line.260"></a> +<span class="sourceLineNo">261</span> }<a name="line.261"></a> +<span class="sourceLineNo">262</span><a name="line.262"></a> +<span class="sourceLineNo">263</span> /**<a name="line.263"></a> +<span class="sourceLineNo">264</span> * @return The filter serialized using pb<a name="line.264"></a> +<span class="sourceLineNo">265</span> */<a name="line.265"></a> +<span class="sourceLineNo">266</span> public byte[] toByteArray() {<a name="line.266"></a> +<span class="sourceLineNo">267</span> FilterProtos.FuzzyRowFilter.Builder builder = FilterProtos.FuzzyRowFilter.newBuilder();<a name="line.267"></a> +<span class="sourceLineNo">268</span> for (Pair<byte[], byte[]> fuzzyData : fuzzyKeysData) {<a name="line.268"></a> +<span class="sourceLineNo">269</span> BytesBytesPair.Builder bbpBuilder = BytesBytesPair.newBuilder();<a name="line.269"></a> +<span class="sourceLineNo">270</span> bbpBuilder.setFirst(UnsafeByteOperations.unsafeWrap(fuzzyData.getFirst()));<a name="line.270"></a> +<span class="sourceLineNo">271</span> bbpBuilder.setSecond(UnsafeByteOperations.unsafeWrap(fuzzyData.getSecond()));<a name="line.271"></a> +<span class="sourceLineNo">272</span> builder.addFuzzyKeysData(bbpBuilder);<a name="line.272"></a> +<span class="sourceLineNo">273</span> }<a name="line.273"></a> +<span class="sourceLineNo">274</span> return builder.build().toByteArray();<a name="line.274"></a> +<span class="sourceLineNo">275</span> }<a name="line.275"></a> +<span class="sourceLineNo">276</span><a name="line.276"></a> +<span class="sourceLineNo">277</span> /**<a name="line.277"></a> +<span class="sourceLineNo">278</span> * @param pbBytes A pb serialized {@link FuzzyRowFilter} instance<a name="line.278"></a> +<span class="sourceLineNo">279</span> * @return An instance of {@link FuzzyRowFilter} made from <code>bytes</code><a name="line.279"></a> +<span class="sourceLineNo">280</span> * @throws DeserializationException<a name="line.280"></a> +<span class="sourceLineNo">281</span> * @see #toByteArray<a name="line.281"></a> +<span class="sourceLineNo">282</span> */<a name="line.282"></a> +<span class="sourceLineNo">283</span> public static FuzzyRowFilter parseFrom(final byte[] pbBytes) throws DeserializationException {<a name="line.283"></a> +<span class="sourceLineNo">284</span> FilterProtos.FuzzyRowFilter proto;<a name="line.284"></a> +<span class="sourceLineNo">285</span> try {<a name="line.285"></a> +<span class="sourceLineNo">286</span> proto = FilterProtos.FuzzyRowFilter.parseFrom(pbBytes);<a name="line.286"></a> +<span class="sourceLineNo">287</span> } catch (InvalidProtocolBufferException e) {<a name="line.287"></a> +<span class="sourceLineNo">288</span> throw new DeserializationException(e);<a name="line.288"></a> +<span class="sourceLineNo">289</span> }<a name="line.289"></a> +<span class="sourceLineNo">290</span> int count = proto.getFuzzyKeysDataCount();<a name="line.290"></a> +<span class="sourceLineNo">291</span> ArrayList<Pair<byte[], byte[]>> fuzzyKeysData = new ArrayList<>(count);<a name="line.291"></a> +<span class="sourceLineNo">292</span> for (int i = 0; i < count; ++i) {<a name="line.292"></a> +<span class="sourceLineNo">293</span> BytesBytesPair current = proto.getFuzzyKeysData(i);<a name="line.293"></a> +<span class="sourceLineNo">294</span> byte[] keyBytes = current.getFirst().toByteArray();<a name="line.294"></a> +<span class="sourceLineNo">295</span> byte[] keyMeta = current.getSecond().toByteArray();<a name="line.295"></a> +<span class="sourceLineNo">296</span> fuzzyKeysData.add(new Pair<>(keyBytes, keyMeta));<a name="line.296"></a> +<span class="sourceLineNo">297</span> }<a name="line.297"></a> +<span class="sourceLineNo">298</span> return new FuzzyRowFilter(fuzzyKeysData);<a name="line.298"></a> +<span class="sourceLineNo">299</span> }<a name="line.299"></a> +<span class="sourceLineNo">300</span><a name="line.300"></a> +<span class="sourceLineNo">301</span> @Override<a name="line.301"></a> +<span class="sourceLineNo">302</span> public String toString() {<a name="line.302"></a> +<span class="sourceLineNo">303</span> final StringBuilder sb = new StringBuilder();<a name="line.303"></a> +<span class="sourceLineNo">304</span> sb.append("FuzzyRowFilter");<a name="line.304"></a> +<span class="sourceLineNo">305</span> sb.append("{fuzzyKeysData=");<a name="line.305"></a> +<span class="sourceLineNo">306</span> for (Pair<byte[], byte[]> fuzzyData : fuzzyKeysData) {<a name="line.306"></a> +<span class="sourceLineNo">307</span> sb.append('{').append(Bytes.toStringBinary(fuzzyData.getFirst())).append(":");<a name="line.307"></a> +<span class="sourceLineNo">308</span> sb.append(Bytes.toStringBinary(fuzzyData.getSecond())).append('}');<a name="line.308"></a> +<span class="sourceLineNo">309</span> }<a name="line.309"></a> +<span class="sourceLineNo">310</span> sb.append("}, ");<a name="line.310"></a> +<span class="sourceLineNo">311</span> return sb.toString();<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> // Utility methods<a name="line.314"></a> <span class="sourceLineNo">315</span><a name="line.315"></a> -<span class="sourceLineNo">316</span> // Utility methods<a name="line.316"></a> -<span class="sourceLineNo">317</span><a name="line.317"></a> -<span class="sourceLineNo">318</span> static enum SatisfiesCode {<a name="line.318"></a> -<span class="sourceLineNo">319</span> /** row satisfies fuzzy rule */<a name="line.319"></a> -<span class="sourceLineNo">320</span> YES,<a name="line.320"></a> -<span class="sourceLineNo">321</span> /** row doesn't satisfy fuzzy rule, but there's possible greater row that does */<a name="line.321"></a> -<span class="sourceLineNo">322</span> NEXT_EXISTS,<a name="line.322"></a> -<span class="sourceLineNo">323</span> /** row doesn't satisfy fuzzy rule and there's no greater row that does */<a name="line.323"></a> -<span class="sourceLineNo">324</span> NO_NEXT<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> @VisibleForTesting<a name="line.327"></a> -<span class="sourceLineNo">328</span> static SatisfiesCode satisfies(byte[] row, byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.328"></a> -<span class="sourceLineNo">329</span> return satisfies(false, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.329"></a> -<span class="sourceLineNo">330</span> }<a name="line.330"></a> -<span class="sourceLineNo">331</span><a name="line.331"></a> -<span class="sourceLineNo">332</span> @VisibleForTesting<a name="line.332"></a> -<span class="sourceLineNo">333</span> static SatisfiesCode satisfies(boolean reverse, byte[] row, byte[] fuzzyKeyBytes,<a name="line.333"></a> -<span class="sourceLineNo">334</span> byte[] fuzzyKeyMeta) {<a name="line.334"></a> -<span class="sourceLineNo">335</span> return satisfies(reverse, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.335"></a> -<span class="sourceLineNo">336</span> }<a name="line.336"></a> -<span class="sourceLineNo">337</span><a name="line.337"></a> -<span class="sourceLineNo">338</span> static SatisfiesCode satisfies(boolean reverse, byte[] row, int offset, int length,<a name="line.338"></a> -<span class="sourceLineNo">339</span> byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.339"></a> -<span class="sourceLineNo">340</span><a name="line.340"></a> -<span class="sourceLineNo">341</span> if (!UNSAFE_UNALIGNED) {<a name="line.341"></a> -<span class="sourceLineNo">342</span> return satisfiesNoUnsafe(reverse, row, offset, length, fuzzyKeyBytes, fuzzyKeyMeta);<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> if (row == null) {<a name="line.345"></a> -<span class="sourceLineNo">346</span> // do nothing, let scan to proceed<a name="line.346"></a> -<span class="sourceLineNo">347</span> return SatisfiesCode.YES;<a name="line.347"></a> -<span class="sourceLineNo">348</span> }<a name="line.348"></a> -<span class="sourceLineNo">349</span> length = Math.min(length, fuzzyKeyBytes.length);<a name="line.349"></a> -<span class="sourceLineNo">350</span> int numWords = length / Bytes.SIZEOF_LONG;<a name="line.350"></a> +<span class="sourceLineNo">316</span> static enum SatisfiesCode {<a name="line.316"></a> +<span class="sourceLineNo">317</span> /** row satisfies fuzzy rule */<a name="line.317"></a> +<span class="sourceLineNo">318</span> YES,<a name="line.318"></a> +<span class="sourceLineNo">319</span> /** row doesn't satisfy fuzzy rule, but there's possible greater row that does */<a name="line.319"></a> +<span class="sourceLineNo">320</span> NEXT_EXISTS,<a name="line.320"></a> +<span class="sourceLineNo">321</span> /** row doesn't satisfy fuzzy rule and there's no greater row that does */<a name="line.321"></a> +<span class="sourceLineNo">322</span> NO_NEXT<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> @VisibleForTesting<a name="line.325"></a> +<span class="sourceLineNo">326</span> static SatisfiesCode satisfies(byte[] row, byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.326"></a> +<span class="sourceLineNo">327</span> return satisfies(false, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.327"></a> +<span class="sourceLineNo">328</span> }<a name="line.328"></a> +<span class="sourceLineNo">329</span><a name="line.329"></a> +<span class="sourceLineNo">330</span> @VisibleForTesting<a name="line.330"></a> +<span class="sourceLineNo">331</span> static SatisfiesCode satisfies(boolean reverse, byte[] row, byte[] fuzzyKeyBytes,<a name="line.331"></a> +<span class="sourceLineNo">332</span> byte[] fuzzyKeyMeta) {<a name="line.332"></a> +<span class="sourceLineNo">333</span> return satisfies(reverse, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.333"></a> +<span class="sourceLineNo">334</span> }<a name="line.334"></a> +<span class="sourceLineNo">335</span><a name="line.335"></a> +<span class="sourceLineNo">336</span> static SatisfiesCode satisfies(boolean reverse, byte[] row, int offset, int length,<a name="line.336"></a> +<span class="sourceLineNo">337</span> byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.337"></a> +<span class="sourceLineNo">338</span><a name="line.338"></a> +<span class="sourceLineNo">339</span> if (!UNSAFE_UNALIGNED) {<a name="line.339"></a> +<span class="sourceLineNo">340</span> return satisfiesNoUnsafe(reverse, row, offset, length, fuzzyKeyBytes, fuzzyKeyMeta);<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> if (row == null) {<a name="line.343"></a> +<span class="sourceLineNo">344</span> // do nothing, let scan to proceed<a name="line.344"></a> +<span class="sourceLineNo">345</span> return SatisfiesCode.YES;<a name="line.345"></a> +<span class="sourceLineNo">346</span> }<a name="line.346"></a> +<span class="sourceLineNo">347</span> length = Math.min(length, fuzzyKeyBytes.length);<a name="line.347"></a> +<span class="sourceLineNo">348</span> int numWords = length / Bytes.SIZEOF_LONG;<a name="line.348"></a> +<span class="sourceLineNo">349</span><a name="line.349"></a> +<span class="sourceLineNo">350</span> int j = numWords << 3; // numWords * SIZEOF_LONG;<a name="line.350"></a> <span class="sourceLineNo">351</span><a name="line.351"></a> -<span class="sourceLineNo">352</span> int j = numWords << 3; // numWords * SIZEOF_LONG;<a name="line.352"></a> -<span class="sourceLineNo">353</span><a name="line.353"></a> -<span class="sourceLineNo">354</span> for (int i = 0; i < j; i += Bytes.SIZEOF_LONG) {<a name="line.354"></a> -<span class="sourceLineNo">355</span> long fuzzyBytes = UnsafeAccess.toLong(fuzzyKeyBytes, i);<a name="line.355"></a> -<span class="sourceLineNo">356</span> long fuzzyMeta = UnsafeAccess.toLong(fuzzyKeyMeta, i);<a name="line.356"></a> -<span class="sourceLineNo">357</span> long rowValue = UnsafeAccess.toLong(row, offset + i);<a name="line.357"></a> -<span class="sourceLineNo">358</span> if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {<a name="line.358"></a> -<span class="sourceLineNo">359</span> // We always return NEXT_EXISTS<a name="line.359"></a> -<span class="sourceLineNo">360</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.360"></a> -<span class="sourceLineNo">361</span> }<a name="line.361"></a> -<span class="sourceLineNo">362</span> }<a name="line.362"></a> +<span class="sourceLineNo">352</span> for (int i = 0; i < j; i += Bytes.SIZEOF_LONG) {<a name="line.352"></a> +<span class="sourceLineNo">353</span> long fuzzyBytes = UnsafeAccess.toLong(fuzzyKeyBytes, i);<a name="line.353"></a> +<span class="sourceLineNo">354</span> long fuzzyMeta = UnsafeAccess.toLong(fuzzyKeyMeta, i);<a name="line.354"></a> +<span class="sourceLineNo">355</span> long rowValue = UnsafeAccess.toLong(row, offset + i);<a name="line.355"></a> +<span class="sourceLineNo">356</span> if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {<a name="line.356"></a> +<span class="sourceLineNo">357</span> // We always return NEXT_EXISTS<a name="line.357"></a> +<span class="sourceLineNo">358</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.358"></a> +<span class="sourceLineNo">359</span> }<a name="line.359"></a> +<span class="sourceLineNo">360</span> }<a name="line.360"></a> +<span class="sourceLineNo">361</span><a name="line.361"></a> +<span class="sourceLineNo">362</span> int off = j;<a name="line.362"></a> <span class="sourceLineNo">363</span><a name="line.363"></a> -<span class="sourceLineNo">364</span> int off = j;<a name="line.364"></a> -<span class="sourceLineNo">365</span><a name="line.365"></a> -<span class="sourceLineNo">366</span> if (length - off >= Bytes.SIZEOF_INT) {<a name="line.366"></a> -<span class="sourceLineNo">367</span> int fuzzyBytes = UnsafeAccess.toInt(fuzzyKeyBytes, off);<a name="line.367"></a> -<span class="sourceLineNo">368</span> int fuzzyMeta = UnsafeAccess.toInt(fuzzyKeyMeta, off);<a name="line.368"></a> -<span class="sourceLineNo">369</span> int rowValue = UnsafeAccess.toInt(row, offset + off);<a name="line.369"></a> -<span class="sourceLineNo">370</span> if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {<a name="line.370"></a> -<span class="sourceLineNo">371</span> // We always return NEXT_EXISTS<a name="line.371"></a> -<span class="sourceLineNo">372</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.372"></a> -<span class="sourceLineNo">373</span> }<a name="line.373"></a> -<span class="sourceLineNo">374</span> off += Bytes.SIZEOF_INT;<a name="line.374"></a> -<span class="sourceLineNo">375</span> }<a name="line.375"></a> -<span class="sourceLineNo">376</span><a name="line.376"></a> -<span class="sourceLineNo">377</span> if (length - off >= Bytes.SIZEOF_SHORT) {<a name="line.377"></a> -<span class="sourceLineNo">378</span> short fuzzyBytes = UnsafeAccess.toShort(fuzzyKeyBytes, off);<a name="line.378"></a> -<span class="sourceLineNo">379</span> short fuzzyMeta = UnsafeAccess.toShort(fuzzyKeyMeta, off);<a name="line.379"></a> -<span class="sourceLineNo">380</span> short rowValue = UnsafeAccess.toShort(row, offset + off);<a name="line.380"></a> -<span class="sourceLineNo">381</span> if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {<a name="line.381"></a> -<span class="sourceLineNo">382</span> // We always return NEXT_EXISTS<a name="line.382"></a> -<span class="sourceLineNo">383</span> // even if it does not (in this case getNextForFuzzyRule<a name="line.383"></a> -<span class="sourceLineNo">384</span> // will return null)<a name="line.384"></a> -<span class="sourceLineNo">385</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.385"></a> -<span class="sourceLineNo">386</span> }<a name="line.386"></a> -<span class="sourceLineNo">387</span> off += Bytes.SIZEOF_SHORT;<a name="line.387"></a> -<span class="sourceLineNo">388</span> }<a name="line.388"></a> -<span class="sourceLineNo">389</span><a name="line.389"></a> -<span class="sourceLineNo">390</span> if (length - off >= Bytes.SIZEOF_BYTE) {<a name="line.390"></a> -<span class="sourceLineNo">391</span> int fuzzyBytes = fuzzyKeyBytes[off] & 0xff;<a name="line.391"></a> -<span class="sourceLineNo">392</span> int fuzzyMeta = fuzzyKeyMeta[off] & 0xff;<a name="line.392"></a> -<span class="sourceLineNo">393</span> int rowValue = row[offset + off] & 0xff;<a name="line.393"></a> -<span class="sourceLineNo">394</span> if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {<a name="line.394"></a> -<span class="sourceLineNo">395</span> // We always return NEXT_EXISTS<a name="line.395"></a> -<span class="sourceLineNo">396</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.396"></a> -<span class="sourceLineNo">397</span> }<a name="line.397"></a> -<span class="sourceLineNo">398</span> }<a name="line.398"></a> -<span class="sourceLineNo">399</span> return SatisfiesCode.YES;<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> static SatisfiesCode satisfiesNoUnsafe(boolean reverse, byte[] row, int offset, int length,<a name="line.402"></a> -<span class="sourceLineNo">403</span> byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.403"></a> -<span class="sourceLineNo">404</span> if (row == null) {<a name="line.404"></a> -<span class="sourceLineNo">405</span> // do nothing, let scan to proceed<a name="line.405"></a> -<span class="sourceLineNo">406</span> return SatisfiesCode.YES;<a name="line.406"></a> -<span class="sourceLineNo">407</span> }<a name="line.407"></a> -<span class="sourceLineNo">408</span><a name="line.408"></a> -<span class="sourceLineNo">409</span> Order order = Order.orderFor(reverse);<a name="line.409"></a> -<span class="sourceLineNo">410</span> boolean nextRowKeyCandidateExists = false;<a name="line.410"></a> -<span class="sourceLineNo">411</span><a name="line.411"></a> -<span class="sourceLineNo">412</span> for (int i = 0; i < fuzzyKeyMeta.length && i < length; i++) {<a name="line.412"></a> -<span class="sourceLineNo">413</span> // First, checking if this position is fixed and not equals the given one<a name="line.413"></a> -<span class="sourceLineNo">414</span> boolean byteAtPositionFixed = fuzzyKeyMeta[i] == 0;<a name="line.414"></a> -<span class="sourceLineNo">415</span> boolean fixedByteIncorrect = byteAtPositionFixed && fuzzyKeyBytes[i] != row[i + offset];<a name="line.415"></a> -<span class="sourceLineNo">416</span> if (fixedByteIncorrect) {<a name="line.416"></a> -<span class="sourceLineNo">417</span> // in this case there's another row that satisfies fuzzy rule and bigger than this row<a name="line.417"></a> -<span class="sourceLineNo">418</span> if (nextRowKeyCandidateExists) {<a name="line.418"></a> -<span class="sourceLineNo">419</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.419"></a> -<span class="sourceLineNo">420</span> }<a name="line.420"></a> -<span class="sourceLineNo">421</span><a name="line.421"></a> -<span class="sourceLineNo">422</span> // If this row byte is less than fixed then there's a byte array bigger than<a name="line.422"></a> -<span class="sourceLineNo">423</span> // this row and which satisfies the fuzzy rule. Otherwise there's no such byte array:<a name="line.423"></a> -<span class="sourceLineNo">424</span> // this row is simply bigger than any byte array that satisfies the fuzzy rule<a name="line.424"></a> -<span class="sourceLineNo">425</span> boolean rowByteLessThanFixed = (row[i + offset] & 0xFF) < (fuzzyKeyBytes[i] & 0xFF);<a name="line.425"></a> -<span class="sourceLineNo">426</span> if (rowByteLessThanFixed && !reverse) {<a name="line.426"></a> +<span class="sourceLineNo">364</span> if (length - off >= Bytes.SIZEOF_INT) {<a name="line.364"></a> +<span class="sourceLineNo">365</span> int fuzzyBytes = UnsafeAccess.toInt(fuzzyKeyBytes, off);<a name="line.365"></a> +<span class="sourceLineNo">366</span> int fuzzyMeta = UnsafeAccess.toInt(fuzzyKeyMeta, off);<a name="line.366"></a> +<span class="sourceLineNo">367</span> int rowValue = UnsafeAccess.toInt(row, offset + off);<a name="line.367"></a> +<span class="sourceLineNo">368</span> if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {<a name="line.368"></a> +<span class="sourceLineNo">369</span> // We always return NEXT_EXISTS<a name="line.369"></a> +<span class="sourceLineNo">370</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.370"></a> +<span class="sourceLineNo">371</span> }<a name="line.371"></a> +<span class="sourceLineNo">372</span> off += Bytes.SIZEOF_INT;<a name="line.372"></a> +<span class="sourceLineNo">373</span> }<a name="line.373"></a> +<span class="sourceLineNo">374</span><a name="line.374"></a> +<span class="sourceLineNo">375</span> if (length - off >= Bytes.SIZEOF_SHORT) {<a name="line.375"></a> +<span class="sourceLineNo">376</span> short fuzzyBytes = UnsafeAccess.toShort(fuzzyKeyBytes, off);<a name="line.376"></a> +<span class="sourceLineNo">377</span> short fuzzyMeta = UnsafeAccess.toShort(fuzzyKeyMeta, off);<a name="line.377"></a> +<span class="sourceLineNo">378</span> short rowValue = UnsafeAccess.toShort(row, offset + off);<a name="line.378"></a> +<span class="sourceLineNo">379</span> if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {<a name="line.379"></a> +<span class="sourceLineNo">380</span> // We always return NEXT_EXISTS<a name="line.380"></a> +<span class="sourceLineNo">381</span> // even if it does not (in this case getNextForFuzzyRule<a name="line.381"></a> +<span class="sourceLineNo">382</span> // will return null)<a name="line.382"></a> +<span class="sourceLineNo">383</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.383"></a> +<span class="sourceLineNo">384</span> }<a name="line.384"></a> +<span class="sourceLineNo">385</span> off += Bytes.SIZEOF_SHORT;<a name="line.385"></a> +<span class="sourceLineNo">386</span> }<a name="line.386"></a> +<span class="sourceLineNo">387</span><a name="line.387"></a> +<span class="sourceLineNo">388</span> if (length - off >= Bytes.SIZEOF_BYTE) {<a name="line.388"></a> +<span class="sourceLineNo">389</span> int fuzzyBytes = fuzzyKeyBytes[off] & 0xff;<a name="line.389"></a> +<span class="sourceLineNo">390</span> int fuzzyMeta = fuzzyKeyMeta[off] & 0xff;<a name="line.390"></a> +<span class="sourceLineNo">391</span> int rowValue = row[offset + off] & 0xff;<a name="line.391"></a> +<span class="sourceLineNo">392</span> if ((rowValue & fuzzyMeta) != (fuzzyBytes)) {<a name="line.392"></a> +<span class="sourceLineNo">393</span> // We always return NEXT_EXISTS<a name="line.393"></a> +<span class="sourceLineNo">394</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.394"></a> +<span class="sourceLineNo">395</span> }<a name="line.395"></a> +<span class="sourceLineNo">396</span> }<a name="line.396"></a> +<span class="sourceLineNo">397</span> return SatisfiesCode.YES;<a name="line.397"></a> +<span class="sourceLineNo">398</span> }<a name="line.398"></a> +<span class="sourceLineNo">399</span><a name="line.399"></a> +<span class="sourceLineNo">400</span> static SatisfiesCode satisfiesNoUnsafe(boolean reverse, byte[] row, int offset, int length,<a name="line.400"></a> +<span class="sourceLineNo">401</span> byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.401"></a> +<span class="sourceLineNo">402</span> if (row == null) {<a name="line.402"></a> +<span class="sourceLineNo">403</span> // do nothing, let scan to proceed<a name="line.403"></a> +<span class="sourceLineNo">404</span> return SatisfiesCode.YES;<a name="line.404"></a> +<span class="sourceLineNo">405</span> }<a name="line.405"></a> +<span class="sourceLineNo">406</span><a name="line.406"></a> +<span class="sourceLineNo">407</span> Order order = Order.orderFor(reverse);<a name="line.407"></a> +<span class="sourceLineNo">408</span> boolean nextRowKeyCandidateExists = false;<a name="line.408"></a> +<span class="sourceLineNo">409</span><a name="line.409"></a> +<span class="sourceLineNo">410</span> for (int i = 0; i < fuzzyKeyMeta.length && i < length; i++) {<a name="line.410"></a> +<span class="sourceLineNo">411</span> // First, checking if this position is fixed and not equals the given one<a name="line.411"></a> +<span class="sourceLineNo">412</span> boolean byteAtPositionFixed = fuzzyKeyMeta[i] == 0;<a name="line.412"></a> +<span class="sourceLineNo">413</span> boolean fixedByteIncorrect = byteAtPositionFixed && fuzzyKeyBytes[i] != row[i + offset];<a name="line.413"></a> +<span class="sourceLineNo">414</span> if (fixedByteIncorrect) {<a name="line.414"></a> +<span class="sourceLineNo">415</span> // in this case there's another row that satisfies fuzzy rule and bigger than this row<a name="line.415"></a> +<span class="sourceLineNo">416</span> if (nextRowKeyCandidateExists) {<a name="line.416"></a> +<span class="sourceLineNo">417</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.417"></a> +<span class="sourceLineNo">418</span> }<a name="line.418"></a> +<span class="sourceLineNo">419</span><a name="line.419"></a> +<span class="sourceLineNo">420</span> // If this row byte is less than fixed then there's a byte array bigger than<a name="line.420"></a> +<span class="sourceLineNo">421</span> // this row and which satisfies the fuzzy rule. Otherwise there's no such byte array:<a name="line.421"></a> +<span class="sourceLineNo">422</span> // this row is simply bigger than any byte array that satisfies the fuzzy rule<a name="line.422"></a> +<span class="sourceLineNo">423</span> boolean rowByteLessThanFixed = (row[i + offset] & 0xFF) < (fuzzyKeyBytes[i] & 0xFF);<a name="line.423"></a> +<span class="sourceLineNo">424</span> if (rowByteLessThanFixed && !reverse) {<a name="line.424"></a> +<span class="sourceLineNo">425</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.425"></a> +<span class="sourceLineNo">426</span> } else if (!rowByteLessThanFixed && reverse) {<a name="line.426"></a> <span class="sourceLineNo">427</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.427"></a> -<span class="sourceLineNo">428</span> } else if (!rowByteLessThanFixed && reverse) {<a name="line.428"></a> -<span class="sourceLineNo">429</span> return SatisfiesCode.NEXT_EXISTS;<a name="line.429"></a> -<span class="sourceLineNo">430</span> } else {<a name="line.430"></a> -<span class="sourceLineNo">431</span> return SatisfiesCode.NO_NEXT;<a name="line.431"></a> -<span class="sourceLineNo">432</span> }<a name="line.432"></a> -<span class="sourceLineNo">433</span> }<a name="line.433"></a> -<span class="sourceLineNo">434</span><a name="line.434"></a> -<span class="sourceLineNo">435</span> // Second, checking if this position is not fixed and byte value is not the biggest. In this<a name="line.435"></a> -<span class="sourceLineNo">436</span> // case there's a byte array bigger than this row and which satisfies the fuzzy rule. To get<a name="line.436"></a> -<span class="sourceLineNo">437</span> // bigger byte array that satisfies the rule we need to just increase this byte<a name="line.437"></a> -<span class="sourceLineNo">438</span> // (see the code of getNextForFuzzyRule below) by one.<a name="line.438"></a> -<span class="sourceLineNo">439</span> // Note: if non-fixed byte is already at biggest value, this doesn't allow us to say there's<a name="line.439"></a> -<span class="sourceLineNo">440</span> // bigger one that satisfies the rule as it can't be increased.<a name="line.440"></a> -<span class="sourceLineNo">441</span> if (fuzzyKeyMeta[i] == 1 && !order.isMax(fuzzyKeyBytes[i])) {<a name="line.441"></a> -<span class="sourceLineNo">442</span> nextRowKeyCandidateExists = true;<a name="line.442"></a> -<span class="sourceLineNo">443</span> }<a name="line.443"></a> -<span class="sourceLineNo">444</span> }<a name="line.444"></a> -<span class="sourceLineNo">445</span> return SatisfiesCode.YES;<a name="line.445"></a> -<span class="sourceLineNo">446</span> }<a name="line.446"></a> -<span class="sourceLineNo">447</span><a name="line.447"></a> -<span class="sourceLineNo">448</span> @VisibleForTesting<a name="line.448"></a> -<span class="sourceLineNo">449</span> static byte[] getNextForFuzzyRule(byte[] row, byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.449"></a> -<span class="sourceLineNo">450</span> return getNextForFuzzyRule(false, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.450"></a> -<span class="sourceLineNo">451</span> }<a name="line.451"></a> -<span class="sourceLineNo">452</span><a name="line.452"></a> -<span class="sourceLineNo">453</span> @VisibleForTesting<a name="line.453"></a> -<span class="sourceLineNo">454</span> static byte[] getNextForFuzzyRule(boolean reverse, byte[] row, byte[] fuzzyKeyBytes,<a name="line.454"></a> -<span class="sourceLineNo">455</span> byte[] fuzzyKeyMeta) {<a name="line.455"></a> -<span class="sourceLineNo">456</span> return getNextForFuzzyRule(reverse, row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<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> /** Abstracts directional comparisons based on scan direction. */<a name="line.459"></a> -<span class="sourceLineNo">460</span> private enum Order {<a name="line.460"></a> -<span class="sourceLineNo">461</span> ASC {<a name="line.461"></a> -<span class="sourceLineNo">462</span> public boolean lt(int lhs, int rhs) {<a name="line.462"></a> -<span class="sourceLineNo">463</span> return lhs < rhs;<a name="line.463"></a> -<span class="sourceLineNo">464</span> }<a name="line.464"></a> -<span class="sourceLineNo">465</span><a name="line.465"></a> -<span class="sourceLineNo">466</span> public boolean gt(int lhs, int rhs) {<a name="line.466"></a> -<span class="sourceLineNo">467</span> return lhs > rhs;<a name="line.467"></a> -<span class="sourceLineNo">468</span> }<a name="line.468"></a> -<span class="sourceLineNo">469</span><a name="line.469"></a> -<span class="sourceLineNo">470</span> public byte inc(byte val) {<a name="line.470"></a> -<span class="sourceLineNo">471</span> // TODO: what about over/underflow?<a name="line.471"></a> -<span class="sourceLineNo">472</span> return (byte) (val + 1);<a name="line.472"></a> -<span class="sourceLineNo">473</span> }<a name="line.473"></a> -<span class="sourceLineNo">474</span><a name="line.474"></a> -<span class="sourceLineNo">475</span> public boolean isMax(byte val) {<a name="line.475"></a> -<span class="sourceLineNo">476</span> return val == (byte) 0xff;<a name="line.476"></a> -<span class="sourceLineNo">477</span> }<a name="line.477"></a> -<span class="sourceLineNo">478</span><a name="line.478"></a> -<span class="sourceLineNo">479</span> public byte min() {<a name="line.479"></a> -<span class="sourceLineNo">480</span> return 0;<a name="line.480"></a> -<span class="sourceLineNo">481</span> }<a name="line.481"></a> -<span class="sourceLineNo">482</span> },<a name="line.482"></a> -<span class="sourceLineNo">483</span> DESC {<a name="line.483"></a> -<span class="sourceLineNo">484</span> public boolean lt(int lhs, int rhs) {<a name="line.484"></a> -<span class="sourceLineNo">485</span> return lhs > rhs;<a name="line.485"></a> -<span class="sourceLineNo">486</span> }<a name="line.486"></a> -<span class="sourceLineNo">487</span><a name="line.487"></a> -<span class="sourceLineNo">488</span> public boolean gt(int lhs, int rhs) {<a name="line.488"></a> -<span class="sourceLineNo">489</span> return lhs < rhs;<a name="line.489"></a> -<span class="sourceLineNo">490</span> }<a name="line.490"></a> -<span class="sourceLineNo">491</span><a name="line.491"></a> -<span class="sourceLineNo">492</span> public byte inc(byte val) {<a name="line.492"></a> -<span class="sourceLineNo">493</span> // TODO: what about over/underflow?<a name="line.493"></a> -<span class="sourceLineNo">494</span> return (byte) (val - 1);<a name="line.494"></a> -<span class="sourceLineNo">495</span> }<a name="line.495"></a> -<span class="sourceLineNo">496</span><a name="line.496"></a> -<span class="sourceLineNo">497</span> public boolean isMax(byte val) {<a name="line.497"></a> -<span class="sourceLineNo">498</span> return val == 0;<a name="line.498"></a> -<span class="sourceLineNo">499</span> }<a name="line.499"></a> -<span class="sourceLineNo">500</span><a name="line.500"></a> -<span class="sourceLineNo">501</span> public byte min() {<a name="line.501"></a> -<span class="sourceLineNo">502</span> return (byte) 0xFF;<a name="line.502"></a> -<span class="sourceLineNo">503</span> }<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> public static Order orderFor(boolean reverse) {<a name="line.506"></a> -<span class="sourceLineNo">507</span> return reverse ? DESC : ASC;<a name="line.507"></a> -<span class="sourceLineNo">508</span> }<a name="line.508"></a> -<span class="sourceLineNo">509</span><a name="line.509"></a> -<span class="sourceLineNo">510</span> /** Returns true when {@code lhs < rhs}. */<a name="line.510"></a> -<span class="sourceLineNo">511</span> public abstract boolean lt(int lhs, int rhs);<a name="line.511"></a> -<span class="sourceLineNo">512</span><a name="line.512"></a> -<span class="sourceLineNo">513</span> /** Returns true when {@code lhs > rhs}. */<a name="line.513"></a> -<span class="sourceLineNo">514</span> public abstract boolean gt(int lhs, int rhs);<a name="line.514"></a> -<span class="sourceLineNo">515</span><a name="line.515"></a> -<span class="sourceLineNo">516</span> /** Returns {@code val} incremented by 1. */<a name="line.516"></a> -<span class="sourceLineNo">517</span> public abstract byte inc(byte val);<a name="line.517"></a> -<span class="sourceLineNo">518</span><a name="line.518"></a> -<span class="sourceLineNo">519</span> /** Return true when {@code val} is the maximum value */<a name="line.519"></a> -<span class="sourceLineNo">520</span> public abstract boolean isMax(byte val);<a name="line.520"></a> -<span class="sourceLineNo">521</span><a name="line.521"></a> -<span class="sourceLineNo">522</span> /** Return the minimum value according to this ordering scheme. */<a name="line.522"></a> -<span class="sourceLineNo">523</span> public abstract byte min()
<TRUNCATED>
