http://git-wip-us.apache.org/repos/asf/hbase-site/blob/293abb17/devapidocs/src-html/org/apache/hadoop/hbase/filter/FilterListWithOR.html
----------------------------------------------------------------------
diff --git
a/devapidocs/src-html/org/apache/hadoop/hbase/filter/FilterListWithOR.html
b/devapidocs/src-html/org/apache/hadoop/hbase/filter/FilterListWithOR.html
index f847dd8..f2cf6a7 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/filter/FilterListWithOR.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/filter/FilterListWithOR.html
@@ -34,395 +34,393 @@
<span class="sourceLineNo">026</span><a name="line.26"></a>
<span class="sourceLineNo">027</span>import java.io.IOException;<a
name="line.27"></a>
<span class="sourceLineNo">028</span>import java.util.ArrayList;<a
name="line.28"></a>
-<span class="sourceLineNo">029</span>import java.util.Arrays;<a
name="line.29"></a>
-<span class="sourceLineNo">030</span>import java.util.Collections;<a
name="line.30"></a>
-<span class="sourceLineNo">031</span>import java.util.List;<a
name="line.31"></a>
-<span class="sourceLineNo">032</span>import java.util.Objects;<a
name="line.32"></a>
-<span class="sourceLineNo">033</span><a name="line.33"></a>
-<span class="sourceLineNo">034</span>/**<a name="line.34"></a>
-<span class="sourceLineNo">035</span> * FilterListWithOR represents an ordered
list of filters which will be evaluated with an OR<a name="line.35"></a>
-<span class="sourceLineNo">036</span> * operator.<a name="line.36"></a>
-<span class="sourceLineNo">037</span> */<a name="line.37"></a>
-<span class="sourceLineNo">038</span>@InterfaceAudience.Private<a
name="line.38"></a>
-<span class="sourceLineNo">039</span>public class FilterListWithOR extends
FilterListBase {<a name="line.39"></a>
-<span class="sourceLineNo">040</span><a name="line.40"></a>
-<span class="sourceLineNo">041</span> /**<a name="line.41"></a>
-<span class="sourceLineNo">042</span> * Save previous return code and
previous cell for every filter in filter list. For MUST_PASS_ONE,<a
name="line.42"></a>
-<span class="sourceLineNo">043</span> * we use the previous return code to
decide whether we should pass current cell encountered to<a name="line.43"></a>
-<span class="sourceLineNo">044</span> * the filter. For MUST_PASS_ALL, the
two list are meaningless.<a name="line.44"></a>
-<span class="sourceLineNo">045</span> */<a name="line.45"></a>
-<span class="sourceLineNo">046</span> private List<ReturnCode>
prevFilterRCList = null;<a name="line.46"></a>
-<span class="sourceLineNo">047</span> private List<Cell> prevCellList =
null;<a name="line.47"></a>
-<span class="sourceLineNo">048</span><a name="line.48"></a>
-<span class="sourceLineNo">049</span> public
FilterListWithOR(List<Filter> filters) {<a name="line.49"></a>
-<span class="sourceLineNo">050</span> super(filters);<a name="line.50"></a>
-<span class="sourceLineNo">051</span> prevFilterRCList = new
ArrayList<>(Collections.nCopies(filters.size(), null));<a
name="line.51"></a>
-<span class="sourceLineNo">052</span> prevCellList = new
ArrayList<>(Collections.nCopies(filters.size(), null));<a
name="line.52"></a>
-<span class="sourceLineNo">053</span> subFiltersIncludedCell = new
ArrayList<>(Collections.nCopies(filters.size(), false));<a
name="line.53"></a>
-<span class="sourceLineNo">054</span> }<a name="line.54"></a>
-<span class="sourceLineNo">055</span><a name="line.55"></a>
-<span class="sourceLineNo">056</span> @Override<a name="line.56"></a>
-<span class="sourceLineNo">057</span> public void
addFilterLists(List<Filter> filters) {<a name="line.57"></a>
-<span class="sourceLineNo">058</span> if (checkAndGetReversed(filters,
isReversed()) != isReversed()) {<a name="line.58"></a>
-<span class="sourceLineNo">059</span> throw new
IllegalArgumentException("Filters in the list must have the same reversed
flag");<a name="line.59"></a>
-<span class="sourceLineNo">060</span> }<a name="line.60"></a>
-<span class="sourceLineNo">061</span> this.filters.addAll(filters);<a
name="line.61"></a>
-<span class="sourceLineNo">062</span>
this.subFiltersIncludedCell.addAll(Collections.nCopies(filters.size(),
false));<a name="line.62"></a>
-<span class="sourceLineNo">063</span>
this.prevFilterRCList.addAll(Collections.nCopies(filters.size(), null));<a
name="line.63"></a>
-<span class="sourceLineNo">064</span>
this.prevCellList.addAll(Collections.nCopies(filters.size(), null));<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> @Override<a name="line.67"></a>
-<span class="sourceLineNo">068</span> protected String
formatLogFilters(List<Filter> logFilters) {<a name="line.68"></a>
-<span class="sourceLineNo">069</span> return String.format("FilterList OR
(%d/%d): %s", logFilters.size(), this.size(),<a name="line.69"></a>
-<span class="sourceLineNo">070</span> logFilters.toString());<a
name="line.70"></a>
-<span class="sourceLineNo">071</span> }<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> * For MUST_PASS_ONE, we cannot make
sure that when filter-A in filter list return NEXT_COL then<a
name="line.74"></a>
-<span class="sourceLineNo">075</span> * the next cell passing to filterList
will be the first cell in next column, because if filter-B<a name="line.75"></a>
-<span class="sourceLineNo">076</span> * in filter list return SKIP, then the
filter list will return SKIP. In this case, we should pass<a name="line.76"></a>
-<span class="sourceLineNo">077</span> * the cell following the previous
cell, and it's possible that the next cell has the same column<a
name="line.77"></a>
-<span class="sourceLineNo">078</span> * as the previous cell even if
filter-A has NEXT_COL returned for the previous cell. So we should<a
name="line.78"></a>
-<span class="sourceLineNo">079</span> * save the previous cell and the
return code list when checking previous cell for every filter in<a
name="line.79"></a>
-<span class="sourceLineNo">080</span> * filter list, and verify if
currentCell fit the previous return code, if fit then pass the<a
name="line.80"></a>
-<span class="sourceLineNo">081</span> * currentCell to the corresponding
filter. (HBASE-17678) <br><a name="line.81"></a>
-<span class="sourceLineNo">082</span> * Note that: In StoreScanner level,
NEXT_ROW will skip to the next row in current family, and in<a
name="line.82"></a>
-<span class="sourceLineNo">083</span> * RegionScanner level, NEXT_ROW will
skip to the next row in current family and switch to the<a name="line.83"></a>
-<span class="sourceLineNo">084</span> * next family for RegionScanner,
INCLUDE_AND_NEXT_ROW is the same. so we should pass current cell<a
name="line.84"></a>
-<span class="sourceLineNo">085</span> * to the filter, if row mismatch or
row match but column family mismatch. (HBASE-18368)<a name="line.85"></a>
-<span class="sourceLineNo">086</span> * @see
org.apache.hadoop.hbase.filter.Filter.ReturnCode<a name="line.86"></a>
-<span class="sourceLineNo">087</span> */<a name="line.87"></a>
-<span class="sourceLineNo">088</span> private boolean
shouldPassCurrentCellToFilter(Cell prevCell, Cell currentCell,<a
name="line.88"></a>
-<span class="sourceLineNo">089</span> ReturnCode prevCode) throws
IOException {<a name="line.89"></a>
-<span class="sourceLineNo">090</span> if (prevCell == null || prevCode ==
null) {<a name="line.90"></a>
-<span class="sourceLineNo">091</span> return true;<a name="line.91"></a>
-<span class="sourceLineNo">092</span> }<a name="line.92"></a>
-<span class="sourceLineNo">093</span> switch (prevCode) {<a
name="line.93"></a>
-<span class="sourceLineNo">094</span> case INCLUDE:<a name="line.94"></a>
-<span class="sourceLineNo">095</span> case SKIP:<a name="line.95"></a>
-<span class="sourceLineNo">096</span> return true;<a name="line.96"></a>
-<span class="sourceLineNo">097</span> case SEEK_NEXT_USING_HINT:<a
name="line.97"></a>
-<span class="sourceLineNo">098</span> Cell nextHintCell =
getNextCellHint(prevCell);<a name="line.98"></a>
-<span class="sourceLineNo">099</span> return nextHintCell == null ||
this.compareCell(currentCell, nextHintCell) >= 0;<a name="line.99"></a>
-<span class="sourceLineNo">100</span> case NEXT_COL:<a name="line.100"></a>
-<span class="sourceLineNo">101</span> case INCLUDE_AND_NEXT_COL:<a
name="line.101"></a>
-<span class="sourceLineNo">102</span> // Once row changed, reset() will
clear prevCells, so we need not to compare their rows<a name="line.102"></a>
-<span class="sourceLineNo">103</span> // because rows are the same
here.<a name="line.103"></a>
-<span class="sourceLineNo">104</span> return
!CellUtil.matchingColumn(prevCell, currentCell);<a name="line.104"></a>
-<span class="sourceLineNo">105</span> case NEXT_ROW:<a name="line.105"></a>
-<span class="sourceLineNo">106</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a
name="line.106"></a>
-<span class="sourceLineNo">107</span> // As described above, rows are
definitely the same, so we only compare the family.<a name="line.107"></a>
-<span class="sourceLineNo">108</span> return
!CellUtil.matchingFamily(prevCell, currentCell);<a name="line.108"></a>
-<span class="sourceLineNo">109</span> default:<a name="line.109"></a>
-<span class="sourceLineNo">110</span> throw new
IllegalStateException("Received code is not valid.");<a name="line.110"></a>
-<span class="sourceLineNo">111</span> }<a name="line.111"></a>
-<span class="sourceLineNo">112</span> }<a name="line.112"></a>
-<span class="sourceLineNo">113</span><a name="line.113"></a>
-<span class="sourceLineNo">114</span> /**<a name="line.114"></a>
-<span class="sourceLineNo">115</span> * FilterList with MUST_PASS_ONE choose
the minimal forward step among sub-filter in filter list.<a name="line.115"></a>
-<span class="sourceLineNo">116</span> * Let's call it: The Minimal Step
Rule. So if filter-A in filter list return INCLUDE and filter-B<a
name="line.116"></a>
-<span class="sourceLineNo">117</span> * in filter list return
INCLUDE_AND_NEXT_COL, then the filter list should return INCLUDE. For<a
name="line.117"></a>
-<span class="sourceLineNo">118</span> * SEEK_NEXT_USING_HINT, it's more
special, because we do not know how far it will forward, so we<a
name="line.118"></a>
-<span class="sourceLineNo">119</span> * use SKIP by default.<br/><a
name="line.119"></a>
-<span class="sourceLineNo">120</span> * <br/><a name="line.120"></a>
-<span class="sourceLineNo">121</span> * The jump step will be:<a
name="line.121"></a>
-<span class="sourceLineNo">122</span> *<a name="line.122"></a>
-<span class="sourceLineNo">123</span> * <pre><a name="line.123"></a>
-<span class="sourceLineNo">124</span> * INCLUDE &lt; SKIP &lt;
INCLUDE_AND_NEXT_COL &lt; NEXT_COL &lt; INCLUDE_AND_SEEK_NEXT_ROW
&lt; NEXT_ROW &lt; SEEK_NEXT_USING_HINT<a name="line.124"></a>
-<span class="sourceLineNo">125</span> * </pre><a name="line.125"></a>
-<span class="sourceLineNo">126</span> *<a name="line.126"></a>
-<span class="sourceLineNo">127</span> * Here, we have the following map to
describe The Minimal Step Rule. if current return code (for<a
name="line.127"></a>
-<span class="sourceLineNo">128</span> * previous sub-filters in filter list)
is <strong>ReturnCode</strong>, and current filter returns<a
name="line.128"></a>
-<span class="sourceLineNo">129</span> *
<strong>localRC</strong>, then we should return
map[ReturnCode][localRC] for the merged result,<a name="line.129"></a>
-<span class="sourceLineNo">130</span> * according to The Minimal Step
Rule.<br/><a name="line.130"></a>
-<span class="sourceLineNo">131</span> *<a name="line.131"></a>
-<span class="sourceLineNo">132</span> * <pre><a name="line.132"></a>
-<span class="sourceLineNo">133</span> * LocalCode\ReturnCode INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_SEEK_NEXT_ROW SKIP NEXT_COL
NEXT_ROW SEEK_NEXT_USING_HINT<a name="line.133"></a>
-<span class="sourceLineNo">134</span> * INCLUDE INCLUDE
INCLUDE INCLUDE INCLUDE INCLUDE
INCLUDE INCLUDE<a name="line.134"></a>
-<span class="sourceLineNo">135</span> * INCLUDE_AND_NEXT_COL INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_NEXT_COL INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_NEXT_COL INCLUDE<a name="line.135"></a>
-<span class="sourceLineNo">136</span> * INCLUDE_AND_SEEK_NEXT_ROW INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_SEEK_NEXT_ROW INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_SEEK_NEXT_ROW INCLUDE<a name="line.136"></a>
-<span class="sourceLineNo">137</span> * SKIP INCLUDE
INCLUDE INCLUDE SKIP SKIP
SKIP SKIP<a name="line.137"></a>
-<span class="sourceLineNo">138</span> * NEXT_COL INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_NEXT_COL SKIP NEXT_COL
NEXT_COL SKIP<a name="line.138"></a>
-<span class="sourceLineNo">139</span> * NEXT_ROW INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_SEEK_NEXT_ROW SKIP NEXT_COL
NEXT_ROW SKIP<a name="line.139"></a>
-<span class="sourceLineNo">140</span> * SEEK_NEXT_USING_HINT INCLUDE
INCLUDE INCLUDE SKIP SKIP
SKIP SEEK_NEXT_USING_HINT<a name="line.140"></a>
-<span class="sourceLineNo">141</span> * </pre><a name="line.141"></a>
-<span class="sourceLineNo">142</span> *<a name="line.142"></a>
-<span class="sourceLineNo">143</span> * @param rc Return code which is
calculated by previous sub-filter(s) in filter list.<a name="line.143"></a>
-<span class="sourceLineNo">144</span> * @param localRC Return code of the
current sub-filter in filter list.<a name="line.144"></a>
-<span class="sourceLineNo">145</span> * @return Return code which is merged
by the return code of previous sub-filter(s) and the return<a
name="line.145"></a>
-<span class="sourceLineNo">146</span> * code of current
sub-filter.<a name="line.146"></a>
-<span class="sourceLineNo">147</span> */<a name="line.147"></a>
-<span class="sourceLineNo">148</span> private ReturnCode
mergeReturnCode(ReturnCode rc, ReturnCode localRC) {<a name="line.148"></a>
-<span class="sourceLineNo">149</span> if (rc == null) return localRC;<a
name="line.149"></a>
-<span class="sourceLineNo">150</span> switch (localRC) {<a
name="line.150"></a>
-<span class="sourceLineNo">151</span> case INCLUDE:<a name="line.151"></a>
-<span class="sourceLineNo">152</span> return ReturnCode.INCLUDE;<a
name="line.152"></a>
-<span class="sourceLineNo">153</span> case INCLUDE_AND_NEXT_COL:<a
name="line.153"></a>
-<span class="sourceLineNo">154</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE, ReturnCode.SKIP,<a name="line.154"></a>
-<span class="sourceLineNo">155</span> ReturnCode.SEEK_NEXT_USING_HINT))
{<a name="line.155"></a>
-<span class="sourceLineNo">156</span> return ReturnCode.INCLUDE;<a
name="line.156"></a>
-<span class="sourceLineNo">157</span> }<a name="line.157"></a>
-<span class="sourceLineNo">158</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_NEXT_COL, ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW,<a
name="line.158"></a>
-<span class="sourceLineNo">159</span> ReturnCode.NEXT_COL,
ReturnCode.NEXT_ROW)) {<a name="line.159"></a>
-<span class="sourceLineNo">160</span> return
ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.160"></a>
-<span class="sourceLineNo">161</span> }<a name="line.161"></a>
-<span class="sourceLineNo">162</span> break;<a name="line.162"></a>
-<span class="sourceLineNo">163</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a
name="line.163"></a>
-<span class="sourceLineNo">164</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE, ReturnCode.SKIP,<a name="line.164"></a>
-<span class="sourceLineNo">165</span> ReturnCode.SEEK_NEXT_USING_HINT))
{<a name="line.165"></a>
-<span class="sourceLineNo">166</span> return ReturnCode.INCLUDE;<a
name="line.166"></a>
-<span class="sourceLineNo">167</span> }<a name="line.167"></a>
-<span class="sourceLineNo">168</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_NEXT_COL, ReturnCode.NEXT_COL)) {<a name="line.168"></a>
-<span class="sourceLineNo">169</span> return
ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.169"></a>
-<span class="sourceLineNo">170</span> }<a name="line.170"></a>
-<span class="sourceLineNo">171</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW, ReturnCode.NEXT_ROW)) {<a
name="line.171"></a>
-<span class="sourceLineNo">172</span> return
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW;<a name="line.172"></a>
-<span class="sourceLineNo">173</span> }<a name="line.173"></a>
-<span class="sourceLineNo">174</span> break;<a name="line.174"></a>
-<span class="sourceLineNo">175</span> case SKIP:<a name="line.175"></a>
-<span class="sourceLineNo">176</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE, ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.176"></a>
-<span class="sourceLineNo">177</span>
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.177"></a>
-<span class="sourceLineNo">178</span> return ReturnCode.INCLUDE;<a
name="line.178"></a>
-<span class="sourceLineNo">179</span> }<a name="line.179"></a>
-<span class="sourceLineNo">180</span> if (isInReturnCodes(rc,
ReturnCode.SKIP, ReturnCode.NEXT_COL, ReturnCode.NEXT_ROW,<a
name="line.180"></a>
-<span class="sourceLineNo">181</span> ReturnCode.SEEK_NEXT_USING_HINT))
{<a name="line.181"></a>
-<span class="sourceLineNo">182</span> return ReturnCode.SKIP;<a
name="line.182"></a>
-<span class="sourceLineNo">183</span> }<a name="line.183"></a>
-<span class="sourceLineNo">184</span> break;<a name="line.184"></a>
-<span class="sourceLineNo">185</span> case NEXT_COL:<a name="line.185"></a>
-<span class="sourceLineNo">186</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE)) {<a name="line.186"></a>
-<span class="sourceLineNo">187</span> return ReturnCode.INCLUDE;<a
name="line.187"></a>
-<span class="sourceLineNo">188</span> }<a name="line.188"></a>
-<span class="sourceLineNo">189</span> if (isInReturnCodes(rc,
ReturnCode.NEXT_COL, ReturnCode.NEXT_ROW)) {<a name="line.189"></a>
-<span class="sourceLineNo">190</span> return ReturnCode.NEXT_COL;<a
name="line.190"></a>
-<span class="sourceLineNo">191</span> }<a name="line.191"></a>
-<span class="sourceLineNo">192</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.192"></a>
-<span class="sourceLineNo">193</span>
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.193"></a>
-<span class="sourceLineNo">194</span> return
ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.194"></a>
-<span class="sourceLineNo">195</span> }<a name="line.195"></a>
-<span class="sourceLineNo">196</span> if (isInReturnCodes(rc,
ReturnCode.SKIP, ReturnCode.SEEK_NEXT_USING_HINT)) {<a name="line.196"></a>
-<span class="sourceLineNo">197</span> return ReturnCode.SKIP;<a
name="line.197"></a>
-<span class="sourceLineNo">198</span> }<a name="line.198"></a>
-<span class="sourceLineNo">199</span> break;<a name="line.199"></a>
-<span class="sourceLineNo">200</span> case NEXT_ROW:<a name="line.200"></a>
-<span class="sourceLineNo">201</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE)) {<a name="line.201"></a>
-<span class="sourceLineNo">202</span> return ReturnCode.INCLUDE;<a
name="line.202"></a>
-<span class="sourceLineNo">203</span> }<a name="line.203"></a>
-<span class="sourceLineNo">204</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_NEXT_COL)) {<a name="line.204"></a>
-<span class="sourceLineNo">205</span> return
ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.205"></a>
-<span class="sourceLineNo">206</span> }<a name="line.206"></a>
-<span class="sourceLineNo">207</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.207"></a>
-<span class="sourceLineNo">208</span> return
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW;<a name="line.208"></a>
-<span class="sourceLineNo">209</span> }<a name="line.209"></a>
-<span class="sourceLineNo">210</span> if (isInReturnCodes(rc,
ReturnCode.SKIP, ReturnCode.SEEK_NEXT_USING_HINT)) {<a name="line.210"></a>
-<span class="sourceLineNo">211</span> return ReturnCode.SKIP;<a
name="line.211"></a>
-<span class="sourceLineNo">212</span> }<a name="line.212"></a>
-<span class="sourceLineNo">213</span> if (isInReturnCodes(rc,
ReturnCode.NEXT_COL)) {<a name="line.213"></a>
-<span class="sourceLineNo">214</span> return ReturnCode.NEXT_COL;<a
name="line.214"></a>
-<span class="sourceLineNo">215</span> }<a name="line.215"></a>
-<span class="sourceLineNo">216</span> if (isInReturnCodes(rc,
ReturnCode.NEXT_ROW)) {<a name="line.216"></a>
-<span class="sourceLineNo">217</span> return ReturnCode.NEXT_ROW;<a
name="line.217"></a>
-<span class="sourceLineNo">218</span> }<a name="line.218"></a>
-<span class="sourceLineNo">219</span> break;<a name="line.219"></a>
-<span class="sourceLineNo">220</span> case SEEK_NEXT_USING_HINT:<a
name="line.220"></a>
-<span class="sourceLineNo">221</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE, ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.221"></a>
-<span class="sourceLineNo">222</span>
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.222"></a>
-<span class="sourceLineNo">223</span> return ReturnCode.INCLUDE;<a
name="line.223"></a>
-<span class="sourceLineNo">224</span> }<a name="line.224"></a>
-<span class="sourceLineNo">225</span> if (isInReturnCodes(rc,
ReturnCode.SKIP, ReturnCode.NEXT_COL, ReturnCode.NEXT_ROW)) {<a
name="line.225"></a>
-<span class="sourceLineNo">226</span> return ReturnCode.SKIP;<a
name="line.226"></a>
-<span class="sourceLineNo">227</span> }<a name="line.227"></a>
-<span class="sourceLineNo">228</span> if (isInReturnCodes(rc,
ReturnCode.SEEK_NEXT_USING_HINT)) {<a name="line.228"></a>
-<span class="sourceLineNo">229</span> return
ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.229"></a>
-<span class="sourceLineNo">230</span> }<a name="line.230"></a>
-<span class="sourceLineNo">231</span> break;<a name="line.231"></a>
-<span class="sourceLineNo">232</span> }<a name="line.232"></a>
-<span class="sourceLineNo">233</span> throw new IllegalStateException(<a
name="line.233"></a>
-<span class="sourceLineNo">234</span> "Received code is not valid. rc:
" + rc + ", localRC: " + localRC);<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> private void updatePrevFilterRCList(int
index, ReturnCode currentRC) {<a name="line.237"></a>
-<span class="sourceLineNo">238</span> prevFilterRCList.set(index,
currentRC);<a name="line.238"></a>
-<span class="sourceLineNo">239</span> }<a name="line.239"></a>
-<span class="sourceLineNo">240</span><a name="line.240"></a>
-<span class="sourceLineNo">241</span> private void updatePrevCellList(int
index, Cell currentCell, ReturnCode currentRC) {<a name="line.241"></a>
-<span class="sourceLineNo">242</span> if (currentCell == null || currentRC
== ReturnCode.INCLUDE || currentRC == ReturnCode.SKIP) {<a name="line.242"></a>
-<span class="sourceLineNo">243</span> // If previous return code is
INCLUDE or SKIP, we should always pass the next cell to the<a
name="line.243"></a>
-<span class="sourceLineNo">244</span> // corresponding sub-filter(need
not test shouldPassCurrentCellToFilter() method), So we<a name="line.244"></a>
-<span class="sourceLineNo">245</span> // need not save current cell to
prevCellList for saving heap memory.<a name="line.245"></a>
-<span class="sourceLineNo">246</span> prevCellList.set(index, null);<a
name="line.246"></a>
-<span class="sourceLineNo">247</span> } else {<a name="line.247"></a>
-<span class="sourceLineNo">248</span> prevCellList.set(index,
KeyValueUtil.toNewKeyCell(currentCell));<a name="line.248"></a>
-<span class="sourceLineNo">249</span> }<a name="line.249"></a>
-<span class="sourceLineNo">250</span> }<a name="line.250"></a>
-<span class="sourceLineNo">251</span><a name="line.251"></a>
-<span class="sourceLineNo">252</span> @Override<a name="line.252"></a>
-<span class="sourceLineNo">253</span> public ReturnCode filterCell(Cell c)
throws IOException {<a name="line.253"></a>
-<span class="sourceLineNo">254</span> if (isEmpty()) {<a
name="line.254"></a>
-<span class="sourceLineNo">255</span> return ReturnCode.INCLUDE;<a
name="line.255"></a>
-<span class="sourceLineNo">256</span> }<a name="line.256"></a>
-<span class="sourceLineNo">257</span> ReturnCode rc = null;<a
name="line.257"></a>
-<span class="sourceLineNo">258</span> boolean everyFilterReturnHint =
true;<a name="line.258"></a>
-<span class="sourceLineNo">259</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.259"></a>
-<span class="sourceLineNo">260</span> Filter filter = filters.get(i);<a
name="line.260"></a>
-<span class="sourceLineNo">261</span> subFiltersIncludedCell.set(i,
false);<a name="line.261"></a>
-<span class="sourceLineNo">262</span><a name="line.262"></a>
-<span class="sourceLineNo">263</span> Cell prevCell =
this.prevCellList.get(i);<a name="line.263"></a>
-<span class="sourceLineNo">264</span> ReturnCode prevCode =
this.prevFilterRCList.get(i);<a name="line.264"></a>
-<span class="sourceLineNo">265</span> if (filter.filterAllRemaining() ||
!shouldPassCurrentCellToFilter(prevCell, c, prevCode)) {<a name="line.265"></a>
-<span class="sourceLineNo">266</span> everyFilterReturnHint = false;<a
name="line.266"></a>
-<span class="sourceLineNo">267</span> continue;<a name="line.267"></a>
-<span class="sourceLineNo">268</span> }<a name="line.268"></a>
-<span class="sourceLineNo">269</span><a name="line.269"></a>
-<span class="sourceLineNo">270</span> ReturnCode localRC =
filter.filterCell(c);<a name="line.270"></a>
-<span class="sourceLineNo">271</span><a name="line.271"></a>
-<span class="sourceLineNo">272</span> // Update previous return code and
previous cell for filter[i].<a name="line.272"></a>
-<span class="sourceLineNo">273</span> updatePrevFilterRCList(i,
localRC);<a name="line.273"></a>
-<span class="sourceLineNo">274</span> updatePrevCellList(i, c,
localRC);<a name="line.274"></a>
-<span class="sourceLineNo">275</span><a name="line.275"></a>
-<span class="sourceLineNo">276</span> if (localRC !=
ReturnCode.SEEK_NEXT_USING_HINT) {<a name="line.276"></a>
-<span class="sourceLineNo">277</span> everyFilterReturnHint = false;<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> rc = mergeReturnCode(rc,
localRC);<a name="line.280"></a>
-<span class="sourceLineNo">281</span><a name="line.281"></a>
-<span class="sourceLineNo">282</span> // For INCLUDE* case, we need to
update the transformed cell.<a name="line.282"></a>
-<span class="sourceLineNo">283</span> if (isInReturnCodes(localRC,
ReturnCode.INCLUDE, ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.283"></a>
-<span class="sourceLineNo">284</span>
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.284"></a>
-<span class="sourceLineNo">285</span> subFiltersIncludedCell.set(i,
true);<a name="line.285"></a>
-<span class="sourceLineNo">286</span> }<a name="line.286"></a>
-<span class="sourceLineNo">287</span> }<a name="line.287"></a>
-<span class="sourceLineNo">288</span><a name="line.288"></a>
-<span class="sourceLineNo">289</span> if (everyFilterReturnHint) {<a
name="line.289"></a>
-<span class="sourceLineNo">290</span> return
ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.290"></a>
-<span class="sourceLineNo">291</span> } else if (rc == null) {<a
name="line.291"></a>
-<span class="sourceLineNo">292</span> // Each sub-filter in filter list
got true for filterAllRemaining().<a name="line.292"></a>
-<span class="sourceLineNo">293</span> return ReturnCode.SKIP;<a
name="line.293"></a>
-<span class="sourceLineNo">294</span> } else {<a name="line.294"></a>
-<span class="sourceLineNo">295</span> return rc;<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><a name="line.298"></a>
-<span class="sourceLineNo">299</span> @Override<a name="line.299"></a>
-<span class="sourceLineNo">300</span> public void reset() throws IOException
{<a name="line.300"></a>
-<span class="sourceLineNo">301</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.301"></a>
-<span class="sourceLineNo">302</span> filters.get(i).reset();<a
name="line.302"></a>
-<span class="sourceLineNo">303</span> subFiltersIncludedCell.set(i,
false);<a name="line.303"></a>
-<span class="sourceLineNo">304</span> prevFilterRCList.set(i, null);<a
name="line.304"></a>
-<span class="sourceLineNo">305</span> prevCellList.set(i, null);<a
name="line.305"></a>
-<span class="sourceLineNo">306</span> }<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> @Override<a name="line.309"></a>
-<span class="sourceLineNo">310</span> public boolean filterRowKey(byte[]
rowKey, int offset, int length) throws IOException {<a name="line.310"></a>
-<span class="sourceLineNo">311</span> if (isEmpty()) {<a
name="line.311"></a>
-<span class="sourceLineNo">312</span> return super.filterRowKey(rowKey,
offset, length);<a name="line.312"></a>
-<span class="sourceLineNo">313</span> }<a name="line.313"></a>
-<span class="sourceLineNo">314</span> boolean retVal = true;<a
name="line.314"></a>
-<span class="sourceLineNo">315</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.315"></a>
-<span class="sourceLineNo">316</span> Filter filter = filters.get(i);<a
name="line.316"></a>
-<span class="sourceLineNo">317</span> if (!filter.filterAllRemaining()
&& !filter.filterRowKey(rowKey, offset, length)) {<a
name="line.317"></a>
-<span class="sourceLineNo">318</span> retVal = false;<a
name="line.318"></a>
-<span class="sourceLineNo">319</span> }<a name="line.319"></a>
-<span class="sourceLineNo">320</span> }<a name="line.320"></a>
-<span class="sourceLineNo">321</span> return retVal;<a name="line.321"></a>
-<span class="sourceLineNo">322</span> }<a name="line.322"></a>
-<span class="sourceLineNo">323</span><a name="line.323"></a>
-<span class="sourceLineNo">324</span> @Override<a name="line.324"></a>
-<span class="sourceLineNo">325</span> public boolean filterRowKey(Cell
firstRowCell) throws IOException {<a name="line.325"></a>
-<span class="sourceLineNo">326</span> if (isEmpty()) {<a
name="line.326"></a>
-<span class="sourceLineNo">327</span> return
super.filterRowKey(firstRowCell);<a name="line.327"></a>
-<span class="sourceLineNo">328</span> }<a name="line.328"></a>
-<span class="sourceLineNo">329</span> boolean retVal = true;<a
name="line.329"></a>
-<span class="sourceLineNo">330</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.330"></a>
-<span class="sourceLineNo">331</span> Filter filter = filters.get(i);<a
name="line.331"></a>
-<span class="sourceLineNo">332</span> if (!filter.filterAllRemaining()
&& !filter.filterRowKey(firstRowCell)) {<a name="line.332"></a>
-<span class="sourceLineNo">333</span> // Can't just return false here,
because there are some filters (such as PrefixFilter) which<a
name="line.333"></a>
-<span class="sourceLineNo">334</span> // will catch the row changed
event by filterRowKey(). If we return early here, those<a name="line.334"></a>
-<span class="sourceLineNo">335</span> // filters will have no chance to
update their row state.<a name="line.335"></a>
-<span class="sourceLineNo">336</span> retVal = false;<a
name="line.336"></a>
-<span class="sourceLineNo">337</span> }<a name="line.337"></a>
-<span class="sourceLineNo">338</span> }<a name="line.338"></a>
-<span class="sourceLineNo">339</span> return retVal;<a name="line.339"></a>
-<span class="sourceLineNo">340</span> }<a name="line.340"></a>
-<span class="sourceLineNo">341</span><a name="line.341"></a>
-<span class="sourceLineNo">342</span> @Override<a name="line.342"></a>
-<span class="sourceLineNo">343</span> public boolean filterAllRemaining()
throws IOException {<a name="line.343"></a>
-<span class="sourceLineNo">344</span> if (isEmpty()) {<a
name="line.344"></a>
-<span class="sourceLineNo">345</span> return
super.filterAllRemaining();<a name="line.345"></a>
-<span class="sourceLineNo">346</span> }<a name="line.346"></a>
-<span class="sourceLineNo">347</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.347"></a>
-<span class="sourceLineNo">348</span> if
(!filters.get(i).filterAllRemaining()) {<a name="line.348"></a>
-<span class="sourceLineNo">349</span> return false;<a
name="line.349"></a>
-<span class="sourceLineNo">350</span> }<a name="line.350"></a>
-<span class="sourceLineNo">351</span> }<a name="line.351"></a>
-<span class="sourceLineNo">352</span> return true;<a name="line.352"></a>
-<span class="sourceLineNo">353</span> }<a name="line.353"></a>
-<span class="sourceLineNo">354</span><a name="line.354"></a>
-<span class="sourceLineNo">355</span> @Override<a name="line.355"></a>
-<span class="sourceLineNo">356</span> public boolean filterRow() throws
IOException {<a name="line.356"></a>
-<span class="sourceLineNo">357</span> if (isEmpty()) {<a
name="line.357"></a>
-<span class="sourceLineNo">358</span> return super.filterRow();<a
name="line.358"></a>
-<span class="sourceLineNo">359</span> }<a name="line.359"></a>
-<span class="sourceLineNo">360</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.360"></a>
-<span class="sourceLineNo">361</span> Filter filter = filters.get(i);<a
name="line.361"></a>
-<span class="sourceLineNo">362</span> if (!filter.filterRow()) {<a
name="line.362"></a>
-<span class="sourceLineNo">363</span> return false;<a
name="line.363"></a>
-<span class="sourceLineNo">364</span> }<a name="line.364"></a>
-<span class="sourceLineNo">365</span> }<a name="line.365"></a>
-<span class="sourceLineNo">366</span> return true;<a name="line.366"></a>
-<span class="sourceLineNo">367</span> }<a name="line.367"></a>
-<span class="sourceLineNo">368</span><a name="line.368"></a>
-<span class="sourceLineNo">369</span> @Override<a name="line.369"></a>
-<span class="sourceLineNo">370</span> public Cell getNextCellHint(Cell
currentCell) throws IOException {<a name="line.370"></a>
-<span class="sourceLineNo">371</span> if (isEmpty()) {<a
name="line.371"></a>
-<span class="sourceLineNo">372</span> return
super.getNextCellHint(currentCell);<a name="line.372"></a>
-<span class="sourceLineNo">373</span> }<a name="line.373"></a>
-<span class="sourceLineNo">374</span> Cell minKeyHint = null;<a
name="line.374"></a>
-<span class="sourceLineNo">375</span> // If any condition can pass, we need
to keep the min hint<a name="line.375"></a>
-<span class="sourceLineNo">376</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.376"></a>
-<span class="sourceLineNo">377</span> if
(filters.get(i).filterAllRemaining()) {<a name="line.377"></a>
-<span class="sourceLineNo">378</span> continue;<a name="line.378"></a>
-<span class="sourceLineNo">379</span> }<a name="line.379"></a>
-<span class="sourceLineNo">380</span> Cell curKeyHint =
filters.get(i).getNextCellHint(currentCell);<a name="line.380"></a>
-<span class="sourceLineNo">381</span> if (curKeyHint == null) {<a
name="line.381"></a>
-<span class="sourceLineNo">382</span> // If we ever don't have a hint
and this is must-pass-one, then no hint<a name="line.382"></a>
-<span class="sourceLineNo">383</span> return null;<a
name="line.383"></a>
-<span class="sourceLineNo">384</span> }<a name="line.384"></a>
-<span class="sourceLineNo">385</span> // If this is the first hint we
find, set it<a name="line.385"></a>
-<span class="sourceLineNo">386</span> if (minKeyHint == null) {<a
name="line.386"></a>
-<span class="sourceLineNo">387</span> minKeyHint = curKeyHint;<a
name="line.387"></a>
-<span class="sourceLineNo">388</span> continue;<a name="line.388"></a>
-<span class="sourceLineNo">389</span> }<a name="line.389"></a>
-<span class="sourceLineNo">390</span> if (this.compareCell(minKeyHint,
curKeyHint) > 0) {<a name="line.390"></a>
-<span class="sourceLineNo">391</span> minKeyHint = curKeyHint;<a
name="line.391"></a>
-<span class="sourceLineNo">392</span> }<a name="line.392"></a>
-<span class="sourceLineNo">393</span> }<a name="line.393"></a>
-<span class="sourceLineNo">394</span> return minKeyHint;<a
name="line.394"></a>
-<span class="sourceLineNo">395</span> }<a name="line.395"></a>
+<span class="sourceLineNo">029</span>import java.util.Collections;<a
name="line.29"></a>
+<span class="sourceLineNo">030</span>import java.util.List;<a
name="line.30"></a>
+<span class="sourceLineNo">031</span>import java.util.Objects;<a
name="line.31"></a>
+<span class="sourceLineNo">032</span><a name="line.32"></a>
+<span class="sourceLineNo">033</span>/**<a name="line.33"></a>
+<span class="sourceLineNo">034</span> * FilterListWithOR represents an ordered
list of filters which will be evaluated with an OR<a name="line.34"></a>
+<span class="sourceLineNo">035</span> * operator.<a name="line.35"></a>
+<span class="sourceLineNo">036</span> */<a name="line.36"></a>
+<span class="sourceLineNo">037</span>@InterfaceAudience.Private<a
name="line.37"></a>
+<span class="sourceLineNo">038</span>public class FilterListWithOR extends
FilterListBase {<a name="line.38"></a>
+<span class="sourceLineNo">039</span><a name="line.39"></a>
+<span class="sourceLineNo">040</span> /**<a name="line.40"></a>
+<span class="sourceLineNo">041</span> * Save previous return code and
previous cell for every filter in filter list. For MUST_PASS_ONE,<a
name="line.41"></a>
+<span class="sourceLineNo">042</span> * we use the previous return code to
decide whether we should pass current cell encountered to<a name="line.42"></a>
+<span class="sourceLineNo">043</span> * the filter. For MUST_PASS_ALL, the
two list are meaningless.<a name="line.43"></a>
+<span class="sourceLineNo">044</span> */<a name="line.44"></a>
+<span class="sourceLineNo">045</span> private List<ReturnCode>
prevFilterRCList = null;<a name="line.45"></a>
+<span class="sourceLineNo">046</span> private List<Cell> prevCellList =
null;<a name="line.46"></a>
+<span class="sourceLineNo">047</span><a name="line.47"></a>
+<span class="sourceLineNo">048</span> public
FilterListWithOR(List<Filter> filters) {<a name="line.48"></a>
+<span class="sourceLineNo">049</span> super(filters);<a name="line.49"></a>
+<span class="sourceLineNo">050</span> prevFilterRCList = new
ArrayList<>(Collections.nCopies(filters.size(), null));<a
name="line.50"></a>
+<span class="sourceLineNo">051</span> prevCellList = new
ArrayList<>(Collections.nCopies(filters.size(), null));<a
name="line.51"></a>
+<span class="sourceLineNo">052</span> subFiltersIncludedCell = new
ArrayList<>(Collections.nCopies(filters.size(), false));<a
name="line.52"></a>
+<span class="sourceLineNo">053</span> }<a name="line.53"></a>
+<span class="sourceLineNo">054</span><a name="line.54"></a>
+<span class="sourceLineNo">055</span> @Override<a name="line.55"></a>
+<span class="sourceLineNo">056</span> public void
addFilterLists(List<Filter> filters) {<a name="line.56"></a>
+<span class="sourceLineNo">057</span> if (checkAndGetReversed(filters,
isReversed()) != isReversed()) {<a name="line.57"></a>
+<span class="sourceLineNo">058</span> throw new
IllegalArgumentException("Filters in the list must have the same reversed
flag");<a name="line.58"></a>
+<span class="sourceLineNo">059</span> }<a name="line.59"></a>
+<span class="sourceLineNo">060</span> this.filters.addAll(filters);<a
name="line.60"></a>
+<span class="sourceLineNo">061</span>
this.subFiltersIncludedCell.addAll(Collections.nCopies(filters.size(),
false));<a name="line.61"></a>
+<span class="sourceLineNo">062</span>
this.prevFilterRCList.addAll(Collections.nCopies(filters.size(), null));<a
name="line.62"></a>
+<span class="sourceLineNo">063</span>
this.prevCellList.addAll(Collections.nCopies(filters.size(), null));<a
name="line.63"></a>
+<span class="sourceLineNo">064</span> }<a name="line.64"></a>
+<span class="sourceLineNo">065</span><a name="line.65"></a>
+<span class="sourceLineNo">066</span> @Override<a name="line.66"></a>
+<span class="sourceLineNo">067</span> protected String
formatLogFilters(List<Filter> logFilters) {<a name="line.67"></a>
+<span class="sourceLineNo">068</span> return String.format("FilterList OR
(%d/%d): %s", logFilters.size(), this.size(),<a name="line.68"></a>
+<span class="sourceLineNo">069</span> logFilters.toString());<a
name="line.69"></a>
+<span class="sourceLineNo">070</span> }<a name="line.70"></a>
+<span class="sourceLineNo">071</span><a name="line.71"></a>
+<span class="sourceLineNo">072</span> /**<a name="line.72"></a>
+<span class="sourceLineNo">073</span> * For MUST_PASS_ONE, we cannot make
sure that when filter-A in filter list return NEXT_COL then<a
name="line.73"></a>
+<span class="sourceLineNo">074</span> * the next cell passing to filterList
will be the first cell in next column, because if filter-B<a name="line.74"></a>
+<span class="sourceLineNo">075</span> * in filter list return SKIP, then the
filter list will return SKIP. In this case, we should pass<a name="line.75"></a>
+<span class="sourceLineNo">076</span> * the cell following the previous
cell, and it's possible that the next cell has the same column<a
name="line.76"></a>
+<span class="sourceLineNo">077</span> * as the previous cell even if
filter-A has NEXT_COL returned for the previous cell. So we should<a
name="line.77"></a>
+<span class="sourceLineNo">078</span> * save the previous cell and the
return code list when checking previous cell for every filter in<a
name="line.78"></a>
+<span class="sourceLineNo">079</span> * filter list, and verify if
currentCell fit the previous return code, if fit then pass the<a
name="line.79"></a>
+<span class="sourceLineNo">080</span> * currentCell to the corresponding
filter. (HBASE-17678) <br><a name="line.80"></a>
+<span class="sourceLineNo">081</span> * Note that: In StoreScanner level,
NEXT_ROW will skip to the next row in current family, and in<a
name="line.81"></a>
+<span class="sourceLineNo">082</span> * RegionScanner level, NEXT_ROW will
skip to the next row in current family and switch to the<a name="line.82"></a>
+<span class="sourceLineNo">083</span> * next family for RegionScanner,
INCLUDE_AND_NEXT_ROW is the same. so we should pass current cell<a
name="line.83"></a>
+<span class="sourceLineNo">084</span> * to the filter, if row mismatch or
row match but column family mismatch. (HBASE-18368)<a name="line.84"></a>
+<span class="sourceLineNo">085</span> * @see
org.apache.hadoop.hbase.filter.Filter.ReturnCode<a name="line.85"></a>
+<span class="sourceLineNo">086</span> */<a name="line.86"></a>
+<span class="sourceLineNo">087</span> private boolean
shouldPassCurrentCellToFilter(Cell prevCell, Cell currentCell,<a
name="line.87"></a>
+<span class="sourceLineNo">088</span> ReturnCode prevCode) throws
IOException {<a name="line.88"></a>
+<span class="sourceLineNo">089</span> if (prevCell == null || prevCode ==
null) {<a name="line.89"></a>
+<span class="sourceLineNo">090</span> return true;<a name="line.90"></a>
+<span class="sourceLineNo">091</span> }<a name="line.91"></a>
+<span class="sourceLineNo">092</span> switch (prevCode) {<a
name="line.92"></a>
+<span class="sourceLineNo">093</span> case INCLUDE:<a name="line.93"></a>
+<span class="sourceLineNo">094</span> case SKIP:<a name="line.94"></a>
+<span class="sourceLineNo">095</span> return true;<a name="line.95"></a>
+<span class="sourceLineNo">096</span> case SEEK_NEXT_USING_HINT:<a
name="line.96"></a>
+<span class="sourceLineNo">097</span> Cell nextHintCell =
getNextCellHint(prevCell);<a name="line.97"></a>
+<span class="sourceLineNo">098</span> return nextHintCell == null ||
this.compareCell(currentCell, nextHintCell) >= 0;<a name="line.98"></a>
+<span class="sourceLineNo">099</span> case NEXT_COL:<a name="line.99"></a>
+<span class="sourceLineNo">100</span> case INCLUDE_AND_NEXT_COL:<a
name="line.100"></a>
+<span class="sourceLineNo">101</span> // Once row changed, reset() will
clear prevCells, so we need not to compare their rows<a name="line.101"></a>
+<span class="sourceLineNo">102</span> // because rows are the same
here.<a name="line.102"></a>
+<span class="sourceLineNo">103</span> return
!CellUtil.matchingColumn(prevCell, currentCell);<a name="line.103"></a>
+<span class="sourceLineNo">104</span> case NEXT_ROW:<a name="line.104"></a>
+<span class="sourceLineNo">105</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a
name="line.105"></a>
+<span class="sourceLineNo">106</span> // As described above, rows are
definitely the same, so we only compare the family.<a name="line.106"></a>
+<span class="sourceLineNo">107</span> return
!CellUtil.matchingFamily(prevCell, currentCell);<a name="line.107"></a>
+<span class="sourceLineNo">108</span> default:<a name="line.108"></a>
+<span class="sourceLineNo">109</span> throw new
IllegalStateException("Received code is not valid.");<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><a name="line.112"></a>
+<span class="sourceLineNo">113</span> /**<a name="line.113"></a>
+<span class="sourceLineNo">114</span> * FilterList with MUST_PASS_ONE choose
the minimal forward step among sub-filter in filter list.<a name="line.114"></a>
+<span class="sourceLineNo">115</span> * Let's call it: The Minimal Step
Rule. So if filter-A in filter list return INCLUDE and filter-B<a
name="line.115"></a>
+<span class="sourceLineNo">116</span> * in filter list return
INCLUDE_AND_NEXT_COL, then the filter list should return INCLUDE. For<a
name="line.116"></a>
+<span class="sourceLineNo">117</span> * SEEK_NEXT_USING_HINT, it's more
special, because we do not know how far it will forward, so we<a
name="line.117"></a>
+<span class="sourceLineNo">118</span> * use SKIP by default.<br/><a
name="line.118"></a>
+<span class="sourceLineNo">119</span> * <br/><a name="line.119"></a>
+<span class="sourceLineNo">120</span> * The jump step will be:<a
name="line.120"></a>
+<span class="sourceLineNo">121</span> *<a name="line.121"></a>
+<span class="sourceLineNo">122</span> * <pre><a name="line.122"></a>
+<span class="sourceLineNo">123</span> * INCLUDE &lt; SKIP &lt;
INCLUDE_AND_NEXT_COL &lt; NEXT_COL &lt; INCLUDE_AND_SEEK_NEXT_ROW
&lt; NEXT_ROW &lt; SEEK_NEXT_USING_HINT<a name="line.123"></a>
+<span class="sourceLineNo">124</span> * </pre><a name="line.124"></a>
+<span class="sourceLineNo">125</span> *<a name="line.125"></a>
+<span class="sourceLineNo">126</span> * Here, we have the following map to
describe The Minimal Step Rule. if current return code (for<a
name="line.126"></a>
+<span class="sourceLineNo">127</span> * previous sub-filters in filter list)
is <strong>ReturnCode</strong>, and current filter returns<a
name="line.127"></a>
+<span class="sourceLineNo">128</span> *
<strong>localRC</strong>, then we should return
map[ReturnCode][localRC] for the merged result,<a name="line.128"></a>
+<span class="sourceLineNo">129</span> * according to The Minimal Step
Rule.<br/><a name="line.129"></a>
+<span class="sourceLineNo">130</span> *<a name="line.130"></a>
+<span class="sourceLineNo">131</span> * <pre><a name="line.131"></a>
+<span class="sourceLineNo">132</span> * LocalCode\ReturnCode INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_SEEK_NEXT_ROW SKIP NEXT_COL
NEXT_ROW SEEK_NEXT_USING_HINT<a name="line.132"></a>
+<span class="sourceLineNo">133</span> * INCLUDE INCLUDE
INCLUDE INCLUDE INCLUDE INCLUDE
INCLUDE INCLUDE<a name="line.133"></a>
+<span class="sourceLineNo">134</span> * INCLUDE_AND_NEXT_COL INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_NEXT_COL INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_NEXT_COL INCLUDE<a name="line.134"></a>
+<span class="sourceLineNo">135</span> * INCLUDE_AND_SEEK_NEXT_ROW INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_SEEK_NEXT_ROW INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_SEEK_NEXT_ROW INCLUDE<a name="line.135"></a>
+<span class="sourceLineNo">136</span> * SKIP INCLUDE
INCLUDE INCLUDE SKIP SKIP
SKIP SKIP<a name="line.136"></a>
+<span class="sourceLineNo">137</span> * NEXT_COL INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_NEXT_COL SKIP NEXT_COL
NEXT_COL SKIP<a name="line.137"></a>
+<span class="sourceLineNo">138</span> * NEXT_ROW INCLUDE
INCLUDE_AND_NEXT_COL INCLUDE_AND_SEEK_NEXT_ROW SKIP NEXT_COL
NEXT_ROW SKIP<a name="line.138"></a>
+<span class="sourceLineNo">139</span> * SEEK_NEXT_USING_HINT INCLUDE
INCLUDE INCLUDE SKIP SKIP
SKIP SEEK_NEXT_USING_HINT<a name="line.139"></a>
+<span class="sourceLineNo">140</span> * </pre><a name="line.140"></a>
+<span class="sourceLineNo">141</span> *<a name="line.141"></a>
+<span class="sourceLineNo">142</span> * @param rc Return code which is
calculated by previous sub-filter(s) in filter list.<a name="line.142"></a>
+<span class="sourceLineNo">143</span> * @param localRC Return code of the
current sub-filter in filter list.<a name="line.143"></a>
+<span class="sourceLineNo">144</span> * @return Return code which is merged
by the return code of previous sub-filter(s) and the return<a
name="line.144"></a>
+<span class="sourceLineNo">145</span> * code of current
sub-filter.<a name="line.145"></a>
+<span class="sourceLineNo">146</span> */<a name="line.146"></a>
+<span class="sourceLineNo">147</span> private ReturnCode
mergeReturnCode(ReturnCode rc, ReturnCode localRC) {<a name="line.147"></a>
+<span class="sourceLineNo">148</span> if (rc == null) return localRC;<a
name="line.148"></a>
+<span class="sourceLineNo">149</span> switch (localRC) {<a
name="line.149"></a>
+<span class="sourceLineNo">150</span> case INCLUDE:<a name="line.150"></a>
+<span class="sourceLineNo">151</span> return ReturnCode.INCLUDE;<a
name="line.151"></a>
+<span class="sourceLineNo">152</span> case INCLUDE_AND_NEXT_COL:<a
name="line.152"></a>
+<span class="sourceLineNo">153</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE, ReturnCode.SKIP,<a name="line.153"></a>
+<span class="sourceLineNo">154</span> ReturnCode.SEEK_NEXT_USING_HINT))
{<a name="line.154"></a>
+<span class="sourceLineNo">155</span> return ReturnCode.INCLUDE;<a
name="line.155"></a>
+<span class="sourceLineNo">156</span> }<a name="line.156"></a>
+<span class="sourceLineNo">157</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_NEXT_COL, ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW,<a
name="line.157"></a>
+<span class="sourceLineNo">158</span> ReturnCode.NEXT_COL,
ReturnCode.NEXT_ROW)) {<a name="line.158"></a>
+<span class="sourceLineNo">159</span> return
ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.159"></a>
+<span class="sourceLineNo">160</span> }<a name="line.160"></a>
+<span class="sourceLineNo">161</span> break;<a name="line.161"></a>
+<span class="sourceLineNo">162</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a
name="line.162"></a>
+<span class="sourceLineNo">163</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE, ReturnCode.SKIP,<a name="line.163"></a>
+<span class="sourceLineNo">164</span> ReturnCode.SEEK_NEXT_USING_HINT))
{<a name="line.164"></a>
+<span class="sourceLineNo">165</span> return ReturnCode.INCLUDE;<a
name="line.165"></a>
+<span class="sourceLineNo">166</span> }<a name="line.166"></a>
+<span class="sourceLineNo">167</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_NEXT_COL, ReturnCode.NEXT_COL)) {<a name="line.167"></a>
+<span class="sourceLineNo">168</span> return
ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.168"></a>
+<span class="sourceLineNo">169</span> }<a name="line.169"></a>
+<span class="sourceLineNo">170</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW, ReturnCode.NEXT_ROW)) {<a
name="line.170"></a>
+<span class="sourceLineNo">171</span> return
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW;<a name="line.171"></a>
+<span class="sourceLineNo">172</span> }<a name="line.172"></a>
+<span class="sourceLineNo">173</span> break;<a name="line.173"></a>
+<span class="sourceLineNo">174</span> case SKIP:<a name="line.174"></a>
+<span class="sourceLineNo">175</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE, ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.175"></a>
+<span class="sourceLineNo">176</span>
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.176"></a>
+<span class="sourceLineNo">177</span> return ReturnCode.INCLUDE;<a
name="line.177"></a>
+<span class="sourceLineNo">178</span> }<a name="line.178"></a>
+<span class="sourceLineNo">179</span> if (isInReturnCodes(rc,
ReturnCode.SKIP, ReturnCode.NEXT_COL, ReturnCode.NEXT_ROW,<a
name="line.179"></a>
+<span class="sourceLineNo">180</span> ReturnCode.SEEK_NEXT_USING_HINT))
{<a name="line.180"></a>
+<span class="sourceLineNo">181</span> return ReturnCode.SKIP;<a
name="line.181"></a>
+<span class="sourceLineNo">182</span> }<a name="line.182"></a>
+<span class="sourceLineNo">183</span> break;<a name="line.183"></a>
+<span class="sourceLineNo">184</span> case NEXT_COL:<a name="line.184"></a>
+<span class="sourceLineNo">185</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE)) {<a name="line.185"></a>
+<span class="sourceLineNo">186</span> return ReturnCode.INCLUDE;<a
name="line.186"></a>
+<span class="sourceLineNo">187</span> }<a name="line.187"></a>
+<span class="sourceLineNo">188</span> if (isInReturnCodes(rc,
ReturnCode.NEXT_COL, ReturnCode.NEXT_ROW)) {<a name="line.188"></a>
+<span class="sourceLineNo">189</span> return ReturnCode.NEXT_COL;<a
name="line.189"></a>
+<span class="sourceLineNo">190</span> }<a name="line.190"></a>
+<span class="sourceLineNo">191</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.191"></a>
+<span class="sourceLineNo">192</span>
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.192"></a>
+<span class="sourceLineNo">193</span> return
ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.193"></a>
+<span class="sourceLineNo">194</span> }<a name="line.194"></a>
+<span class="sourceLineNo">195</span> if (isInReturnCodes(rc,
ReturnCode.SKIP, ReturnCode.SEEK_NEXT_USING_HINT)) {<a name="line.195"></a>
+<span class="sourceLineNo">196</span> return ReturnCode.SKIP;<a
name="line.196"></a>
+<span class="sourceLineNo">197</span> }<a name="line.197"></a>
+<span class="sourceLineNo">198</span> break;<a name="line.198"></a>
+<span class="sourceLineNo">199</span> case NEXT_ROW:<a name="line.199"></a>
+<span class="sourceLineNo">200</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE)) {<a name="line.200"></a>
+<span class="sourceLineNo">201</span> return ReturnCode.INCLUDE;<a
name="line.201"></a>
+<span class="sourceLineNo">202</span> }<a name="line.202"></a>
+<span class="sourceLineNo">203</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_NEXT_COL)) {<a name="line.203"></a>
+<span class="sourceLineNo">204</span> return
ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.204"></a>
+<span class="sourceLineNo">205</span> }<a name="line.205"></a>
+<span class="sourceLineNo">206</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.206"></a>
+<span class="sourceLineNo">207</span> return
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW;<a name="line.207"></a>
+<span class="sourceLineNo">208</span> }<a name="line.208"></a>
+<span class="sourceLineNo">209</span> if (isInReturnCodes(rc,
ReturnCode.SKIP, ReturnCode.SEEK_NEXT_USING_HINT)) {<a name="line.209"></a>
+<span class="sourceLineNo">210</span> return ReturnCode.SKIP;<a
name="line.210"></a>
+<span class="sourceLineNo">211</span> }<a name="line.211"></a>
+<span class="sourceLineNo">212</span> if (isInReturnCodes(rc,
ReturnCode.NEXT_COL)) {<a name="line.212"></a>
+<span class="sourceLineNo">213</span> return ReturnCode.NEXT_COL;<a
name="line.213"></a>
+<span class="sourceLineNo">214</span> }<a name="line.214"></a>
+<span class="sourceLineNo">215</span> if (isInReturnCodes(rc,
ReturnCode.NEXT_ROW)) {<a name="line.215"></a>
+<span class="sourceLineNo">216</span> return ReturnCode.NEXT_ROW;<a
name="line.216"></a>
+<span class="sourceLineNo">217</span> }<a name="line.217"></a>
+<span class="sourceLineNo">218</span> break;<a name="line.218"></a>
+<span class="sourceLineNo">219</span> case SEEK_NEXT_USING_HINT:<a
name="line.219"></a>
+<span class="sourceLineNo">220</span> if (isInReturnCodes(rc,
ReturnCode.INCLUDE, ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.220"></a>
+<span class="sourceLineNo">221</span>
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.221"></a>
+<span class="sourceLineNo">222</span> return ReturnCode.INCLUDE;<a
name="line.222"></a>
+<span class="sourceLineNo">223</span> }<a name="line.223"></a>
+<span class="sourceLineNo">224</span> if (isInReturnCodes(rc,
ReturnCode.SKIP, ReturnCode.NEXT_COL, ReturnCode.NEXT_ROW)) {<a
name="line.224"></a>
+<span class="sourceLineNo">225</span> return ReturnCode.SKIP;<a
name="line.225"></a>
+<span class="sourceLineNo">226</span> }<a name="line.226"></a>
+<span class="sourceLineNo">227</span> if (isInReturnCodes(rc,
ReturnCode.SEEK_NEXT_USING_HINT)) {<a name="line.227"></a>
+<span class="sourceLineNo">228</span> return
ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.228"></a>
+<span class="sourceLineNo">229</span> }<a name="line.229"></a>
+<span class="sourceLineNo">230</span> break;<a name="line.230"></a>
+<span class="sourceLineNo">231</span> }<a name="line.231"></a>
+<span class="sourceLineNo">232</span> throw new IllegalStateException(<a
name="line.232"></a>
+<span class="sourceLineNo">233</span> "Received code is not valid. rc:
" + rc + ", localRC: " + localRC);<a name="line.233"></a>
+<span class="sourceLineNo">234</span> }<a name="line.234"></a>
+<span class="sourceLineNo">235</span><a name="line.235"></a>
+<span class="sourceLineNo">236</span> private void updatePrevFilterRCList(int
index, ReturnCode currentRC) {<a name="line.236"></a>
+<span class="sourceLineNo">237</span> prevFilterRCList.set(index,
currentRC);<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> private void updatePrevCellList(int
index, Cell currentCell, ReturnCode currentRC) {<a name="line.240"></a>
+<span class="sourceLineNo">241</span> if (currentCell == null || currentRC
== ReturnCode.INCLUDE || currentRC == ReturnCode.SKIP) {<a name="line.241"></a>
+<span class="sourceLineNo">242</span> // If previous return code is
INCLUDE or SKIP, we should always pass the next cell to the<a
name="line.242"></a>
+<span class="sourceLineNo">243</span> // corresponding sub-filter(need
not test shouldPassCurrentCellToFilter() method), So we<a name="line.243"></a>
+<span class="sourceLineNo">244</span> // need not save current cell to
prevCellList for saving heap memory.<a name="line.244"></a>
+<span class="sourceLineNo">245</span> prevCellList.set(index, null);<a
name="line.245"></a>
+<span class="sourceLineNo">246</span> } else {<a name="line.246"></a>
+<span class="sourceLineNo">247</span> prevCellList.set(index,
KeyValueUtil.toNewKeyCell(currentCell));<a name="line.247"></a>
+<span class="sourceLineNo">248</span> }<a name="line.248"></a>
+<span class="sourceLineNo">249</span> }<a name="line.249"></a>
+<span class="sourceLineNo">250</span><a name="line.250"></a>
+<span class="sourceLineNo">251</span> @Override<a name="line.251"></a>
+<span class="sourceLineNo">252</span> public ReturnCode filterCell(Cell c)
throws IOException {<a name="line.252"></a>
+<span class="sourceLineNo">253</span> if (isEmpty()) {<a
name="line.253"></a>
+<span class="sourceLineNo">254</span> return ReturnCode.INCLUDE;<a
name="line.254"></a>
+<span class="sourceLineNo">255</span> }<a name="line.255"></a>
+<span class="sourceLineNo">256</span> ReturnCode rc = null;<a
name="line.256"></a>
+<span class="sourceLineNo">257</span> boolean everyFilterReturnHint =
true;<a name="line.257"></a>
+<span class="sourceLineNo">258</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.258"></a>
+<span class="sourceLineNo">259</span> Filter filter = filters.get(i);<a
name="line.259"></a>
+<span class="sourceLineNo">260</span> subFiltersIncludedCell.set(i,
false);<a name="line.260"></a>
+<span class="sourceLineNo">261</span><a name="line.261"></a>
+<span class="sourceLineNo">262</span> Cell prevCell =
this.prevCellList.get(i);<a name="line.262"></a>
+<span class="sourceLineNo">263</span> ReturnCode prevCode =
this.prevFilterRCList.get(i);<a name="line.263"></a>
+<span class="sourceLineNo">264</span> if (filter.filterAllRemaining() ||
!shouldPassCurrentCellToFilter(prevCell, c, prevCode)) {<a name="line.264"></a>
+<span class="sourceLineNo">265</span> everyFilterReturnHint = false;<a
name="line.265"></a>
+<span class="sourceLineNo">266</span> continue;<a name="line.266"></a>
+<span class="sourceLineNo">267</span> }<a name="line.267"></a>
+<span class="sourceLineNo">268</span><a name="line.268"></a>
+<span class="sourceLineNo">269</span> ReturnCode localRC =
filter.filterCell(c);<a name="line.269"></a>
+<span class="sourceLineNo">270</span><a name="line.270"></a>
+<span class="sourceLineNo">271</span> // Update previous return code and
previous cell for filter[i].<a name="line.271"></a>
+<span class="sourceLineNo">272</span> updatePrevFilterRCList(i,
localRC);<a name="line.272"></a>
+<span class="sourceLineNo">273</span> updatePrevCellList(i, c,
localRC);<a name="line.273"></a>
+<span class="sourceLineNo">274</span><a name="line.274"></a>
+<span class="sourceLineNo">275</span> if (localRC !=
ReturnCode.SEEK_NEXT_USING_HINT) {<a name="line.275"></a>
+<span class="sourceLineNo">276</span> everyFilterReturnHint = false;<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> rc = mergeReturnCode(rc,
localRC);<a name="line.279"></a>
+<span class="sourceLineNo">280</span><a name="line.280"></a>
+<span class="sourceLineNo">281</span> // For INCLUDE* case, we need to
update the transformed cell.<a name="line.281"></a>
+<span class="sourceLineNo">282</span> if (isInReturnCodes(localRC,
ReturnCode.INCLUDE, ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.282"></a>
+<span class="sourceLineNo">283</span>
ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.283"></a>
+<span class="sourceLineNo">284</span> subFiltersIncludedCell.set(i,
true);<a name="line.284"></a>
+<span class="sourceLineNo">285</span> }<a name="line.285"></a>
+<span class="sourceLineNo">286</span> }<a name="line.286"></a>
+<span class="sourceLineNo">287</span><a name="line.287"></a>
+<span class="sourceLineNo">288</span> if (everyFilterReturnHint) {<a
name="line.288"></a>
+<span class="sourceLineNo">289</span> return
ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.289"></a>
+<span class="sourceLineNo">290</span> } else if (rc == null) {<a
name="line.290"></a>
+<span class="sourceLineNo">291</span> // Each sub-filter in filter list
got true for filterAllRemaining().<a name="line.291"></a>
+<span class="sourceLineNo">292</span> return ReturnCode.SKIP;<a
name="line.292"></a>
+<span class="sourceLineNo">293</span> } else {<a name="line.293"></a>
+<span class="sourceLineNo">294</span> return rc;<a name="line.294"></a>
+<span class="sourceLineNo">295</span> }<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> @Override<a name="line.298"></a>
+<span class="sourceLineNo">299</span> public void reset() throws IOException
{<a name="line.299"></a>
+<span class="sourceLineNo">300</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.300"></a>
+<span class="sourceLineNo">301</span> filters.get(i).reset();<a
name="line.301"></a>
+<span class="sourceLineNo">302</span> subFiltersIncludedCell.set(i,
false);<a name="line.302"></a>
+<span class="sourceLineNo">303</span> prevFilterRCList.set(i, null);<a
name="line.303"></a>
+<span class="sourceLineNo">304</span> prevCellList.set(i, null);<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><a name="line.307"></a>
+<span class="sourceLineNo">308</span> @Override<a name="line.308"></a>
+<span class="sourceLineNo">309</span> public boolean filterRowKey(byte[]
rowKey, int offset, int length) throws IOException {<a name="line.309"></a>
+<span class="sourceLineNo">310</span> if (isEmpty()) {<a
name="line.310"></a>
+<span class="sourceLineNo">311</span> return super.filterRowKey(rowKey,
offset, length);<a name="line.311"></a>
+<span class="sourceLineNo">312</span> }<a name="line.312"></a>
+<span class="sourceLineNo">313</span> boolean retVal = true;<a
name="line.313"></a>
+<span class="sourceLineNo">314</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.314"></a>
+<span class="sourceLineNo">315</span> Filter filter = filters.get(i);<a
name="line.315"></a>
+<span class="sourceLineNo">316</span> if (!filter.filterAllRemaining()
&& !filter.filterRowKey(rowKey, offset, length)) {<a
name="line.316"></a>
+<span class="sourceLineNo">317</span> retVal = false;<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> return retVal;<a name="line.320"></a>
+<span class="sourceLineNo">321</span> }<a name="line.321"></a>
+<span class="sourceLineNo">322</span><a name="line.322"></a>
+<span class="sourceLineNo">323</span> @Override<a name="line.323"></a>
+<span class="sourceLineNo">324</span> public boolean filterRowKey(Cell
firstRowCell) throws IOException {<a name="line.324"></a>
+<span class="sourceLineNo">325</span> if (isEmpty()) {<a
name="line.325"></a>
+<span class="sourceLineNo">326</span> return
super.filterRowKey(firstRowCell);<a name="line.326"></a>
+<span class="sourceLineNo">327</span> }<a name="line.327"></a>
+<span class="sourceLineNo">328</span> boolean retVal = true;<a
name="line.328"></a>
+<span class="sourceLineNo">329</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.329"></a>
+<span class="sourceLineNo">330</span> Filter filter = filters.get(i);<a
name="line.330"></a>
+<span class="sourceLineNo">331</span> if (!filter.filterAllRemaining()
&& !filter.filterRowKey(firstRowCell)) {<a name="line.331"></a>
+<span class="sourceLineNo">332</span> // Can't just return false here,
because there are some filters (such as PrefixFilter) which<a
name="line.332"></a>
+<span class="sourceLineNo">333</span> // will catch the row changed
event by filterRowKey(). If we return early here, those<a name="line.333"></a>
+<span class="sourceLineNo">334</span> // filters will have no chance to
update their row state.<a name="line.334"></a>
+<span class="sourceLineNo">335</span> retVal = false;<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> return retVal;<a name="line.338"></a>
+<span class="sourceLineNo">339</span> }<a name="line.339"></a>
+<span class="sourceLineNo">340</span><a name="line.340"></a>
+<span class="sourceLineNo">341</span> @Override<a name="line.341"></a>
+<span class="sourceLineNo">342</span> public boolean filterAllRemaining()
throws IOException {<a name="line.342"></a>
+<span class="sourceLineNo">343</span> if (isEmpty()) {<a
name="line.343"></a>
+<span class="sourceLineNo">344</span> return
super.filterAllRemaining();<a name="line.344"></a>
+<span class="sourceLineNo">345</span> }<a name="line.345"></a>
+<span class="sourceLineNo">346</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.346"></a>
+<span class="sourceLineNo">347</span> if
(!filters.get(i).filterAllRemaining()) {<a name="line.347"></a>
+<span class="sourceLineNo">348</span> return false;<a
name="line.348"></a>
+<span class="sourceLineNo">349</span> }<a name="line.349"></a>
+<span class="sourceLineNo">350</span> }<a name="line.350"></a>
+<span class="sourceLineNo">351</span> return true;<a name="line.351"></a>
+<span class="sourceLineNo">352</span> }<a name="line.352"></a>
+<span class="sourceLineNo">353</span><a name="line.353"></a>
+<span class="sourceLineNo">354</span> @Override<a name="line.354"></a>
+<span class="sourceLineNo">355</span> public boolean filterRow() throws
IOException {<a name="line.355"></a>
+<span class="sourceLineNo">356</span> if (isEmpty()) {<a
name="line.356"></a>
+<span class="sourceLineNo">357</span> return super.filterRow();<a
name="line.357"></a>
+<span class="sourceLineNo">358</span> }<a name="line.358"></a>
+<span class="sourceLineNo">359</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.359"></a>
+<span class="sourceLineNo">360</span> Filter filter = filters.get(i);<a
name="line.360"></a>
+<span class="sourceLineNo">361</span> if (!filter.filterRow()) {<a
name="line.361"></a>
+<span class="sourceLineNo">362</span> return false;<a
name="line.362"></a>
+<span class="sourceLineNo">363</span> }<a name="line.363"></a>
+<span class="sourceLineNo">364</span> }<a name="line.364"></a>
+<span class="sourceLineNo">365</span> return true;<a name="line.365"></a>
+<span class="sourceLineNo">366</span> }<a name="line.366"></a>
+<span class="sourceLineNo">367</span><a name="line.367"></a>
+<span class="sourceLineNo">368</span> @Override<a name="line.368"></a>
+<span class="sourceLineNo">369</span> public Cell getNextCellHint(Cell
currentCell) throws IOException {<a name="line.369"></a>
+<span class="sourceLineNo">370</span> if (isEmpty()) {<a
name="line.370"></a>
+<span class="sourceLineNo">371</span> return
super.getNextCellHint(currentCell);<a name="line.371"></a>
+<span class="sourceLineNo">372</span> }<a name="line.372"></a>
+<span class="sourceLineNo">373</span> Cell minKeyHint = null;<a
name="line.373"></a>
+<span class="sourceLineNo">374</span> // If any condition can pass, we need
to keep the min hint<a name="line.374"></a>
+<span class="sourceLineNo">375</span> for (int i = 0, n = filters.size(); i
< n; i++) {<a name="line.375"></a>
+<span class="sourceLineNo">376</span> if
(filters.get(i).filterAllRemaining()) {<a name="line.376"></a>
+<span class="sourceLineNo">377</span> continue;<a name="line.377"></a>
+<span class="sourceLineNo">378</span> }<a name="line.378"></a>
+<span class="sourceLineNo">379</span> Cell curKeyHint =
filters.get(i).getNextCellHint(currentCell);<a name="line.379"></a>
+<span class="sourceLineNo">380</span> if (curKeyHint == null) {<a
name="line.380"></a>
+<span class="sourceLineNo">381</span> // If we ever don't have a hint
and this is must-pass-one, then no hint<a name="line.381"></a>
+<span class="sourceLineNo">382</span> return null;<a
name="line.382"></a>
+<span class="sourceLineNo">383</span> }<a name="line.383"></a>
+<span class="sourceLineNo">384</span> // If this is the first hint we
find, set it<a name="line.384"></a>
+<span class="sourceLineNo">385</span> if (minKeyHint == null) {<a
name="line.385"></a>
+<span class="sourceLineNo">386</span> minKeyHint = curKeyHint;<a
name="line.386"></a>
+<span class="sourceLineNo">387</span> continue;<a name="line.387"></a>
+<span class="sourceLineNo">388</span> }<a name="line.388"></a>
+<span class="sourceLineNo">389</span> if (this.compareCell(minKeyHint,
curKeyHint) > 0) {<a name="line.389"></a>
+<span class="sourceLineNo">390</span> minKeyHint = curKeyHint;<a
name="line.390"></a>
+<span class="sourceLineNo">391</span> }<a name="line.391"></a>
+<span class="sourceLineNo">392</span> }<a name="line.392"></a>
+<span class="sourceLineNo">393</span> return minKeyHint;<a
name="line.393"></a>
+<span class="sourceLineNo">394</span> }<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><a name="line.397"></a>
-<span class="sourceLineNo">398</span> @Override<a name="line.398"></a>
-<span class="sourceLineNo">399</span> public boolean equals(Object obj) {<a
name="line.399"></a>
-<span class="sourceLineNo">400</span> if (obj == null || (!(obj instanceof
FilterListWithOR))) {<a name="line.400"></a>
-<span class="sourceLineNo">401</span> return false;<a name="line.401"></a>
-<span class="sourceLineNo">402</span> }<a name="line.402"></a>
-<span class="sourceLineNo">403</span> if (this == obj) {<a
name="line.403"></a>
-<span class="sourceLineNo">404</span> return true;<a name="line.404"></a>
-<span class="sourceLineNo">405</span> }<a name="line.405"></a>
-<span class="sourceLineNo">406</span> FilterListWithOR f =
(FilterListWithOR) obj;<a name="line.406"></a>
-<span class="sourceLineNo">407</span> return
this.filters.equals(f.getFilters()) &&<a name="line.407"></a>
-<span class="sourceLineNo">408</span>
this.prevFilterRCList.equals(f.prevFilterRCList) &&<a
name="line.408"></a>
-<span class="sourceLineNo">409</span>
this.prevCellList.equals(f.prevCellList);<a name="line.409"></a>
-<span class="sourceLineNo">410</span> }<a name="line.410"></a>
-<span class="sourceLineNo">411</span><a name="line.411"></a>
-<span class="sourceLineNo">412</span> @Override<a name="line.412"></a>
-<span class="sourceLineNo">413</span> public int hashCode() {<a
name="line.413"></a>
-<span class="sourceLineNo">414</span> return
Objects.hash(Arrays.hashCode(this.prevFilterRCList.toArray()),<a
name="line.414"></a>
-<span class="sourceLineNo">415</span>
Arrays.hashCode(this.prevCellList.toArray()),
Arrays.hashCode(this.filters.toArray()));<a name="line.415"></a>
-<span class="sourceLineNo">416</span> }<a name="line.416"></a>
-<span class="sourceLineNo">417</span>}<a name="line.417"></a>
+<span class="sourceLineNo">397</span> @Override<a name="line.397"></a>
+<span class="sourceLineNo">398</span> public boolean equals(Object obj) {<a
name="line.398"></a>
+<span class="sourceLineNo">399</span> if (obj == null || (!(obj instanceof
FilterListWithOR))) {<a name="line.399"></a>
+<span class="sourceLineNo">400</span> return false;<a name="line.400"></a>
+<span class="sourceLineNo">401</span> }<a name="line.401"></a>
+<span class="sourceLineNo">402</span> if (this == obj) {<a
name="line.402"></a>
+<span class="sourceLineNo">403</span> return true;<a name="line.403"></a>
+<span class="sourceLineNo">404</span> }<a name="line.404"></a>
+<span class="sourceLineNo">405</span> FilterListWithOR f =
(FilterListWithOR) obj;<a name="line.405"></a>
+<span class="sourceLineNo">406</span> return
this.filters.equals(f.getFilters()) &&<a name="line.406"></a>
+<span class="sourceLineNo">407</span>
this.prevFilterRCList.equals(f.prevFilterRCList) &&<a
name="line.407"></a>
+<span class="sourceLineNo">408</span>
this.prevCellList.equals(f.prevCellList);<a name="line.408"></a>
+<span class="sourceLineNo">409</span> }<a name="line.409"></a>
+<span class="sourceLineNo">410</span><a name="line.410"></a>
+<span class="sourceLineNo">411</span> @Override<a name="line.411"></a>
+<span class="sourceLineNo">412</span> public int hashCode() {<a
name="line.412"></a>
+<span class="sourceLineNo">413</span> return
Objects.hash(this.prevFilterRCList, this.prevCellList, this.filters);<a
name="line.413"></a>
+<span class="sourceLineNo">414</span> }<a name="line.414"></a>
+<span class="sourceLineNo">415</span>}<a name="line.415"></a>
