http://git-wip-us.apache.org/repos/asf/hbase-site/blob/8e4e1542/apidocs/src-html/org/apache/hadoop/hbase/filter/FilterList.Operator.html ---------------------------------------------------------------------- diff --git a/apidocs/src-html/org/apache/hadoop/hbase/filter/FilterList.Operator.html b/apidocs/src-html/org/apache/hadoop/hbase/filter/FilterList.Operator.html index e21f63b..fe5dbbb 100644 --- a/apidocs/src-html/org/apache/hadoop/hbase/filter/FilterList.Operator.html +++ b/apidocs/src-html/org/apache/hadoop/hbase/filter/FilterList.Operator.html @@ -98,566 +98,732 @@ <span class="sourceLineNo">090</span> private Cell transformedCell = null;<a name="line.90"></a> <span class="sourceLineNo">091</span><a name="line.91"></a> <span class="sourceLineNo">092</span> /**<a name="line.92"></a> -<span class="sourceLineNo">093</span> * Constructor that takes a set of {@link Filter}s. The default operator<a name="line.93"></a> -<span class="sourceLineNo">094</span> * MUST_PASS_ALL is assumed.<a name="line.94"></a> -<span class="sourceLineNo">095</span> * All filters are cloned to internal list.<a name="line.95"></a> -<span class="sourceLineNo">096</span> * @param rowFilters list of filters<a name="line.96"></a> -<span class="sourceLineNo">097</span> */<a name="line.97"></a> -<span class="sourceLineNo">098</span> public FilterList(final List<Filter> rowFilters) {<a name="line.98"></a> -<span class="sourceLineNo">099</span> reversed = getReversed(rowFilters, reversed);<a name="line.99"></a> -<span class="sourceLineNo">100</span> this.filters = new ArrayList<>(rowFilters);<a name="line.100"></a> +<span class="sourceLineNo">093</span> * Constructor that takes a set of {@link Filter}s and an operator.<a name="line.93"></a> +<span class="sourceLineNo">094</span> * @param operator Operator to process filter set with.<a name="line.94"></a> +<span class="sourceLineNo">095</span> * @param rowFilters Set of row filters.<a name="line.95"></a> +<span class="sourceLineNo">096</span> */<a name="line.96"></a> +<span class="sourceLineNo">097</span> public FilterList(final Operator operator, final List<Filter> rowFilters) {<a name="line.97"></a> +<span class="sourceLineNo">098</span> reversed = checkAndGetReversed(rowFilters, reversed);<a name="line.98"></a> +<span class="sourceLineNo">099</span> this.filters = new ArrayList<>(rowFilters);<a name="line.99"></a> +<span class="sourceLineNo">100</span> this.operator = operator;<a name="line.100"></a> <span class="sourceLineNo">101</span> initPrevListForMustPassOne(rowFilters.size());<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> * Constructor that takes a var arg number of {@link Filter}s. The fefault operator<a name="line.105"></a> -<span class="sourceLineNo">106</span> * MUST_PASS_ALL is assumed.<a name="line.106"></a> -<span class="sourceLineNo">107</span> * @param rowFilters<a name="line.107"></a> +<span class="sourceLineNo">105</span> * Constructor that takes a set of {@link Filter}s. The default operator MUST_PASS_ALL is assumed.<a name="line.105"></a> +<span class="sourceLineNo">106</span> * All filters are cloned to internal list.<a name="line.106"></a> +<span class="sourceLineNo">107</span> * @param rowFilters list of filters<a name="line.107"></a> <span class="sourceLineNo">108</span> */<a name="line.108"></a> -<span class="sourceLineNo">109</span> public FilterList(final Filter... rowFilters) {<a name="line.109"></a> -<span class="sourceLineNo">110</span> this(Arrays.asList(rowFilters));<a name="line.110"></a> +<span class="sourceLineNo">109</span> public FilterList(final List<Filter> rowFilters) {<a name="line.109"></a> +<span class="sourceLineNo">110</span> this(Operator.MUST_PASS_ALL, rowFilters);<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> * Constructor that takes an operator.<a name="line.114"></a> -<span class="sourceLineNo">115</span> *<a name="line.115"></a> -<span class="sourceLineNo">116</span> * @param operator Operator to process filter set with.<a name="line.116"></a> +<span class="sourceLineNo">114</span> * Constructor that takes a var arg number of {@link Filter}s. The default operator MUST_PASS_ALL<a name="line.114"></a> +<span class="sourceLineNo">115</span> * is assumed.<a name="line.115"></a> +<span class="sourceLineNo">116</span> * @param rowFilters<a name="line.116"></a> <span class="sourceLineNo">117</span> */<a name="line.117"></a> -<span class="sourceLineNo">118</span> public FilterList(final Operator operator) {<a name="line.118"></a> -<span class="sourceLineNo">119</span> this.operator = operator;<a name="line.119"></a> -<span class="sourceLineNo">120</span> this.filters = new ArrayList<>();<a name="line.120"></a> -<span class="sourceLineNo">121</span> initPrevListForMustPassOne(filters.size());<a name="line.121"></a> -<span class="sourceLineNo">122</span> }<a name="line.122"></a> -<span class="sourceLineNo">123</span><a name="line.123"></a> -<span class="sourceLineNo">124</span> /**<a name="line.124"></a> -<span class="sourceLineNo">125</span> * Constructor that takes a set of {@link Filter}s and an operator.<a name="line.125"></a> -<span class="sourceLineNo">126</span> *<a name="line.126"></a> -<span class="sourceLineNo">127</span> * @param operator Operator to process filter set with.<a name="line.127"></a> -<span class="sourceLineNo">128</span> * @param rowFilters Set of row filters.<a name="line.128"></a> -<span class="sourceLineNo">129</span> */<a name="line.129"></a> -<span class="sourceLineNo">130</span> public FilterList(final Operator operator, final List<Filter> rowFilters) {<a name="line.130"></a> -<span class="sourceLineNo">131</span> this(rowFilters);<a name="line.131"></a> -<span class="sourceLineNo">132</span> this.operator = operator;<a name="line.132"></a> -<span class="sourceLineNo">133</span> initPrevListForMustPassOne(rowFilters.size());<a name="line.133"></a> -<span class="sourceLineNo">134</span> }<a name="line.134"></a> -<span class="sourceLineNo">135</span><a name="line.135"></a> -<span class="sourceLineNo">136</span> /**<a name="line.136"></a> -<span class="sourceLineNo">137</span> * Constructor that takes a var arg number of {@link Filter}s and an operator.<a name="line.137"></a> -<span class="sourceLineNo">138</span> *<a name="line.138"></a> -<span class="sourceLineNo">139</span> * @param operator Operator to process filter set with.<a name="line.139"></a> -<span class="sourceLineNo">140</span> * @param rowFilters Filters to use<a name="line.140"></a> -<span class="sourceLineNo">141</span> */<a name="line.141"></a> -<span class="sourceLineNo">142</span> public FilterList(final Operator operator, final Filter... rowFilters) {<a name="line.142"></a> -<span class="sourceLineNo">143</span> this(rowFilters);<a name="line.143"></a> -<span class="sourceLineNo">144</span> this.operator = operator;<a name="line.144"></a> -<span class="sourceLineNo">145</span> initPrevListForMustPassOne(rowFilters.length);<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> public void initPrevListForMustPassOne(int size) {<a name="line.148"></a> -<span class="sourceLineNo">149</span> if (operator == Operator.MUST_PASS_ONE) {<a name="line.149"></a> -<span class="sourceLineNo">150</span> if (this.prevFilterRCList == null) {<a name="line.150"></a> -<span class="sourceLineNo">151</span> prevFilterRCList = new ArrayList<>(Collections.nCopies(size, null));<a name="line.151"></a> -<span class="sourceLineNo">152</span> }<a name="line.152"></a> -<span class="sourceLineNo">153</span> if (this.prevCellList == null) {<a name="line.153"></a> -<span class="sourceLineNo">154</span> prevCellList = new ArrayList<>(Collections.nCopies(size, null));<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> }<a name="line.157"></a> -<span class="sourceLineNo">158</span><a name="line.158"></a> -<span class="sourceLineNo">159</span><a name="line.159"></a> -<span class="sourceLineNo">160</span> /**<a name="line.160"></a> -<span class="sourceLineNo">161</span> * Get the operator.<a name="line.161"></a> -<span class="sourceLineNo">162</span> *<a name="line.162"></a> -<span class="sourceLineNo">163</span> * @return operator<a name="line.163"></a> -<span class="sourceLineNo">164</span> */<a name="line.164"></a> -<span class="sourceLineNo">165</span> public Operator getOperator() {<a name="line.165"></a> -<span class="sourceLineNo">166</span> return operator;<a name="line.166"></a> -<span class="sourceLineNo">167</span> }<a name="line.167"></a> -<span class="sourceLineNo">168</span><a name="line.168"></a> -<span class="sourceLineNo">169</span> /**<a name="line.169"></a> -<span class="sourceLineNo">170</span> * Get the filters.<a name="line.170"></a> -<span class="sourceLineNo">171</span> *<a name="line.171"></a> -<span class="sourceLineNo">172</span> * @return filters<a name="line.172"></a> -<span class="sourceLineNo">173</span> */<a name="line.173"></a> -<span class="sourceLineNo">174</span> public List<Filter> getFilters() {<a name="line.174"></a> -<span class="sourceLineNo">175</span> return filters;<a name="line.175"></a> -<span class="sourceLineNo">176</span> }<a name="line.176"></a> -<span class="sourceLineNo">177</span><a name="line.177"></a> -<span class="sourceLineNo">178</span> public int size() {<a name="line.178"></a> -<span class="sourceLineNo">179</span> return filters.size();<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> private boolean isEmpty() {<a name="line.182"></a> -<span class="sourceLineNo">183</span> return filters.isEmpty();<a name="line.183"></a> +<span class="sourceLineNo">118</span> public FilterList(final Filter... rowFilters) {<a name="line.118"></a> +<span class="sourceLineNo">119</span> this(Operator.MUST_PASS_ALL, Arrays.asList(rowFilters));<a name="line.119"></a> +<span class="sourceLineNo">120</span> }<a name="line.120"></a> +<span class="sourceLineNo">121</span><a name="line.121"></a> +<span class="sourceLineNo">122</span> /**<a name="line.122"></a> +<span class="sourceLineNo">123</span> * Constructor that takes an operator.<a name="line.123"></a> +<span class="sourceLineNo">124</span> * @param operator Operator to process filter set with.<a name="line.124"></a> +<span class="sourceLineNo">125</span> */<a name="line.125"></a> +<span class="sourceLineNo">126</span> public FilterList(final Operator operator) {<a name="line.126"></a> +<span class="sourceLineNo">127</span> this(operator, new ArrayList<>());<a name="line.127"></a> +<span class="sourceLineNo">128</span> }<a name="line.128"></a> +<span class="sourceLineNo">129</span><a name="line.129"></a> +<span class="sourceLineNo">130</span> /**<a name="line.130"></a> +<span class="sourceLineNo">131</span> * Constructor that takes a var arg number of {@link Filter}s and an operator.<a name="line.131"></a> +<span class="sourceLineNo">132</span> * @param operator Operator to process filter set with.<a name="line.132"></a> +<span class="sourceLineNo">133</span> * @param rowFilters Filters to use<a name="line.133"></a> +<span class="sourceLineNo">134</span> */<a name="line.134"></a> +<span class="sourceLineNo">135</span> public FilterList(final Operator operator, final Filter... rowFilters) {<a name="line.135"></a> +<span class="sourceLineNo">136</span> this(operator, Arrays.asList(rowFilters));<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> private void initPrevListForMustPassOne(int size) {<a name="line.139"></a> +<span class="sourceLineNo">140</span> if (operator == Operator.MUST_PASS_ONE) {<a name="line.140"></a> +<span class="sourceLineNo">141</span> if (this.prevFilterRCList == null) {<a name="line.141"></a> +<span class="sourceLineNo">142</span> prevFilterRCList = new ArrayList<>(Collections.nCopies(size, null));<a name="line.142"></a> +<span class="sourceLineNo">143</span> }<a name="line.143"></a> +<span class="sourceLineNo">144</span> if (this.prevCellList == null) {<a name="line.144"></a> +<span class="sourceLineNo">145</span> prevCellList = new ArrayList<>(Collections.nCopies(size, null));<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> }<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> * Get the operator.<a name="line.151"></a> +<span class="sourceLineNo">152</span> * @return operator<a name="line.152"></a> +<span class="sourceLineNo">153</span> */<a name="line.153"></a> +<span class="sourceLineNo">154</span> public Operator getOperator() {<a name="line.154"></a> +<span class="sourceLineNo">155</span> return operator;<a name="line.155"></a> +<span class="sourceLineNo">156</span> }<a name="line.156"></a> +<span class="sourceLineNo">157</span><a name="line.157"></a> +<span class="sourceLineNo">158</span> /**<a name="line.158"></a> +<span class="sourceLineNo">159</span> * Get the filters.<a name="line.159"></a> +<span class="sourceLineNo">160</span> * @return filters<a name="line.160"></a> +<span class="sourceLineNo">161</span> */<a name="line.161"></a> +<span class="sourceLineNo">162</span> public List<Filter> getFilters() {<a name="line.162"></a> +<span class="sourceLineNo">163</span> return filters;<a name="line.163"></a> +<span class="sourceLineNo">164</span> }<a name="line.164"></a> +<span class="sourceLineNo">165</span><a name="line.165"></a> +<span class="sourceLineNo">166</span> public int size() {<a name="line.166"></a> +<span class="sourceLineNo">167</span> return filters.size();<a name="line.167"></a> +<span class="sourceLineNo">168</span> }<a name="line.168"></a> +<span class="sourceLineNo">169</span><a name="line.169"></a> +<span class="sourceLineNo">170</span> private boolean isEmpty() {<a name="line.170"></a> +<span class="sourceLineNo">171</span> return filters.isEmpty();<a name="line.171"></a> +<span class="sourceLineNo">172</span> }<a name="line.172"></a> +<span class="sourceLineNo">173</span><a name="line.173"></a> +<span class="sourceLineNo">174</span> private static boolean checkAndGetReversed(List<Filter> rowFilters, boolean defaultValue) {<a name="line.174"></a> +<span class="sourceLineNo">175</span> if (rowFilters.isEmpty()) {<a name="line.175"></a> +<span class="sourceLineNo">176</span> return defaultValue;<a name="line.176"></a> +<span class="sourceLineNo">177</span> }<a name="line.177"></a> +<span class="sourceLineNo">178</span> Boolean retValue = rowFilters.get(0).isReversed();<a name="line.178"></a> +<span class="sourceLineNo">179</span> boolean allEqual = rowFilters.stream().map(Filter::isReversed).allMatch(retValue::equals);<a name="line.179"></a> +<span class="sourceLineNo">180</span> if (!allEqual) {<a name="line.180"></a> +<span class="sourceLineNo">181</span> throw new IllegalArgumentException("Filters in the list must have the same reversed flag");<a name="line.181"></a> +<span class="sourceLineNo">182</span> }<a name="line.182"></a> +<span class="sourceLineNo">183</span> return retValue;<a name="line.183"></a> <span class="sourceLineNo">184</span> }<a name="line.184"></a> <span class="sourceLineNo">185</span><a name="line.185"></a> -<span class="sourceLineNo">186</span> private static boolean getReversed(List<Filter> rowFilters, boolean defaultValue) {<a name="line.186"></a> -<span class="sourceLineNo">187</span> boolean rval = defaultValue;<a name="line.187"></a> -<span class="sourceLineNo">188</span> boolean isFirst = true;<a name="line.188"></a> -<span class="sourceLineNo">189</span> for (Filter f : rowFilters) {<a name="line.189"></a> -<span class="sourceLineNo">190</span> if (isFirst) {<a name="line.190"></a> -<span class="sourceLineNo">191</span> rval = f.isReversed();<a name="line.191"></a> -<span class="sourceLineNo">192</span> isFirst = false;<a name="line.192"></a> -<span class="sourceLineNo">193</span> continue;<a name="line.193"></a> -<span class="sourceLineNo">194</span> }<a name="line.194"></a> -<span class="sourceLineNo">195</span> if (rval != f.isReversed()) {<a name="line.195"></a> -<span class="sourceLineNo">196</span> throw new IllegalArgumentException("Filters in the list must have the same reversed flag");<a name="line.196"></a> -<span class="sourceLineNo">197</span> }<a name="line.197"></a> -<span class="sourceLineNo">198</span> }<a name="line.198"></a> -<span class="sourceLineNo">199</span> return rval;<a name="line.199"></a> -<span class="sourceLineNo">200</span> }<a name="line.200"></a> -<span class="sourceLineNo">201</span> private static void checkReversed(List<Filter> rowFilters, boolean expected) {<a name="line.201"></a> -<span class="sourceLineNo">202</span> for (Filter filter : rowFilters) {<a name="line.202"></a> -<span class="sourceLineNo">203</span> if (expected != filter.isReversed()) {<a name="line.203"></a> -<span class="sourceLineNo">204</span> throw new IllegalArgumentException(<a name="line.204"></a> -<span class="sourceLineNo">205</span> "Filters in the list must have the same reversed flag, expected="<a name="line.205"></a> -<span class="sourceLineNo">206</span> + expected);<a name="line.206"></a> -<span class="sourceLineNo">207</span> }<a name="line.207"></a> -<span class="sourceLineNo">208</span> }<a name="line.208"></a> -<span class="sourceLineNo">209</span> }<a name="line.209"></a> -<span class="sourceLineNo">210</span><a name="line.210"></a> -<span class="sourceLineNo">211</span> public void addFilter(List<Filter> filters) {<a name="line.211"></a> -<span class="sourceLineNo">212</span> checkReversed(filters, isReversed());<a name="line.212"></a> -<span class="sourceLineNo">213</span> this.filters.addAll(filters);<a name="line.213"></a> -<span class="sourceLineNo">214</span> if (operator == Operator.MUST_PASS_ONE) {<a name="line.214"></a> -<span class="sourceLineNo">215</span> this.prevFilterRCList.addAll(Collections.nCopies(filters.size(), null));<a name="line.215"></a> -<span class="sourceLineNo">216</span> this.prevCellList.addAll(Collections.nCopies(filters.size(), null));<a name="line.216"></a> -<span class="sourceLineNo">217</span> }<a name="line.217"></a> -<span class="sourceLineNo">218</span> }<a name="line.218"></a> -<span class="sourceLineNo">219</span><a name="line.219"></a> -<span class="sourceLineNo">220</span> /**<a name="line.220"></a> -<span class="sourceLineNo">221</span> * Add a filter.<a name="line.221"></a> -<span class="sourceLineNo">222</span> *<a name="line.222"></a> -<span class="sourceLineNo">223</span> * @param filter another filter<a name="line.223"></a> -<span class="sourceLineNo">224</span> */<a name="line.224"></a> -<span class="sourceLineNo">225</span> public void addFilter(Filter filter) {<a name="line.225"></a> -<span class="sourceLineNo">226</span> addFilter(Collections.singletonList(filter));<a name="line.226"></a> -<span class="sourceLineNo">227</span> }<a name="line.227"></a> -<span class="sourceLineNo">228</span><a name="line.228"></a> -<span class="sourceLineNo">229</span> @Override<a name="line.229"></a> -<span class="sourceLineNo">230</span> public void reset() throws IOException {<a name="line.230"></a> -<span class="sourceLineNo">231</span> int listize = filters.size();<a name="line.231"></a> -<span class="sourceLineNo">232</span> for (int i = 0; i < listize; i++) {<a name="line.232"></a> -<span class="sourceLineNo">233</span> filters.get(i).reset();<a name="line.233"></a> -<span class="sourceLineNo">234</span> if (operator == Operator.MUST_PASS_ONE) {<a name="line.234"></a> -<span class="sourceLineNo">235</span> prevFilterRCList.set(i, null);<a name="line.235"></a> -<span class="sourceLineNo">236</span> prevCellList.set(i, null);<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> seekHintFilter.clear();<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> @Override<a name="line.242"></a> -<span class="sourceLineNo">243</span> public boolean filterRowKey(byte[] rowKey, int offset, int length) throws IOException {<a name="line.243"></a> -<span class="sourceLineNo">244</span> if (isEmpty()) {<a name="line.244"></a> -<span class="sourceLineNo">245</span> return super.filterRowKey(rowKey, offset, length);<a name="line.245"></a> -<span class="sourceLineNo">246</span> }<a name="line.246"></a> -<span class="sourceLineNo">247</span> boolean flag = this.operator == Operator.MUST_PASS_ONE;<a name="line.247"></a> -<span class="sourceLineNo">248</span> int listize = filters.size();<a name="line.248"></a> -<span class="sourceLineNo">249</span> for (int i = 0; i < listize; i++) {<a name="line.249"></a> -<span class="sourceLineNo">250</span> Filter filter = filters.get(i);<a name="line.250"></a> -<span class="sourceLineNo">251</span> if (this.operator == Operator.MUST_PASS_ALL) {<a name="line.251"></a> -<span class="sourceLineNo">252</span> if (filter.filterAllRemaining() ||<a name="line.252"></a> -<span class="sourceLineNo">253</span> filter.filterRowKey(rowKey, offset, length)) {<a name="line.253"></a> -<span class="sourceLineNo">254</span> flag = true;<a name="line.254"></a> -<span class="sourceLineNo">255</span> }<a name="line.255"></a> -<span class="sourceLineNo">256</span> } else if (this.operator == Operator.MUST_PASS_ONE) {<a name="line.256"></a> -<span class="sourceLineNo">257</span> if (!filter.filterAllRemaining() &&<a name="line.257"></a> -<span class="sourceLineNo">258</span> !filter.filterRowKey(rowKey, offset, length)) {<a name="line.258"></a> -<span class="sourceLineNo">259</span> flag = false;<a name="line.259"></a> -<span class="sourceLineNo">260</span> }<a name="line.260"></a> -<span class="sourceLineNo">261</span> }<a name="line.261"></a> -<span class="sourceLineNo">262</span> }<a name="line.262"></a> -<span class="sourceLineNo">263</span> return flag;<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> @Override<a name="line.266"></a> -<span class="sourceLineNo">267</span> public boolean filterRowKey(Cell firstRowCell) throws IOException {<a name="line.267"></a> -<span class="sourceLineNo">268</span> if (isEmpty()) {<a name="line.268"></a> -<span class="sourceLineNo">269</span> return super.filterRowKey(firstRowCell);<a name="line.269"></a> -<span class="sourceLineNo">270</span> }<a name="line.270"></a> -<span class="sourceLineNo">271</span> boolean flag = this.operator == Operator.MUST_PASS_ONE;<a name="line.271"></a> -<span class="sourceLineNo">272</span> int listize = filters.size();<a name="line.272"></a> -<span class="sourceLineNo">273</span> for (int i = 0; i < listize; i++) {<a name="line.273"></a> -<span class="sourceLineNo">274</span> Filter filter = filters.get(i);<a name="line.274"></a> -<span class="sourceLineNo">275</span> if (this.operator == Operator.MUST_PASS_ALL) {<a name="line.275"></a> -<span class="sourceLineNo">276</span> if (filter.filterAllRemaining() || filter.filterRowKey(firstRowCell)) {<a name="line.276"></a> -<span class="sourceLineNo">277</span> flag = true;<a name="line.277"></a> -<span class="sourceLineNo">278</span> }<a name="line.278"></a> -<span class="sourceLineNo">279</span> } else if (this.operator == Operator.MUST_PASS_ONE) {<a name="line.279"></a> -<span class="sourceLineNo">280</span> if (!filter.filterAllRemaining() && !filter.filterRowKey(firstRowCell)) {<a name="line.280"></a> -<span class="sourceLineNo">281</span> flag = false;<a name="line.281"></a> -<span class="sourceLineNo">282</span> }<a name="line.282"></a> -<span class="sourceLineNo">283</span> }<a name="line.283"></a> -<span class="sourceLineNo">284</span> }<a name="line.284"></a> -<span class="sourceLineNo">285</span> return flag;<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> @Override<a name="line.288"></a> -<span class="sourceLineNo">289</span> public boolean filterAllRemaining() throws IOException {<a name="line.289"></a> -<span class="sourceLineNo">290</span> if (isEmpty()) {<a name="line.290"></a> -<span class="sourceLineNo">291</span> return super.filterAllRemaining();<a name="line.291"></a> -<span class="sourceLineNo">292</span> }<a name="line.292"></a> -<span class="sourceLineNo">293</span> int listize = filters.size();<a name="line.293"></a> -<span class="sourceLineNo">294</span> for (int i = 0; i < listize; i++) {<a name="line.294"></a> -<span class="sourceLineNo">295</span> if (filters.get(i).filterAllRemaining()) {<a name="line.295"></a> -<span class="sourceLineNo">296</span> if (operator == Operator.MUST_PASS_ALL) {<a name="line.296"></a> -<span class="sourceLineNo">297</span> return true;<a name="line.297"></a> -<span class="sourceLineNo">298</span> }<a name="line.298"></a> -<span class="sourceLineNo">299</span> } else {<a name="line.299"></a> -<span class="sourceLineNo">300</span> if (operator == Operator.MUST_PASS_ONE) {<a name="line.300"></a> -<span class="sourceLineNo">301</span> return false;<a name="line.301"></a> -<span class="sourceLineNo">302</span> }<a name="line.302"></a> -<span class="sourceLineNo">303</span> }<a name="line.303"></a> -<span class="sourceLineNo">304</span> }<a name="line.304"></a> -<span class="sourceLineNo">305</span> return operator == Operator.MUST_PASS_ONE;<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 Cell transformCell(Cell c) 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.transformCell(c);<a name="line.311"></a> -<span class="sourceLineNo">312</span> }<a name="line.312"></a> -<span class="sourceLineNo">313</span> if (!CellUtil.equals(c, referenceCell)) {<a name="line.313"></a> -<span class="sourceLineNo">314</span> throw new IllegalStateException("Reference Cell: " + this.referenceCell + " does not match: "<a name="line.314"></a> -<span class="sourceLineNo">315</span> + c);<a name="line.315"></a> -<span class="sourceLineNo">316</span> }<a name="line.316"></a> -<span class="sourceLineNo">317</span> return this.transformedCell;<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> /**<a name="line.320"></a> -<span class="sourceLineNo">321</span> * For MUST_PASS_ONE, we cannot make sure that when filter-A in filter list return NEXT_COL then<a name="line.321"></a> -<span class="sourceLineNo">322</span> * the next cell passing to filterList will be the first cell in next column, because if filter-B<a name="line.322"></a> -<span class="sourceLineNo">323</span> * in filter list return SKIP, then the filter list will return SKIP. In this case, we should pass<a name="line.323"></a> -<span class="sourceLineNo">324</span> * the cell following the previous cell, and it's possible that the next cell has the same column<a name="line.324"></a> -<span class="sourceLineNo">325</span> * as the previous cell even if filter-A has NEXT_COL returned for the previous cell. So we should<a name="line.325"></a> -<span class="sourceLineNo">326</span> * save the previous cell and the return code list when checking previous cell for every filter in<a name="line.326"></a> -<span class="sourceLineNo">327</span> * filter list, and verify if currentCell fit the previous return code, if fit then pass the currentCell<a name="line.327"></a> -<span class="sourceLineNo">328</span> * to the corresponding filter. (HBASE-17678)<a name="line.328"></a> -<span class="sourceLineNo">329</span> */<a name="line.329"></a> -<span class="sourceLineNo">330</span> private boolean shouldPassCurrentCellToFilter(Cell prevCell, Cell currentCell, int filterIdx)<a name="line.330"></a> -<span class="sourceLineNo">331</span> throws IOException {<a name="line.331"></a> -<span class="sourceLineNo">332</span> ReturnCode prevCode = this.prevFilterRCList.get(filterIdx);<a name="line.332"></a> -<span class="sourceLineNo">333</span> if (prevCell == null || prevCode == null) {<a name="line.333"></a> -<span class="sourceLineNo">334</span> return true;<a name="line.334"></a> -<span class="sourceLineNo">335</span> }<a name="line.335"></a> -<span class="sourceLineNo">336</span> switch (prevCode) {<a name="line.336"></a> -<span class="sourceLineNo">337</span> case INCLUDE:<a name="line.337"></a> -<span class="sourceLineNo">338</span> case SKIP:<a name="line.338"></a> -<span class="sourceLineNo">339</span> return true;<a name="line.339"></a> -<span class="sourceLineNo">340</span> case SEEK_NEXT_USING_HINT:<a name="line.340"></a> -<span class="sourceLineNo">341</span> Cell nextHintCell = getNextCellHint(prevCell);<a name="line.341"></a> -<span class="sourceLineNo">342</span> return nextHintCell == null<a name="line.342"></a> -<span class="sourceLineNo">343</span> || CellComparator.COMPARATOR.compare(currentCell, nextHintCell) >= 0;<a name="line.343"></a> -<span class="sourceLineNo">344</span> case NEXT_COL:<a name="line.344"></a> -<span class="sourceLineNo">345</span> case INCLUDE_AND_NEXT_COL:<a name="line.345"></a> -<span class="sourceLineNo">346</span> return !CellUtil.matchingRowColumn(prevCell, currentCell);<a name="line.346"></a> -<span class="sourceLineNo">347</span> case NEXT_ROW:<a name="line.347"></a> -<span class="sourceLineNo">348</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.348"></a> -<span class="sourceLineNo">349</span> return !CellUtil.matchingRows(prevCell, currentCell);<a name="line.349"></a> -<span class="sourceLineNo">350</span> default:<a name="line.350"></a> -<span class="sourceLineNo">351</span> throw new IllegalStateException("Received code is not valid.");<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><a name="line.354"></a> -<span class="sourceLineNo">355</span> @Override<a name="line.355"></a> -<span class="sourceLineNo">356</span> @edu.umd.cs.findbugs.annotations.SuppressWarnings(value="SF_SWITCH_FALLTHROUGH",<a name="line.356"></a> -<span class="sourceLineNo">357</span> justification="Intentional")<a name="line.357"></a> -<span class="sourceLineNo">358</span> public ReturnCode filterKeyValue(Cell c) throws IOException {<a name="line.358"></a> -<span class="sourceLineNo">359</span> if (isEmpty()) {<a name="line.359"></a> -<span class="sourceLineNo">360</span> return ReturnCode.INCLUDE;<a name="line.360"></a> -<span class="sourceLineNo">361</span> }<a name="line.361"></a> -<span class="sourceLineNo">362</span> this.referenceCell = c;<a name="line.362"></a> -<span class="sourceLineNo">363</span> seekHintFilter.clear();<a name="line.363"></a> -<span class="sourceLineNo">364</span><a name="line.364"></a> -<span class="sourceLineNo">365</span> // Accumulates successive transformation of every filter that includes the Cell:<a name="line.365"></a> -<span class="sourceLineNo">366</span> Cell transformed = c;<a name="line.366"></a> -<span class="sourceLineNo">367</span><a name="line.367"></a> -<span class="sourceLineNo">368</span> ReturnCode rc = operator == Operator.MUST_PASS_ONE?<a name="line.368"></a> -<span class="sourceLineNo">369</span> ReturnCode.SKIP: ReturnCode.INCLUDE;<a name="line.369"></a> -<span class="sourceLineNo">370</span> int listize = filters.size();<a name="line.370"></a> -<span class="sourceLineNo">371</span> /*<a name="line.371"></a> -<span class="sourceLineNo">372</span> * When all filters in a MUST_PASS_ONE FilterList return a SEEK_USING_NEXT_HINT code,<a name="line.372"></a> -<span class="sourceLineNo">373</span> * we should return SEEK_NEXT_USING_HINT from the FilterList to utilize the lowest seek value.<a name="line.373"></a> -<span class="sourceLineNo">374</span> * <a name="line.374"></a> -<span class="sourceLineNo">375</span> * The following variable tracks whether any of the Filters returns ReturnCode other than<a name="line.375"></a> -<span class="sourceLineNo">376</span> * SEEK_NEXT_USING_HINT for MUST_PASS_ONE FilterList, in which case the optimization would<a name="line.376"></a> -<span class="sourceLineNo">377</span> * be skipped.<a name="line.377"></a> -<span class="sourceLineNo">378</span> */<a name="line.378"></a> -<span class="sourceLineNo">379</span> boolean seenNonHintReturnCode = false;<a name="line.379"></a> -<span class="sourceLineNo">380</span> for (int i = 0; i < listize; i++) {<a name="line.380"></a> -<span class="sourceLineNo">381</span> Filter filter = filters.get(i);<a name="line.381"></a> -<span class="sourceLineNo">382</span> if (operator == Operator.MUST_PASS_ALL) {<a name="line.382"></a> -<span class="sourceLineNo">383</span> if (filter.filterAllRemaining()) {<a name="line.383"></a> -<span class="sourceLineNo">384</span> return ReturnCode.NEXT_ROW;<a name="line.384"></a> -<span class="sourceLineNo">385</span> }<a name="line.385"></a> -<span class="sourceLineNo">386</span> ReturnCode code = filter.filterKeyValue(c);<a name="line.386"></a> -<span class="sourceLineNo">387</span> switch (code) {<a name="line.387"></a> -<span class="sourceLineNo">388</span> // Override INCLUDE and continue to evaluate.<a name="line.388"></a> -<span class="sourceLineNo">389</span> case INCLUDE_AND_NEXT_COL:<a name="line.389"></a> -<span class="sourceLineNo">390</span> rc = ReturnCode.INCLUDE_AND_NEXT_COL; // FindBugs SF_SWITCH_FALLTHROUGH<a name="line.390"></a> -<span class="sourceLineNo">391</span> case INCLUDE:<a name="line.391"></a> -<span class="sourceLineNo">392</span> transformed = filter.transformCell(transformed);<a name="line.392"></a> -<span class="sourceLineNo">393</span> continue;<a name="line.393"></a> -<span class="sourceLineNo">394</span> case SEEK_NEXT_USING_HINT:<a name="line.394"></a> -<span class="sourceLineNo">395</span> seekHintFilter.add(filter);<a name="line.395"></a> -<span class="sourceLineNo">396</span> continue;<a name="line.396"></a> -<span class="sourceLineNo">397</span> default:<a name="line.397"></a> -<span class="sourceLineNo">398</span> if (seekHintFilter.isEmpty()) {<a name="line.398"></a> -<span class="sourceLineNo">399</span> return code;<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> } else if (operator == Operator.MUST_PASS_ONE) {<a name="line.402"></a> -<span class="sourceLineNo">403</span> Cell prevCell = this.prevCellList.get(i);<a name="line.403"></a> -<span class="sourceLineNo">404</span> if (filter.filterAllRemaining() || !shouldPassCurrentCellToFilter(prevCell, c, i)) {<a name="line.404"></a> -<span class="sourceLineNo">405</span> seenNonHintReturnCode = true;<a name="line.405"></a> -<span class="sourceLineNo">406</span> continue;<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> ReturnCode localRC = filter.filterKeyValue(c);<a name="line.409"></a> -<span class="sourceLineNo">410</span> // Update previous cell and return code we encountered.<a name="line.410"></a> -<span class="sourceLineNo">411</span> prevFilterRCList.set(i, localRC);<a name="line.411"></a> -<span class="sourceLineNo">412</span> if (c == null || localRC == ReturnCode.INCLUDE || localRC == ReturnCode.SKIP) {<a name="line.412"></a> -<span class="sourceLineNo">413</span> // If previous return code is INCLUDE or SKIP, we should always pass the next cell to the<a name="line.413"></a> -<span class="sourceLineNo">414</span> // corresponding sub-filter(need not test shouldPassCurrentCellToFilter() method), So we<a name="line.414"></a> -<span class="sourceLineNo">415</span> // need not save current cell to prevCellList for saving heap memory.<a name="line.415"></a> -<span class="sourceLineNo">416</span> prevCellList.set(i, null);<a name="line.416"></a> -<span class="sourceLineNo">417</span> } else {<a name="line.417"></a> -<span class="sourceLineNo">418</span> prevCellList.set(i, KeyValueUtil.toNewKeyCell(c));<a name="line.418"></a> -<span class="sourceLineNo">419</span> }<a name="line.419"></a> +<span class="sourceLineNo">186</span> public void addFilter(List<Filter> filters) {<a name="line.186"></a> +<span class="sourceLineNo">187</span> if (checkAndGetReversed(filters, isReversed()) != isReversed()) {<a name="line.187"></a> +<span class="sourceLineNo">188</span> throw new IllegalArgumentException("Filters in the list must have the same reversed flag");<a name="line.188"></a> +<span class="sourceLineNo">189</span> }<a name="line.189"></a> +<span class="sourceLineNo">190</span> this.filters.addAll(filters);<a name="line.190"></a> +<span class="sourceLineNo">191</span> if (operator == Operator.MUST_PASS_ONE) {<a name="line.191"></a> +<span class="sourceLineNo">192</span> this.prevFilterRCList.addAll(Collections.nCopies(filters.size(), null));<a name="line.192"></a> +<span class="sourceLineNo">193</span> this.prevCellList.addAll(Collections.nCopies(filters.size(), null));<a name="line.193"></a> +<span class="sourceLineNo">194</span> }<a name="line.194"></a> +<span class="sourceLineNo">195</span> }<a name="line.195"></a> +<span class="sourceLineNo">196</span><a name="line.196"></a> +<span class="sourceLineNo">197</span> /**<a name="line.197"></a> +<span class="sourceLineNo">198</span> * Add a filter.<a name="line.198"></a> +<span class="sourceLineNo">199</span> * @param filter another filter<a name="line.199"></a> +<span class="sourceLineNo">200</span> */<a name="line.200"></a> +<span class="sourceLineNo">201</span> public void addFilter(Filter filter) {<a name="line.201"></a> +<span class="sourceLineNo">202</span> addFilter(Collections.singletonList(filter));<a name="line.202"></a> +<span class="sourceLineNo">203</span> }<a name="line.203"></a> +<span class="sourceLineNo">204</span><a name="line.204"></a> +<span class="sourceLineNo">205</span> @Override<a name="line.205"></a> +<span class="sourceLineNo">206</span> public void reset() throws IOException {<a name="line.206"></a> +<span class="sourceLineNo">207</span> for (int i = 0, n = filters.size(); i < n; i++) {<a name="line.207"></a> +<span class="sourceLineNo">208</span> filters.get(i).reset();<a name="line.208"></a> +<span class="sourceLineNo">209</span> if (operator == Operator.MUST_PASS_ONE) {<a name="line.209"></a> +<span class="sourceLineNo">210</span> prevFilterRCList.set(i, null);<a name="line.210"></a> +<span class="sourceLineNo">211</span> prevCellList.set(i, null);<a name="line.211"></a> +<span class="sourceLineNo">212</span> }<a name="line.212"></a> +<span class="sourceLineNo">213</span> }<a name="line.213"></a> +<span class="sourceLineNo">214</span> seekHintFilter.clear();<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> @Override<a name="line.217"></a> +<span class="sourceLineNo">218</span> public boolean filterRowKey(byte[] rowKey, int offset, int length) throws IOException {<a name="line.218"></a> +<span class="sourceLineNo">219</span> if (isEmpty()) {<a name="line.219"></a> +<span class="sourceLineNo">220</span> return super.filterRowKey(rowKey, offset, length);<a name="line.220"></a> +<span class="sourceLineNo">221</span> }<a name="line.221"></a> +<span class="sourceLineNo">222</span> boolean flag = this.operator == Operator.MUST_PASS_ONE;<a name="line.222"></a> +<span class="sourceLineNo">223</span> for (int i = 0, n = filters.size(); i < n; i++) {<a name="line.223"></a> +<span class="sourceLineNo">224</span> Filter filter = filters.get(i);<a name="line.224"></a> +<span class="sourceLineNo">225</span> if (this.operator == Operator.MUST_PASS_ALL) {<a name="line.225"></a> +<span class="sourceLineNo">226</span> if (filter.filterAllRemaining() || filter.filterRowKey(rowKey, offset, length)) {<a name="line.226"></a> +<span class="sourceLineNo">227</span> flag = true;<a name="line.227"></a> +<span class="sourceLineNo">228</span> }<a name="line.228"></a> +<span class="sourceLineNo">229</span> } else if (this.operator == Operator.MUST_PASS_ONE) {<a name="line.229"></a> +<span class="sourceLineNo">230</span> if (!filter.filterAllRemaining() && !filter.filterRowKey(rowKey, offset, length)) {<a name="line.230"></a> +<span class="sourceLineNo">231</span> flag = false;<a name="line.231"></a> +<span class="sourceLineNo">232</span> }<a name="line.232"></a> +<span class="sourceLineNo">233</span> }<a name="line.233"></a> +<span class="sourceLineNo">234</span> }<a name="line.234"></a> +<span class="sourceLineNo">235</span> return flag;<a name="line.235"></a> +<span class="sourceLineNo">236</span> }<a name="line.236"></a> +<span class="sourceLineNo">237</span><a name="line.237"></a> +<span class="sourceLineNo">238</span> @Override<a name="line.238"></a> +<span class="sourceLineNo">239</span> public boolean filterRowKey(Cell firstRowCell) throws IOException {<a name="line.239"></a> +<span class="sourceLineNo">240</span> if (isEmpty()) {<a name="line.240"></a> +<span class="sourceLineNo">241</span> return super.filterRowKey(firstRowCell);<a name="line.241"></a> +<span class="sourceLineNo">242</span> }<a name="line.242"></a> +<span class="sourceLineNo">243</span> boolean flag = this.operator == Operator.MUST_PASS_ONE;<a name="line.243"></a> +<span class="sourceLineNo">244</span> for (int i = 0, n = filters.size(); i < n; i++) {<a name="line.244"></a> +<span class="sourceLineNo">245</span> Filter filter = filters.get(i);<a name="line.245"></a> +<span class="sourceLineNo">246</span> if (this.operator == Operator.MUST_PASS_ALL) {<a name="line.246"></a> +<span class="sourceLineNo">247</span> if (filter.filterAllRemaining() || filter.filterRowKey(firstRowCell)) {<a name="line.247"></a> +<span class="sourceLineNo">248</span> flag = true;<a name="line.248"></a> +<span class="sourceLineNo">249</span> }<a name="line.249"></a> +<span class="sourceLineNo">250</span> } else if (this.operator == Operator.MUST_PASS_ONE) {<a name="line.250"></a> +<span class="sourceLineNo">251</span> if (!filter.filterAllRemaining() && !filter.filterRowKey(firstRowCell)) {<a name="line.251"></a> +<span class="sourceLineNo">252</span> flag = false;<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> return flag;<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> @Override<a name="line.259"></a> +<span class="sourceLineNo">260</span> public boolean filterAllRemaining() throws IOException {<a name="line.260"></a> +<span class="sourceLineNo">261</span> if (isEmpty()) {<a name="line.261"></a> +<span class="sourceLineNo">262</span> return super.filterAllRemaining();<a name="line.262"></a> +<span class="sourceLineNo">263</span> }<a name="line.263"></a> +<span class="sourceLineNo">264</span> for (int i = 0, n = filters.size(); i < n; i++) {<a name="line.264"></a> +<span class="sourceLineNo">265</span> if (filters.get(i).filterAllRemaining()) {<a name="line.265"></a> +<span class="sourceLineNo">266</span> if (operator == Operator.MUST_PASS_ALL) {<a name="line.266"></a> +<span class="sourceLineNo">267</span> return true;<a name="line.267"></a> +<span class="sourceLineNo">268</span> }<a name="line.268"></a> +<span class="sourceLineNo">269</span> } else {<a name="line.269"></a> +<span class="sourceLineNo">270</span> if (operator == Operator.MUST_PASS_ONE) {<a name="line.270"></a> +<span class="sourceLineNo">271</span> return false;<a name="line.271"></a> +<span class="sourceLineNo">272</span> }<a name="line.272"></a> +<span class="sourceLineNo">273</span> }<a name="line.273"></a> +<span class="sourceLineNo">274</span> }<a name="line.274"></a> +<span class="sourceLineNo">275</span> return operator == Operator.MUST_PASS_ONE;<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> @Override<a name="line.278"></a> +<span class="sourceLineNo">279</span> public Cell transformCell(Cell c) throws IOException {<a name="line.279"></a> +<span class="sourceLineNo">280</span> if (isEmpty()) {<a name="line.280"></a> +<span class="sourceLineNo">281</span> return super.transformCell(c);<a name="line.281"></a> +<span class="sourceLineNo">282</span> }<a name="line.282"></a> +<span class="sourceLineNo">283</span> if (!CellUtil.equals(c, referenceCell)) {<a name="line.283"></a> +<span class="sourceLineNo">284</span> throw new IllegalStateException(<a name="line.284"></a> +<span class="sourceLineNo">285</span> "Reference Cell: " + this.referenceCell + " does not match: " + c);<a name="line.285"></a> +<span class="sourceLineNo">286</span> }<a name="line.286"></a> +<span class="sourceLineNo">287</span> // Copy transformedCell into a new cell and reset transformedCell & referenceCell to null for<a name="line.287"></a> +<span class="sourceLineNo">288</span> // Java GC optimization<a name="line.288"></a> +<span class="sourceLineNo">289</span> Cell cell = KeyValueUtil.copyToNewKeyValue(this.transformedCell);<a name="line.289"></a> +<span class="sourceLineNo">290</span> this.transformedCell = null;<a name="line.290"></a> +<span class="sourceLineNo">291</span> this.referenceCell = null;<a name="line.291"></a> +<span class="sourceLineNo">292</span> return cell;<a name="line.292"></a> +<span class="sourceLineNo">293</span> }<a name="line.293"></a> +<span class="sourceLineNo">294</span><a name="line.294"></a> +<span class="sourceLineNo">295</span> /**<a name="line.295"></a> +<span class="sourceLineNo">296</span> * For MUST_PASS_ONE, we cannot make sure that when filter-A in filter list return NEXT_COL then<a name="line.296"></a> +<span class="sourceLineNo">297</span> * the next cell passing to filterList will be the first cell in next column, because if filter-B<a name="line.297"></a> +<span class="sourceLineNo">298</span> * in filter list return SKIP, then the filter list will return SKIP. In this case, we should pass<a name="line.298"></a> +<span class="sourceLineNo">299</span> * the cell following the previous cell, and it's possible that the next cell has the same column<a name="line.299"></a> +<span class="sourceLineNo">300</span> * as the previous cell even if filter-A has NEXT_COL returned for the previous cell. So we should<a name="line.300"></a> +<span class="sourceLineNo">301</span> * save the previous cell and the return code list when checking previous cell for every filter in<a name="line.301"></a> +<span class="sourceLineNo">302</span> * filter list, and verify if currentCell fit the previous return code, if fit then pass the currentCell<a name="line.302"></a> +<span class="sourceLineNo">303</span> * to the corresponding filter. (HBASE-17678)<a name="line.303"></a> +<span class="sourceLineNo">304</span> */<a name="line.304"></a> +<span class="sourceLineNo">305</span> private boolean shouldPassCurrentCellToFilter(Cell prevCell, Cell currentCell, int filterIdx)<a name="line.305"></a> +<span class="sourceLineNo">306</span> throws IOException {<a name="line.306"></a> +<span class="sourceLineNo">307</span> ReturnCode prevCode = this.prevFilterRCList.get(filterIdx);<a name="line.307"></a> +<span class="sourceLineNo">308</span> if (prevCell == null || prevCode == null) {<a name="line.308"></a> +<span class="sourceLineNo">309</span> return true;<a name="line.309"></a> +<span class="sourceLineNo">310</span> }<a name="line.310"></a> +<span class="sourceLineNo">311</span> switch (prevCode) {<a name="line.311"></a> +<span class="sourceLineNo">312</span> case INCLUDE:<a name="line.312"></a> +<span class="sourceLineNo">313</span> case SKIP:<a name="line.313"></a> +<span class="sourceLineNo">314</span> return true;<a name="line.314"></a> +<span class="sourceLineNo">315</span> case SEEK_NEXT_USING_HINT:<a name="line.315"></a> +<span class="sourceLineNo">316</span> Cell nextHintCell = getNextCellHint(prevCell);<a name="line.316"></a> +<span class="sourceLineNo">317</span> return nextHintCell == null<a name="line.317"></a> +<span class="sourceLineNo">318</span> || CellComparator.COMPARATOR.compare(currentCell, nextHintCell) >= 0;<a name="line.318"></a> +<span class="sourceLineNo">319</span> case NEXT_COL:<a name="line.319"></a> +<span class="sourceLineNo">320</span> case INCLUDE_AND_NEXT_COL:<a name="line.320"></a> +<span class="sourceLineNo">321</span> return !CellUtil.matchingRowColumn(prevCell, currentCell);<a name="line.321"></a> +<span class="sourceLineNo">322</span> case NEXT_ROW:<a name="line.322"></a> +<span class="sourceLineNo">323</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.323"></a> +<span class="sourceLineNo">324</span> return !CellUtil.matchingRows(prevCell, currentCell);<a name="line.324"></a> +<span class="sourceLineNo">325</span> default:<a name="line.325"></a> +<span class="sourceLineNo">326</span> throw new IllegalStateException("Received code is not valid.");<a name="line.326"></a> +<span class="sourceLineNo">327</span> }<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> /**<a name="line.330"></a> +<span class="sourceLineNo">331</span> * FilterList with MUST_PASS_ALL choose the maximal forward step among sub-filters in filter list.<a name="line.331"></a> +<span class="sourceLineNo">332</span> * Let's call it: The Maximal Step Rule. So if filter-A in filter list return INCLUDE and filter-B<a name="line.332"></a> +<span class="sourceLineNo">333</span> * in filter list return INCLUDE_AND_NEXT_COL, then the filter list should return<a name="line.333"></a> +<span class="sourceLineNo">334</span> * INCLUDE_AND_NEXT_COL. For SEEK_NEXT_USING_HINT, it's more special, and in method<a name="line.334"></a> +<span class="sourceLineNo">335</span> * filterKeyValueWithMustPassAll(), if any sub-filter return SEEK_NEXT_USING_HINT, then our filter<a name="line.335"></a> +<span class="sourceLineNo">336</span> * list will return SEEK_NEXT_USING_HINT. so we don't care about the SEEK_NEXT_USING_HINT here. <br/><a name="line.336"></a> +<span class="sourceLineNo">337</span> * <br/><a name="line.337"></a> +<span class="sourceLineNo">338</span> * The jump step will be:<a name="line.338"></a> +<span class="sourceLineNo">339</span> *<a name="line.339"></a> +<span class="sourceLineNo">340</span> * <pre><a name="line.340"></a> +<span class="sourceLineNo">341</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.341"></a> +<span class="sourceLineNo">342</span> * </pre><a name="line.342"></a> +<span class="sourceLineNo">343</span> *<a name="line.343"></a> +<span class="sourceLineNo">344</span> * Here, we have the following map to describe The Maximal Step Rule. if current return code (for<a name="line.344"></a> +<span class="sourceLineNo">345</span> * previous sub-filters in filter list) is <strong>ReturnCode</strong>, and current filter returns<a name="line.345"></a> +<span class="sourceLineNo">346</span> * <strong>localRC</strong>, then we should return map[ReturnCode][localRC] for the merged result,<a name="line.346"></a> +<span class="sourceLineNo">347</span> * according to The Maximal Step Rule. <br/><a name="line.347"></a> +<span class="sourceLineNo">348</span> *<a name="line.348"></a> +<span class="sourceLineNo">349</span> * <pre><a name="line.349"></a> +<span class="sourceLineNo">350</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.350"></a> +<span class="sourceLineNo">351</span> * INCLUDE INCLUDE INCLUDE_AND_NEXT_COL INCLUDE_AND_SEEK_NEXT_ROW SKIP NEXT_COL NEXT_ROW SEEK_NEXT_USING_HINT<a name="line.351"></a> +<span class="sourceLineNo">352</span> * INCLUDE_AND_NEXT_COL INCLUDE_AND_NEXT_COL INCLUDE_AND_NEXT_COL INCLUDE_AND_SEEK_NEXT_ROW NEXT_COL NEXT_COL NEXT_ROW SEEK_NEXT_USING_HINT<a name="line.352"></a> +<span class="sourceLineNo">353</span> * INCLUDE_AND_SEEK_NEXT_ROW INCLUDE_AND_SEEK_NEXT_ROW INCLUDE_AND_SEEK_NEXT_ROW INCLUDE_AND_SEEK_NEXT_ROW NEXT_ROW NEXT_ROW NEXT_ROW SEEK_NEXT_USING_HINT<a name="line.353"></a> +<span class="sourceLineNo">354</span> * SKIP SKIP NEXT_COL NEXT_ROW SKIP NEXT_COL NEXT_ROW SEEK_NEXT_USING_HINT<a name="line.354"></a> +<span class="sourceLineNo">355</span> * NEXT_COL NEXT_COL NEXT_COL NEXT_ROW NEXT_COL NEXT_COL NEXT_ROW SEEK_NEXT_USING_HINT<a name="line.355"></a> +<span class="sourceLineNo">356</span> * NEXT_ROW NEXT_ROW NEXT_ROW NEXT_ROW NEXT_ROW NEXT_ROW NEXT_ROW SEEK_NEXT_USING_HINT<a name="line.356"></a> +<span class="sourceLineNo">357</span> * SEEK_NEXT_USING_HINT SEEK_NEXT_USING_HINT SEEK_NEXT_USING_HINT SEEK_NEXT_USING_HINT SEEK_NEXT_USING_HINT SEEK_NEXT_USING_HINT SEEK_NEXT_USING_HINT SEEK_NEXT_USING_HINT<a name="line.357"></a> +<span class="sourceLineNo">358</span> * </pre><a name="line.358"></a> +<span class="sourceLineNo">359</span> * @param rc Return code which is calculated by previous sub-filter(s) in filter list.<a name="line.359"></a> +<span class="sourceLineNo">360</span> * @param localRC Return code of the current sub-filter in filter list.<a name="line.360"></a> +<span class="sourceLineNo">361</span> * @return Return code which is merged by the return code of previous sub-filter(s) and the return<a name="line.361"></a> +<span class="sourceLineNo">362</span> * code of current sub-filter.<a name="line.362"></a> +<span class="sourceLineNo">363</span> */<a name="line.363"></a> +<span class="sourceLineNo">364</span> private ReturnCode mergeReturnCodeForAndOperator(ReturnCode rc, ReturnCode localRC) {<a name="line.364"></a> +<span class="sourceLineNo">365</span> if (rc == ReturnCode.SEEK_NEXT_USING_HINT || localRC == ReturnCode.SEEK_NEXT_USING_HINT) {<a name="line.365"></a> +<span class="sourceLineNo">366</span> return ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.366"></a> +<span class="sourceLineNo">367</span> }<a name="line.367"></a> +<span class="sourceLineNo">368</span> switch (localRC) {<a name="line.368"></a> +<span class="sourceLineNo">369</span> case INCLUDE:<a name="line.369"></a> +<span class="sourceLineNo">370</span> return rc;<a name="line.370"></a> +<span class="sourceLineNo">371</span> case INCLUDE_AND_NEXT_COL:<a name="line.371"></a> +<span class="sourceLineNo">372</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE, ReturnCode.INCLUDE_AND_NEXT_COL)) {<a name="line.372"></a> +<span class="sourceLineNo">373</span> return ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.373"></a> +<span class="sourceLineNo">374</span> }<a name="line.374"></a> +<span class="sourceLineNo">375</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.375"></a> +<span class="sourceLineNo">376</span> return ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW;<a name="line.376"></a> +<span class="sourceLineNo">377</span> }<a name="line.377"></a> +<span class="sourceLineNo">378</span> if (isInReturnCodes(rc, ReturnCode.SKIP, ReturnCode.NEXT_COL)) {<a name="line.378"></a> +<span class="sourceLineNo">379</span> return ReturnCode.NEXT_COL;<a name="line.379"></a> +<span class="sourceLineNo">380</span> }<a name="line.380"></a> +<span class="sourceLineNo">381</span> if (isInReturnCodes(rc, ReturnCode.NEXT_ROW)) {<a name="line.381"></a> +<span class="sourceLineNo">382</span> return ReturnCode.NEXT_ROW;<a name="line.382"></a> +<span class="sourceLineNo">383</span> }<a name="line.383"></a> +<span class="sourceLineNo">384</span> break;<a name="line.384"></a> +<span class="sourceLineNo">385</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.385"></a> +<span class="sourceLineNo">386</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE, ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.386"></a> +<span class="sourceLineNo">387</span> ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.387"></a> +<span class="sourceLineNo">388</span> return ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW;<a name="line.388"></a> +<span class="sourceLineNo">389</span> }<a name="line.389"></a> +<span class="sourceLineNo">390</span> if (isInReturnCodes(rc, ReturnCode.SKIP, ReturnCode.NEXT_COL, ReturnCode.NEXT_ROW)) {<a name="line.390"></a> +<span class="sourceLineNo">391</span> return ReturnCode.NEXT_ROW;<a name="line.391"></a> +<span class="sourceLineNo">392</span> }<a name="line.392"></a> +<span class="sourceLineNo">393</span> break;<a name="line.393"></a> +<span class="sourceLineNo">394</span> case SKIP:<a name="line.394"></a> +<span class="sourceLineNo">395</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE, ReturnCode.SKIP)) {<a name="line.395"></a> +<span class="sourceLineNo">396</span> return ReturnCode.SKIP;<a name="line.396"></a> +<span class="sourceLineNo">397</span> }<a name="line.397"></a> +<span class="sourceLineNo">398</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE_AND_NEXT_COL, ReturnCode.NEXT_COL)) {<a name="line.398"></a> +<span class="sourceLineNo">399</span> return ReturnCode.NEXT_COL;<a name="line.399"></a> +<span class="sourceLineNo">400</span> }<a name="line.400"></a> +<span class="sourceLineNo">401</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW, ReturnCode.NEXT_ROW)) {<a name="line.401"></a> +<span class="sourceLineNo">402</span> return ReturnCode.NEXT_ROW;<a name="line.402"></a> +<span class="sourceLineNo">403</span> }<a name="line.403"></a> +<span class="sourceLineNo">404</span> break;<a name="line.404"></a> +<span class="sourceLineNo">405</span> case NEXT_COL:<a name="line.405"></a> +<span class="sourceLineNo">406</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE, ReturnCode.INCLUDE_AND_NEXT_COL, ReturnCode.SKIP,<a name="line.406"></a> +<span class="sourceLineNo">407</span> ReturnCode.NEXT_COL)) {<a name="line.407"></a> +<span class="sourceLineNo">408</span> return ReturnCode.NEXT_COL;<a name="line.408"></a> +<span class="sourceLineNo">409</span> }<a name="line.409"></a> +<span class="sourceLineNo">410</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW, ReturnCode.NEXT_ROW)) {<a name="line.410"></a> +<span class="sourceLineNo">411</span> return ReturnCode.NEXT_ROW;<a name="line.411"></a> +<span class="sourceLineNo">412</span> }<a name="line.412"></a> +<span class="sourceLineNo">413</span> break;<a name="line.413"></a> +<span class="sourceLineNo">414</span> case NEXT_ROW:<a name="line.414"></a> +<span class="sourceLineNo">415</span> return ReturnCode.NEXT_ROW;<a name="line.415"></a> +<span class="sourceLineNo">416</span> }<a name="line.416"></a> +<span class="sourceLineNo">417</span> throw new IllegalStateException("Received code is not valid. rc: " + rc + ", localRC: "<a name="line.417"></a> +<span class="sourceLineNo">418</span> + localRC);<a name="line.418"></a> +<span class="sourceLineNo">419</span> }<a name="line.419"></a> <span class="sourceLineNo">420</span><a name="line.420"></a> -<span class="sourceLineNo">421</span> if (localRC != ReturnCode.SEEK_NEXT_USING_HINT) {<a name="line.421"></a> -<span class="sourceLineNo">422</span> seenNonHintReturnCode = true;<a name="line.422"></a> -<span class="sourceLineNo">423</span> }<a name="line.423"></a> -<span class="sourceLineNo">424</span> switch (localRC) {<a name="line.424"></a> -<span class="sourceLineNo">425</span> case INCLUDE:<a name="line.425"></a> -<span class="sourceLineNo">426</span> if (rc != ReturnCode.INCLUDE_AND_NEXT_COL) {<a name="line.426"></a> -<span class="sourceLineNo">427</span> rc = ReturnCode.INCLUDE;<a name="line.427"></a> -<span class="sourceLineNo">428</span> }<a name="line.428"></a> -<span class="sourceLineNo">429</span> transformed = filter.transformCell(transformed);<a name="line.429"></a> -<span class="sourceLineNo">430</span> break;<a name="line.430"></a> -<span class="sourceLineNo">431</span> case INCLUDE_AND_NEXT_COL:<a name="line.431"></a> -<span class="sourceLineNo">432</span> rc = ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.432"></a> -<span class="sourceLineNo">433</span> transformed = filter.transformCell(transformed);<a name="line.433"></a> -<span class="sourceLineNo">434</span> // must continue here to evaluate all filters<a name="line.434"></a> -<span class="sourceLineNo">435</span> break;<a name="line.435"></a> -<span class="sourceLineNo">436</span> case NEXT_ROW:<a name="line.436"></a> -<span class="sourceLineNo">437</span> break;<a name="line.437"></a> -<span class="sourceLineNo">438</span> case SKIP:<a name="line.438"></a> -<span class="sourceLineNo">439</span> break;<a name="line.439"></a> -<span class="sourceLineNo">440</span> case NEXT_COL:<a name="line.440"></a> -<span class="sourceLineNo">441</span> break;<a name="line.441"></a> -<span class="sourceLineNo">442</span> case SEEK_NEXT_USING_HINT:<a name="line.442"></a> -<span class="sourceLineNo">443</span> break;<a name="line.443"></a> -<span class="sourceLineNo">444</span> default:<a name="line.444"></a> -<span class="sourceLineNo">445</span> throw new IllegalStateException("Received code is not valid.");<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> }<a name="line.448"></a> -<span class="sourceLineNo">449</span><a name="line.449"></a> -<span class="sourceLineNo">450</span> if (!seekHintFilter.isEmpty()) {<a name="line.450"></a> -<span class="sourceLineNo">451</span> return ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.451"></a> -<span class="sourceLineNo">452</span> }<a name="line.452"></a> -<span class="sourceLineNo">453</span><a name="line.453"></a> -<span class="sourceLineNo">454</span> // Save the transformed Cell for transform():<a name="line.454"></a> -<span class="sourceLineNo">455</span> this.transformedCell = transformed;<a name="line.455"></a> -<span class="sourceLineNo">456</span><a name="line.456"></a> -<span class="sourceLineNo">457</span> /*<a name="line.457"></a> -<span class="sourceLineNo">458</span> * The seenNonHintReturnCode flag is intended only for Operator.MUST_PASS_ONE branch.<a name="line.458"></a> -<span class="sourceLineNo">459</span> * If we have seen non SEEK_NEXT_USING_HINT ReturnCode, respect that ReturnCode.<a name="line.459"></a> -<span class="sourceLineNo">460</span> */<a name="line.460"></a> -<span class="sourceLineNo">461</span> if (operator == Operator.MUST_PASS_ONE && !seenNonHintReturnCode) {<a name="line.461"></a> -<span class="sourceLineNo">462</span> return ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.462"></a> -<span class="sourceLineNo">463</span> }<a name="line.463"></a> -<span class="sourceLineNo">464</span> return rc;<a name="line.464"></a> -<span class="sourceLineNo">465</span> }<a name="line.465"></a> -<span class="sourceLineNo">466</span><a name="line.466"></a> -<span class="sourceLineNo">467</span> /**<a name="line.467"></a> -<span class="sourceLineNo">468</span> * Filters that never filter by modifying the returned List of Cells can<a name="line.468"></a> -<span class="sourceLineNo">469</span> * inherit this implementation that does nothing.<a name="line.469"></a> -<span class="sourceLineNo">470</span> *<a name="line.470"></a> -<span class="sourceLineNo">471</span> * {@inheritDoc}<a name="line.471"></a> -<span class="sourceLineNo">472</span> */<a name="line.472"></a> -<span class="sourceLineNo">473</span> @Override<a name="line.473"></a> -<span class="sourceLineNo">474</span> public void filterRowCells(List<Cell> cells) throws IOException {<a name="line.474"></a> -<span class="sourceLineNo">475</span> int listize = filters.size();<a name="line.475"></a> -<span class="sourceLineNo">476</span> for (int i = 0; i < listize; i++) {<a name="line.476"></a> -<span class="sourceLineNo">477</span> filters.get(i).filterRowCells(cells);<a name="line.477"></a> -<span class="sourceLineNo">478</span> }<a name="line.478"></a> -<span class="sourceLineNo">479</span> }<a name="line.479"></a> -<span class="sourceLineNo">480</span><a name="line.480"></a> -<span class="sourceLineNo">481</span> @Override<a name="line.481"></a> -<span class="sourceLineNo">482</span> public boolean hasFilterRow() {<a name="line.482"></a> -<span class="sourceLineNo">483</span> int listize = filters.size();<a name="line.483"></a> -<span class="sourceLineNo">484</span> for (int i = 0; i < listize; i++) {<a name="line.484"></a> -<span class="sourceLineNo">485</span> if (filters.get(i).hasFilterRow()) {<a name="line.485"></a> -<span class="sourceLineNo">486</span> return true;<a name="line.486"></a> -<span class="sourceLineNo">487</span> }<a name="line.487"></a> -<span class="sourceLineNo">488</span> }<a name="line.488"></a> -<span class="sourceLineNo">489</span> return false;<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> @Override<a name="line.492"></a> -<span class="sourceLineNo">493</span> public boolean filterRow() throws IOException {<a name="line.493"></a> -<span class="sourceLineNo">494</span> if (isEmpty()) {<a name="line.494"></a> -<span class="sourceLineNo">495</span> return super.filterRow();<a name="line.495"></a> -<span class="sourceLineNo">496</span> }<a name="line.496"></a> -<span class="sourceLineNo">497</span> int listize = filters.size();<a name="line.497"></a> -<span class="sourceLineNo">498</span> for (int i = 0; i < listize; i++) {<a name="line.498"></a> -<span class="sourceLineNo">499</span> Filter filter = filters.get(i);<a name="line.499"></a> -<span class="sourceLineNo">500</span> if (operator == Operator.MUST_PASS_ALL) {<a name="line.500"></a> -<span class="sourceLineNo">501</span> if (filter.filterRow()) {<a name="line.501"></a> -<span class="sourceLineNo">502</span> return true;<a name="line.502"></a> -<span class="sourceLineNo">503</span> }<a name="line.503"></a> -<span class="sourceLineNo">504</span> } else if (operator == Operator.MUST_PASS_ONE) {<a name="line.504"></a> -<span class="sourceLineNo">505</span> if (!filter.filterRow()) {<a name="line.505"></a> -<span class="sourceLineNo">506</span> return false;<a name="line.506"></a> -<span class="sourceLineNo">507</span> }<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> return operator == Operator.MUST_PASS_ONE;<a name="line.510"></a> -<span class="sourceLineNo">511</span> }<a name="line.511"></a> -<span class="sourceLineNo">512</span><a name="line.512"></a> -<span class="sourceLineNo">513</span> /**<a name="line.513"></a> -<span class="sourceLineNo">514</span> * @return The filter serialized using pb<a name="line.514"></a> -<span class="sourceLineNo">515</span> */<a name="line.515"></a> -<span class="sourceLineNo">516</span> public byte[] toByteArray() throws IOException {<a name="line.516"></a> -<span class="sourceLineNo">517</span> FilterProtos.FilterList.Builder builder =<a name="line.517"></a> -<span class="sourceLineNo">518</span> FilterProtos.FilterList.newBuilder();<a name="line.518"></a> -<span class="sourceLineNo">519</span> builder.setOperator(FilterProtos.FilterList.Operator.valueOf(operator.name()));<a name="line.519"></a> -<span class="sourceLineNo">520</span> int listize = filters.size();<a name="line.520"></a> -<span class="sourceLineNo">521</span> for (int i = 0; i < listize; i++) {<a name="line.521"></a> -<span class="sourceLineNo">522</span> builder.addFilters(ProtobufUtil.toFilter(filters.get(i)));<a name="line.522"></a> -<span class="sourceLineNo">523</span> }<a name="line.523"></a> -<span class="sourceLineNo">524</span> return builder.build().toByteArray();<a name="line.524"></a> -<span class="sourceLineNo">525</span> }<a name="line.525"></a> -<span class="sourceLineNo">526</span><a name="line.526"></a> -<span class="sourceLineNo">527</span> /**<a name="line.527"></a> -<span class="sourceLineNo">528</span> * @param pbBytes A pb serialized {@link FilterList} instance<a name="line.528"></a> -<span class="sourceLineNo">529</span> * @return An instance of {@link FilterList} made from <code>bytes</code><a name="line.529"></a> -<span class="sourceLineNo">530</span> * @throws DeserializationException<a name="line.530"></a> -<span class="sourceLineNo">531</span> * @see #toByteArray<a name="line.531"></a> -<span class="sourceLineNo">532</span> */<a name="line.532"></a> -<span class="sourceLineNo">533</span> public static FilterList parseFrom(final byte [] pbBytes)<a name="line.533"></a> -<span class="sourceLineNo">534</span> throws DeserializationException {<a name="line.534"></a> -<span class="sourceLineNo">535</span> FilterProtos.FilterList proto;<a name="line.535"></a> -<span class="sourceLineNo">536</span> try {<a name="line.536"></a> -<span class="sourceLineNo">537</span> proto = FilterProtos.FilterList.parseFrom(pbBytes);<a name="line.537"></a> -<span class="sourceLineNo">538</span> } catch (InvalidProtocolBufferException e) {<a name="line.538"></a> -<span class="sourceLineNo">539</span> throw new DeserializationException(e);<a name="line.539"></a> -<span class="sourceLineNo">540</span> }<a name="line.540"></a> -<span class="sourceLineNo">541</span><a name="line.541"></a> -<span class="sourceLineNo">542</span> List<Filter> rowFilters = new ArrayList<>(proto.getFiltersCount());<a name="line.542"></a> -<span class="sourceLineNo">543</span> try {<a name="line.543"></a> -<span class="sourceLineNo">544</span> List<FilterProtos.Filter> filtersList = proto.getFiltersList();<a name="line.544"></a> -<span class="sourceLineNo">545</span> int listSize = filtersList.size();<a name="line.545"></a> -<span class="sourceLineNo">546</span> for (int i = 0; i < listSize; i++) {<a name="line.546"></a> -<span class="sourceLineNo">547</span> rowFilters.add(ProtobufUtil.toFilter(filtersList.get(i)));<a name="line.547"></a> +<span class="sourceLineNo">421</span> private ReturnCode filterKeyValueWithMustPassAll(Cell c) throws IOException {<a name="line.421"></a> +<span class="sourceLineNo">422</span> ReturnCode rc = ReturnCode.INCLUDE;<a name="line.422"></a> +<span class="sourceLineNo">423</span> Cell transformed = c;<a name="line.423"></a> +<span class="sourceLineNo">424</span> this.seekHintFilter.clear();<a name="line.424"></a> +<span class="sourceLineNo">425</span> for (int i = 0, n = filters.size(); i < n; i++) {<a name="line.425"></a> +<span class="sourceLineNo">426</span> Filter filter = filters.get(i);<a name="line.426"></a> +<span class="sourceLineNo">427</span> if (filter.filterAllRemaining()) {<a name="line.427"></a> +<span class="sourceLineNo">428</span> return ReturnCode.NEXT_ROW;<a name="line.428"></a> +<span class="sourceLineNo">429</span> }<a name="line.429"></a> +<span class="sourceLineNo">430</span> ReturnCode localRC = filter.filterKeyValue(c);<a name="line.430"></a> +<span class="sourceLineNo">431</span> rc = mergeReturnCodeForAndOperator(rc, localRC);<a name="line.431"></a> +<span class="sourceLineNo">432</span><a name="line.432"></a> +<span class="sourceLineNo">433</span> // For INCLUDE* case, we need to update the transformed cell.<a name="line.433"></a> +<span class="sourceLineNo">434</span> if (isInReturnCodes(localRC, ReturnCode.INCLUDE, ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.434"></a> +<span class="sourceLineNo">435</span> ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.435"></a> +<span class="sourceLineNo">436</span> transformed = filter.transformCell(transformed);<a name="line.436"></a> +<span class="sourceLineNo">437</span> }<a name="line.437"></a> +<span class="sourceLineNo">438</span> if (localRC == ReturnCode.SEEK_NEXT_USING_HINT) {<a name="line.438"></a> +<span class="sourceLineNo">439</span> seekHintFilter.add(filter);<a name="line.439"></a> +<span class="sourceLineNo">440</span> }<a name="line.440"></a> +<span class="sourceLineNo">441</span> }<a name="line.441"></a> +<span class="sourceLineNo">442</span> this.transformedCell = transformed;<a name="line.442"></a> +<span class="sourceLineNo">443</span> if (!seekHintFilter.isEmpty()) {<a name="line.443"></a> +<span class="sourceLineNo">444</span> return ReturnCode.SEEK_NEXT_USING_HINT;<a name="line.444"></a> +<span class="sourceLineNo">445</span> }<a name="line.445"></a> +<span class="sourceLineNo">446</span> return rc;<a name="line.446"></a> +<span class="sourceLineNo">447</span> }<a name="line.447"></a> +<span class="sourceLineNo">448</span><a name="line.448"></a> +<span class="sourceLineNo">449</span> private void updatePrevFilterRCList(int index, ReturnCode currentRC) {<a name="line.449"></a> +<span class="sourceLineNo">450</span> prevFilterRCList.set(index, currentRC);<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> private void updatePrevCellList(int index, Cell currentCell, ReturnCode currentRC) {<a name="line.453"></a> +<span class="sourceLineNo">454</span> if (currentCell == null || currentRC == ReturnCode.INCLUDE || currentRC == ReturnCode.SKIP) {<a name="line.454"></a> +<span class="sourceLineNo">455</span> // If previous return code is INCLUDE or SKIP, we should always pass the next cell to the<a name="line.455"></a> +<span class="sourceLineNo">456</span> // corresponding sub-filter(need not test shouldPassCurrentCellToFilter() method), So we<a name="line.456"></a> +<span class="sourceLineNo">457</span> // need not save current cell to prevCellList for saving heap memory.<a name="line.457"></a> +<span class="sourceLineNo">458</span> prevCellList.set(index, null);<a name="line.458"></a> +<span class="sourceLineNo">459</span> } else {<a name="line.459"></a> +<span class="sourceLineNo">460</span> prevCellList.set(index, KeyValueUtil.toNewKeyCell(currentCell));<a name="line.460"></a> +<span class="sourceLineNo">461</span> }<a name="line.461"></a> +<span class="sourceLineNo">462</span> }<a name="line.462"></a> +<span class="sourceLineNo">463</span><a name="line.463"></a> +<span class="sourceLineNo">464</span> private static boolean isInReturnCodes(ReturnCode testRC, ReturnCode... returnCodes) {<a name="line.464"></a> +<span class="sourceLineNo">465</span> return Arrays.stream(returnCodes).anyMatch(testRC::equals);<a name="line.465"></a> +<span class="sourceLineNo">466</span> }<a name="line.466"></a> +<span class="sourceLineNo">467</span><a name="line.467"></a> +<span class="sourceLineNo">468</span> /**<a name="line.468"></a> +<span class="sourceLineNo">469</span> * FilterList with MUST_PASS_ONE choose the minimal forward step among sub-filter in filter list.<a name="line.469"></a> +<span class="sourceLineNo">470</span> * Let's call it: The Minimal Step Rule. So if filter-A in filter list return INCLUDE and filter-B<a name="line.470"></a> +<span class="sourceLineNo">471</span> * in filter list return INCLUDE_AND_NEXT_COL, then the filter list should return INCLUDE. For<a name="line.471"></a> +<span class="sourceLineNo">472</span> * SEEK_NEXT_USING_HINT, it's more special, because we do not know how far it will forward, so we<a name="line.472"></a> +<span class="sourceLineNo">473</span> * use SKIP by default.<br/><a name="line.473"></a> +<span class="sourceLineNo">474</span> * <br/><a name="line.474"></a> +<span class="sourceLineNo">475</span> * The jump step will be:<a name="line.475"></a> +<span class="sourceLineNo">476</span> *<a name="line.476"></a> +<span class="sourceLineNo">477</span> * <pre><a name="line.477"></a> +<span class="sourceLineNo">478</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.478"></a> +<span class="sourceLineNo">479</span> * </pre><a name="line.479"></a> +<span class="sourceLineNo">480</span> *<a name="line.480"></a> +<span class="sourceLineNo">481</span> * Here, we have the following map to describe The Minimal Step Rule. if current return code (for<a name="line.481"></a> +<span class="sourceLineNo">482</span> * previous sub-filters in filter list) is <strong>ReturnCode</strong>, and current filter returns<a name="line.482"></a> +<span class="sourceLineNo">483</span> * <strong>localRC</strong>, then we should return map[ReturnCode][localRC] for the merged result,<a name="line.483"></a> +<span class="sourceLineNo">484</span> * according to The Minimal Step Rule.<br/><a name="line.484"></a> +<span class="sourceLineNo">485</span> *<a name="line.485"></a> +<span class="sourceLineNo">486</span> * <pre><a name="line.486"></a> +<span class="sourceLineNo">487</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.487"></a> +<span class="sourceLineNo">488</span> * INCLUDE INCLUDE INCLUDE INCLUDE INCLUDE INCLUDE INCLUDE INCLUDE<a name="line.488"></a> +<span class="sourceLineNo">489</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.489"></a> +<span class="sourceLineNo">490</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.490"></a> +<span class="sourceLineNo">491</span> * SKIP INCLUDE INCLUDE INCLUDE SKIP SKIP SKIP SKIP<a name="line.491"></a> +<span class="sourceLineNo">492</span> * NEXT_COL INCLUDE INCLUDE_AND_NEXT_COL INCLUDE_AND_NEXT_COL SKIP NEXT_COL NEXT_COL SKIP<a name="line.492"></a> +<span class="sourceLineNo">493</span> * NEXT_ROW INCLUDE INCLUDE_AND_NEXT_COL INCLUDE_AND_SEEK_NEXT_ROW SKIP NEXT_COL NEXT_ROW SKIP<a name="line.493"></a> +<span class="sourceLineNo">494</span> * SEEK_NEXT_USING_HINT INCLUDE INCLUDE INCLUDE SKIP SKIP SKIP SEEK_NEXT_USING_HINT<a name="line.494"></a> +<span class="sourceLineNo">495</span> * </pre><a name="line.495"></a> +<span class="sourceLineNo">496</span> * @param rc Return code which is calculated by previous sub-filter(s) in filter list.<a name="line.496"></a> +<span class="sourceLineNo">497</span> * @param localRC Return code of the current sub-filter in filter list.<a name="line.497"></a> +<span class="sourceLineNo">498</span> * @return Return code which is merged by the return code of previous sub-filter(s) and the return<a name="line.498"></a> +<span class="sourceLineNo">499</span> * code of current sub-filter.<a name="line.499"></a> +<span class="sourceLineNo">500</span> */<a name="line.500"></a> +<span class="sourceLineNo">501</span> private ReturnCode mergeReturnCodeForOrOperator(ReturnCode rc, ReturnCode localRC) {<a name="line.501"></a> +<span class="sourceLineNo">502</span> if (rc == null) return localRC;<a name="line.502"></a> +<span class="sourceLineNo">503</span> switch (localRC) {<a name="line.503"></a> +<span class="sourceLineNo">504</span> case INCLUDE:<a name="line.504"></a> +<span class="sourceLineNo">505</span> return ReturnCode.INCLUDE;<a name="line.505"></a> +<span class="sourceLineNo">506</span> case INCLUDE_AND_NEXT_COL:<a name="line.506"></a> +<span class="sourceLineNo">507</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE, ReturnCode.SKIP,<a name="line.507"></a> +<span class="sourceLineNo">508</span> ReturnCode.SEEK_NEXT_USING_HINT)) {<a name="line.508"></a> +<span class="sourceLineNo">509</span> return ReturnCode.INCLUDE;<a name="line.509"></a> +<span class="sourceLineNo">510</span> }<a name="line.510"></a> +<span class="sourceLineNo">511</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE_AND_NEXT_COL, ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW,<a name="line.511"></a> +<span class="sourceLineNo">512</span> ReturnCode.NEXT_COL, ReturnCode.NEXT_ROW)) {<a name="line.512"></a> +<span class="sourceLineNo">513</span> return ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.513"></a> +<span class="sourceLineNo">514</span> }<a name="line.514"></a> +<span class="sourceLineNo">515</span> break;<a name="line.515"></a> +<span class="sourceLineNo">516</span> case INCLUDE_AND_SEEK_NEXT_ROW:<a name="line.516"></a> +<span class="sourceLineNo">517</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE, ReturnCode.SKIP,<a name="line.517"></a> +<span class="sourceLineNo">518</span> ReturnCode.SEEK_NEXT_USING_HINT)) {<a name="line.518"></a> +<span class="sourceLineNo">519</span> return ReturnCode.INCLUDE;<a name="line.519"></a> +<span class="sourceLineNo">520</span> }<a name="line.520"></a> +<span class="sourceLineNo">521</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE_AND_NEXT_COL, ReturnCode.NEXT_COL)) {<a name="line.521"></a> +<span class="sourceLineNo">522</span> return ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.522"></a> +<span class="sourceLineNo">523</span> }<a name="line.523"></a> +<span class="sourceLineNo">524</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW, ReturnCode.NEXT_ROW)) {<a name="line.524"></a> +<span class="sourceLineNo">525</span> return ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW;<a name="line.525"></a> +<span class="sourceLineNo">526</span> }<a name="line.526"></a> +<span class="sourceLineNo">527</span> break;<a name="line.527"></a> +<span class="sourceLineNo">528</span> case SKIP:<a name="line.528"></a> +<span class="sourceLineNo">529</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE, ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.529"></a> +<span class="sourceLineNo">530</span> ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.530"></a> +<span class="sourceLineNo">531</span> return ReturnCode.INCLUDE;<a name="line.531"></a> +<span class="sourceLineNo">532</span> }<a name="line.532"></a> +<span class="sourceLineNo">533</span> if (isInReturnCodes(rc, ReturnCode.SKIP, ReturnCode.NEXT_COL, ReturnCode.NEXT_ROW,<a name="line.533"></a> +<span class="sourceLineNo">534</span> ReturnCode.SEEK_NEXT_USING_HINT)) {<a name="line.534"></a> +<span class="sourceLineNo">535</span> return ReturnCode.SKIP;<a name="line.535"></a> +<span class="sourceLineNo">536</span> }<a name="line.536"></a> +<span class="sourceLineNo">537</span> break;<a name="line.537"></a> +<span class="sourceLineNo">538</span> case NEXT_COL:<a name="line.538"></a> +<span class="sourceLineNo">539</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE)) {<a name="line.539"></a> +<span class="sourceLineNo">540</span> return ReturnCode.INCLUDE;<a name="line.540"></a> +<span class="sourceLineNo">541</span> }<a name="line.541"></a> +<span class="sourceLineNo">542</span> if (isInReturnCodes(rc, ReturnCode.INCLUDE_AND_NEXT_COL,<a name="line.542"></a> +<span class="sourceLineNo">543</span> ReturnCode.INCLUDE_AND_SEEK_NEXT_ROW)) {<a name="line.543"></a> +<span class="sourceLineNo">544</span> return ReturnCode.INCLUDE_AND_NEXT_COL;<a name="line.544"></a> +<span class="sourceLineNo">545</span> }<a name="line.545"></a> +<span class="sourceLineNo">546</span> if (isInR
<TRUNCATED>
