http://git-wip-us.apache.org/repos/asf/hbase-site/blob/22cff34f/apidocs/src-html/org/apache/hadoop/hbase/filter/FuzzyRowFilter.html
----------------------------------------------------------------------
diff --git
a/apidocs/src-html/org/apache/hadoop/hbase/filter/FuzzyRowFilter.html
b/apidocs/src-html/org/apache/hadoop/hbase/filter/FuzzyRowFilter.html
index 3e67195..3a0b315 100644
--- a/apidocs/src-html/org/apache/hadoop/hbase/filter/FuzzyRowFilter.html
+++ b/apidocs/src-html/org/apache/hadoop/hbase/filter/FuzzyRowFilter.html
@@ -91,7 +91,7 @@
<span class="sourceLineNo">083</span> p = fuzzyKeysData.get(i);<a
name="line.83"></a>
<span class="sourceLineNo">084</span> if (p.getFirst().length !=
p.getSecond().length) {<a name="line.84"></a>
<span class="sourceLineNo">085</span> Pair<String, String>
readable =<a name="line.85"></a>
-<span class="sourceLineNo">086</span> new Pair<String,
String>(Bytes.toStringBinary(p.getFirst()), Bytes.toStringBinary(p<a
name="line.86"></a>
+<span class="sourceLineNo">086</span> new
Pair<>(Bytes.toStringBinary(p.getFirst()), Bytes.toStringBinary(p<a
name="line.86"></a>
<span class="sourceLineNo">087</span> .getSecond()));<a
name="line.87"></a>
<span class="sourceLineNo">088</span> throw new
IllegalArgumentException("Fuzzy pair lengths do not match: " + readable);<a
name="line.88"></a>
<span class="sourceLineNo">089</span> }<a name="line.89"></a>
@@ -199,440 +199,439 @@
<span class="sourceLineNo">191</span> private boolean initialized =
false;<a name="line.191"></a>
<span class="sourceLineNo">192</span><a name="line.192"></a>
<span class="sourceLineNo">193</span> RowTracker() {<a name="line.193"></a>
-<span class="sourceLineNo">194</span> nextRows =<a name="line.194"></a>
-<span class="sourceLineNo">195</span> new
PriorityQueue<Pair<byte[], Pair<byte[],
byte[]>>>(fuzzyKeysData.size(),<a name="line.195"></a>
-<span class="sourceLineNo">196</span> new
Comparator<Pair<byte[], Pair<byte[], byte[]>>>() {<a
name="line.196"></a>
-<span class="sourceLineNo">197</span> @Override<a
name="line.197"></a>
-<span class="sourceLineNo">198</span> public int
compare(Pair<byte[], Pair<byte[], byte[]>> o1,<a
name="line.198"></a>
-<span class="sourceLineNo">199</span> Pair<byte[],
Pair<byte[], byte[]>> o2) {<a name="line.199"></a>
-<span class="sourceLineNo">200</span> return isReversed()?
Bytes.compareTo(o2.getFirst(), o1.getFirst()):<a name="line.200"></a>
-<span class="sourceLineNo">201</span>
Bytes.compareTo(o1.getFirst(), o2.getFirst());<a name="line.201"></a>
-<span class="sourceLineNo">202</span> }<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><a name="line.205"></a>
-<span class="sourceLineNo">206</span> byte[] nextRow() {<a
name="line.206"></a>
-<span class="sourceLineNo">207</span> if (nextRows.isEmpty()) {<a
name="line.207"></a>
-<span class="sourceLineNo">208</span> throw new
IllegalStateException(<a name="line.208"></a>
-<span class="sourceLineNo">209</span> "NextRows should not be
empty, make sure to call nextRow() after updateTracker() return true");<a
name="line.209"></a>
-<span class="sourceLineNo">210</span> } else {<a name="line.210"></a>
-<span class="sourceLineNo">211</span> return
nextRows.peek().getFirst();<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><a name="line.214"></a>
-<span class="sourceLineNo">215</span> boolean updateTracker(Cell
currentCell) {<a name="line.215"></a>
-<span class="sourceLineNo">216</span> if (!initialized) {<a
name="line.216"></a>
-<span class="sourceLineNo">217</span> for (Pair<byte[], byte[]>
fuzzyData : fuzzyKeysData) {<a name="line.217"></a>
-<span class="sourceLineNo">218</span> updateWith(currentCell,
fuzzyData);<a name="line.218"></a>
-<span class="sourceLineNo">219</span> }<a name="line.219"></a>
-<span class="sourceLineNo">220</span> initialized = true;<a
name="line.220"></a>
-<span class="sourceLineNo">221</span> } else {<a name="line.221"></a>
-<span class="sourceLineNo">222</span> while (!nextRows.isEmpty()
&& !lessThan(currentCell, nextRows.peek().getFirst())) {<a
name="line.222"></a>
-<span class="sourceLineNo">223</span> Pair<byte[], Pair<byte[],
byte[]>> head = nextRows.poll();<a name="line.223"></a>
-<span class="sourceLineNo">224</span> Pair<byte[], byte[]>
fuzzyData = head.getSecond();<a name="line.224"></a>
-<span class="sourceLineNo">225</span> updateWith(currentCell,
fuzzyData);<a name="line.225"></a>
-<span class="sourceLineNo">226</span> }<a name="line.226"></a>
-<span class="sourceLineNo">227</span> }<a name="line.227"></a>
-<span class="sourceLineNo">228</span> return !nextRows.isEmpty();<a
name="line.228"></a>
-<span class="sourceLineNo">229</span> }<a name="line.229"></a>
-<span class="sourceLineNo">230</span><a name="line.230"></a>
-<span class="sourceLineNo">231</span> boolean lessThan(Cell currentCell,
byte[] nextRowKey) {<a name="line.231"></a>
-<span class="sourceLineNo">232</span> int compareResult =<a
name="line.232"></a>
-<span class="sourceLineNo">233</span>
CellComparator.COMPARATOR.compareRows(currentCell, nextRowKey, 0,
nextRowKey.length);<a name="line.233"></a>
-<span class="sourceLineNo">234</span> return (!isReversed() &&
compareResult < 0) || (isReversed() && compareResult > 0);<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> void updateWith(Cell currentCell,
Pair<byte[], byte[]> fuzzyData) {<a name="line.237"></a>
-<span class="sourceLineNo">238</span> byte[] nextRowKeyCandidate =<a
name="line.238"></a>
-<span class="sourceLineNo">239</span>
getNextForFuzzyRule(isReversed(), currentCell.getRowArray(),
currentCell.getRowOffset(),<a name="line.239"></a>
-<span class="sourceLineNo">240</span> currentCell.getRowLength(),
fuzzyData.getFirst(), fuzzyData.getSecond());<a name="line.240"></a>
-<span class="sourceLineNo">241</span> if (nextRowKeyCandidate != null)
{<a name="line.241"></a>
-<span class="sourceLineNo">242</span> nextRows.add(new Pair<byte[],
Pair<byte[], byte[]>>(nextRowKeyCandidate, fuzzyData));<a
name="line.242"></a>
-<span class="sourceLineNo">243</span> }<a name="line.243"></a>
-<span class="sourceLineNo">244</span> }<a name="line.244"></a>
-<span class="sourceLineNo">245</span><a name="line.245"></a>
-<span class="sourceLineNo">246</span> }<a name="line.246"></a>
-<span class="sourceLineNo">247</span><a name="line.247"></a>
-<span class="sourceLineNo">248</span> @Override<a name="line.248"></a>
-<span class="sourceLineNo">249</span> public boolean filterAllRemaining() {<a
name="line.249"></a>
-<span class="sourceLineNo">250</span> return done;<a name="line.250"></a>
-<span class="sourceLineNo">251</span> }<a name="line.251"></a>
-<span class="sourceLineNo">252</span><a name="line.252"></a>
-<span class="sourceLineNo">253</span> /**<a name="line.253"></a>
-<span class="sourceLineNo">254</span> * @return The filter serialized using
pb<a name="line.254"></a>
-<span class="sourceLineNo">255</span> */<a name="line.255"></a>
-<span class="sourceLineNo">256</span> public byte[] toByteArray() {<a
name="line.256"></a>
-<span class="sourceLineNo">257</span> FilterProtos.FuzzyRowFilter.Builder
builder = FilterProtos.FuzzyRowFilter.newBuilder();<a name="line.257"></a>
-<span class="sourceLineNo">258</span> for (Pair<byte[], byte[]>
fuzzyData : fuzzyKeysData) {<a name="line.258"></a>
-<span class="sourceLineNo">259</span> BytesBytesPair.Builder bbpBuilder =
BytesBytesPair.newBuilder();<a name="line.259"></a>
-<span class="sourceLineNo">260</span>
bbpBuilder.setFirst(UnsafeByteOperations.unsafeWrap(fuzzyData.getFirst()));<a
name="line.260"></a>
-<span class="sourceLineNo">261</span>
bbpBuilder.setSecond(UnsafeByteOperations.unsafeWrap(fuzzyData.getSecond()));<a
name="line.261"></a>
-<span class="sourceLineNo">262</span>
builder.addFuzzyKeysData(bbpBuilder);<a name="line.262"></a>
-<span class="sourceLineNo">263</span> }<a name="line.263"></a>
-<span class="sourceLineNo">264</span> return
builder.build().toByteArray();<a name="line.264"></a>
-<span class="sourceLineNo">265</span> }<a name="line.265"></a>
-<span class="sourceLineNo">266</span><a name="line.266"></a>
-<span class="sourceLineNo">267</span> /**<a name="line.267"></a>
-<span class="sourceLineNo">268</span> * @param pbBytes A pb serialized
{@link FuzzyRowFilter} instance<a name="line.268"></a>
-<span class="sourceLineNo">269</span> * @return An instance of {@link
FuzzyRowFilter} made from <code>bytes</code><a name="line.269"></a>
-<span class="sourceLineNo">270</span> * @throws DeserializationException<a
name="line.270"></a>
-<span class="sourceLineNo">271</span> * @see #toByteArray<a
name="line.271"></a>
-<span class="sourceLineNo">272</span> */<a name="line.272"></a>
-<span class="sourceLineNo">273</span> public static FuzzyRowFilter
parseFrom(final byte[] pbBytes) throws DeserializationException {<a
name="line.273"></a>
-<span class="sourceLineNo">274</span> FilterProtos.FuzzyRowFilter proto;<a
name="line.274"></a>
-<span class="sourceLineNo">275</span> try {<a name="line.275"></a>
-<span class="sourceLineNo">276</span> proto =
FilterProtos.FuzzyRowFilter.parseFrom(pbBytes);<a name="line.276"></a>
-<span class="sourceLineNo">277</span> } catch
(InvalidProtocolBufferException e) {<a name="line.277"></a>
-<span class="sourceLineNo">278</span> throw new
DeserializationException(e);<a name="line.278"></a>
-<span class="sourceLineNo">279</span> }<a name="line.279"></a>
-<span class="sourceLineNo">280</span> int count =
proto.getFuzzyKeysDataCount();<a name="line.280"></a>
-<span class="sourceLineNo">281</span> ArrayList<Pair<byte[],
byte[]>> fuzzyKeysData = new ArrayList<Pair<byte[],
byte[]>>(count);<a name="line.281"></a>
-<span class="sourceLineNo">282</span> for (int i = 0; i < count; ++i)
{<a name="line.282"></a>
-<span class="sourceLineNo">283</span> BytesBytesPair current =
proto.getFuzzyKeysData(i);<a name="line.283"></a>
-<span class="sourceLineNo">284</span> byte[] keyBytes =
current.getFirst().toByteArray();<a name="line.284"></a>
-<span class="sourceLineNo">285</span> byte[] keyMeta =
current.getSecond().toByteArray();<a name="line.285"></a>
-<span class="sourceLineNo">286</span> fuzzyKeysData.add(new
Pair<byte[], byte[]>(keyBytes, keyMeta));<a name="line.286"></a>
-<span class="sourceLineNo">287</span> }<a name="line.287"></a>
-<span class="sourceLineNo">288</span> return new
FuzzyRowFilter(fuzzyKeysData);<a name="line.288"></a>
-<span class="sourceLineNo">289</span> }<a name="line.289"></a>
-<span class="sourceLineNo">290</span><a name="line.290"></a>
-<span class="sourceLineNo">291</span> @Override<a name="line.291"></a>
-<span class="sourceLineNo">292</span> public String toString() {<a
name="line.292"></a>
-<span class="sourceLineNo">293</span> final StringBuilder sb = new
StringBuilder();<a name="line.293"></a>
-<span class="sourceLineNo">294</span> sb.append("FuzzyRowFilter");<a
name="line.294"></a>
-<span class="sourceLineNo">295</span> sb.append("{fuzzyKeysData=");<a
name="line.295"></a>
-<span class="sourceLineNo">296</span> for (Pair<byte[], byte[]>
fuzzyData : fuzzyKeysData) {<a name="line.296"></a>
-<span class="sourceLineNo">297</span>
sb.append('{').append(Bytes.toStringBinary(fuzzyData.getFirst())).append(":");<a
name="line.297"></a>
-<span class="sourceLineNo">298</span>
sb.append(Bytes.toStringBinary(fuzzyData.getSecond())).append('}');<a
name="line.298"></a>
-<span class="sourceLineNo">299</span> }<a name="line.299"></a>
-<span class="sourceLineNo">300</span> sb.append("}, ");<a
name="line.300"></a>
-<span class="sourceLineNo">301</span> return sb.toString();<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> // Utility methods<a
name="line.304"></a>
-<span class="sourceLineNo">305</span><a name="line.305"></a>
-<span class="sourceLineNo">306</span> static enum SatisfiesCode {<a
name="line.306"></a>
-<span class="sourceLineNo">307</span> /** row satisfies fuzzy rule */<a
name="line.307"></a>
-<span class="sourceLineNo">308</span> YES,<a name="line.308"></a>
-<span class="sourceLineNo">309</span> /** row doesn't satisfy fuzzy rule,
but there's possible greater row that does */<a name="line.309"></a>
-<span class="sourceLineNo">310</span> NEXT_EXISTS,<a name="line.310"></a>
-<span class="sourceLineNo">311</span> /** row doesn't satisfy fuzzy rule
and there's no greater row that does */<a name="line.311"></a>
-<span class="sourceLineNo">312</span> NO_NEXT<a name="line.312"></a>
-<span class="sourceLineNo">313</span> }<a name="line.313"></a>
-<span class="sourceLineNo">314</span><a name="line.314"></a>
-<span class="sourceLineNo">315</span> @VisibleForTesting<a
name="line.315"></a>
-<span class="sourceLineNo">316</span> static SatisfiesCode satisfies(byte[]
row, byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.316"></a>
-<span class="sourceLineNo">317</span> return satisfies(false, row, 0,
row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.317"></a>
-<span class="sourceLineNo">318</span> }<a name="line.318"></a>
-<span class="sourceLineNo">319</span><a name="line.319"></a>
-<span class="sourceLineNo">320</span> @VisibleForTesting<a
name="line.320"></a>
-<span class="sourceLineNo">321</span> static SatisfiesCode satisfies(boolean
reverse, byte[] row, byte[] fuzzyKeyBytes,<a name="line.321"></a>
-<span class="sourceLineNo">322</span> byte[] fuzzyKeyMeta) {<a
name="line.322"></a>
-<span class="sourceLineNo">323</span> return satisfies(reverse, row, 0,
row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.323"></a>
-<span class="sourceLineNo">324</span> }<a name="line.324"></a>
-<span class="sourceLineNo">325</span><a name="line.325"></a>
-<span class="sourceLineNo">326</span> static SatisfiesCode satisfies(boolean
reverse, byte[] row, int offset, int length,<a name="line.326"></a>
-<span class="sourceLineNo">327</span> byte[] fuzzyKeyBytes, byte[]
fuzzyKeyMeta) {<a name="line.327"></a>
-<span class="sourceLineNo">328</span><a name="line.328"></a>
-<span class="sourceLineNo">329</span> if (!UNSAFE_UNALIGNED) {<a
name="line.329"></a>
-<span class="sourceLineNo">330</span> return satisfiesNoUnsafe(reverse,
row, offset, length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.330"></a>
-<span class="sourceLineNo">331</span> }<a name="line.331"></a>
-<span class="sourceLineNo">332</span><a name="line.332"></a>
-<span class="sourceLineNo">333</span> if (row == null) {<a
name="line.333"></a>
-<span class="sourceLineNo">334</span> // do nothing, let scan to
proceed<a name="line.334"></a>
-<span class="sourceLineNo">335</span> return SatisfiesCode.YES;<a
name="line.335"></a>
-<span class="sourceLineNo">336</span> }<a name="line.336"></a>
-<span class="sourceLineNo">337</span> length = Math.min(length,
fuzzyKeyBytes.length);<a name="line.337"></a>
-<span class="sourceLineNo">338</span> int numWords = length /
Bytes.SIZEOF_LONG;<a name="line.338"></a>
-<span class="sourceLineNo">339</span><a name="line.339"></a>
-<span class="sourceLineNo">340</span> int j = numWords << 3; //
numWords * SIZEOF_LONG;<a name="line.340"></a>
-<span class="sourceLineNo">341</span><a name="line.341"></a>
-<span class="sourceLineNo">342</span> for (int i = 0; i < j; i +=
Bytes.SIZEOF_LONG) {<a name="line.342"></a>
-<span class="sourceLineNo">343</span> long fuzzyBytes =
UnsafeAccess.toLong(fuzzyKeyBytes, i);<a name="line.343"></a>
-<span class="sourceLineNo">344</span> long fuzzyMeta =
UnsafeAccess.toLong(fuzzyKeyMeta, i);<a name="line.344"></a>
-<span class="sourceLineNo">345</span> long rowValue =
UnsafeAccess.toLong(row, offset + i);<a name="line.345"></a>
-<span class="sourceLineNo">346</span> if ((rowValue & fuzzyMeta) !=
(fuzzyBytes)) {<a name="line.346"></a>
-<span class="sourceLineNo">347</span> // We always return NEXT_EXISTS<a
name="line.347"></a>
-<span class="sourceLineNo">348</span> return
SatisfiesCode.NEXT_EXISTS;<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><a name="line.351"></a>
-<span class="sourceLineNo">352</span> int off = j;<a name="line.352"></a>
-<span class="sourceLineNo">353</span><a name="line.353"></a>
-<span class="sourceLineNo">354</span> if (length - off >=
Bytes.SIZEOF_INT) {<a name="line.354"></a>
-<span class="sourceLineNo">355</span> int fuzzyBytes =
UnsafeAccess.toInt(fuzzyKeyBytes, off);<a name="line.355"></a>
-<span class="sourceLineNo">356</span> int fuzzyMeta =
UnsafeAccess.toInt(fuzzyKeyMeta, off);<a name="line.356"></a>
-<span class="sourceLineNo">357</span> int rowValue =
UnsafeAccess.toInt(row, offset + off);<a name="line.357"></a>
-<span class="sourceLineNo">358</span> if ((rowValue & fuzzyMeta) !=
(fuzzyBytes)) {<a name="line.358"></a>
-<span class="sourceLineNo">359</span> // We always return NEXT_EXISTS<a
name="line.359"></a>
-<span class="sourceLineNo">360</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.360"></a>
-<span class="sourceLineNo">361</span> }<a name="line.361"></a>
-<span class="sourceLineNo">362</span> off += Bytes.SIZEOF_INT;<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> if (length - off >=
Bytes.SIZEOF_SHORT) {<a name="line.365"></a>
-<span class="sourceLineNo">366</span> short fuzzyBytes =
UnsafeAccess.toShort(fuzzyKeyBytes, off);<a name="line.366"></a>
-<span class="sourceLineNo">367</span> short fuzzyMeta =
UnsafeAccess.toShort(fuzzyKeyMeta, off);<a name="line.367"></a>
-<span class="sourceLineNo">368</span> short rowValue =
UnsafeAccess.toShort(row, offset + off);<a name="line.368"></a>
-<span class="sourceLineNo">369</span> if ((rowValue & fuzzyMeta) !=
(fuzzyBytes)) {<a name="line.369"></a>
-<span class="sourceLineNo">370</span> // We always return NEXT_EXISTS<a
name="line.370"></a>
-<span class="sourceLineNo">371</span> // even if it does not (in this
case getNextForFuzzyRule<a name="line.371"></a>
-<span class="sourceLineNo">372</span> // will return null)<a
name="line.372"></a>
-<span class="sourceLineNo">373</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.373"></a>
-<span class="sourceLineNo">374</span> }<a name="line.374"></a>
-<span class="sourceLineNo">375</span> off += Bytes.SIZEOF_SHORT;<a
name="line.375"></a>
-<span class="sourceLineNo">376</span> }<a name="line.376"></a>
-<span class="sourceLineNo">377</span><a name="line.377"></a>
-<span class="sourceLineNo">378</span> if (length - off >=
Bytes.SIZEOF_BYTE) {<a name="line.378"></a>
-<span class="sourceLineNo">379</span> int fuzzyBytes = fuzzyKeyBytes[off]
& 0xff;<a name="line.379"></a>
-<span class="sourceLineNo">380</span> int fuzzyMeta = fuzzyKeyMeta[off]
& 0xff;<a name="line.380"></a>
-<span class="sourceLineNo">381</span> int rowValue = row[offset + off]
& 0xff;<a name="line.381"></a>
-<span class="sourceLineNo">382</span> if ((rowValue & fuzzyMeta) !=
(fuzzyBytes)) {<a name="line.382"></a>
-<span class="sourceLineNo">383</span> // We always return NEXT_EXISTS<a
name="line.383"></a>
-<span class="sourceLineNo">384</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.384"></a>
-<span class="sourceLineNo">385</span> }<a name="line.385"></a>
-<span class="sourceLineNo">386</span> }<a name="line.386"></a>
-<span class="sourceLineNo">387</span> return SatisfiesCode.YES;<a
name="line.387"></a>
-<span class="sourceLineNo">388</span> }<a name="line.388"></a>
-<span class="sourceLineNo">389</span><a name="line.389"></a>
-<span class="sourceLineNo">390</span> static SatisfiesCode
satisfiesNoUnsafe(boolean reverse, byte[] row, int offset, int length,<a
name="line.390"></a>
-<span class="sourceLineNo">391</span> byte[] fuzzyKeyBytes, byte[]
fuzzyKeyMeta) {<a name="line.391"></a>
-<span class="sourceLineNo">392</span> if (row == null) {<a
name="line.392"></a>
-<span class="sourceLineNo">393</span> // do nothing, let scan to
proceed<a name="line.393"></a>
-<span class="sourceLineNo">394</span> return SatisfiesCode.YES;<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> Order order =
Order.orderFor(reverse);<a name="line.397"></a>
-<span class="sourceLineNo">398</span> boolean nextRowKeyCandidateExists =
false;<a name="line.398"></a>
-<span class="sourceLineNo">399</span><a name="line.399"></a>
-<span class="sourceLineNo">400</span> for (int i = 0; i <
fuzzyKeyMeta.length && i < length; i++) {<a name="line.400"></a>
-<span class="sourceLineNo">401</span> // First, checking if this position
is fixed and not equals the given one<a name="line.401"></a>
-<span class="sourceLineNo">402</span> boolean byteAtPositionFixed =
fuzzyKeyMeta[i] == 0;<a name="line.402"></a>
-<span class="sourceLineNo">403</span> boolean fixedByteIncorrect =
byteAtPositionFixed && fuzzyKeyBytes[i] != row[i + offset];<a
name="line.403"></a>
-<span class="sourceLineNo">404</span> if (fixedByteIncorrect) {<a
name="line.404"></a>
-<span class="sourceLineNo">405</span> // in this case there's another
row that satisfies fuzzy rule and bigger than this row<a name="line.405"></a>
-<span class="sourceLineNo">406</span> if (nextRowKeyCandidateExists)
{<a name="line.406"></a>
-<span class="sourceLineNo">407</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.407"></a>
-<span class="sourceLineNo">408</span> }<a name="line.408"></a>
-<span class="sourceLineNo">409</span><a name="line.409"></a>
-<span class="sourceLineNo">410</span> // If this row byte is less than
fixed then there's a byte array bigger than<a name="line.410"></a>
-<span class="sourceLineNo">411</span> // this row and which satisfies
the fuzzy rule. Otherwise there's no such byte array:<a name="line.411"></a>
-<span class="sourceLineNo">412</span> // this row is simply bigger than
any byte array that satisfies the fuzzy rule<a name="line.412"></a>
-<span class="sourceLineNo">413</span> boolean rowByteLessThanFixed =
(row[i + offset] & 0xFF) < (fuzzyKeyBytes[i] & 0xFF);<a
name="line.413"></a>
-<span class="sourceLineNo">414</span> if (rowByteLessThanFixed
&& !reverse) {<a name="line.414"></a>
-<span class="sourceLineNo">415</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.415"></a>
-<span class="sourceLineNo">416</span> } else if (!rowByteLessThanFixed
&& reverse) {<a name="line.416"></a>
-<span class="sourceLineNo">417</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.417"></a>
-<span class="sourceLineNo">418</span> } else {<a name="line.418"></a>
-<span class="sourceLineNo">419</span> return SatisfiesCode.NO_NEXT;<a
name="line.419"></a>
-<span class="sourceLineNo">420</span> }<a name="line.420"></a>
-<span class="sourceLineNo">421</span> }<a name="line.421"></a>
-<span class="sourceLineNo">422</span><a name="line.422"></a>
-<span class="sourceLineNo">423</span> // Second, checking if this
position is not fixed and byte value is not the biggest. In this<a
name="line.423"></a>
-<span class="sourceLineNo">424</span> // case there's a byte array bigger
than this row and which satisfies the fuzzy rule. To get<a name="line.424"></a>
-<span class="sourceLineNo">425</span> // bigger byte array that satisfies
the rule we need to just increase this byte<a name="line.425"></a>
-<span class="sourceLineNo">426</span> // (see the code of
getNextForFuzzyRule below) by one.<a name="line.426"></a>
-<span class="sourceLineNo">427</span> // Note: if non-fixed byte is
already at biggest value, this doesn't allow us to say there's<a
name="line.427"></a>
-<span class="sourceLineNo">428</span> // bigger one that satisfies the
rule as it can't be increased.<a name="line.428"></a>
-<span class="sourceLineNo">429</span> if (fuzzyKeyMeta[i] == 1 &&
!order.isMax(fuzzyKeyBytes[i])) {<a name="line.429"></a>
-<span class="sourceLineNo">430</span> nextRowKeyCandidateExists =
true;<a name="line.430"></a>
-<span class="sourceLineNo">431</span> }<a name="line.431"></a>
-<span class="sourceLineNo">432</span> }<a name="line.432"></a>
-<span class="sourceLineNo">433</span> return SatisfiesCode.YES;<a
name="line.433"></a>
-<span class="sourceLineNo">434</span> }<a name="line.434"></a>
-<span class="sourceLineNo">435</span><a name="line.435"></a>
-<span class="sourceLineNo">436</span> @VisibleForTesting<a
name="line.436"></a>
-<span class="sourceLineNo">437</span> static byte[]
getNextForFuzzyRule(byte[] row, byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a
name="line.437"></a>
-<span class="sourceLineNo">438</span> return getNextForFuzzyRule(false,
row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.438"></a>
-<span class="sourceLineNo">439</span> }<a name="line.439"></a>
-<span class="sourceLineNo">440</span><a name="line.440"></a>
-<span class="sourceLineNo">441</span> @VisibleForTesting<a
name="line.441"></a>
-<span class="sourceLineNo">442</span> static byte[]
getNextForFuzzyRule(boolean reverse, byte[] row, byte[] fuzzyKeyBytes,<a
name="line.442"></a>
-<span class="sourceLineNo">443</span> byte[] fuzzyKeyMeta) {<a
name="line.443"></a>
-<span class="sourceLineNo">444</span> return getNextForFuzzyRule(reverse,
row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.444"></a>
-<span class="sourceLineNo">445</span> }<a name="line.445"></a>
-<span class="sourceLineNo">446</span><a name="line.446"></a>
-<span class="sourceLineNo">447</span> /** Abstracts directional comparisons
based on scan direction. */<a name="line.447"></a>
-<span class="sourceLineNo">448</span> private enum Order {<a
name="line.448"></a>
-<span class="sourceLineNo">449</span> ASC {<a name="line.449"></a>
-<span class="sourceLineNo">450</span> public boolean lt(int lhs, int rhs)
{<a name="line.450"></a>
-<span class="sourceLineNo">451</span> return lhs < rhs;<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> public boolean gt(int lhs, int rhs)
{<a name="line.454"></a>
-<span class="sourceLineNo">455</span> return lhs > rhs;<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> public byte inc(byte val) {<a
name="line.458"></a>
-<span class="sourceLineNo">459</span> // TODO: what about
over/underflow?<a name="line.459"></a>
-<span class="sourceLineNo">460</span> return (byte) (val + 1);<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> public boolean isMax(byte val) {<a
name="line.463"></a>
-<span class="sourceLineNo">464</span> return val == (byte) 0xff;<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> public byte min() {<a
name="line.467"></a>
-<span class="sourceLineNo">468</span> return 0;<a name="line.468"></a>
-<span class="sourceLineNo">469</span> }<a name="line.469"></a>
-<span class="sourceLineNo">470</span> },<a name="line.470"></a>
-<span class="sourceLineNo">471</span> DESC {<a name="line.471"></a>
-<span class="sourceLineNo">472</span> public boolean lt(int lhs, int rhs)
{<a name="line.472"></a>
-<span class="sourceLineNo">473</span> return lhs > rhs;<a
name="line.473"></a>
-<span class="sourceLineNo">474</span> }<a name="line.474"></a>
-<span class="sourceLineNo">475</span><a name="line.475"></a>
-<span class="sourceLineNo">476</span> public boolean gt(int lhs, int rhs)
{<a name="line.476"></a>
-<span class="sourceLineNo">477</span> return lhs < rhs;<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> public byte inc(byte val) {<a
name="line.480"></a>
-<span class="sourceLineNo">481</span> // TODO: what about
over/underflow?<a name="line.481"></a>
-<span class="sourceLineNo">482</span> return (byte) (val - 1);<a
name="line.482"></a>
-<span class="sourceLineNo">483</span> }<a name="line.483"></a>
-<span class="sourceLineNo">484</span><a name="line.484"></a>
-<span class="sourceLineNo">485</span> public boolean isMax(byte val) {<a
name="line.485"></a>
-<span class="sourceLineNo">486</span> return val == 0;<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> public byte min() {<a
name="line.489"></a>
-<span class="sourceLineNo">490</span> return (byte) 0xFF;<a
name="line.490"></a>
-<span class="sourceLineNo">491</span> }<a name="line.491"></a>
-<span class="sourceLineNo">492</span> };<a name="line.492"></a>
-<span class="sourceLineNo">493</span><a name="line.493"></a>
-<span class="sourceLineNo">494</span> public static Order orderFor(boolean
reverse) {<a name="line.494"></a>
-<span class="sourceLineNo">495</span> return reverse ? DESC : ASC;<a
name="line.495"></a>
-<span class="sourceLineNo">496</span> }<a name="line.496"></a>
-<span class="sourceLineNo">497</span><a name="line.497"></a>
-<span class="sourceLineNo">498</span> /** Returns true when {@code lhs <
rhs}. */<a name="line.498"></a>
-<span class="sourceLineNo">499</span> public abstract boolean lt(int lhs,
int rhs);<a name="line.499"></a>
-<span class="sourceLineNo">500</span><a name="line.500"></a>
-<span class="sourceLineNo">501</span> /** Returns true when {@code lhs >
rhs}. */<a name="line.501"></a>
-<span class="sourceLineNo">502</span> public abstract boolean gt(int lhs,
int rhs);<a name="line.502"></a>
-<span class="sourceLineNo">503</span><a name="line.503"></a>
-<span class="sourceLineNo">504</span> /** Returns {@code val} incremented
by 1. */<a name="line.504"></a>
-<span class="sourceLineNo">505</span> public abstract byte inc(byte val);<a
name="line.505"></a>
-<span class="sourceLineNo">506</span><a name="line.506"></a>
-<span class="sourceLineNo">507</span> /** Return true when {@code val} is
the maximum value */<a name="line.507"></a>
-<span class="sourceLineNo">508</span> public abstract boolean isMax(byte
val);<a name="line.508"></a>
-<span class="sourceLineNo">509</span><a name="line.509"></a>
-<span class="sourceLineNo">510</span> /** Return the minimum value
according to this ordering scheme. */<a name="line.510"></a>
-<span class="sourceLineNo">511</span> public abstract byte min();<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> /**<a name="line.514"></a>
-<span class="sourceLineNo">515</span> * @return greater byte array than
given (row) which satisfies the fuzzy rule if it exists, null<a
name="line.515"></a>
-<span class="sourceLineNo">516</span> * otherwise<a
name="line.516"></a>
-<span class="sourceLineNo">517</span> */<a name="line.517"></a>
-<span class="sourceLineNo">518</span> @VisibleForTesting<a
name="line.518"></a>
-<span class="sourceLineNo">519</span> static byte[]
getNextForFuzzyRule(boolean reverse, byte[] row, int offset, int length,<a
name="line.519"></a>
-<span class="sourceLineNo">520</span> byte[] fuzzyKeyBytes, byte[]
fuzzyKeyMeta) {<a name="line.520"></a>
-<span class="sourceLineNo">521</span> // To find out the next "smallest"
byte array that satisfies fuzzy rule and "greater" than<a name="line.521"></a>
-<span class="sourceLineNo">522</span> // the given one we do the
following:<a name="line.522"></a>
-<span class="sourceLineNo">523</span> // 1. setting values on all "fixed"
positions to the values from fuzzyKeyBytes<a name="line.523"></a>
-<span class="sourceLineNo">524</span> // 2. if during the first step given
row did not increase, then we increase the value at<a name="line.524"></a>
-<span class="sourceLineNo">525</span> // the first "non-fixed" position
(where it is not maximum already)<a name="line.525"></a>
-<span class="sourceLineNo">526</span><a name="line.526"></a>
-<span class="sourceLineNo">527</span> // It is easier to perform this by
using fuzzyKeyBytes copy and setting "non-fixed" position<a name="line.527"></a>
-<span class="sourceLineNo">528</span> // values than otherwise.<a
name="line.528"></a>
-<span class="sourceLineNo">529</span> byte[] result =<a name="line.529"></a>
-<span class="sourceLineNo">530</span> Arrays.copyOf(fuzzyKeyBytes,
length > fuzzyKeyBytes.length ? length : fuzzyKeyBytes.length);<a
name="line.530"></a>
-<span class="sourceLineNo">531</span> if (reverse && length >
fuzzyKeyBytes.length) {<a name="line.531"></a>
-<span class="sourceLineNo">532</span> // we need trailing 0xff's instead
of trailing 0x00's<a name="line.532"></a>
-<span class="sourceLineNo">533</span> for (int i = fuzzyKeyBytes.length;
i < result.length; i++) {<a name="line.533"></a>
-<span class="sourceLineNo">534</span> result[i] = (byte) 0xFF;<a
name="line.534"></a>
-<span class="sourceLineNo">535</span> }<a name="line.535"></a>
-<span class="sourceLineNo">536</span> }<a name="line.536"></a>
-<span class="sourceLineNo">537</span> int toInc = -1;<a name="line.537"></a>
-<span class="sourceLineNo">538</span> final Order order =
Order.orderFor(reverse);<a name="line.538"></a>
-<span class="sourceLineNo">539</span><a name="line.539"></a>
-<span class="sourceLineNo">540</span> boolean increased = false;<a
name="line.540"></a>
-<span class="sourceLineNo">541</span> for (int i = 0; i < result.length;
i++) {<a name="line.541"></a>
-<span class="sourceLineNo">542</span> if (i >= fuzzyKeyMeta.length ||
fuzzyKeyMeta[i] == 0 /* non-fixed */) {<a name="line.542"></a>
-<span class="sourceLineNo">543</span> result[i] = row[offset + i];<a
name="line.543"></a>
-<span class="sourceLineNo">544</span> if (!order.isMax(row[offset +
i])) {<a name="line.544"></a>
-<span class="sourceLineNo">545</span> // this is "non-fixed" position
and is not at max value, hence we can increase it<a name="line.545"></a>
-<span class="sourceLineNo">546</span> toInc = i;<a
name="line.546"></a>
-<span class="sourceLineNo">547</span> }<a name="line.547"></a>
-<span class="sourceLineNo">548</span> } else if (i <
fuzzyKeyMeta.length && fuzzyKeyMeta[i] == -1 /* fixed */) {<a
name="line.548"></a>
-<span class="sourceLineNo">549</span> if (order.lt((row[i + offset]
& 0xFF), (fuzzyKeyBytes[i] & 0xFF))) {<a name="line.549"></a>
-<span class="sourceLineNo">550</span> // if setting value for any
fixed position increased the original array,<a name="line.550"></a>
-<span class="sourceLineNo">551</span> // we are OK<a
name="line.551"></a>
-<span class="sourceLineNo">552</span> increased = true;<a
name="line.552"></a>
-<span class="sourceLineNo">553</span> break;<a name="line.553"></a>
-<span class="sourceLineNo">554</span> }<a name="line.554"></a>
-<span class="sourceLineNo">555</span><a name="line.555"></a>
-<span class="sourceLineNo">556</span> if (order.gt((row[i + offset]
& 0xFF), (fuzzyKeyBytes[i] & 0xFF))) {<a name="line.556"></a>
-<span class="sourceLineNo">557</span> // if setting value for any
fixed position makes array "smaller", then just stop:<a name="line.557"></a>
-<span class="sourceLineNo">558</span> // in case we found some
non-fixed position to increase we will do it, otherwise<a name="line.558"></a>
-<span class="sourceLineNo">559</span> // there's no "next" row key
that satisfies fuzzy rule and "greater" than given row<a name="line.559"></a>
-<span class="sourceLineNo">560</span> break;<a name="line.560"></a>
-<span class="sourceLineNo">561</span> }<a name="line.561"></a>
-<span class="sourceLineNo">562</span> }<a name="line.562"></a>
-<span class="sourceLineNo">563</span> }<a name="line.563"></a>
-<span class="sourceLineNo">564</span><a name="line.564"></a>
-<span class="sourceLineNo">565</span> if (!increased) {<a
name="line.565"></a>
-<span class="sourceLineNo">566</span> if (toInc < 0) {<a
name="line.566"></a>
-<span class="sourceLineNo">567</span> return null;<a
name="line.567"></a>
-<span class="sourceLineNo">568</span> }<a name="line.568"></a>
-<span class="sourceLineNo">569</span> result[toInc] =
order.inc(result[toInc]);<a name="line.569"></a>
-<span class="sourceLineNo">570</span><a name="line.570"></a>
-<span class="sourceLineNo">571</span> // Setting all "non-fixed"
positions to zeroes to the right of the one we increased so<a
name="line.571"></a>
-<span class="sourceLineNo">572</span> // that found "next" row key is the
smallest possible<a name="line.572"></a>
-<span class="sourceLineNo">573</span> for (int i = toInc + 1; i <
result.length; i++) {<a name="line.573"></a>
-<span class="sourceLineNo">574</span> if (i >= fuzzyKeyMeta.length
|| fuzzyKeyMeta[i] == 0 /* non-fixed */) {<a name="line.574"></a>
-<span class="sourceLineNo">575</span> result[i] = order.min();<a
name="line.575"></a>
-<span class="sourceLineNo">576</span> }<a name="line.576"></a>
-<span class="sourceLineNo">577</span> }<a name="line.577"></a>
-<span class="sourceLineNo">578</span> }<a name="line.578"></a>
-<span class="sourceLineNo">579</span><a name="line.579"></a>
-<span class="sourceLineNo">580</span> return reverse? result:
trimTrailingZeroes(result, fuzzyKeyMeta, toInc);<a name="line.580"></a>
-<span class="sourceLineNo">581</span> }<a name="line.581"></a>
-<span class="sourceLineNo">582</span><a name="line.582"></a>
-<span class="sourceLineNo">583</span> /**<a name="line.583"></a>
-<span class="sourceLineNo">584</span> * For forward scanner, next cell hint
should not contain any trailing zeroes<a name="line.584"></a>
-<span class="sourceLineNo">585</span> * unless they are part of
fuzzyKeyMeta<a name="line.585"></a>
-<span class="sourceLineNo">586</span> * hint = '\x01\x01\x01\x00\x00'<a
name="line.586"></a>
-<span class="sourceLineNo">587</span> * will skip valid row '\x01\x01\x01'<a
name="line.587"></a>
-<span class="sourceLineNo">588</span> * <a name="line.588"></a>
-<span class="sourceLineNo">589</span> * @param result<a name="line.589"></a>
-<span class="sourceLineNo">590</span> * @param fuzzyKeyMeta<a
name="line.590"></a>
-<span class="sourceLineNo">591</span> * @param toInc - position of
incremented byte<a name="line.591"></a>
-<span class="sourceLineNo">592</span> * @return trimmed version of result<a
name="line.592"></a>
-<span class="sourceLineNo">593</span> */<a name="line.593"></a>
-<span class="sourceLineNo">594</span> <a name="line.594"></a>
-<span class="sourceLineNo">595</span> private static byte[]
trimTrailingZeroes(byte[] result, byte[] fuzzyKeyMeta, int toInc) {<a
name="line.595"></a>
-<span class="sourceLineNo">596</span> int off = fuzzyKeyMeta.length >=
result.length? result.length -1:<a name="line.596"></a>
-<span class="sourceLineNo">597</span> fuzzyKeyMeta.length -1; <a
name="line.597"></a>
-<span class="sourceLineNo">598</span> for( ; off >= 0; off--){<a
name="line.598"></a>
-<span class="sourceLineNo">599</span> if(fuzzyKeyMeta[off] != 0) break;<a
name="line.599"></a>
-<span class="sourceLineNo">600</span> }<a name="line.600"></a>
-<span class="sourceLineNo">601</span> if (off < toInc) off = toInc;<a
name="line.601"></a>
-<span class="sourceLineNo">602</span> byte[] retValue = new byte[off+1];<a
name="line.602"></a>
-<span class="sourceLineNo">603</span> System.arraycopy(result, 0, retValue,
0, retValue.length);<a name="line.603"></a>
-<span class="sourceLineNo">604</span> return retValue;<a
name="line.604"></a>
-<span class="sourceLineNo">605</span> }<a name="line.605"></a>
-<span class="sourceLineNo">606</span><a name="line.606"></a>
-<span class="sourceLineNo">607</span> /**<a name="line.607"></a>
-<span class="sourceLineNo">608</span> * @return true if and only if the
fields of the filter that are serialized are equal to the<a name="line.608"></a>
-<span class="sourceLineNo">609</span> * corresponding fields in
other. Used for testing.<a name="line.609"></a>
-<span class="sourceLineNo">610</span> */<a name="line.610"></a>
-<span class="sourceLineNo">611</span> boolean areSerializedFieldsEqual(Filter
o) {<a name="line.611"></a>
-<span class="sourceLineNo">612</span> if (o == this) return true;<a
name="line.612"></a>
-<span class="sourceLineNo">613</span> if (!(o instanceof FuzzyRowFilter))
return false;<a name="line.613"></a>
-<span class="sourceLineNo">614</span><a name="line.614"></a>
-<span class="sourceLineNo">615</span> FuzzyRowFilter other =
(FuzzyRowFilter) o;<a name="line.615"></a>
-<span class="sourceLineNo">616</span> if (this.fuzzyKeysData.size() !=
other.fuzzyKeysData.size()) return false;<a name="line.616"></a>
-<span class="sourceLineNo">617</span> for (int i = 0; i <
fuzzyKeysData.size(); ++i) {<a name="line.617"></a>
-<span class="sourceLineNo">618</span> Pair<byte[], byte[]> thisData
= this.fuzzyKeysData.get(i);<a name="line.618"></a>
-<span class="sourceLineNo">619</span> Pair<byte[], byte[]>
otherData = other.fuzzyKeysData.get(i);<a name="line.619"></a>
-<span class="sourceLineNo">620</span> if
(!(Bytes.equals(thisData.getFirst(), otherData.getFirst()) &&
Bytes.equals(<a name="line.620"></a>
-<span class="sourceLineNo">621</span> thisData.getSecond(),
otherData.getSecond()))) {<a name="line.621"></a>
-<span class="sourceLineNo">622</span> return false;<a
name="line.622"></a>
-<span class="sourceLineNo">623</span> }<a name="line.623"></a>
-<span class="sourceLineNo">624</span> }<a name="line.624"></a>
-<span class="sourceLineNo">625</span> return true;<a name="line.625"></a>
-<span class="sourceLineNo">626</span> }<a name="line.626"></a>
-<span class="sourceLineNo">627</span>}<a name="line.627"></a>
+<span class="sourceLineNo">194</span> nextRows = new
PriorityQueue<>(fuzzyKeysData.size(),<a name="line.194"></a>
+<span class="sourceLineNo">195</span> new
Comparator<Pair<byte[], Pair<byte[], byte[]>>>() {<a
name="line.195"></a>
+<span class="sourceLineNo">196</span> @Override<a
name="line.196"></a>
+<span class="sourceLineNo">197</span> public int
compare(Pair<byte[], Pair<byte[], byte[]>> o1,<a
name="line.197"></a>
+<span class="sourceLineNo">198</span> Pair<byte[],
Pair<byte[], byte[]>> o2) {<a name="line.198"></a>
+<span class="sourceLineNo">199</span> return isReversed()?
Bytes.compareTo(o2.getFirst(), o1.getFirst()):<a name="line.199"></a>
+<span class="sourceLineNo">200</span>
Bytes.compareTo(o1.getFirst(), o2.getFirst());<a name="line.200"></a>
+<span class="sourceLineNo">201</span> }<a name="line.201"></a>
+<span class="sourceLineNo">202</span> });<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> byte[] nextRow() {<a
name="line.205"></a>
+<span class="sourceLineNo">206</span> if (nextRows.isEmpty()) {<a
name="line.206"></a>
+<span class="sourceLineNo">207</span> throw new
IllegalStateException(<a name="line.207"></a>
+<span class="sourceLineNo">208</span> "NextRows should not be
empty, make sure to call nextRow() after updateTracker() return true");<a
name="line.208"></a>
+<span class="sourceLineNo">209</span> } else {<a name="line.209"></a>
+<span class="sourceLineNo">210</span> return
nextRows.peek().getFirst();<a name="line.210"></a>
+<span class="sourceLineNo">211</span> }<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> boolean updateTracker(Cell
currentCell) {<a name="line.214"></a>
+<span class="sourceLineNo">215</span> if (!initialized) {<a
name="line.215"></a>
+<span class="sourceLineNo">216</span> for (Pair<byte[], byte[]>
fuzzyData : fuzzyKeysData) {<a name="line.216"></a>
+<span class="sourceLineNo">217</span> updateWith(currentCell,
fuzzyData);<a name="line.217"></a>
+<span class="sourceLineNo">218</span> }<a name="line.218"></a>
+<span class="sourceLineNo">219</span> initialized = true;<a
name="line.219"></a>
+<span class="sourceLineNo">220</span> } else {<a name="line.220"></a>
+<span class="sourceLineNo">221</span> while (!nextRows.isEmpty()
&& !lessThan(currentCell, nextRows.peek().getFirst())) {<a
name="line.221"></a>
+<span class="sourceLineNo">222</span> Pair<byte[], Pair<byte[],
byte[]>> head = nextRows.poll();<a name="line.222"></a>
+<span class="sourceLineNo">223</span> Pair<byte[], byte[]>
fuzzyData = head.getSecond();<a name="line.223"></a>
+<span class="sourceLineNo">224</span> updateWith(currentCell,
fuzzyData);<a name="line.224"></a>
+<span class="sourceLineNo">225</span> }<a name="line.225"></a>
+<span class="sourceLineNo">226</span> }<a name="line.226"></a>
+<span class="sourceLineNo">227</span> return !nextRows.isEmpty();<a
name="line.227"></a>
+<span class="sourceLineNo">228</span> }<a name="line.228"></a>
+<span class="sourceLineNo">229</span><a name="line.229"></a>
+<span class="sourceLineNo">230</span> boolean lessThan(Cell currentCell,
byte[] nextRowKey) {<a name="line.230"></a>
+<span class="sourceLineNo">231</span> int compareResult =<a
name="line.231"></a>
+<span class="sourceLineNo">232</span>
CellComparator.COMPARATOR.compareRows(currentCell, nextRowKey, 0,
nextRowKey.length);<a name="line.232"></a>
+<span class="sourceLineNo">233</span> return (!isReversed() &&
compareResult < 0) || (isReversed() && compareResult > 0);<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> void updateWith(Cell currentCell,
Pair<byte[], byte[]> fuzzyData) {<a name="line.236"></a>
+<span class="sourceLineNo">237</span> byte[] nextRowKeyCandidate =<a
name="line.237"></a>
+<span class="sourceLineNo">238</span>
getNextForFuzzyRule(isReversed(), currentCell.getRowArray(),
currentCell.getRowOffset(),<a name="line.238"></a>
+<span class="sourceLineNo">239</span> currentCell.getRowLength(),
fuzzyData.getFirst(), fuzzyData.getSecond());<a name="line.239"></a>
+<span class="sourceLineNo">240</span> if (nextRowKeyCandidate != null)
{<a name="line.240"></a>
+<span class="sourceLineNo">241</span> nextRows.add(new
Pair<>(nextRowKeyCandidate, fuzzyData));<a name="line.241"></a>
+<span class="sourceLineNo">242</span> }<a name="line.242"></a>
+<span class="sourceLineNo">243</span> }<a name="line.243"></a>
+<span class="sourceLineNo">244</span><a name="line.244"></a>
+<span class="sourceLineNo">245</span> }<a name="line.245"></a>
+<span class="sourceLineNo">246</span><a name="line.246"></a>
+<span class="sourceLineNo">247</span> @Override<a name="line.247"></a>
+<span class="sourceLineNo">248</span> public boolean filterAllRemaining() {<a
name="line.248"></a>
+<span class="sourceLineNo">249</span> return done;<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> /**<a name="line.252"></a>
+<span class="sourceLineNo">253</span> * @return The filter serialized using
pb<a name="line.253"></a>
+<span class="sourceLineNo">254</span> */<a name="line.254"></a>
+<span class="sourceLineNo">255</span> public byte[] toByteArray() {<a
name="line.255"></a>
+<span class="sourceLineNo">256</span> FilterProtos.FuzzyRowFilter.Builder
builder = FilterProtos.FuzzyRowFilter.newBuilder();<a name="line.256"></a>
+<span class="sourceLineNo">257</span> for (Pair<byte[], byte[]>
fuzzyData : fuzzyKeysData) {<a name="line.257"></a>
+<span class="sourceLineNo">258</span> BytesBytesPair.Builder bbpBuilder =
BytesBytesPair.newBuilder();<a name="line.258"></a>
+<span class="sourceLineNo">259</span>
bbpBuilder.setFirst(UnsafeByteOperations.unsafeWrap(fuzzyData.getFirst()));<a
name="line.259"></a>
+<span class="sourceLineNo">260</span>
bbpBuilder.setSecond(UnsafeByteOperations.unsafeWrap(fuzzyData.getSecond()));<a
name="line.260"></a>
+<span class="sourceLineNo">261</span>
builder.addFuzzyKeysData(bbpBuilder);<a name="line.261"></a>
+<span class="sourceLineNo">262</span> }<a name="line.262"></a>
+<span class="sourceLineNo">263</span> return
builder.build().toByteArray();<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> /**<a name="line.266"></a>
+<span class="sourceLineNo">267</span> * @param pbBytes A pb serialized
{@link FuzzyRowFilter} instance<a name="line.267"></a>
+<span class="sourceLineNo">268</span> * @return An instance of {@link
FuzzyRowFilter} made from <code>bytes</code><a name="line.268"></a>
+<span class="sourceLineNo">269</span> * @throws DeserializationException<a
name="line.269"></a>
+<span class="sourceLineNo">270</span> * @see #toByteArray<a
name="line.270"></a>
+<span class="sourceLineNo">271</span> */<a name="line.271"></a>
+<span class="sourceLineNo">272</span> public static FuzzyRowFilter
parseFrom(final byte[] pbBytes) throws DeserializationException {<a
name="line.272"></a>
+<span class="sourceLineNo">273</span> FilterProtos.FuzzyRowFilter proto;<a
name="line.273"></a>
+<span class="sourceLineNo">274</span> try {<a name="line.274"></a>
+<span class="sourceLineNo">275</span> proto =
FilterProtos.FuzzyRowFilter.parseFrom(pbBytes);<a name="line.275"></a>
+<span class="sourceLineNo">276</span> } catch
(InvalidProtocolBufferException e) {<a name="line.276"></a>
+<span class="sourceLineNo">277</span> throw new
DeserializationException(e);<a name="line.277"></a>
+<span class="sourceLineNo">278</span> }<a name="line.278"></a>
+<span class="sourceLineNo">279</span> int count =
proto.getFuzzyKeysDataCount();<a name="line.279"></a>
+<span class="sourceLineNo">280</span> ArrayList<Pair<byte[],
byte[]>> fuzzyKeysData = new ArrayList<>(count);<a
name="line.280"></a>
+<span class="sourceLineNo">281</span> for (int i = 0; i < count; ++i)
{<a name="line.281"></a>
+<span class="sourceLineNo">282</span> BytesBytesPair current =
proto.getFuzzyKeysData(i);<a name="line.282"></a>
+<span class="sourceLineNo">283</span> byte[] keyBytes =
current.getFirst().toByteArray();<a name="line.283"></a>
+<span class="sourceLineNo">284</span> byte[] keyMeta =
current.getSecond().toByteArray();<a name="line.284"></a>
+<span class="sourceLineNo">285</span> fuzzyKeysData.add(new
Pair<>(keyBytes, keyMeta));<a name="line.285"></a>
+<span class="sourceLineNo">286</span> }<a name="line.286"></a>
+<span class="sourceLineNo">287</span> return new
FuzzyRowFilter(fuzzyKeysData);<a name="line.287"></a>
+<span class="sourceLineNo">288</span> }<a name="line.288"></a>
+<span class="sourceLineNo">289</span><a name="line.289"></a>
+<span class="sourceLineNo">290</span> @Override<a name="line.290"></a>
+<span class="sourceLineNo">291</span> public String toString() {<a
name="line.291"></a>
+<span class="sourceLineNo">292</span> final StringBuilder sb = new
StringBuilder();<a name="line.292"></a>
+<span class="sourceLineNo">293</span> sb.append("FuzzyRowFilter");<a
name="line.293"></a>
+<span class="sourceLineNo">294</span> sb.append("{fuzzyKeysData=");<a
name="line.294"></a>
+<span class="sourceLineNo">295</span> for (Pair<byte[], byte[]>
fuzzyData : fuzzyKeysData) {<a name="line.295"></a>
+<span class="sourceLineNo">296</span>
sb.append('{').append(Bytes.toStringBinary(fuzzyData.getFirst())).append(":");<a
name="line.296"></a>
+<span class="sourceLineNo">297</span>
sb.append(Bytes.toStringBinary(fuzzyData.getSecond())).append('}');<a
name="line.297"></a>
+<span class="sourceLineNo">298</span> }<a name="line.298"></a>
+<span class="sourceLineNo">299</span> sb.append("}, ");<a
name="line.299"></a>
+<span class="sourceLineNo">300</span> return sb.toString();<a
name="line.300"></a>
+<span class="sourceLineNo">301</span> }<a name="line.301"></a>
+<span class="sourceLineNo">302</span><a name="line.302"></a>
+<span class="sourceLineNo">303</span> // Utility methods<a
name="line.303"></a>
+<span class="sourceLineNo">304</span><a name="line.304"></a>
+<span class="sourceLineNo">305</span> static enum SatisfiesCode {<a
name="line.305"></a>
+<span class="sourceLineNo">306</span> /** row satisfies fuzzy rule */<a
name="line.306"></a>
+<span class="sourceLineNo">307</span> YES,<a name="line.307"></a>
+<span class="sourceLineNo">308</span> /** row doesn't satisfy fuzzy rule,
but there's possible greater row that does */<a name="line.308"></a>
+<span class="sourceLineNo">309</span> NEXT_EXISTS,<a name="line.309"></a>
+<span class="sourceLineNo">310</span> /** row doesn't satisfy fuzzy rule
and there's no greater row that does */<a name="line.310"></a>
+<span class="sourceLineNo">311</span> NO_NEXT<a name="line.311"></a>
+<span class="sourceLineNo">312</span> }<a name="line.312"></a>
+<span class="sourceLineNo">313</span><a name="line.313"></a>
+<span class="sourceLineNo">314</span> @VisibleForTesting<a
name="line.314"></a>
+<span class="sourceLineNo">315</span> static SatisfiesCode satisfies(byte[]
row, byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a name="line.315"></a>
+<span class="sourceLineNo">316</span> return satisfies(false, row, 0,
row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.316"></a>
+<span class="sourceLineNo">317</span> }<a name="line.317"></a>
+<span class="sourceLineNo">318</span><a name="line.318"></a>
+<span class="sourceLineNo">319</span> @VisibleForTesting<a
name="line.319"></a>
+<span class="sourceLineNo">320</span> static SatisfiesCode satisfies(boolean
reverse, byte[] row, byte[] fuzzyKeyBytes,<a name="line.320"></a>
+<span class="sourceLineNo">321</span> byte[] fuzzyKeyMeta) {<a
name="line.321"></a>
+<span class="sourceLineNo">322</span> return satisfies(reverse, row, 0,
row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.322"></a>
+<span class="sourceLineNo">323</span> }<a name="line.323"></a>
+<span class="sourceLineNo">324</span><a name="line.324"></a>
+<span class="sourceLineNo">325</span> static SatisfiesCode satisfies(boolean
reverse, byte[] row, int offset, int length,<a name="line.325"></a>
+<span class="sourceLineNo">326</span> byte[] fuzzyKeyBytes, byte[]
fuzzyKeyMeta) {<a name="line.326"></a>
+<span class="sourceLineNo">327</span><a name="line.327"></a>
+<span class="sourceLineNo">328</span> if (!UNSAFE_UNALIGNED) {<a
name="line.328"></a>
+<span class="sourceLineNo">329</span> return satisfiesNoUnsafe(reverse,
row, offset, length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.329"></a>
+<span class="sourceLineNo">330</span> }<a name="line.330"></a>
+<span class="sourceLineNo">331</span><a name="line.331"></a>
+<span class="sourceLineNo">332</span> if (row == null) {<a
name="line.332"></a>
+<span class="sourceLineNo">333</span> // do nothing, let scan to
proceed<a name="line.333"></a>
+<span class="sourceLineNo">334</span> return SatisfiesCode.YES;<a
name="line.334"></a>
+<span class="sourceLineNo">335</span> }<a name="line.335"></a>
+<span class="sourceLineNo">336</span> length = Math.min(length,
fuzzyKeyBytes.length);<a name="line.336"></a>
+<span class="sourceLineNo">337</span> int numWords = length /
Bytes.SIZEOF_LONG;<a name="line.337"></a>
+<span class="sourceLineNo">338</span><a name="line.338"></a>
+<span class="sourceLineNo">339</span> int j = numWords << 3; //
numWords * SIZEOF_LONG;<a name="line.339"></a>
+<span class="sourceLineNo">340</span><a name="line.340"></a>
+<span class="sourceLineNo">341</span> for (int i = 0; i < j; i +=
Bytes.SIZEOF_LONG) {<a name="line.341"></a>
+<span class="sourceLineNo">342</span> long fuzzyBytes =
UnsafeAccess.toLong(fuzzyKeyBytes, i);<a name="line.342"></a>
+<span class="sourceLineNo">343</span> long fuzzyMeta =
UnsafeAccess.toLong(fuzzyKeyMeta, i);<a name="line.343"></a>
+<span class="sourceLineNo">344</span> long rowValue =
UnsafeAccess.toLong(row, offset + i);<a name="line.344"></a>
+<span class="sourceLineNo">345</span> if ((rowValue & fuzzyMeta) !=
(fuzzyBytes)) {<a name="line.345"></a>
+<span class="sourceLineNo">346</span> // We always return NEXT_EXISTS<a
name="line.346"></a>
+<span class="sourceLineNo">347</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.347"></a>
+<span class="sourceLineNo">348</span> }<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> int off = j;<a name="line.351"></a>
+<span class="sourceLineNo">352</span><a name="line.352"></a>
+<span class="sourceLineNo">353</span> if (length - off >=
Bytes.SIZEOF_INT) {<a name="line.353"></a>
+<span class="sourceLineNo">354</span> int fuzzyBytes =
UnsafeAccess.toInt(fuzzyKeyBytes, off);<a name="line.354"></a>
+<span class="sourceLineNo">355</span> int fuzzyMeta =
UnsafeAccess.toInt(fuzzyKeyMeta, off);<a name="line.355"></a>
+<span class="sourceLineNo">356</span> int rowValue =
UnsafeAccess.toInt(row, offset + off);<a name="line.356"></a>
+<span class="sourceLineNo">357</span> if ((rowValue & fuzzyMeta) !=
(fuzzyBytes)) {<a name="line.357"></a>
+<span class="sourceLineNo">358</span> // We always return NEXT_EXISTS<a
name="line.358"></a>
+<span class="sourceLineNo">359</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.359"></a>
+<span class="sourceLineNo">360</span> }<a name="line.360"></a>
+<span class="sourceLineNo">361</span> off += Bytes.SIZEOF_INT;<a
name="line.361"></a>
+<span class="sourceLineNo">362</span> }<a name="line.362"></a>
+<span class="sourceLineNo">363</span><a name="line.363"></a>
+<span class="sourceLineNo">364</span> if (length - off >=
Bytes.SIZEOF_SHORT) {<a name="line.364"></a>
+<span class="sourceLineNo">365</span> short fuzzyBytes =
UnsafeAccess.toShort(fuzzyKeyBytes, off);<a name="line.365"></a>
+<span class="sourceLineNo">366</span> short fuzzyMeta =
UnsafeAccess.toShort(fuzzyKeyMeta, off);<a name="line.366"></a>
+<span class="sourceLineNo">367</span> short rowValue =
UnsafeAccess.toShort(row, offset + off);<a name="line.367"></a>
+<span class="sourceLineNo">368</span> if ((rowValue & fuzzyMeta) !=
(fuzzyBytes)) {<a name="line.368"></a>
+<span class="sourceLineNo">369</span> // We always return NEXT_EXISTS<a
name="line.369"></a>
+<span class="sourceLineNo">370</span> // even if it does not (in this
case getNextForFuzzyRule<a name="line.370"></a>
+<span class="sourceLineNo">371</span> // will return null)<a
name="line.371"></a>
+<span class="sourceLineNo">372</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.372"></a>
+<span class="sourceLineNo">373</span> }<a name="line.373"></a>
+<span class="sourceLineNo">374</span> off += Bytes.SIZEOF_SHORT;<a
name="line.374"></a>
+<span class="sourceLineNo">375</span> }<a name="line.375"></a>
+<span class="sourceLineNo">376</span><a name="line.376"></a>
+<span class="sourceLineNo">377</span> if (length - off >=
Bytes.SIZEOF_BYTE) {<a name="line.377"></a>
+<span class="sourceLineNo">378</span> int fuzzyBytes = fuzzyKeyBytes[off]
& 0xff;<a name="line.378"></a>
+<span class="sourceLineNo">379</span> int fuzzyMeta = fuzzyKeyMeta[off]
& 0xff;<a name="line.379"></a>
+<span class="sourceLineNo">380</span> int rowValue = row[offset + off]
& 0xff;<a name="line.380"></a>
+<span class="sourceLineNo">381</span> if ((rowValue & fuzzyMeta) !=
(fuzzyBytes)) {<a name="line.381"></a>
+<span class="sourceLineNo">382</span> // We always return NEXT_EXISTS<a
name="line.382"></a>
+<span class="sourceLineNo">383</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.383"></a>
+<span class="sourceLineNo">384</span> }<a name="line.384"></a>
+<span class="sourceLineNo">385</span> }<a name="line.385"></a>
+<span class="sourceLineNo">386</span> return SatisfiesCode.YES;<a
name="line.386"></a>
+<span class="sourceLineNo">387</span> }<a name="line.387"></a>
+<span class="sourceLineNo">388</span><a name="line.388"></a>
+<span class="sourceLineNo">389</span> static SatisfiesCode
satisfiesNoUnsafe(boolean reverse, byte[] row, int offset, int length,<a
name="line.389"></a>
+<span class="sourceLineNo">390</span> byte[] fuzzyKeyBytes, byte[]
fuzzyKeyMeta) {<a name="line.390"></a>
+<span class="sourceLineNo">391</span> if (row == null) {<a
name="line.391"></a>
+<span class="sourceLineNo">392</span> // do nothing, let scan to
proceed<a name="line.392"></a>
+<span class="sourceLineNo">393</span> return SatisfiesCode.YES;<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> Order order =
Order.orderFor(reverse);<a name="line.396"></a>
+<span class="sourceLineNo">397</span> boolean nextRowKeyCandidateExists =
false;<a name="line.397"></a>
+<span class="sourceLineNo">398</span><a name="line.398"></a>
+<span class="sourceLineNo">399</span> for (int i = 0; i <
fuzzyKeyMeta.length && i < length; i++) {<a name="line.399"></a>
+<span class="sourceLineNo">400</span> // First, checking if this position
is fixed and not equals the given one<a name="line.400"></a>
+<span class="sourceLineNo">401</span> boolean byteAtPositionFixed =
fuzzyKeyMeta[i] == 0;<a name="line.401"></a>
+<span class="sourceLineNo">402</span> boolean fixedByteIncorrect =
byteAtPositionFixed && fuzzyKeyBytes[i] != row[i + offset];<a
name="line.402"></a>
+<span class="sourceLineNo">403</span> if (fixedByteIncorrect) {<a
name="line.403"></a>
+<span class="sourceLineNo">404</span> // in this case there's another
row that satisfies fuzzy rule and bigger than this row<a name="line.404"></a>
+<span class="sourceLineNo">405</span> if (nextRowKeyCandidateExists)
{<a name="line.405"></a>
+<span class="sourceLineNo">406</span> return
SatisfiesCode.NEXT_EXISTS;<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> // If this row byte is less than
fixed then there's a byte array bigger than<a name="line.409"></a>
+<span class="sourceLineNo">410</span> // this row and which satisfies
the fuzzy rule. Otherwise there's no such byte array:<a name="line.410"></a>
+<span class="sourceLineNo">411</span> // this row is simply bigger than
any byte array that satisfies the fuzzy rule<a name="line.411"></a>
+<span class="sourceLineNo">412</span> boolean rowByteLessThanFixed =
(row[i + offset] & 0xFF) < (fuzzyKeyBytes[i] & 0xFF);<a
name="line.412"></a>
+<span class="sourceLineNo">413</span> if (rowByteLessThanFixed
&& !reverse) {<a name="line.413"></a>
+<span class="sourceLineNo">414</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.414"></a>
+<span class="sourceLineNo">415</span> } else if (!rowByteLessThanFixed
&& reverse) {<a name="line.415"></a>
+<span class="sourceLineNo">416</span> return
SatisfiesCode.NEXT_EXISTS;<a name="line.416"></a>
+<span class="sourceLineNo">417</span> } else {<a name="line.417"></a>
+<span class="sourceLineNo">418</span> return SatisfiesCode.NO_NEXT;<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><a name="line.421"></a>
+<span class="sourceLineNo">422</span> // Second, checking if this
position is not fixed and byte value is not the biggest. In this<a
name="line.422"></a>
+<span class="sourceLineNo">423</span> // case there's a byte array bigger
than this row and which satisfies the fuzzy rule. To get<a name="line.423"></a>
+<span class="sourceLineNo">424</span> // bigger byte array that satisfies
the rule we need to just increase this byte<a name="line.424"></a>
+<span class="sourceLineNo">425</span> // (see the code of
getNextForFuzzyRule below) by one.<a name="line.425"></a>
+<span class="sourceLineNo">426</span> // Note: if non-fixed byte is
already at biggest value, this doesn't allow us to say there's<a
name="line.426"></a>
+<span class="sourceLineNo">427</span> // bigger one that satisfies the
rule as it can't be increased.<a name="line.427"></a>
+<span class="sourceLineNo">428</span> if (fuzzyKeyMeta[i] == 1 &&
!order.isMax(fuzzyKeyBytes[i])) {<a name="line.428"></a>
+<span class="sourceLineNo">429</span> nextRowKeyCandidateExists =
true;<a name="line.429"></a>
+<span class="sourceLineNo">430</span> }<a name="line.430"></a>
+<span class="sourceLineNo">431</span> }<a name="line.431"></a>
+<span class="sourceLineNo">432</span> return SatisfiesCode.YES;<a
name="line.432"></a>
+<span class="sourceLineNo">433</span> }<a name="line.433"></a>
+<span class="sourceLineNo">434</span><a name="line.434"></a>
+<span class="sourceLineNo">435</span> @VisibleForTesting<a
name="line.435"></a>
+<span class="sourceLineNo">436</span> static byte[]
getNextForFuzzyRule(byte[] row, byte[] fuzzyKeyBytes, byte[] fuzzyKeyMeta) {<a
name="line.436"></a>
+<span class="sourceLineNo">437</span> return getNextForFuzzyRule(false,
row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.437"></a>
+<span class="sourceLineNo">438</span> }<a name="line.438"></a>
+<span class="sourceLineNo">439</span><a name="line.439"></a>
+<span class="sourceLineNo">440</span> @VisibleForTesting<a
name="line.440"></a>
+<span class="sourceLineNo">441</span> static byte[]
getNextForFuzzyRule(boolean reverse, byte[] row, byte[] fuzzyKeyBytes,<a
name="line.441"></a>
+<span class="sourceLineNo">442</span> byte[] fuzzyKeyMeta) {<a
name="line.442"></a>
+<span class="sourceLineNo">443</span> return getNextForFuzzyRule(reverse,
row, 0, row.length, fuzzyKeyBytes, fuzzyKeyMeta);<a name="line.443"></a>
+<span class="sourceLineNo">444</span> }<a name="line.444"></a>
+<span class="sourceLineNo">445</span><a name="line.445"></a>
+<span class="sourceLineNo">446</span> /** Abstracts directional comparisons
based on scan direction. */<a name="line.446"></a>
+<span class="sourceLineNo">447</span> private enum Order {<a
name="line.447"></a>
+<span class="sourceLineNo">448</span> ASC {<a name="line.448"></a>
+<span class="sourceLineNo">449</span> public boolean lt(int lhs, int rhs)
{<a name="line.449"></a>
+<span class="sourceLineNo">450</span> return lhs < rhs;<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> public boolean gt(int lhs, int rhs)
{<a name="line.453"></a>
+<span class="sourceLineNo">454</span> return lhs > rhs;<a
name="line.454"></a>
+<span class="sourceLineNo">455</span> }<a name="line.455"></a>
+<span class="sourceLineNo">456</span><a name="line.456"></a>
+<span class="sourceLineNo">457</span> public byte inc(byte val) {<a
name="line.457"></a>
+<span class="sourceLineNo">458</span> // TODO: what about
over/underflow?<a name="line.458"></a>
+<span class="sourceLineNo">459</span> return (byte) (val + 1);<a
name="line.459"></a>
+<span class="sourceLineNo">460</span> }<a name="line.460"></a>
+<span class="sourceLineNo">461</span><a name="line.461"></a>
+<span class="sourceLineNo">462</span> public boolean isMax(byte val) {<a
name="line.462"></a>
+<span class="sourceLineNo">463</span> return val == (byte) 0xff;<a
name="line.463"></a>
+<span class="sourceLineNo">464</span> }<a name="line.464"></a>
+<span class="sourceLineNo">465</span><a name="line.465"></a>
+<span class="sourceLineNo">466</span> public byte min() {<a
name="line.466"></a>
+<span class="sourceLineNo">467</span> return 0;<a name="line.467"></a>
+<span class="sourceLineNo">468</span> }<a name="line.468"></a>
+<span class="sourceLineNo">469</span> },<a name="line.469"></a>
+<span class="sourceLineNo">470</span> DESC {<a name="line.470"></a>
+<span class="sourceLineNo">471</span> public boolean lt(int lhs, int rhs)
{<a name="line.471"></a>
+<span class="sourceLineNo">472</span> return lhs > rhs;<a
name="line.472"></a>
+<span class="sourceLineNo">473</span> }<a name="line.473"></a>
+<span class="sourceLineNo">474</span><a name="line.474"></a>
+<span class="sourceLineNo">475</span> public boolean gt(int lhs, int rhs)
{<a name="line.475"></a>
+<span class="sourceLineNo">476</span> return lhs < rhs;<a
name="line.476"></a>
+<span class="sourceLineNo">477</span> }<a name="line.477"></a>
+<span class="sourceLineNo">478</span><a name="line.478"></a>
+<span class="sourceLineNo">479</span> public byte inc(byte val) {<a
name="line.479"></a>
+<span class="sourceLineNo">480</span> // TODO: what about
over/underflow?<a name="line.480"></a>
+<span class="sourceLineNo">481</span> return (byte) (val - 1);<a
name="line.481"></a>
+<span class="sourceLineNo">482</span> }<a name="line.482"></a>
+<span class="sourceLineNo">483</span><a name="line.483"></a>
+<span class="sourceLineNo">484</span> public boolean isMax(byte val) {<a
name="line.484"></a>
+<span class="sourceLineNo">485</span> return val == 0;<a
name="line.485"></a>
+<span class="sourceLineNo">486</span> }<a name="line.486"></a>
+<span class="sourceLineNo">487</span><a name="line.487"></a>
+<span class="sourceLineNo">488</span> public byte min() {<a
name="line.488"></a>
+<span class="sourceLineNo">489</span> return (byte) 0xFF;<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><a name="line.492"></a>
+<span class="sourceLineNo">493</span> public static Order orderFor(boolean
reverse) {<a name="line.493"></a>
+<span class="sourceLineNo">494</span> return reverse ? DESC : ASC;<a
name="line.494"></a>
+<span class="sourceLineNo">495</span> }<a name="line.495"></a>
+<span class="sourceLineNo">496</span><a name="line.496"></a>
+<span class="sourceLineNo">497</span> /** Returns true when {@code lhs <
rhs}. */<a name="line.497"></a>
+<span class="sourceLineNo">498</span> public abstract boolean lt(int lhs,
int rhs);<a name="line.498"></a>
+<span class="sourceLineNo">499</span><a name="line.499"></a>
+<span class="sourceLineNo">500</span> /** Returns true when {@code lhs >
rhs}. */<a name="line.500"></a>
+<span class="sourceLineNo">501</span> public abstract boolean gt(int lhs,
int rhs);<a name="line.501"></a>
+<span class="sourceLineNo">502</span><a name="line.502"></a>
+<span class="sourceLineNo">503</span> /** Returns {@code val} incremented
by 1. */<a name="line.503"></a>
+<span class="sourceLineNo">504</span> public abstract byte inc(byte val);<a
name="line.504"></a>
+<span class="sourceLineNo">505</span><a name="line.505"></a>
+<span class="sourceLineNo">506</span> /** Return true when {@code val} is
the maximum value */<a name="line.506"></a>
+<span class="sourceLineNo">507</span> public abstract boolean isMax(byte
val);<a name="line.507"></a>
+<span class="sourceLineNo">508</span><a name="line.508"></a>
+<span class="sourceLineNo">509</span> /** Return the minimum value
according to this ordering scheme. */<a name="line.509"></a>
+<span class="sourceLineNo">510</span> public abstract byte min();<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 greater byte array than
given (row) which satisfies the fuzzy rule if it exists, null<a
name="line.514"></a>
+<span class="sourceLineNo">515</span> * otherwise<a
name="line.515"></a>
+<span class="sourceLineNo">516</span> */<a name="line.516"></a>
+<span class="sourceLineNo">517</span> @VisibleForTesting<a
name="line.517"></a>
+<span class="sourceLineNo">518</span> static byte[]
getNextForFuzzyRule(boolean reverse, byte[] row, int offset, int length,<a
name="line.518"></a>
+<span class="sourceLineNo">519</span> byte[] fuzzyKeyBytes, byte[]
fuzzyKeyMeta) {<a name="line.519"></a>
+<span class="sourceLineNo">520</span> // To find out the next "smallest"
byte array that satisfies fuzzy rule and "greater" than<a name="line.520"></a>
+<span class="sourceLineNo">521</span> // the given one we do the
following:<a name="line.521"></a>
+<span class="sourceLineNo">522</span> // 1. setting values on all "fixed"
positions to the values from fuzzyKeyBytes<a name="line.522"></a>
+<span class="sourceLineNo">523</span> // 2. if during the first step given
row did not increase, then we increase the value at<a name="line.523"></a>
+<span class="sourceLineNo">524</span> // the first "non-fixed" position
(where it is not maximum already)<a name="line.524"></a>
+<span class="sourceLineNo">525</span><a name="line.525"></a>
+<span class="sourceLineNo">526</span> // It is easier to perform this by
using fuzzyKeyBytes copy and setting "non-fixed" position<a name="line.526"></a>
+<span class="sourceLineNo">527</span> // values than otherwise.<a
name="line.527"></a>
+<span class="sourceLineNo">528</span> byte[] result =<a name="line.528"></a>
+<span class="sourceLineNo">529</span> Arrays.copyOf(fuzzyKeyBytes,
length > fuzzyKeyBytes.length ? length : fuzzyKeyBytes.length);<a
name="line.529"></a>
+<span class="sourceLineNo">530</span> if (reverse && length >
fuzzyKeyBytes.length) {<a name="line.530"></a>
+<span class="sourceLineNo">531</span> // we need trailing 0xff's instead
of trailing 0x00's<a name="line.531"></a>
+<span class="sourceLineNo">532</span> for (int i = fuzzyKeyBytes.length;
i < result.length; i++) {<a name="line.532"></a>
+<span class="sourceLineNo">533</span> result[i] = (byte) 0xFF;<a
name="line.533"></a>
+<span class="sourceLineNo">534</span> }<a name="line.534"></a>
+<span class="sourceLineNo">535</span> }<a name="line.535"></a>
+<span class="sourceLineNo">536</span> int toInc = -1;<a name="line.536"></a>
+<span class="sourceLineNo">537</span> final Order order =
Order.orderFor(reverse);<a name="line.537"></a>
+<span class="sourceLineNo">538</span><a name="line.538"></a>
+<span class="sourceLineNo">539</span> boolean increased = false;<a
name="line.539"></a>
+<span class="sourceLineNo">540</span> for (int i = 0; i < result.length;
i++) {<a name="line.540"></a>
+<span class="sourceLineNo">541</span> if (i >= fuzzyKeyMeta.length ||
fuzzyKeyMeta[i] == 0 /* non-fixed */) {<a name="line.541"></a>
+<span class="sourceLineNo">542</span> result[i] = row[offset + i];<a
name="line.542"></a>
+<span class="sourceLineNo">543</span> if (!order.isMax(row[offset +
i])) {<a name="line.543"></a>
+<span class="sourceLineNo">544</span> // this is "non-fixed" position
and is not at max value, hence we can increase it<a name="line.544"></a>
+<span class="sourceLineNo">545</span> toInc = i;<a
name="line.545"></a>
+<span class="sourceLineNo">546</span> }<a name="line.546"></a>
+<span class="sourceLineNo">547</span> } else if (i <
fuzzyKeyMeta.length && fuzzyKeyMeta[i] == -1 /* fixed */) {<a
name="line.547"></a>
+<span class="sourceLineNo">548</span> if (order.lt((row[i + offset]
& 0xFF), (fuzzyKeyBytes[i] & 0xFF))) {<a name="line.548"></a>
+<span class="sourceLineNo">549</span> // if setting value for any
fixed position increased the original array,<a name="line.549"></a>
+<span class="sourceLineNo">550</span> // we are OK<a
name="line.550"></a>
+<span class="sourceLineNo">551</span> increased = true;<a
name="line.551"></a>
+<span class="sourceLineNo">552</span> break;<a name="line.552"></a>
+<span class="sourceLineNo">553</span> }<a name="line.553"></a>
+<span class="sourceLineNo">554</span><a name="line.554"></a>
+<span class="sourceLineNo">555</span> if (order.gt((row[i + offset]
& 0xFF), (fuzzyKeyBytes[i] & 0xFF))) {<a name="line.555"></a>
+<span class="sourceLineNo">556</span> // if setting value for any
fixed position makes array "smaller", then just stop:<a name="line.556"></a>
+<span class="sourceLineNo">557</span> // in case we found some
non-fixed position to increase we will do it, otherwise<a name="line.557"></a>
+<span class="sourceLineNo">558</span> // there's no "next" row key
that satisfies fuzzy rule and "greater" than given row<a name="line.558"></a>
+<span class="sourceLineNo">559</span> break;<a name="line.559"></a>
+<span class="sourceLineNo">560</span> }<a name="line.560"></a>
+<span class="sourceLineNo">561</span> }<a name="line.561"></a>
+<span class="sourceLineNo">562</span> }<a name="line.562"></a>
+<span class="sourceLineNo">563</span><a name="line.563"></a>
+<span class="sourceLineNo">564</span> if (!increased) {<a
name="line.564"></a>
+<span class="sourceLineNo">565</span> if (toInc < 0) {<a
name="line.565"></a>
+<span class="sourceLineNo">566</span> return null;<a
name="line.566"></a>
+<span class="sourceLineNo">567</span> }<a name="line.567"></a>
+<span class="sourceLineNo">568</span> result[toInc] =
order.inc(result[toInc]);<a name="line.568"></a>
+<span class="sourceLineNo">569</span><a name="line.569"></a>
+<span class="sourceLineNo">570</span> // Setting all "non-fixed"
positions to zeroes to the right of the one we increased so<a
name="line.570"></a>
+<span class="sourceLineNo">571</span> // that found "next" row key is the
smallest possible<a name="line.571"></a>
+<span class="sourceLineNo">572</span> for (int i = toInc + 1; i <
result.length; i++) {<a name="line.572"></a>
+<span class="sourceLineNo">573</span> if (i >= fuzzyKeyMeta.length
|| fuzzyKeyMeta[i] == 0 /* non-fixed */) {<a name="line.573"></a>
+<span class="sourceLineNo">574</span> result[i] = order.min();<a
name="line.574"></a>
+<span class="sourceLineNo">575</span> }<a name="line.575"></a>
+<span class="sourceLineNo">576</span> }<a name="line.576"></a>
+<span class="sourceLineNo">577</span> }<a name="line.577"></a>
+<span class="sourceLineNo">578</span><a name="line.578"></a>
+<span class="sourceLineNo">579</span> return reverse? result:
trimTrailingZeroes(result, fuzzyKeyMeta, toInc);<a name="line.579"></a>
+<span class="sourceLineNo">580</span> }<a name="line.580"></a>
+<span class="sourceLineNo">581</span><a name="line.581"></a>
+<span class="sourceLineNo">582</span> /**<a name="line.582"></a>
+<span class="sourceLineNo">583</span> * For forward scanner, next cell hint
should not contain any trailing zeroes<a name="line.583"></a>
+<span class="sourceLineNo">584</span> * unless they are part of
fuzzyKeyMeta<a name="line.584"></a>
+<span class="sourceLineNo">585</span> * hint = '\x01\x01\x01\x00\x00'<a
name="line.585"></a>
+<span class="sourceLineNo">586</span> * will skip valid row '\x01\x01\x01'<a
name="line.586"></a>
+<span class="sourceLineNo">587</span> * <a name="line.587"></a>
+<span class="sourceLineNo">588</span> * @param result<a name="line.588"></a>
+<span class="sourceLineNo">589</span> * @param fuzzyKeyMeta<a
name="line.589"></a>
+<span class="sourceLineNo">590</span> * @param toInc - position of
incremented byte<a name="line.590"></a>
+<span class="sourceLineNo">591</span> * @return trimmed version of result<a
name="line.591"></a>
+<span class="sourceLineNo">592</span> */<a name="line.592"></a>
+<span class="sourceLineNo">593</span> <a name="line.593"></a>
+<span class="sourceLineNo">594</span> private static byte[]
trimTrailingZeroes(byte[] result, byte[] fuzzyKeyMeta, int toInc) {<a
name="line.594"></a>
+<span class="sourceLineNo">595</span> int off = fuzzyKeyMeta.length >=
result.length? result.length -1:<a name="line.595"></a>
+<span class="sourceLineNo">596</span> fuzzyKeyMeta.length -1; <a
name="line.596"></a>
+<span class="sourceLineNo">597</span> for( ; off >= 0; off--){<a
name="line.597"></a>
+<span class="sourceLineNo">598</span> if(fuzzyKeyMeta[off] != 0) break;<a
name="line.598"></a>
+<span class="sourceLineNo">599</span> }<a name="line.599"></a>
+<span class="sourceLineNo">600</span> if (off < toInc) off = toInc;<a
name="line.600"></a>
+<span class="sourceLineNo">601</span> byte[] retValue = new byte[off+1];<a
name="line.601"></a>
+<span class="sourceLineNo">602</span> System.arraycopy(result, 0, retValue,
0, retValue.length);<a name="line.602"></a>
+<span class="sourceLineNo">603</span> return retValue;<a
name="line.603"></a>
+<span class="sourceLineNo">604</span> }<a name="line.604"></a>
+<span class="sourceLineNo">605</span><a name="line.605"></a>
+<span class="sourceLineNo">606</span> /**<a name="line.606"></a>
+<span class="sourceLineNo">607</span> * @return true if and only if the
fields of the filter that are serialized are equal to the<a name="line.607"></a>
+<span class="sourceLineNo">608</span> * corresponding fields in
other. Used for testing.<a name="line.608"></a>
+<span class="sourceLineNo">609</span> */<a name="line.609"></a>
+<span class="sourceLineNo">610</span> boolean areSerializedFieldsEqual(Filter
o) {<a name="line.610"></a>
+<span class="sourceLineNo">611</span> if (o == this) return true;<a
name="line.611"></a>
+<span class="sourceLineNo">612</span> if (!(o instanceof FuzzyRowFilter))
return false;<a name="line.612"></a>
+<span class="sourceLineNo">613</span><a name="line.613"></a>
+<span class="sourceLineNo">614</span> FuzzyRowFilter other =
(FuzzyRowFilter) o;<a name="line.614"></a>
+<span class="sourceLineNo">615</span> if (this.fuzzyKeysData.size() !=
other.fuzzyKeysData.size()) return false;<a name="line.615"></a>
+<span class="sourceLineNo">616</span> for (int i = 0; i <
fuzzyKeysData.size(); ++i) {<a name="line.616"></a>
+<span class="sourceLineNo">617</span> Pair<byte[], byte[]> thisData
= this.fuzzyKeysData.get(i);<a name="line.617"></a>
+<span class="sourceLineNo">618</span> Pair<byte[], byte[]>
otherData = other.fuzzyKeysData.get(i);<a name="line.618"></a>
+<span class="sourceLineNo">619</span> if
(!(Bytes.equals(thisData.getFirst(), otherData.getFirst()) &&
Bytes.equals(<a name="line.619"></a>
+<span class="sourceLineNo">620</span> thisData.getSecond(),
otherData.getSecond()))) {<a name="line.620"></a>
+<span class="sourceLineNo">621</span> return false;<a
name="line.621"></a>
+<span class="sourceLineNo">622</span> }<a name="line.622"></a>
+<span class="sourceLineNo">623</span> }<a name="line.623"></a>
+<span class="sourceLineNo">624</span> return true;<a name="line.624"></a>
+<span class="sourceLineNo">625</span> }<a name="line.625"></a>
+<span class="sourceLineNo">626</span>}<a name="line.626"></a>