You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@hbase.apache.org by gi...@apache.org on 2017/04/27 22:53:08 UTC
[01/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Repository: hbase-site
Updated Branches:
refs/heads/asf-site 74b941d1a -> f9332e6e2
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/hbase-archetypes/hbase-client-project/dependencies.html
----------------------------------------------------------------------
diff --git a/hbase-archetypes/hbase-client-project/dependencies.html b/hbase-archetypes/hbase-client-project/dependencies.html
index 395ad73..487f0f3 100644
--- a/hbase-archetypes/hbase-client-project/dependencies.html
+++ b/hbase-archetypes/hbase-client-project/dependencies.html
@@ -3494,7 +3494,7 @@ built on Jackson JSON processor</p>
<td>-</td></tr>
<tr class="a">
<td>hbase-hadoop-compat-2.0.0-SNAPSHOT-tests.jar</td>
-<td>22.30 kB</td>
+<td>22.29 kB</td>
<td>-</td>
<td>-</td>
<td>-</td>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/hbase-archetypes/hbase-shaded-client-project/dependencies.html
----------------------------------------------------------------------
diff --git a/hbase-archetypes/hbase-shaded-client-project/dependencies.html b/hbase-archetypes/hbase-shaded-client-project/dependencies.html
index 354e833..a422951 100644
--- a/hbase-archetypes/hbase-shaded-client-project/dependencies.html
+++ b/hbase-archetypes/hbase-shaded-client-project/dependencies.html
@@ -3509,7 +3509,7 @@ These include: bzip2, gzip, pack200, xz and ar, cpio, jar, tar, zip, dump.</p>
<td>-</td></tr>
<tr class="a">
<td>hbase-hadoop-compat-2.0.0-SNAPSHOT-tests.jar</td>
-<td>22.30 kB</td>
+<td>22.29 kB</td>
<td>-</td>
<td>-</td>
<td>-</td>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/hbase-spark/dependencies.html
----------------------------------------------------------------------
diff --git a/hbase-spark/dependencies.html b/hbase-spark/dependencies.html
index bc6830f..7feb430 100644
--- a/hbase-spark/dependencies.html
+++ b/hbase-spark/dependencies.html
@@ -4684,7 +4684,7 @@ The following provides more details on the included cryptographic software:
<td>-</td></tr>
<tr class="b">
<td>hbase-hadoop-compat-2.0.0-SNAPSHOT-tests.jar</td>
-<td>22.30 kB</td>
+<td>22.29 kB</td>
<td>-</td>
<td>-</td>
<td>-</td>
[08/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.ByteArrayComparator.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.ByteArrayComparator.html b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.ByteArrayComparator.html
index 3c7d6b4..3dea877 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.ByteArrayComparator.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.ByteArrayComparator.html
@@ -1583,1089 +1583,1084 @@
<span class="sourceLineNo">1575</span> length1 == length2) {<a name="line.1575"></a>
<span class="sourceLineNo">1576</span> return 0;<a name="line.1576"></a>
<span class="sourceLineNo">1577</span> }<a name="line.1577"></a>
-<span class="sourceLineNo">1578</span> final int minLength = Math.min(length1, length2);<a name="line.1578"></a>
-<span class="sourceLineNo">1579</span> final int minWords = minLength / SIZEOF_LONG;<a name="line.1579"></a>
-<span class="sourceLineNo">1580</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1580"></a>
-<span class="sourceLineNo">1581</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
-<span class="sourceLineNo">1582</span><a name="line.1582"></a>
-<span class="sourceLineNo">1583</span> /*<a name="line.1583"></a>
-<span class="sourceLineNo">1584</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a<a name="line.1584"></a>
-<span class="sourceLineNo">1585</span> * time is no slower than comparing 4 bytes at a time even on 32-bit.<a name="line.1585"></a>
-<span class="sourceLineNo">1586</span> * On the other hand, it is substantially faster on 64-bit.<a name="line.1586"></a>
-<span class="sourceLineNo">1587</span> */<a name="line.1587"></a>
-<span class="sourceLineNo">1588</span> // This is the end offset of long parts.<a name="line.1588"></a>
-<span class="sourceLineNo">1589</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.1589"></a>
-<span class="sourceLineNo">1590</span> for (int i = 0; i < j; i += SIZEOF_LONG) {<a name="line.1590"></a>
-<span class="sourceLineNo">1591</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1591"></a>
-<span class="sourceLineNo">1592</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1592"></a>
-<span class="sourceLineNo">1593</span> long diff = lw ^ rw;<a name="line.1593"></a>
-<span class="sourceLineNo">1594</span> if (diff != 0) {<a name="line.1594"></a>
-<span class="sourceLineNo">1595</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.1595"></a>
-<span class="sourceLineNo">1596</span> }<a name="line.1596"></a>
-<span class="sourceLineNo">1597</span> }<a name="line.1597"></a>
-<span class="sourceLineNo">1598</span> int offset = j;<a name="line.1598"></a>
-<span class="sourceLineNo">1599</span><a name="line.1599"></a>
-<span class="sourceLineNo">1600</span> if (minLength - offset >= SIZEOF_INT) {<a name="line.1600"></a>
-<span class="sourceLineNo">1601</span> int il = theUnsafe.getInt(buffer1, offset1Adj + offset);<a name="line.1601"></a>
-<span class="sourceLineNo">1602</span> int ir = theUnsafe.getInt(buffer2, offset2Adj + offset);<a name="line.1602"></a>
-<span class="sourceLineNo">1603</span> if (il != ir) {<a name="line.1603"></a>
-<span class="sourceLineNo">1604</span> return lessThanUnsignedInt(il, ir) ? -1: 1;<a name="line.1604"></a>
-<span class="sourceLineNo">1605</span> }<a name="line.1605"></a>
-<span class="sourceLineNo">1606</span> offset += SIZEOF_INT;<a name="line.1606"></a>
-<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
-<span class="sourceLineNo">1608</span> if (minLength - offset >= SIZEOF_SHORT) {<a name="line.1608"></a>
-<span class="sourceLineNo">1609</span> short sl = theUnsafe.getShort(buffer1, offset1Adj + offset);<a name="line.1609"></a>
-<span class="sourceLineNo">1610</span> short sr = theUnsafe.getShort(buffer2, offset2Adj + offset);<a name="line.1610"></a>
-<span class="sourceLineNo">1611</span> if (sl != sr) {<a name="line.1611"></a>
-<span class="sourceLineNo">1612</span> return lessThanUnsignedShort(sl, sr) ? -1: 1;<a name="line.1612"></a>
-<span class="sourceLineNo">1613</span> }<a name="line.1613"></a>
-<span class="sourceLineNo">1614</span> offset += SIZEOF_SHORT;<a name="line.1614"></a>
-<span class="sourceLineNo">1615</span> }<a name="line.1615"></a>
-<span class="sourceLineNo">1616</span> if (minLength - offset == 1) {<a name="line.1616"></a>
-<span class="sourceLineNo">1617</span> int a = (buffer1[(int)(offset1 + offset)] & 0xff);<a name="line.1617"></a>
-<span class="sourceLineNo">1618</span> int b = (buffer2[(int)(offset2 + offset)] & 0xff);<a name="line.1618"></a>
-<span class="sourceLineNo">1619</span> if (a != b) {<a name="line.1619"></a>
-<span class="sourceLineNo">1620</span> return a - b;<a name="line.1620"></a>
-<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
-<span class="sourceLineNo">1622</span> }<a name="line.1622"></a>
-<span class="sourceLineNo">1623</span> return length1 - length2;<a name="line.1623"></a>
-<span class="sourceLineNo">1624</span> }<a name="line.1624"></a>
-<span class="sourceLineNo">1625</span> }<a name="line.1625"></a>
-<span class="sourceLineNo">1626</span> }<a name="line.1626"></a>
-<span class="sourceLineNo">1627</span><a name="line.1627"></a>
-<span class="sourceLineNo">1628</span> /**<a name="line.1628"></a>
-<span class="sourceLineNo">1629</span> * @param left left operand<a name="line.1629"></a>
-<span class="sourceLineNo">1630</span> * @param right right operand<a name="line.1630"></a>
-<span class="sourceLineNo">1631</span> * @return True if equal<a name="line.1631"></a>
-<span class="sourceLineNo">1632</span> */<a name="line.1632"></a>
-<span class="sourceLineNo">1633</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1633"></a>
-<span class="sourceLineNo">1634</span> // Could use Arrays.equals?<a name="line.1634"></a>
-<span class="sourceLineNo">1635</span> //noinspection SimplifiableConditionalExpression<a name="line.1635"></a>
-<span class="sourceLineNo">1636</span> if (left == right) return true;<a name="line.1636"></a>
-<span class="sourceLineNo">1637</span> if (left == null || right == null) return false;<a name="line.1637"></a>
-<span class="sourceLineNo">1638</span> if (left.length != right.length) return false;<a name="line.1638"></a>
-<span class="sourceLineNo">1639</span> if (left.length == 0) return true;<a name="line.1639"></a>
+<span class="sourceLineNo">1578</span> final int stride = 8;<a name="line.1578"></a>
+<span class="sourceLineNo">1579</span> final int minLength = Math.min(length1, length2);<a name="line.1579"></a>
+<span class="sourceLineNo">1580</span> int strideLimit = minLength & ~(stride - 1);<a name="line.1580"></a>
+<span class="sourceLineNo">1581</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
+<span class="sourceLineNo">1582</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1582"></a>
+<span class="sourceLineNo">1583</span> int i;<a name="line.1583"></a>
+<span class="sourceLineNo">1584</span><a name="line.1584"></a>
+<span class="sourceLineNo">1585</span> /*<a name="line.1585"></a>
+<span class="sourceLineNo">1586</span> * Compare 8 bytes at a time. Benchmarking on x86 shows a stride of 8 bytes is no slower<a name="line.1586"></a>
+<span class="sourceLineNo">1587</span> * than 4 bytes even on 32-bit. On the other hand, it is substantially faster on 64-bit.<a name="line.1587"></a>
+<span class="sourceLineNo">1588</span> */<a name="line.1588"></a>
+<span class="sourceLineNo">1589</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.1589"></a>
+<span class="sourceLineNo">1590</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1590"></a>
+<span class="sourceLineNo">1591</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1591"></a>
+<span class="sourceLineNo">1592</span> if (lw != rw) {<a name="line.1592"></a>
+<span class="sourceLineNo">1593</span> if(!UnsafeAccess.littleEndian) {<a name="line.1593"></a>
+<span class="sourceLineNo">1594</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.1594"></a>
+<span class="sourceLineNo">1595</span> }<a name="line.1595"></a>
+<span class="sourceLineNo">1596</span><a name="line.1596"></a>
+<span class="sourceLineNo">1597</span> /*<a name="line.1597"></a>
+<span class="sourceLineNo">1598</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.1598"></a>
+<span class="sourceLineNo">1599</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.1599"></a>
+<span class="sourceLineNo">1600</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.1600"></a>
+<span class="sourceLineNo">1601</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.1601"></a>
+<span class="sourceLineNo">1602</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.1602"></a>
+<span class="sourceLineNo">1603</span> * comparator from guava v21<a name="line.1603"></a>
+<span class="sourceLineNo">1604</span> */<a name="line.1604"></a>
+<span class="sourceLineNo">1605</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.1605"></a>
+<span class="sourceLineNo">1606</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.1606"></a>
+<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
+<span class="sourceLineNo">1608</span> }<a name="line.1608"></a>
+<span class="sourceLineNo">1609</span><a name="line.1609"></a>
+<span class="sourceLineNo">1610</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.1610"></a>
+<span class="sourceLineNo">1611</span> for (; i < minLength; i++) {<a name="line.1611"></a>
+<span class="sourceLineNo">1612</span> int a = (buffer1[offset1 + i] & 0xFF);<a name="line.1612"></a>
+<span class="sourceLineNo">1613</span> int b = (buffer2[offset2 + i] & 0xFF);<a name="line.1613"></a>
+<span class="sourceLineNo">1614</span> if (a != b) {<a name="line.1614"></a>
+<span class="sourceLineNo">1615</span> return a - b;<a name="line.1615"></a>
+<span class="sourceLineNo">1616</span> }<a name="line.1616"></a>
+<span class="sourceLineNo">1617</span> }<a name="line.1617"></a>
+<span class="sourceLineNo">1618</span> return length1 - length2;<a name="line.1618"></a>
+<span class="sourceLineNo">1619</span> }<a name="line.1619"></a>
+<span class="sourceLineNo">1620</span> }<a name="line.1620"></a>
+<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
+<span class="sourceLineNo">1622</span><a name="line.1622"></a>
+<span class="sourceLineNo">1623</span> /**<a name="line.1623"></a>
+<span class="sourceLineNo">1624</span> * @param left left operand<a name="line.1624"></a>
+<span class="sourceLineNo">1625</span> * @param right right operand<a name="line.1625"></a>
+<span class="sourceLineNo">1626</span> * @return True if equal<a name="line.1626"></a>
+<span class="sourceLineNo">1627</span> */<a name="line.1627"></a>
+<span class="sourceLineNo">1628</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1628"></a>
+<span class="sourceLineNo">1629</span> // Could use Arrays.equals?<a name="line.1629"></a>
+<span class="sourceLineNo">1630</span> //noinspection SimplifiableConditionalExpression<a name="line.1630"></a>
+<span class="sourceLineNo">1631</span> if (left == right) return true;<a name="line.1631"></a>
+<span class="sourceLineNo">1632</span> if (left == null || right == null) return false;<a name="line.1632"></a>
+<span class="sourceLineNo">1633</span> if (left.length != right.length) return false;<a name="line.1633"></a>
+<span class="sourceLineNo">1634</span> if (left.length == 0) return true;<a name="line.1634"></a>
+<span class="sourceLineNo">1635</span><a name="line.1635"></a>
+<span class="sourceLineNo">1636</span> // Since we're often comparing adjacent sorted data,<a name="line.1636"></a>
+<span class="sourceLineNo">1637</span> // it's usual to have equal arrays except for the very last byte<a name="line.1637"></a>
+<span class="sourceLineNo">1638</span> // so check that first<a name="line.1638"></a>
+<span class="sourceLineNo">1639</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1639"></a>
<span class="sourceLineNo">1640</span><a name="line.1640"></a>
-<span class="sourceLineNo">1641</span> // Since we're often comparing adjacent sorted data,<a name="line.1641"></a>
-<span class="sourceLineNo">1642</span> // it's usual to have equal arrays except for the very last byte<a name="line.1642"></a>
-<span class="sourceLineNo">1643</span> // so check that first<a name="line.1643"></a>
-<span class="sourceLineNo">1644</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1644"></a>
-<span class="sourceLineNo">1645</span><a name="line.1645"></a>
-<span class="sourceLineNo">1646</span> return compareTo(left, right) == 0;<a name="line.1646"></a>
-<span class="sourceLineNo">1647</span> }<a name="line.1647"></a>
-<span class="sourceLineNo">1648</span><a name="line.1648"></a>
-<span class="sourceLineNo">1649</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1649"></a>
-<span class="sourceLineNo">1650</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1650"></a>
-<span class="sourceLineNo">1651</span> // short circuit case<a name="line.1651"></a>
-<span class="sourceLineNo">1652</span> if (left == right &&<a name="line.1652"></a>
-<span class="sourceLineNo">1653</span> leftOffset == rightOffset &&<a name="line.1653"></a>
-<span class="sourceLineNo">1654</span> leftLen == rightLen) {<a name="line.1654"></a>
-<span class="sourceLineNo">1655</span> return true;<a name="line.1655"></a>
-<span class="sourceLineNo">1656</span> }<a name="line.1656"></a>
-<span class="sourceLineNo">1657</span> // different lengths fast check<a name="line.1657"></a>
-<span class="sourceLineNo">1658</span> if (leftLen != rightLen) {<a name="line.1658"></a>
-<span class="sourceLineNo">1659</span> return false;<a name="line.1659"></a>
-<span class="sourceLineNo">1660</span> }<a name="line.1660"></a>
-<span class="sourceLineNo">1661</span> if (leftLen == 0) {<a name="line.1661"></a>
-<span class="sourceLineNo">1662</span> return true;<a name="line.1662"></a>
-<span class="sourceLineNo">1663</span> }<a name="line.1663"></a>
+<span class="sourceLineNo">1641</span> return compareTo(left, right) == 0;<a name="line.1641"></a>
+<span class="sourceLineNo">1642</span> }<a name="line.1642"></a>
+<span class="sourceLineNo">1643</span><a name="line.1643"></a>
+<span class="sourceLineNo">1644</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1644"></a>
+<span class="sourceLineNo">1645</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1645"></a>
+<span class="sourceLineNo">1646</span> // short circuit case<a name="line.1646"></a>
+<span class="sourceLineNo">1647</span> if (left == right &&<a name="line.1647"></a>
+<span class="sourceLineNo">1648</span> leftOffset == rightOffset &&<a name="line.1648"></a>
+<span class="sourceLineNo">1649</span> leftLen == rightLen) {<a name="line.1649"></a>
+<span class="sourceLineNo">1650</span> return true;<a name="line.1650"></a>
+<span class="sourceLineNo">1651</span> }<a name="line.1651"></a>
+<span class="sourceLineNo">1652</span> // different lengths fast check<a name="line.1652"></a>
+<span class="sourceLineNo">1653</span> if (leftLen != rightLen) {<a name="line.1653"></a>
+<span class="sourceLineNo">1654</span> return false;<a name="line.1654"></a>
+<span class="sourceLineNo">1655</span> }<a name="line.1655"></a>
+<span class="sourceLineNo">1656</span> if (leftLen == 0) {<a name="line.1656"></a>
+<span class="sourceLineNo">1657</span> return true;<a name="line.1657"></a>
+<span class="sourceLineNo">1658</span> }<a name="line.1658"></a>
+<span class="sourceLineNo">1659</span><a name="line.1659"></a>
+<span class="sourceLineNo">1660</span> // Since we're often comparing adjacent sorted data,<a name="line.1660"></a>
+<span class="sourceLineNo">1661</span> // it's usual to have equal arrays except for the very last byte<a name="line.1661"></a>
+<span class="sourceLineNo">1662</span> // so check that first<a name="line.1662"></a>
+<span class="sourceLineNo">1663</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1663"></a>
<span class="sourceLineNo">1664</span><a name="line.1664"></a>
-<span class="sourceLineNo">1665</span> // Since we're often comparing adjacent sorted data,<a name="line.1665"></a>
-<span class="sourceLineNo">1666</span> // it's usual to have equal arrays except for the very last byte<a name="line.1666"></a>
-<span class="sourceLineNo">1667</span> // so check that first<a name="line.1667"></a>
-<span class="sourceLineNo">1668</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1668"></a>
+<span class="sourceLineNo">1665</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1665"></a>
+<span class="sourceLineNo">1666</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1666"></a>
+<span class="sourceLineNo">1667</span> }<a name="line.1667"></a>
+<span class="sourceLineNo">1668</span><a name="line.1668"></a>
<span class="sourceLineNo">1669</span><a name="line.1669"></a>
-<span class="sourceLineNo">1670</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1670"></a>
-<span class="sourceLineNo">1671</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1671"></a>
-<span class="sourceLineNo">1672</span> }<a name="line.1672"></a>
-<span class="sourceLineNo">1673</span><a name="line.1673"></a>
-<span class="sourceLineNo">1674</span><a name="line.1674"></a>
-<span class="sourceLineNo">1675</span> /**<a name="line.1675"></a>
-<span class="sourceLineNo">1676</span> * @param a left operand<a name="line.1676"></a>
-<span class="sourceLineNo">1677</span> * @param buf right operand<a name="line.1677"></a>
-<span class="sourceLineNo">1678</span> * @return True if equal<a name="line.1678"></a>
-<span class="sourceLineNo">1679</span> */<a name="line.1679"></a>
-<span class="sourceLineNo">1680</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1680"></a>
-<span class="sourceLineNo">1681</span> if (a == null) return buf == null;<a name="line.1681"></a>
-<span class="sourceLineNo">1682</span> if (buf == null) return false;<a name="line.1682"></a>
-<span class="sourceLineNo">1683</span> if (a.length != buf.remaining()) return false;<a name="line.1683"></a>
-<span class="sourceLineNo">1684</span><a name="line.1684"></a>
-<span class="sourceLineNo">1685</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1685"></a>
-<span class="sourceLineNo">1686</span> ByteBuffer b = buf.duplicate();<a name="line.1686"></a>
-<span class="sourceLineNo">1687</span> for (byte anA : a) {<a name="line.1687"></a>
-<span class="sourceLineNo">1688</span> if (anA != b.get()) {<a name="line.1688"></a>
-<span class="sourceLineNo">1689</span> return false;<a name="line.1689"></a>
-<span class="sourceLineNo">1690</span> }<a name="line.1690"></a>
-<span class="sourceLineNo">1691</span> }<a name="line.1691"></a>
-<span class="sourceLineNo">1692</span> return true;<a name="line.1692"></a>
-<span class="sourceLineNo">1693</span> }<a name="line.1693"></a>
-<span class="sourceLineNo">1694</span><a name="line.1694"></a>
-<span class="sourceLineNo">1695</span><a name="line.1695"></a>
-<span class="sourceLineNo">1696</span> /**<a name="line.1696"></a>
-<span class="sourceLineNo">1697</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1697"></a>
-<span class="sourceLineNo">1698</span> * array on the left.<a name="line.1698"></a>
-<span class="sourceLineNo">1699</span> */<a name="line.1699"></a>
-<span class="sourceLineNo">1700</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1700"></a>
-<span class="sourceLineNo">1701</span> return bytes != null && prefix != null &&<a name="line.1701"></a>
-<span class="sourceLineNo">1702</span> bytes.length >= prefix.length &&<a name="line.1702"></a>
-<span class="sourceLineNo">1703</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1703"></a>
-<span class="sourceLineNo">1704</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1704"></a>
-<span class="sourceLineNo">1705</span> }<a name="line.1705"></a>
-<span class="sourceLineNo">1706</span><a name="line.1706"></a>
-<span class="sourceLineNo">1707</span> /**<a name="line.1707"></a>
-<span class="sourceLineNo">1708</span> * @param b bytes to hash<a name="line.1708"></a>
-<span class="sourceLineNo">1709</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1709"></a>
-<span class="sourceLineNo">1710</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1710"></a>
-<span class="sourceLineNo">1711</span> * use calculating hash code.<a name="line.1711"></a>
-<span class="sourceLineNo">1712</span> */<a name="line.1712"></a>
-<span class="sourceLineNo">1713</span> public static int hashCode(final byte [] b) {<a name="line.1713"></a>
-<span class="sourceLineNo">1714</span> return hashCode(b, b.length);<a name="line.1714"></a>
-<span class="sourceLineNo">1715</span> }<a name="line.1715"></a>
-<span class="sourceLineNo">1716</span><a name="line.1716"></a>
-<span class="sourceLineNo">1717</span> /**<a name="line.1717"></a>
-<span class="sourceLineNo">1718</span> * @param b value<a name="line.1718"></a>
-<span class="sourceLineNo">1719</span> * @param length length of the value<a name="line.1719"></a>
-<span class="sourceLineNo">1720</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1720"></a>
-<span class="sourceLineNo">1721</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1721"></a>
-<span class="sourceLineNo">1722</span> * use calculating hash code.<a name="line.1722"></a>
-<span class="sourceLineNo">1723</span> */<a name="line.1723"></a>
-<span class="sourceLineNo">1724</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1724"></a>
-<span class="sourceLineNo">1725</span> return WritableComparator.hashBytes(b, length);<a name="line.1725"></a>
-<span class="sourceLineNo">1726</span> }<a name="line.1726"></a>
-<span class="sourceLineNo">1727</span><a name="line.1727"></a>
-<span class="sourceLineNo">1728</span> /**<a name="line.1728"></a>
-<span class="sourceLineNo">1729</span> * @param b bytes to hash<a name="line.1729"></a>
-<span class="sourceLineNo">1730</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1730"></a>
-<span class="sourceLineNo">1731</span> * Maps.<a name="line.1731"></a>
-<span class="sourceLineNo">1732</span> */<a name="line.1732"></a>
-<span class="sourceLineNo">1733</span> public static Integer mapKey(final byte [] b) {<a name="line.1733"></a>
-<span class="sourceLineNo">1734</span> return hashCode(b);<a name="line.1734"></a>
-<span class="sourceLineNo">1735</span> }<a name="line.1735"></a>
-<span class="sourceLineNo">1736</span><a name="line.1736"></a>
-<span class="sourceLineNo">1737</span> /**<a name="line.1737"></a>
-<span class="sourceLineNo">1738</span> * @param b bytes to hash<a name="line.1738"></a>
-<span class="sourceLineNo">1739</span> * @param length length to hash<a name="line.1739"></a>
-<span class="sourceLineNo">1740</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1740"></a>
-<span class="sourceLineNo">1741</span> * Maps.<a name="line.1741"></a>
-<span class="sourceLineNo">1742</span> */<a name="line.1742"></a>
-<span class="sourceLineNo">1743</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1743"></a>
-<span class="sourceLineNo">1744</span> return hashCode(b, length);<a name="line.1744"></a>
-<span class="sourceLineNo">1745</span> }<a name="line.1745"></a>
-<span class="sourceLineNo">1746</span><a name="line.1746"></a>
-<span class="sourceLineNo">1747</span> /**<a name="line.1747"></a>
-<span class="sourceLineNo">1748</span> * @param a lower half<a name="line.1748"></a>
-<span class="sourceLineNo">1749</span> * @param b upper half<a name="line.1749"></a>
-<span class="sourceLineNo">1750</span> * @return New array that has a in lower half and b in upper half.<a name="line.1750"></a>
-<span class="sourceLineNo">1751</span> */<a name="line.1751"></a>
-<span class="sourceLineNo">1752</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1752"></a>
-<span class="sourceLineNo">1753</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1753"></a>
-<span class="sourceLineNo">1754</span> }<a name="line.1754"></a>
-<span class="sourceLineNo">1755</span><a name="line.1755"></a>
-<span class="sourceLineNo">1756</span> /**<a name="line.1756"></a>
-<span class="sourceLineNo">1757</span> * @param a first third<a name="line.1757"></a>
-<span class="sourceLineNo">1758</span> * @param b second third<a name="line.1758"></a>
-<span class="sourceLineNo">1759</span> * @param c third third<a name="line.1759"></a>
-<span class="sourceLineNo">1760</span> * @return New array made from a, b and c<a name="line.1760"></a>
-<span class="sourceLineNo">1761</span> */<a name="line.1761"></a>
-<span class="sourceLineNo">1762</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1762"></a>
-<span class="sourceLineNo">1763</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1763"></a>
-<span class="sourceLineNo">1764</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1764"></a>
-<span class="sourceLineNo">1765</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1765"></a>
-<span class="sourceLineNo">1766</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1766"></a>
-<span class="sourceLineNo">1767</span> return result;<a name="line.1767"></a>
-<span class="sourceLineNo">1768</span> }<a name="line.1768"></a>
-<span class="sourceLineNo">1769</span><a name="line.1769"></a>
-<span class="sourceLineNo">1770</span> /**<a name="line.1770"></a>
-<span class="sourceLineNo">1771</span> * @param arrays all the arrays to concatenate together.<a name="line.1771"></a>
-<span class="sourceLineNo">1772</span> * @return New array made from the concatenation of the given arrays.<a name="line.1772"></a>
-<span class="sourceLineNo">1773</span> */<a name="line.1773"></a>
-<span class="sourceLineNo">1774</span> public static byte [] add(final byte [][] arrays) {<a name="line.1774"></a>
-<span class="sourceLineNo">1775</span> int length = 0;<a name="line.1775"></a>
+<span class="sourceLineNo">1670</span> /**<a name="line.1670"></a>
+<span class="sourceLineNo">1671</span> * @param a left operand<a name="line.1671"></a>
+<span class="sourceLineNo">1672</span> * @param buf right operand<a name="line.1672"></a>
+<span class="sourceLineNo">1673</span> * @return True if equal<a name="line.1673"></a>
+<span class="sourceLineNo">1674</span> */<a name="line.1674"></a>
+<span class="sourceLineNo">1675</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1675"></a>
+<span class="sourceLineNo">1676</span> if (a == null) return buf == null;<a name="line.1676"></a>
+<span class="sourceLineNo">1677</span> if (buf == null) return false;<a name="line.1677"></a>
+<span class="sourceLineNo">1678</span> if (a.length != buf.remaining()) return false;<a name="line.1678"></a>
+<span class="sourceLineNo">1679</span><a name="line.1679"></a>
+<span class="sourceLineNo">1680</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1680"></a>
+<span class="sourceLineNo">1681</span> ByteBuffer b = buf.duplicate();<a name="line.1681"></a>
+<span class="sourceLineNo">1682</span> for (byte anA : a) {<a name="line.1682"></a>
+<span class="sourceLineNo">1683</span> if (anA != b.get()) {<a name="line.1683"></a>
+<span class="sourceLineNo">1684</span> return false;<a name="line.1684"></a>
+<span class="sourceLineNo">1685</span> }<a name="line.1685"></a>
+<span class="sourceLineNo">1686</span> }<a name="line.1686"></a>
+<span class="sourceLineNo">1687</span> return true;<a name="line.1687"></a>
+<span class="sourceLineNo">1688</span> }<a name="line.1688"></a>
+<span class="sourceLineNo">1689</span><a name="line.1689"></a>
+<span class="sourceLineNo">1690</span><a name="line.1690"></a>
+<span class="sourceLineNo">1691</span> /**<a name="line.1691"></a>
+<span class="sourceLineNo">1692</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1692"></a>
+<span class="sourceLineNo">1693</span> * array on the left.<a name="line.1693"></a>
+<span class="sourceLineNo">1694</span> */<a name="line.1694"></a>
+<span class="sourceLineNo">1695</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1695"></a>
+<span class="sourceLineNo">1696</span> return bytes != null && prefix != null &&<a name="line.1696"></a>
+<span class="sourceLineNo">1697</span> bytes.length >= prefix.length &&<a name="line.1697"></a>
+<span class="sourceLineNo">1698</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1698"></a>
+<span class="sourceLineNo">1699</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1699"></a>
+<span class="sourceLineNo">1700</span> }<a name="line.1700"></a>
+<span class="sourceLineNo">1701</span><a name="line.1701"></a>
+<span class="sourceLineNo">1702</span> /**<a name="line.1702"></a>
+<span class="sourceLineNo">1703</span> * @param b bytes to hash<a name="line.1703"></a>
+<span class="sourceLineNo">1704</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1704"></a>
+<span class="sourceLineNo">1705</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1705"></a>
+<span class="sourceLineNo">1706</span> * use calculating hash code.<a name="line.1706"></a>
+<span class="sourceLineNo">1707</span> */<a name="line.1707"></a>
+<span class="sourceLineNo">1708</span> public static int hashCode(final byte [] b) {<a name="line.1708"></a>
+<span class="sourceLineNo">1709</span> return hashCode(b, b.length);<a name="line.1709"></a>
+<span class="sourceLineNo">1710</span> }<a name="line.1710"></a>
+<span class="sourceLineNo">1711</span><a name="line.1711"></a>
+<span class="sourceLineNo">1712</span> /**<a name="line.1712"></a>
+<span class="sourceLineNo">1713</span> * @param b value<a name="line.1713"></a>
+<span class="sourceLineNo">1714</span> * @param length length of the value<a name="line.1714"></a>
+<span class="sourceLineNo">1715</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1715"></a>
+<span class="sourceLineNo">1716</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1716"></a>
+<span class="sourceLineNo">1717</span> * use calculating hash code.<a name="line.1717"></a>
+<span class="sourceLineNo">1718</span> */<a name="line.1718"></a>
+<span class="sourceLineNo">1719</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1719"></a>
+<span class="sourceLineNo">1720</span> return WritableComparator.hashBytes(b, length);<a name="line.1720"></a>
+<span class="sourceLineNo">1721</span> }<a name="line.1721"></a>
+<span class="sourceLineNo">1722</span><a name="line.1722"></a>
+<span class="sourceLineNo">1723</span> /**<a name="line.1723"></a>
+<span class="sourceLineNo">1724</span> * @param b bytes to hash<a name="line.1724"></a>
+<span class="sourceLineNo">1725</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1725"></a>
+<span class="sourceLineNo">1726</span> * Maps.<a name="line.1726"></a>
+<span class="sourceLineNo">1727</span> */<a name="line.1727"></a>
+<span class="sourceLineNo">1728</span> public static Integer mapKey(final byte [] b) {<a name="line.1728"></a>
+<span class="sourceLineNo">1729</span> return hashCode(b);<a name="line.1729"></a>
+<span class="sourceLineNo">1730</span> }<a name="line.1730"></a>
+<span class="sourceLineNo">1731</span><a name="line.1731"></a>
+<span class="sourceLineNo">1732</span> /**<a name="line.1732"></a>
+<span class="sourceLineNo">1733</span> * @param b bytes to hash<a name="line.1733"></a>
+<span class="sourceLineNo">1734</span> * @param length length to hash<a name="line.1734"></a>
+<span class="sourceLineNo">1735</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1735"></a>
+<span class="sourceLineNo">1736</span> * Maps.<a name="line.1736"></a>
+<span class="sourceLineNo">1737</span> */<a name="line.1737"></a>
+<span class="sourceLineNo">1738</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1738"></a>
+<span class="sourceLineNo">1739</span> return hashCode(b, length);<a name="line.1739"></a>
+<span class="sourceLineNo">1740</span> }<a name="line.1740"></a>
+<span class="sourceLineNo">1741</span><a name="line.1741"></a>
+<span class="sourceLineNo">1742</span> /**<a name="line.1742"></a>
+<span class="sourceLineNo">1743</span> * @param a lower half<a name="line.1743"></a>
+<span class="sourceLineNo">1744</span> * @param b upper half<a name="line.1744"></a>
+<span class="sourceLineNo">1745</span> * @return New array that has a in lower half and b in upper half.<a name="line.1745"></a>
+<span class="sourceLineNo">1746</span> */<a name="line.1746"></a>
+<span class="sourceLineNo">1747</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1747"></a>
+<span class="sourceLineNo">1748</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1748"></a>
+<span class="sourceLineNo">1749</span> }<a name="line.1749"></a>
+<span class="sourceLineNo">1750</span><a name="line.1750"></a>
+<span class="sourceLineNo">1751</span> /**<a name="line.1751"></a>
+<span class="sourceLineNo">1752</span> * @param a first third<a name="line.1752"></a>
+<span class="sourceLineNo">1753</span> * @param b second third<a name="line.1753"></a>
+<span class="sourceLineNo">1754</span> * @param c third third<a name="line.1754"></a>
+<span class="sourceLineNo">1755</span> * @return New array made from a, b and c<a name="line.1755"></a>
+<span class="sourceLineNo">1756</span> */<a name="line.1756"></a>
+<span class="sourceLineNo">1757</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1757"></a>
+<span class="sourceLineNo">1758</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1758"></a>
+<span class="sourceLineNo">1759</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1759"></a>
+<span class="sourceLineNo">1760</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1760"></a>
+<span class="sourceLineNo">1761</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1761"></a>
+<span class="sourceLineNo">1762</span> return result;<a name="line.1762"></a>
+<span class="sourceLineNo">1763</span> }<a name="line.1763"></a>
+<span class="sourceLineNo">1764</span><a name="line.1764"></a>
+<span class="sourceLineNo">1765</span> /**<a name="line.1765"></a>
+<span class="sourceLineNo">1766</span> * @param arrays all the arrays to concatenate together.<a name="line.1766"></a>
+<span class="sourceLineNo">1767</span> * @return New array made from the concatenation of the given arrays.<a name="line.1767"></a>
+<span class="sourceLineNo">1768</span> */<a name="line.1768"></a>
+<span class="sourceLineNo">1769</span> public static byte [] add(final byte [][] arrays) {<a name="line.1769"></a>
+<span class="sourceLineNo">1770</span> int length = 0;<a name="line.1770"></a>
+<span class="sourceLineNo">1771</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1771"></a>
+<span class="sourceLineNo">1772</span> length += arrays[i].length;<a name="line.1772"></a>
+<span class="sourceLineNo">1773</span> }<a name="line.1773"></a>
+<span class="sourceLineNo">1774</span> byte [] result = new byte[length];<a name="line.1774"></a>
+<span class="sourceLineNo">1775</span> int index = 0;<a name="line.1775"></a>
<span class="sourceLineNo">1776</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1776"></a>
-<span class="sourceLineNo">1777</span> length += arrays[i].length;<a name="line.1777"></a>
-<span class="sourceLineNo">1778</span> }<a name="line.1778"></a>
-<span class="sourceLineNo">1779</span> byte [] result = new byte[length];<a name="line.1779"></a>
-<span class="sourceLineNo">1780</span> int index = 0;<a name="line.1780"></a>
-<span class="sourceLineNo">1781</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1781"></a>
-<span class="sourceLineNo">1782</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1782"></a>
-<span class="sourceLineNo">1783</span> index += arrays[i].length;<a name="line.1783"></a>
-<span class="sourceLineNo">1784</span> }<a name="line.1784"></a>
-<span class="sourceLineNo">1785</span> return result;<a name="line.1785"></a>
-<span class="sourceLineNo">1786</span> }<a name="line.1786"></a>
-<span class="sourceLineNo">1787</span><a name="line.1787"></a>
-<span class="sourceLineNo">1788</span> /**<a name="line.1788"></a>
-<span class="sourceLineNo">1789</span> * @param a array<a name="line.1789"></a>
-<span class="sourceLineNo">1790</span> * @param length amount of bytes to grab<a name="line.1790"></a>
-<span class="sourceLineNo">1791</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1791"></a>
-<span class="sourceLineNo">1792</span> */<a name="line.1792"></a>
-<span class="sourceLineNo">1793</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1793"></a>
-<span class="sourceLineNo">1794</span> if (a.length < length) {<a name="line.1794"></a>
-<span class="sourceLineNo">1795</span> return null;<a name="line.1795"></a>
-<span class="sourceLineNo">1796</span> }<a name="line.1796"></a>
-<span class="sourceLineNo">1797</span> byte [] result = new byte[length];<a name="line.1797"></a>
-<span class="sourceLineNo">1798</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1798"></a>
-<span class="sourceLineNo">1799</span> return result;<a name="line.1799"></a>
-<span class="sourceLineNo">1800</span> }<a name="line.1800"></a>
-<span class="sourceLineNo">1801</span><a name="line.1801"></a>
-<span class="sourceLineNo">1802</span> /**<a name="line.1802"></a>
-<span class="sourceLineNo">1803</span> * @param a array<a name="line.1803"></a>
-<span class="sourceLineNo">1804</span> * @param length amount of bytes to snarf<a name="line.1804"></a>
-<span class="sourceLineNo">1805</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1805"></a>
-<span class="sourceLineNo">1806</span> */<a name="line.1806"></a>
-<span class="sourceLineNo">1807</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1807"></a>
-<span class="sourceLineNo">1808</span> if (a.length < length) {<a name="line.1808"></a>
-<span class="sourceLineNo">1809</span> return null;<a name="line.1809"></a>
-<span class="sourceLineNo">1810</span> }<a name="line.1810"></a>
-<span class="sourceLineNo">1811</span> byte [] result = new byte[length];<a name="line.1811"></a>
-<span class="sourceLineNo">1812</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1812"></a>
-<span class="sourceLineNo">1813</span> return result;<a name="line.1813"></a>
-<span class="sourceLineNo">1814</span> }<a name="line.1814"></a>
-<span class="sourceLineNo">1815</span><a name="line.1815"></a>
-<span class="sourceLineNo">1816</span> /**<a name="line.1816"></a>
-<span class="sourceLineNo">1817</span> * @param a array<a name="line.1817"></a>
-<span class="sourceLineNo">1818</span> * @param length new array size<a name="line.1818"></a>
-<span class="sourceLineNo">1819</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1819"></a>
-<span class="sourceLineNo">1820</span> */<a name="line.1820"></a>
-<span class="sourceLineNo">1821</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1821"></a>
-<span class="sourceLineNo">1822</span> byte [] padding = new byte[length];<a name="line.1822"></a>
-<span class="sourceLineNo">1823</span> for (int i = 0; i < length; i++) {<a name="line.1823"></a>
-<span class="sourceLineNo">1824</span> padding[i] = 0;<a name="line.1824"></a>
-<span class="sourceLineNo">1825</span> }<a name="line.1825"></a>
-<span class="sourceLineNo">1826</span> return add(padding,a);<a name="line.1826"></a>
-<span class="sourceLineNo">1827</span> }<a name="line.1827"></a>
-<span class="sourceLineNo">1828</span><a name="line.1828"></a>
-<span class="sourceLineNo">1829</span> /**<a name="line.1829"></a>
-<span class="sourceLineNo">1830</span> * @param a array<a name="line.1830"></a>
-<span class="sourceLineNo">1831</span> * @param length new array size<a name="line.1831"></a>
-<span class="sourceLineNo">1832</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1832"></a>
-<span class="sourceLineNo">1833</span> */<a name="line.1833"></a>
-<span class="sourceLineNo">1834</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1834"></a>
-<span class="sourceLineNo">1835</span> byte [] padding = new byte[length];<a name="line.1835"></a>
-<span class="sourceLineNo">1836</span> for (int i = 0; i < length; i++) {<a name="line.1836"></a>
-<span class="sourceLineNo">1837</span> padding[i] = 0;<a name="line.1837"></a>
-<span class="sourceLineNo">1838</span> }<a name="line.1838"></a>
-<span class="sourceLineNo">1839</span> return add(a,padding);<a name="line.1839"></a>
-<span class="sourceLineNo">1840</span> }<a name="line.1840"></a>
-<span class="sourceLineNo">1841</span><a name="line.1841"></a>
-<span class="sourceLineNo">1842</span> /**<a name="line.1842"></a>
-<span class="sourceLineNo">1843</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1843"></a>
-<span class="sourceLineNo">1844</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1844"></a>
-<span class="sourceLineNo">1845</span> * @param a Beginning of range<a name="line.1845"></a>
-<span class="sourceLineNo">1846</span> * @param b End of range<a name="line.1846"></a>
-<span class="sourceLineNo">1847</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1847"></a>
-<span class="sourceLineNo">1848</span> * the range in two; i.e. one split.<a name="line.1848"></a>
-<span class="sourceLineNo">1849</span> * @return Array of dividing values<a name="line.1849"></a>
-<span class="sourceLineNo">1850</span> */<a name="line.1850"></a>
-<span class="sourceLineNo">1851</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1851"></a>
-<span class="sourceLineNo">1852</span> return split(a, b, false, num);<a name="line.1852"></a>
-<span class="sourceLineNo">1853</span> }<a name="line.1853"></a>
-<span class="sourceLineNo">1854</span><a name="line.1854"></a>
-<span class="sourceLineNo">1855</span> /**<a name="line.1855"></a>
-<span class="sourceLineNo">1856</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1856"></a>
-<span class="sourceLineNo">1857</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1857"></a>
-<span class="sourceLineNo">1858</span> * @param a Beginning of range<a name="line.1858"></a>
-<span class="sourceLineNo">1859</span> * @param b End of range<a name="line.1859"></a>
-<span class="sourceLineNo">1860</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1860"></a>
-<span class="sourceLineNo">1861</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1861"></a>
-<span class="sourceLineNo">1862</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1862"></a>
-<span class="sourceLineNo">1863</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1863"></a>
-<span class="sourceLineNo">1864</span> * the range in two; i.e. one split.<a name="line.1864"></a>
-<span class="sourceLineNo">1865</span> * @return Array of dividing values<a name="line.1865"></a>
-<span class="sourceLineNo">1866</span> */<a name="line.1866"></a>
-<span class="sourceLineNo">1867</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1867"></a>
-<span class="sourceLineNo">1868</span> boolean inclusive, final int num) {<a name="line.1868"></a>
-<span class="sourceLineNo">1869</span> byte[][] ret = new byte[num + 2][];<a name="line.1869"></a>
-<span class="sourceLineNo">1870</span> int i = 0;<a name="line.1870"></a>
-<span class="sourceLineNo">1871</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1871"></a>
-<span class="sourceLineNo">1872</span> if (iter == null)<a name="line.1872"></a>
-<span class="sourceLineNo">1873</span> return null;<a name="line.1873"></a>
-<span class="sourceLineNo">1874</span> for (byte[] elem : iter) {<a name="line.1874"></a>
-<span class="sourceLineNo">1875</span> ret[i++] = elem;<a name="line.1875"></a>
-<span class="sourceLineNo">1876</span> }<a name="line.1876"></a>
-<span class="sourceLineNo">1877</span> return ret;<a name="line.1877"></a>
-<span class="sourceLineNo">1878</span> }<a name="line.1878"></a>
-<span class="sourceLineNo">1879</span><a name="line.1879"></a>
-<span class="sourceLineNo">1880</span> /**<a name="line.1880"></a>
-<span class="sourceLineNo">1881</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1881"></a>
-<span class="sourceLineNo">1882</span> */<a name="line.1882"></a>
-<span class="sourceLineNo">1883</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1883"></a>
-<span class="sourceLineNo">1884</span> final byte[] b, final int num)<a name="line.1884"></a>
-<span class="sourceLineNo">1885</span> {<a name="line.1885"></a>
-<span class="sourceLineNo">1886</span> return iterateOnSplits(a, b, false, num);<a name="line.1886"></a>
-<span class="sourceLineNo">1887</span> }<a name="line.1887"></a>
-<span class="sourceLineNo">1888</span><a name="line.1888"></a>
-<span class="sourceLineNo">1889</span> /**<a name="line.1889"></a>
-<span class="sourceLineNo">1890</span> * Iterate over keys within the passed range.<a name="line.1890"></a>
-<span class="sourceLineNo">1891</span> */<a name="line.1891"></a>
-<span class="sourceLineNo">1892</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1892"></a>
-<span class="sourceLineNo">1893</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1893"></a>
-<span class="sourceLineNo">1894</span> {<a name="line.1894"></a>
-<span class="sourceLineNo">1895</span> byte [] aPadded;<a name="line.1895"></a>
-<span class="sourceLineNo">1896</span> byte [] bPadded;<a name="line.1896"></a>
-<span class="sourceLineNo">1897</span> if (a.length < b.length) {<a name="line.1897"></a>
-<span class="sourceLineNo">1898</span> aPadded = padTail(a, b.length - a.length);<a name="line.1898"></a>
-<span class="sourceLineNo">1899</span> bPadded = b;<a name="line.1899"></a>
-<span class="sourceLineNo">1900</span> } else if (b.length < a.length) {<a name="line.1900"></a>
-<span class="sourceLineNo">1901</span> aPadded = a;<a name="line.1901"></a>
-<span class="sourceLineNo">1902</span> bPadded = padTail(b, a.length - b.length);<a name="line.1902"></a>
-<span class="sourceLineNo">1903</span> } else {<a name="line.1903"></a>
-<span class="sourceLineNo">1904</span> aPadded = a;<a name="line.1904"></a>
-<span class="sourceLineNo">1905</span> bPadded = b;<a name="line.1905"></a>
-<span class="sourceLineNo">1906</span> }<a name="line.1906"></a>
-<span class="sourceLineNo">1907</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1907"></a>
-<span class="sourceLineNo">1908</span> throw new IllegalArgumentException("b <= a");<a name="line.1908"></a>
-<span class="sourceLineNo">1909</span> }<a name="line.1909"></a>
-<span class="sourceLineNo">1910</span> if (num <= 0) {<a name="line.1910"></a>
-<span class="sourceLineNo">1911</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1911"></a>
-<span class="sourceLineNo">1912</span> }<a name="line.1912"></a>
-<span class="sourceLineNo">1913</span> byte [] prependHeader = {1, 0};<a name="line.1913"></a>
-<span class="sourceLineNo">1914</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1914"></a>
-<span class="sourceLineNo">1915</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1915"></a>
-<span class="sourceLineNo">1916</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1916"></a>
-<span class="sourceLineNo">1917</span> if (inclusive) {<a name="line.1917"></a>
-<span class="sourceLineNo">1918</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1918"></a>
-<span class="sourceLineNo">1919</span> }<a name="line.1919"></a>
-<span class="sourceLineNo">1920</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1920"></a>
-<span class="sourceLineNo">1921</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1921"></a>
-<span class="sourceLineNo">1922</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1922"></a>
-<span class="sourceLineNo">1923</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1923"></a>
-<span class="sourceLineNo">1924</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1924"></a>
-<span class="sourceLineNo">1925</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1925"></a>
-<span class="sourceLineNo">1926</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1926"></a>
-<span class="sourceLineNo">1927</span> }<a name="line.1927"></a>
-<span class="sourceLineNo">1928</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1928"></a>
-<span class="sourceLineNo">1929</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1929"></a>
-<span class="sourceLineNo">1930</span> }<a name="line.1930"></a>
-<span class="sourceLineNo">1931</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1931"></a>
-<span class="sourceLineNo">1932</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1932"></a>
-<span class="sourceLineNo">1933</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1933"></a>
-<span class="sourceLineNo">1934</span> }<a name="line.1934"></a>
-<span class="sourceLineNo">1935</span> final BigInteger intervalBI;<a name="line.1935"></a>
-<span class="sourceLineNo">1936</span> try {<a name="line.1936"></a>
-<span class="sourceLineNo">1937</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1937"></a>
-<span class="sourceLineNo">1938</span> } catch(Exception e) {<a name="line.1938"></a>
-<span class="sourceLineNo">1939</span> LOG.error("Exception caught during division", e);<a name="line.1939"></a>
-<span class="sourceLineNo">1940</span> return null;<a name="line.1940"></a>
-<span class="sourceLineNo">1941</span> }<a name="line.1941"></a>
-<span class="sourceLineNo">1942</span><a name="line.1942"></a>
-<span class="sourceLineNo">1943</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1943"></a>
-<span class="sourceLineNo">1944</span> private int i = -1;<a name="line.1944"></a>
+<span class="sourceLineNo">1777</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1777"></a>
+<span class="sourceLineNo">1778</span> index += arrays[i].length;<a name="line.1778"></a>
+<span class="sourceLineNo">1779</span> }<a name="line.1779"></a>
+<span class="sourceLineNo">1780</span> return result;<a name="line.1780"></a>
+<span class="sourceLineNo">1781</span> }<a name="line.1781"></a>
+<span class="sourceLineNo">1782</span><a name="line.1782"></a>
+<span class="sourceLineNo">1783</span> /**<a name="line.1783"></a>
+<span class="sourceLineNo">1784</span> * @param a array<a name="line.1784"></a>
+<span class="sourceLineNo">1785</span> * @param length amount of bytes to grab<a name="line.1785"></a>
+<span class="sourceLineNo">1786</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1786"></a>
+<span class="sourceLineNo">1787</span> */<a name="line.1787"></a>
+<span class="sourceLineNo">1788</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1788"></a>
+<span class="sourceLineNo">1789</span> if (a.length < length) {<a name="line.1789"></a>
+<span class="sourceLineNo">1790</span> return null;<a name="line.1790"></a>
+<span class="sourceLineNo">1791</span> }<a name="line.1791"></a>
+<span class="sourceLineNo">1792</span> byte [] result = new byte[length];<a name="line.1792"></a>
+<span class="sourceLineNo">1793</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1793"></a>
+<span class="sourceLineNo">1794</span> return result;<a name="line.1794"></a>
+<span class="sourceLineNo">1795</span> }<a name="line.1795"></a>
+<span class="sourceLineNo">1796</span><a name="line.1796"></a>
+<span class="sourceLineNo">1797</span> /**<a name="line.1797"></a>
+<span class="sourceLineNo">1798</span> * @param a array<a name="line.1798"></a>
+<span class="sourceLineNo">1799</span> * @param length amount of bytes to snarf<a name="line.1799"></a>
+<span class="sourceLineNo">1800</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1800"></a>
+<span class="sourceLineNo">1801</span> */<a name="line.1801"></a>
+<span class="sourceLineNo">1802</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1802"></a>
+<span class="sourceLineNo">1803</span> if (a.length < length) {<a name="line.1803"></a>
+<span class="sourceLineNo">1804</span> return null;<a name="line.1804"></a>
+<span class="sourceLineNo">1805</span> }<a name="line.1805"></a>
+<span class="sourceLineNo">1806</span> byte [] result = new byte[length];<a name="line.1806"></a>
+<span class="sourceLineNo">1807</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1807"></a>
+<span class="sourceLineNo">1808</span> return result;<a name="line.1808"></a>
+<span class="sourceLineNo">1809</span> }<a name="line.1809"></a>
+<span class="sourceLineNo">1810</span><a name="line.1810"></a>
+<span class="sourceLineNo">1811</span> /**<a name="line.1811"></a>
+<span class="sourceLineNo">1812</span> * @param a array<a name="line.1812"></a>
+<span class="sourceLineNo">1813</span> * @param length new array size<a name="line.1813"></a>
+<span class="sourceLineNo">1814</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1814"></a>
+<span class="sourceLineNo">1815</span> */<a name="line.1815"></a>
+<span class="sourceLineNo">1816</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1816"></a>
+<span class="sourceLineNo">1817</span> byte [] padding = new byte[length];<a name="line.1817"></a>
+<span class="sourceLineNo">1818</span> for (int i = 0; i < length; i++) {<a name="line.1818"></a>
+<span class="sourceLineNo">1819</span> padding[i] = 0;<a name="line.1819"></a>
+<span class="sourceLineNo">1820</span> }<a name="line.1820"></a>
+<span class="sourceLineNo">1821</span> return add(padding,a);<a name="line.1821"></a>
+<span class="sourceLineNo">1822</span> }<a name="line.1822"></a>
+<span class="sourceLineNo">1823</span><a name="line.1823"></a>
+<span class="sourceLineNo">1824</span> /**<a name="line.1824"></a>
+<span class="sourceLineNo">1825</span> * @param a array<a name="line.1825"></a>
+<span class="sourceLineNo">1826</span> * @param length new array size<a name="line.1826"></a>
+<span class="sourceLineNo">1827</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1827"></a>
+<span class="sourceLineNo">1828</span> */<a name="line.1828"></a>
+<span class="sourceLineNo">1829</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1829"></a>
+<span class="sourceLineNo">1830</span> byte [] padding = new byte[length];<a name="line.1830"></a>
+<span class="sourceLineNo">1831</span> for (int i = 0; i < length; i++) {<a name="line.1831"></a>
+<span class="sourceLineNo">1832</span> padding[i] = 0;<a name="line.1832"></a>
+<span class="sourceLineNo">1833</span> }<a name="line.1833"></a>
+<span class="sourceLineNo">1834</span> return add(a,padding);<a name="line.1834"></a>
+<span class="sourceLineNo">1835</span> }<a name="line.1835"></a>
+<span class="sourceLineNo">1836</span><a name="line.1836"></a>
+<span class="sourceLineNo">1837</span> /**<a name="line.1837"></a>
+<span class="sourceLineNo">1838</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1838"></a>
+<span class="sourceLineNo">1839</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1839"></a>
+<span class="sourceLineNo">1840</span> * @param a Beginning of range<a name="line.1840"></a>
+<span class="sourceLineNo">1841</span> * @param b End of range<a name="line.1841"></a>
+<span class="sourceLineNo">1842</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1842"></a>
+<span class="sourceLineNo">1843</span> * the range in two; i.e. one split.<a name="line.1843"></a>
+<span class="sourceLineNo">1844</span> * @return Array of dividing values<a name="line.1844"></a>
+<span class="sourceLineNo">1845</span> */<a name="line.1845"></a>
+<span class="sourceLineNo">1846</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1846"></a>
+<span class="sourceLineNo">1847</span> return split(a, b, false, num);<a name="line.1847"></a>
+<span class="sourceLineNo">1848</span> }<a name="line.1848"></a>
+<span class="sourceLineNo">1849</span><a name="line.1849"></a>
+<span class="sourceLineNo">1850</span> /**<a name="line.1850"></a>
+<span class="sourceLineNo">1851</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1851"></a>
+<span class="sourceLineNo">1852</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1852"></a>
+<span class="sourceLineNo">1853</span> * @param a Beginning of range<a name="line.1853"></a>
+<span class="sourceLineNo">1854</span> * @param b End of range<a name="line.1854"></a>
+<span class="sourceLineNo">1855</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1855"></a>
+<span class="sourceLineNo">1856</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1856"></a>
+<span class="sourceLineNo">1857</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1857"></a>
+<span class="sourceLineNo">1858</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1858"></a>
+<span class="sourceLineNo">1859</span> * the range in two; i.e. one split.<a name="line.1859"></a>
+<span class="sourceLineNo">1860</span> * @return Array of dividing values<a name="line.1860"></a>
+<span class="sourceLineNo">1861</span> */<a name="line.1861"></a>
+<span class="sourceLineNo">1862</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1862"></a>
+<span class="sourceLineNo">1863</span> boolean inclusive, final int num) {<a name="line.1863"></a>
+<span class="sourceLineNo">1864</span> byte[][] ret = new byte[num + 2][];<a name="line.1864"></a>
+<span class="sourceLineNo">1865</span> int i = 0;<a name="line.1865"></a>
+<span class="sourceLineNo">1866</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1866"></a>
+<span class="sourceLineNo">1867</span> if (iter == null)<a name="line.1867"></a>
+<span class="sourceLineNo">1868</span> return null;<a name="line.1868"></a>
+<span class="sourceLineNo">1869</span> for (byte[] elem : iter) {<a name="line.1869"></a>
+<span class="sourceLineNo">1870</span> ret[i++] = elem;<a name="line.1870"></a>
+<span class="sourceLineNo">1871</span> }<a name="line.1871"></a>
+<span class="sourceLineNo">1872</span> return ret;<a name="line.1872"></a>
+<span class="sourceLineNo">1873</span> }<a name="line.1873"></a>
+<span class="sourceLineNo">1874</span><a name="line.1874"></a>
+<span class="sourceLineNo">1875</span> /**<a name="line.1875"></a>
+<span class="sourceLineNo">1876</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1876"></a>
+<span class="sourceLineNo">1877</span> */<a name="line.1877"></a>
+<span class="sourceLineNo">1878</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1878"></a>
+<span class="sourceLineNo">1879</span> final byte[] b, final int num)<a name="line.1879"></a>
+<span class="sourceLineNo">1880</span> {<a name="line.1880"></a>
+<span class="sourceLineNo">1881</span> return iterateOnSplits(a, b, false, num);<a name="line.1881"></a>
+<span class="sourceLineNo">1882</span> }<a name="line.1882"></a>
+<span class="sourceLineNo">1883</span><a name="line.1883"></a>
+<span class="sourceLineNo">1884</span> /**<a name="line.1884"></a>
+<span class="sourceLineNo">1885</span> * Iterate over keys within the passed range.<a name="line.1885"></a>
+<span class="sourceLineNo">1886</span> */<a name="line.1886"></a>
+<span class="sourceLineNo">1887</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1887"></a>
+<span class="sourceLineNo">1888</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1888"></a>
+<span class="sourceLineNo">1889</span> {<a name="line.1889"></a>
+<span class="sourceLineNo">1890</span> byte [] aPadded;<a name="line.1890"></a>
+<span class="sourceLineNo">1891</span> byte [] bPadded;<a name="line.1891"></a>
+<span class="sourceLineNo">1892</span> if (a.length < b.length) {<a name="line.1892"></a>
+<span class="sourceLineNo">1893</span> aPadded = padTail(a, b.length - a.length);<a name="line.1893"></a>
+<span class="sourceLineNo">1894</span> bPadded = b;<a name="line.1894"></a>
+<span class="sourceLineNo">1895</span> } else if (b.length < a.length) {<a name="line.1895"></a>
+<span class="sourceLineNo">1896</span> aPadded = a;<a name="line.1896"></a>
+<span class="sourceLineNo">1897</span> bPadded = padTail(b, a.length - b.length);<a name="line.1897"></a>
+<span class="sourceLineNo">1898</span> } else {<a name="line.1898"></a>
+<span class="sourceLineNo">1899</span> aPadded = a;<a name="line.1899"></a>
+<span class="sourceLineNo">1900</span> bPadded = b;<a name="line.1900"></a>
+<span class="sourceLineNo">1901</span> }<a name="line.1901"></a>
+<span class="sourceLineNo">1902</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1902"></a>
+<span class="sourceLineNo">1903</span> throw new IllegalArgumentException("b <= a");<a name="line.1903"></a>
+<span class="sourceLineNo">1904</span> }<a name="line.1904"></a>
+<span class="sourceLineNo">1905</span> if (num <= 0) {<a name="line.1905"></a>
+<span class="sourceLineNo">1906</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1906"></a>
+<span class="sourceLineNo">1907</span> }<a name="line.1907"></a>
+<span class="sourceLineNo">1908</span> byte [] prependHeader = {1, 0};<a name="line.1908"></a>
+<span class="sourceLineNo">1909</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1909"></a>
+<span class="sourceLineNo">1910</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1910"></a>
+<span class="sourceLineNo">1911</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1911"></a>
+<span class="sourceLineNo">1912</span> if (inclusive) {<a name="line.1912"></a>
+<span class="sourceLineNo">1913</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1913"></a>
+<span class="sourceLineNo">1914</span> }<a name="line.1914"></a>
+<span class="sourceLineNo">1915</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1915"></a>
+<span class="sourceLineNo">1916</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1916"></a>
+<span class="sourceLineNo">1917</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1917"></a>
+<span class="sourceLineNo">1918</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1918"></a>
+<span class="sourceLineNo">1919</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1919"></a>
+<span class="sourceLineNo">1920</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1920"></a>
+<span class="sourceLineNo">1921</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1921"></a>
+<span class="sourceLineNo">1922</span> }<a name="line.1922"></a>
+<span class="sourceLineNo">1923</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1923"></a>
+<span class="sourceLineNo">1924</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1924"></a>
+<span class="sourceLineNo">1925</span> }<a name="line.1925"></a>
+<span class="sourceLineNo">1926</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1926"></a>
+<span class="sourceLineNo">1927</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1927"></a>
+<span class="sourceLineNo">1928</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1928"></a>
+<span class="sourceLineNo">1929</span> }<a name="line.1929"></a>
+<span class="sourceLineNo">1930</span> final BigInteger intervalBI;<a name="line.1930"></a>
+<span class="sourceLineNo">1931</span> try {<a name="line.1931"></a>
+<span class="sourceLineNo">1932</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1932"></a>
+<span class="sourceLineNo">1933</span> } catch(Exception e) {<a name="line.1933"></a>
+<span class="sourceLineNo">1934</span> LOG.error("Exception caught during division", e);<a name="line.1934"></a>
+<span class="sourceLineNo">1935</span> return null;<a name="line.1935"></a>
+<span class="sourceLineNo">1936</span> }<a name="line.1936"></a>
+<span class="sourceLineNo">1937</span><a name="line.1937"></a>
+<span class="sourceLineNo">1938</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1938"></a>
+<span class="sourceLineNo">1939</span> private int i = -1;<a name="line.1939"></a>
+<span class="sourceLineNo">1940</span><a name="line.1940"></a>
+<span class="sourceLineNo">1941</span> @Override<a name="line.1941"></a>
+<span class="sourceLineNo">1942</span> public boolean hasNext() {<a name="line.1942"></a>
+<span class="sourceLineNo">1943</span> return i < num+1;<a name="line.1943"></a>
+<span class="sourceLineNo">1944</span> }<a name="line.1944"></a>
<span class="sourceLineNo">1945</span><a name="line.1945"></a>
<span class="sourceLineNo">1946</span> @Override<a name="line.1946"></a>
-<span class="sourceLineNo">1947</span> public boolean hasNext() {<a name="line.1947"></a>
-<span class="sourceLineNo">1948</span> return i < num+1;<a name="line.1948"></a>
-<span class="sourceLineNo">1949</span> }<a name="line.1949"></a>
-<span class="sourceLineNo">1950</span><a name="line.1950"></a>
-<span class="sourceLineNo">1951</span> @Override<a name="line.1951"></a>
-<span class="sourceLineNo">1952</span> public byte[] next() {<a name="line.1952"></a>
-<span class="sourceLineNo">1953</span> i++;<a name="line.1953"></a>
-<span class="sourceLineNo">1954</span> if (i == 0) return a;<a name="line.1954"></a>
-<span class="sourceLineNo">1955</span> if (i == num + 1) return b;<a name="line.1955"></a>
-<span class="sourceLineNo">1956</span><a name="line.1956"></a>
-<span class="sourceLineNo">1957</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1957"></a>
-<span class="sourceLineNo">1958</span> byte [] padded = curBI.toByteArray();<a name="line.1958"></a>
-<span class="sourceLineNo">1959</span> if (padded[1] == 0)<a name="line.1959"></a>
-<span class="sourceLineNo">1960</span> padded = tail(padded, padded.length - 2);<a name="line.1960"></a>
-<span class="sourceLineNo">1961</span> else<a name="line.1961"></a>
-<span class="sourceLineNo">1962</span> padded = tail(padded, padded.length - 1);<a name="line.1962"></a>
-<span class="sourceLineNo">1963</span> return padded;<a name="line.1963"></a>
+<span class="sourceLineNo">1947</span> public byte[] next() {<a name="line.1947"></a>
+<span class="sourceLineNo">1948</span> i++;<a name="line.1948"></a>
+<span class="sourceLineNo">1949</span> if (i == 0) return a;<a name="line.1949"></a>
+<span class="sourceLineNo">1950</span> if (i == num + 1) return b;<a name="line.1950"></a>
+<span class="sourceLineNo">1951</span><a name="line.1951"></a>
+<span class="sourceLineNo">1952</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1952"></a>
+<span class="sourceLineNo">1953</span> byte [] padded = curBI.toByteArray();<a name="line.1953"></a>
+<span class="sourceLineNo">1954</span> if (padded[1] == 0)<a name="line.1954"></a>
+<span class="sourceLineNo">1955</span> padded = tail(padded, padded.length - 2);<a name="line.1955"></a>
+<span class="sourceLineNo">1956</span> else<a name="line.1956"></a>
+<span class="sourceLineNo">1957</span> padded = tail(padded, padded.length - 1);<a name="line.1957"></a>
+<span class="sourceLineNo">1958</span> return padded;<a name="line.1958"></a>
+<span class="sourceLineNo">1959</span> }<a name="line.1959"></a>
+<span class="sourceLineNo">1960</span><a name="line.1960"></a>
+<span class="sourceLineNo">1961</span> @Override<a name="line.1961"></a>
+<span class="sourceLineNo">1962</span> public void remove() {<a name="line.1962"></a>
+<span class="sourceLineNo">1963</span> throw new UnsupportedOperationException();<a name="line.1963"></a>
<span class="sourceLineNo">1964</span> }<a name="line.1964"></a>
<span class="sourceLineNo">1965</span><a name="line.1965"></a>
-<span class="sourceLineNo">1966</span> @Override<a name="line.1966"></a>
-<span class="sourceLineNo">1967</span> public void remove() {<a name="line.1967"></a>
-<span class="sourceLineNo">1968</span> throw new UnsupportedOperationException();<a name="line.1968"></a>
-<span class="sourceLineNo">1969</span> }<a name="line.1969"></a>
-<span class="sourceLineNo">1970</span><a name="line.1970"></a>
-<span class="sourceLineNo">1971</span> };<a name="line.1971"></a>
-<span class="sourceLineNo">1972</span><a name="line.1972"></a>
-<span class="sourceLineNo">1973</span> return new Iterable<byte[]>() {<a name="line.1973"></a>
-<span class="sourceLineNo">1974</span> @Override<a name="line.1974"></a>
-<span class="sourceLineNo">1975</span> public Iterator<byte[]> iterator() {<a name="line.1975"></a>
-<span class="sourceLineNo">1976</span> return iterator;<a name="line.1976"></a>
-<span class="sourceLineNo">1977</span> }<a name="line.1977"></a>
-<span class="sourceLineNo">1978</span> };<a name="line.1978"></a>
-<span class="sourceLineNo">1979</span> }<a name="line.1979"></a>
-<span class="sourceLineNo">1980</span><a name="line.1980"></a>
-<span class="sourceLineNo">1981</span> /**<a name="line.1981"></a>
-<span class="sourceLineNo">1982</span> * @param bytes array to hash<a name="line.1982"></a>
-<span class="sourceLineNo">1983</span> * @param offset offset to start from<a name="line.1983"></a>
-<span class="sourceLineNo">1984</span> * @param length length to hash<a name="line.1984"></a>
-<span class="sourceLineNo">1985</span> * */<a name="line.1985"></a>
-<span class="sourceLineNo">1986</span> public static int hashCode(byte[] bytes, int offset, int length) {<a name="line.1986"></a>
-<span class="sourceLineNo">1987</span> int hash = 1;<a name="line.1987"></a>
-<span class="sourceLineNo">1988</span> for (int i = offset; i < offset + length; i++)<a name="line.1988"></a>
-<span class="sourceLineNo">1989</span> hash = (31 * hash) + (int) bytes[i];<a name="line.1989"></a>
-<span class="sourceLineNo">1990</span> return hash;<a name="line.1990"></a>
-<span class="sourceLineNo">1991</span> }<a name="line.1991"></a>
-<span class="sourceLineNo">1992</span><a name="line.1992"></a>
-<span class="sourceLineNo">1993</span> /**<a name="line.1993"></a>
-<span class="sourceLineNo">1994</span> * @param t operands<a name="line.1994"></a>
-<span class="sourceLineNo">1995</span> * @return Array of byte arrays made from passed array of Text<a name="line.1995"></a>
-<span class="sourceLineNo">1996</span> */<a name="line.1996"></a>
-<span class="sourceLineNo">1997</span> public static byte [][] toByteArrays(final String [] t) {<a name="line.1997"></a>
-<span class="sourceLineNo">1998</span> byte [][] result = new byte[t.length][];<a name="line.1998"></a>
-<span class="sourceLineNo">1999</span> for (int i = 0; i < t.length; i++) {<a name="line.1999"></a>
-<span class="sourceLineNo">2000</span> result[i] = Bytes.toBytes(t[i]);<a name="line.2000"></a>
-<span class="sourceLineNo">2001</span> }<a name="line.2001"></a>
-<span class="sourceLineNo">2002</span> return result;<a name="line.2002"></a>
-<span class="sourceLineNo">2003</span> }<a name="line.2003"></a>
-<span class="sourceLineNo">2004</span><a name="line.2004"></a>
-<span class="sourceLineNo">2005</span> /**<a name="line.2005"></a>
-<span class="sourceLineNo">2006</span> * @param t operands<a name="line.2006"></a>
-<span class="sourceLineNo">2007</span> * @return Array of binary byte arrays made from passed array of binary strings<a name="line.2007"></a>
-<span class="sourceLineNo">2008</span> */<a name="line.2008"></a>
-<span class="sourceLineNo">2009</span> public static byte[][] toBinaryByteArrays(final String[] t) {<a name="line.2009"></a>
-<span class="sourceLineNo">2010</span> byte[][] result = new byte[t.length][];<a name="line.2010"></a>
-<span class="sourceLineNo">2011</span> for (int i = 0; i < t.length; i++) {<a name="line.2011"></a>
-<span class="sourceLineNo">2012</span> result[i] = Bytes.toBytesBinary(t[i]);<a name="line.2012"></a>
-<span class="sourceLineNo">2013</span> }<a name="line.2013"></a>
-<span class="sourceLineNo">2014</span> return result;<a name="line.2014"></a>
-<span class="sourceLineNo">2015</span> }<a name="line.2015"></a>
-<span class="sourceLineNo">2016</span><a name="line.2016"></a>
-<span class="sourceLineNo">2017</span> /**<a name="line.2017"></a>
-<span class="sourceLineNo">2018</span> * @param column operand<a name="line.2018"></a>
-<span class="sourceLineNo">2019</span> * @return A byte array of a byte array where first and only entry is<a name="line.2019"></a>
-<span class="sourceLineNo">2020</span> * <code>column</code><a name="line.2020"></a>
-<span class="sourceLineNo">2021</span> */<a name="line.2021"></a>
-<span class="sourceLineNo">2022</span> public static byte [][] toByteArrays(final String column) {<a name="line.2022"></a>
-<span class="sourceLineNo">2023</span> return toByteArrays(toBytes(column));<a name="line.2023"></a>
-<span class="sourceLineNo">2024</span> }<a name="line.2024"></a>
-<span class="sourceLineNo">2025</span><a name="line.2025"></a>
-<span class="sourceLineNo">2026</span> /**<a name="line.2026"></a>
-<span class="sourceLineNo">2027</span> * @param column operand<a name="line.2027"></a>
-<span class="sourceLineNo">2028</span> * @return A byte array of a byte array where first and only entry is<a name="line.2028"></a>
-<span class="sourceLineNo">2029</span> * <code>column</code><a name="line.2029"></a>
-<span class="sourceLineNo">2030</span> */<a name="line.2030"></a>
-<span class="sourceLineNo">2031</span> public static byte [][] toByteArrays(final byte [] column) {<a name="line.2031"></a>
-<span class="sourceLineNo">2032</span> byte [][] result = new byte[1][];<a name="line.2032"></a>
-<span class="sourceLineNo">2033</span> result[0] = column;<a name="line.2033"></a>
-<span class="sourceLineNo">2034</span> return result;<a name="line.2034"></a>
-<span class="sourceLineNo">2035</span> }<a name="line.2035"></a>
-<span class="sourceLineNo">2036</span><a name="line.2036"></a>
-<span class="sourceLineNo">2037</span> /**<a name="line.2037"></a>
-<span class="sourceLineNo">2038</span> * Binary search for keys in indexes.<a name="line.2038"></a>
-<span class="sourceLineNo">2039</span> *<a name="line.2039"></a>
-<span class="sourceLineNo">2040</span> * @param arr array of byte arrays to search for<a name="line.2040"></a>
-<span class="sourceLineNo">2041</span> * @param key the key you want to find<a name="line.2041"></a>
-<span class="sourceLineNo">2042</span> * @param offset the offset in the key you want to find<a name="line.2042"></a>
-<span class="sourceLineNo">2043</span> * @param length the length of the key<a name="line.2043"></a>
-<span class="sourceLineNo">2044</span> * @param comparator a comparator to compare.<a name="line.2044"></a>
-<span class="sourceLineNo">2045</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2045"></a>
-<span class="sourceLineNo">2046</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2046"></a>
-<span class="sourceLineNo">2047</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2047"></a>
-<span class="sourceLineNo">2048</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2048"></a>
-<span class="sourceLineNo">2049</span> * means that this function can return 2N + 1 different values<a name="line.2049"></a>
-<span class="sourceLineNo">2050</span> * ranging from -(N + 1) to N - 1.<a name="line.2050"></a>
-<span class="sourceLineNo">2051</span> * @deprecated {@link Bytes#binarySearch(byte[][], byte[], int, int)}<a name="line.2051"></a>
-<span class="sourceLineNo">2052</span> */<a name="line.2052"></a>
-<span class="sourceLineNo">2053</span> @Deprecated<a name="line.2053"></a>
-<span class="sourceLineNo">2054</span> public static int binarySearch(byte [][]arr, byte []key, int offset,<a name="line.2054"></a>
-<span class="sourceLineNo">2055</span> int length, RawComparator<?> comparator) {<a name="line.2055"></a>
-<span class="sourceLineNo">2056</span> return binarySearch(arr, key, offset, length);<a name="line.2056"></a>
-<span class="sourceLineNo">2057</span> }<a name="line.2057"></a>
-<span class="sourceLineNo">2058</span><a name="line.2058"></a>
-<span class="sourceLineNo">2059</span> /**<a name="line.2059"></a>
-<span class="sourceLineNo">2060</span> * Binary search for keys in indexes using Bytes.BYTES_RAWCOMPARATOR.<a name="line.2060"></a>
-<span class="sourceLineNo">2061</span> *<a name="line.2061"></a>
-<span class="sourceLineNo">2062</span> * @param arr array of byte arrays to search for<a name="line.2062"></a>
-<span class="sourceLineNo">2063</span> * @param key the key you want to find<a name="line.2063"></a>
-<span class="sourceLineNo">2064</span> * @param offset the offset in the key you want to find<a name="line.2064"></a>
-<span class="sourceLineNo">2065</span> * @param length the length of the key<a name="line.2065"></a>
-<span class="sourceLineNo">2066</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2066"></a>
-<span class="sourceLineNo">2067</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2067"></a>
-<span class="sourceLineNo">2068</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2068"></a>
-<span class="sourceLineNo">2069</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2069"></a>
-<span class="sourceLineNo">2070</span> * means that this function can return 2N + 1 different values<a name="line.2070"></a>
-<span class="sourceLineNo">2071</span> * ranging from -(N + 1) to N - 1.<a name="line.2071"></a>
-<span class="sourceLineNo">2072</span> */<a name="line.2072"></a>
-<span class="sourceLineNo">2073</span> public static int binarySearch(byte[][] arr, byte[] key, int offset, int length) {<a name="line.2073"></a>
-<span class="sourceLineNo">2074</span> int low = 0;<a name="line.2074"></a>
-<span class="sourceLineNo">2075</span> int high = arr.length - 1;<a name="line.2075"></a>
-<span class="sourceLineNo">2076</span><a name="line.2076"></a>
-<span class="sourceLineNo">2077</span> while (low <= high) {<a name="line.2077"></a>
-<span class="sourceLineNo">2078</span> int mid = (low + high) >>> 1;<a name="line.2078"></a>
-<span class="sourceLineNo">2079</span> // we have to compare in this order, because the comparator order<a name="line.2079"></a>
-<span class="sourceLineNo">2080</span> // has special logic when the 'left side' is a special key.<a name="line.2080"></a>
-<span class="sourceLineNo">2081</span> int cmp = Bytes.BYTES_RAWCOMPARATOR<a name="line.2081"></a>
-<span class="sourceLineNo">2082</span> .compare(key, offset, length, arr[mid], 0, arr[mid].length);<a name="line.2082"></a>
-<span class="sourceLineNo">2083</span> // key lives above the midpoint<a name="line.2083"></a>
-<span class="sourceLineNo">2084</span> if (cmp > 0)<a name="line.2084"></a>
-<span class="sourceLineNo">2085</span> low = mid + 1;<a name="line.2085"></a>
-<span class="sourceLineNo">2086</span> // key lives below the midpoint<a name="line.2086"></a>
-<span class="sourceLineNo">2087</span> else if (cmp < 0)<a name="line.2087"></a>
-<span class="sourceLineNo">2088</span> high = mid - 1;<a name="line.2088"></a>
-<span class="sourceLineNo">2089</span> // BAM. how often does this really happen?<a name="line.2089"></a>
-<span class="sourceLineNo">2090</span> else<a name="line.2090"></a>
-<span class="sourceLineNo">2091</span> return mid;<a name="line.2091"></a>
-<span class="sourceLineNo">2092</span> }<a name="line.2092"></a>
-<span class="sourceLineNo">2093</span> return -(low + 1);<a name="line.2093"></a>
-<span class="sourceLineNo">2094</span> }<a name="line.2094"></a>
-<span class="sourceLineNo">2095</span><a name="line.2095"></a>
-<span class="sourceLineNo">2096</span> /**<a name="line.2096"></a>
-<span class="sourceLineNo">2097</span> * Binary search for keys in indexes.<a name="line.2097"></a>
-<span class="sourceLineNo">2098</span> *<a name="line.2098"></a>
-<span class="sourceLineNo">2099</span> * @param arr array of byte arrays to search for<a name="line.2099"></a>
-<span class="sourceLineNo">2100</span> * @param key the key you want to find<a name="line.2100"></a>
-<span class="sourceLineNo">2101</span> * @param comparator a comparator to compare.<a name="line.2101"></a>
-<span class="sourceLineNo">2102</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2102"></a>
-<span class="sourceLineNo">2103</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2103"></a>
-<span class="sourceLineNo">2104</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2104"></a>
-<span class="sourceLineNo">2105</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2105"></a>
-<span class="sourceLineNo">2106</span> * means that this function can return 2N + 1 different values<a name="line.2106"></a>
-<span class="sourceLineNo">2107</span> * ranging from -(N + 1) to N - 1.<a name="line.2107"></a>
-<span class="sourceLineNo">2108</span> * @return the index of the block<a name="line.2108"></a>
-<span class="sourceLineNo">2109</span> * @deprecated Use {@link Bytes#binarySearch(Cell[], Cell, CellComparator)}<a name="line.2109"></a>
-<span class="sourceLineNo">2110</span> */<a name="line.2110"></a>
-<span class="sourceLineNo">2111</span> @Deprecated<a name="line.2111"></a>
-<span class="sourceLineNo">2112</span> public static int binarySearch(byte[][] arr, Cell key, RawComparator<Cell> comparator) {<a name="line.2112"></a>
-<span class="sourceLineNo">2113</span> int low = 0;<a name="line.2113"></a>
-<span class="sourceLineNo">2114</span> int high = arr.length - 1;<a name="line.2114"></a>
-<span class="sourceLineNo">2115</span> KeyValue.KeyOnlyKeyValue r = new KeyValue.KeyOnlyKeyValue();<a name="line.2115"></a>
-<span class="sourceLineNo">2116</span> while (low <= high) {<a name="line.2116"></a>
-<span class="sourceLineNo">2117</span>
<TRUNCATED>
[16/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.RowEndKeyComparator.html
----------------------------------------------------------------------
diff --git a/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.RowEndKeyComparator.html b/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.RowEndKeyComparator.html
index 3c7d6b4..3dea877 100644
--- a/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.RowEndKeyComparator.html
+++ b/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.RowEndKeyComparator.html
@@ -1583,1089 +1583,1084 @@
<span class="sourceLineNo">1575</span> length1 == length2) {<a name="line.1575"></a>
<span class="sourceLineNo">1576</span> return 0;<a name="line.1576"></a>
<span class="sourceLineNo">1577</span> }<a name="line.1577"></a>
-<span class="sourceLineNo">1578</span> final int minLength = Math.min(length1, length2);<a name="line.1578"></a>
-<span class="sourceLineNo">1579</span> final int minWords = minLength / SIZEOF_LONG;<a name="line.1579"></a>
-<span class="sourceLineNo">1580</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1580"></a>
-<span class="sourceLineNo">1581</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
-<span class="sourceLineNo">1582</span><a name="line.1582"></a>
-<span class="sourceLineNo">1583</span> /*<a name="line.1583"></a>
-<span class="sourceLineNo">1584</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a<a name="line.1584"></a>
-<span class="sourceLineNo">1585</span> * time is no slower than comparing 4 bytes at a time even on 32-bit.<a name="line.1585"></a>
-<span class="sourceLineNo">1586</span> * On the other hand, it is substantially faster on 64-bit.<a name="line.1586"></a>
-<span class="sourceLineNo">1587</span> */<a name="line.1587"></a>
-<span class="sourceLineNo">1588</span> // This is the end offset of long parts.<a name="line.1588"></a>
-<span class="sourceLineNo">1589</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.1589"></a>
-<span class="sourceLineNo">1590</span> for (int i = 0; i < j; i += SIZEOF_LONG) {<a name="line.1590"></a>
-<span class="sourceLineNo">1591</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1591"></a>
-<span class="sourceLineNo">1592</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1592"></a>
-<span class="sourceLineNo">1593</span> long diff = lw ^ rw;<a name="line.1593"></a>
-<span class="sourceLineNo">1594</span> if (diff != 0) {<a name="line.1594"></a>
-<span class="sourceLineNo">1595</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.1595"></a>
-<span class="sourceLineNo">1596</span> }<a name="line.1596"></a>
-<span class="sourceLineNo">1597</span> }<a name="line.1597"></a>
-<span class="sourceLineNo">1598</span> int offset = j;<a name="line.1598"></a>
-<span class="sourceLineNo">1599</span><a name="line.1599"></a>
-<span class="sourceLineNo">1600</span> if (minLength - offset >= SIZEOF_INT) {<a name="line.1600"></a>
-<span class="sourceLineNo">1601</span> int il = theUnsafe.getInt(buffer1, offset1Adj + offset);<a name="line.1601"></a>
-<span class="sourceLineNo">1602</span> int ir = theUnsafe.getInt(buffer2, offset2Adj + offset);<a name="line.1602"></a>
-<span class="sourceLineNo">1603</span> if (il != ir) {<a name="line.1603"></a>
-<span class="sourceLineNo">1604</span> return lessThanUnsignedInt(il, ir) ? -1: 1;<a name="line.1604"></a>
-<span class="sourceLineNo">1605</span> }<a name="line.1605"></a>
-<span class="sourceLineNo">1606</span> offset += SIZEOF_INT;<a name="line.1606"></a>
-<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
-<span class="sourceLineNo">1608</span> if (minLength - offset >= SIZEOF_SHORT) {<a name="line.1608"></a>
-<span class="sourceLineNo">1609</span> short sl = theUnsafe.getShort(buffer1, offset1Adj + offset);<a name="line.1609"></a>
-<span class="sourceLineNo">1610</span> short sr = theUnsafe.getShort(buffer2, offset2Adj + offset);<a name="line.1610"></a>
-<span class="sourceLineNo">1611</span> if (sl != sr) {<a name="line.1611"></a>
-<span class="sourceLineNo">1612</span> return lessThanUnsignedShort(sl, sr) ? -1: 1;<a name="line.1612"></a>
-<span class="sourceLineNo">1613</span> }<a name="line.1613"></a>
-<span class="sourceLineNo">1614</span> offset += SIZEOF_SHORT;<a name="line.1614"></a>
-<span class="sourceLineNo">1615</span> }<a name="line.1615"></a>
-<span class="sourceLineNo">1616</span> if (minLength - offset == 1) {<a name="line.1616"></a>
-<span class="sourceLineNo">1617</span> int a = (buffer1[(int)(offset1 + offset)] & 0xff);<a name="line.1617"></a>
-<span class="sourceLineNo">1618</span> int b = (buffer2[(int)(offset2 + offset)] & 0xff);<a name="line.1618"></a>
-<span class="sourceLineNo">1619</span> if (a != b) {<a name="line.1619"></a>
-<span class="sourceLineNo">1620</span> return a - b;<a name="line.1620"></a>
-<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
-<span class="sourceLineNo">1622</span> }<a name="line.1622"></a>
-<span class="sourceLineNo">1623</span> return length1 - length2;<a name="line.1623"></a>
-<span class="sourceLineNo">1624</span> }<a name="line.1624"></a>
-<span class="sourceLineNo">1625</span> }<a name="line.1625"></a>
-<span class="sourceLineNo">1626</span> }<a name="line.1626"></a>
-<span class="sourceLineNo">1627</span><a name="line.1627"></a>
-<span class="sourceLineNo">1628</span> /**<a name="line.1628"></a>
-<span class="sourceLineNo">1629</span> * @param left left operand<a name="line.1629"></a>
-<span class="sourceLineNo">1630</span> * @param right right operand<a name="line.1630"></a>
-<span class="sourceLineNo">1631</span> * @return True if equal<a name="line.1631"></a>
-<span class="sourceLineNo">1632</span> */<a name="line.1632"></a>
-<span class="sourceLineNo">1633</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1633"></a>
-<span class="sourceLineNo">1634</span> // Could use Arrays.equals?<a name="line.1634"></a>
-<span class="sourceLineNo">1635</span> //noinspection SimplifiableConditionalExpression<a name="line.1635"></a>
-<span class="sourceLineNo">1636</span> if (left == right) return true;<a name="line.1636"></a>
-<span class="sourceLineNo">1637</span> if (left == null || right == null) return false;<a name="line.1637"></a>
-<span class="sourceLineNo">1638</span> if (left.length != right.length) return false;<a name="line.1638"></a>
-<span class="sourceLineNo">1639</span> if (left.length == 0) return true;<a name="line.1639"></a>
+<span class="sourceLineNo">1578</span> final int stride = 8;<a name="line.1578"></a>
+<span class="sourceLineNo">1579</span> final int minLength = Math.min(length1, length2);<a name="line.1579"></a>
+<span class="sourceLineNo">1580</span> int strideLimit = minLength & ~(stride - 1);<a name="line.1580"></a>
+<span class="sourceLineNo">1581</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
+<span class="sourceLineNo">1582</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1582"></a>
+<span class="sourceLineNo">1583</span> int i;<a name="line.1583"></a>
+<span class="sourceLineNo">1584</span><a name="line.1584"></a>
+<span class="sourceLineNo">1585</span> /*<a name="line.1585"></a>
+<span class="sourceLineNo">1586</span> * Compare 8 bytes at a time. Benchmarking on x86 shows a stride of 8 bytes is no slower<a name="line.1586"></a>
+<span class="sourceLineNo">1587</span> * than 4 bytes even on 32-bit. On the other hand, it is substantially faster on 64-bit.<a name="line.1587"></a>
+<span class="sourceLineNo">1588</span> */<a name="line.1588"></a>
+<span class="sourceLineNo">1589</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.1589"></a>
+<span class="sourceLineNo">1590</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1590"></a>
+<span class="sourceLineNo">1591</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1591"></a>
+<span class="sourceLineNo">1592</span> if (lw != rw) {<a name="line.1592"></a>
+<span class="sourceLineNo">1593</span> if(!UnsafeAccess.littleEndian) {<a name="line.1593"></a>
+<span class="sourceLineNo">1594</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.1594"></a>
+<span class="sourceLineNo">1595</span> }<a name="line.1595"></a>
+<span class="sourceLineNo">1596</span><a name="line.1596"></a>
+<span class="sourceLineNo">1597</span> /*<a name="line.1597"></a>
+<span class="sourceLineNo">1598</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.1598"></a>
+<span class="sourceLineNo">1599</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.1599"></a>
+<span class="sourceLineNo">1600</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.1600"></a>
+<span class="sourceLineNo">1601</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.1601"></a>
+<span class="sourceLineNo">1602</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.1602"></a>
+<span class="sourceLineNo">1603</span> * comparator from guava v21<a name="line.1603"></a>
+<span class="sourceLineNo">1604</span> */<a name="line.1604"></a>
+<span class="sourceLineNo">1605</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.1605"></a>
+<span class="sourceLineNo">1606</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.1606"></a>
+<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
+<span class="sourceLineNo">1608</span> }<a name="line.1608"></a>
+<span class="sourceLineNo">1609</span><a name="line.1609"></a>
+<span class="sourceLineNo">1610</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.1610"></a>
+<span class="sourceLineNo">1611</span> for (; i < minLength; i++) {<a name="line.1611"></a>
+<span class="sourceLineNo">1612</span> int a = (buffer1[offset1 + i] & 0xFF);<a name="line.1612"></a>
+<span class="sourceLineNo">1613</span> int b = (buffer2[offset2 + i] & 0xFF);<a name="line.1613"></a>
+<span class="sourceLineNo">1614</span> if (a != b) {<a name="line.1614"></a>
+<span class="sourceLineNo">1615</span> return a - b;<a name="line.1615"></a>
+<span class="sourceLineNo">1616</span> }<a name="line.1616"></a>
+<span class="sourceLineNo">1617</span> }<a name="line.1617"></a>
+<span class="sourceLineNo">1618</span> return length1 - length2;<a name="line.1618"></a>
+<span class="sourceLineNo">1619</span> }<a name="line.1619"></a>
+<span class="sourceLineNo">1620</span> }<a name="line.1620"></a>
+<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
+<span class="sourceLineNo">1622</span><a name="line.1622"></a>
+<span class="sourceLineNo">1623</span> /**<a name="line.1623"></a>
+<span class="sourceLineNo">1624</span> * @param left left operand<a name="line.1624"></a>
+<span class="sourceLineNo">1625</span> * @param right right operand<a name="line.1625"></a>
+<span class="sourceLineNo">1626</span> * @return True if equal<a name="line.1626"></a>
+<span class="sourceLineNo">1627</span> */<a name="line.1627"></a>
+<span class="sourceLineNo">1628</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1628"></a>
+<span class="sourceLineNo">1629</span> // Could use Arrays.equals?<a name="line.1629"></a>
+<span class="sourceLineNo">1630</span> //noinspection SimplifiableConditionalExpression<a name="line.1630"></a>
+<span class="sourceLineNo">1631</span> if (left == right) return true;<a name="line.1631"></a>
+<span class="sourceLineNo">1632</span> if (left == null || right == null) return false;<a name="line.1632"></a>
+<span class="sourceLineNo">1633</span> if (left.length != right.length) return false;<a name="line.1633"></a>
+<span class="sourceLineNo">1634</span> if (left.length == 0) return true;<a name="line.1634"></a>
+<span class="sourceLineNo">1635</span><a name="line.1635"></a>
+<span class="sourceLineNo">1636</span> // Since we're often comparing adjacent sorted data,<a name="line.1636"></a>
+<span class="sourceLineNo">1637</span> // it's usual to have equal arrays except for the very last byte<a name="line.1637"></a>
+<span class="sourceLineNo">1638</span> // so check that first<a name="line.1638"></a>
+<span class="sourceLineNo">1639</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1639"></a>
<span class="sourceLineNo">1640</span><a name="line.1640"></a>
-<span class="sourceLineNo">1641</span> // Since we're often comparing adjacent sorted data,<a name="line.1641"></a>
-<span class="sourceLineNo">1642</span> // it's usual to have equal arrays except for the very last byte<a name="line.1642"></a>
-<span class="sourceLineNo">1643</span> // so check that first<a name="line.1643"></a>
-<span class="sourceLineNo">1644</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1644"></a>
-<span class="sourceLineNo">1645</span><a name="line.1645"></a>
-<span class="sourceLineNo">1646</span> return compareTo(left, right) == 0;<a name="line.1646"></a>
-<span class="sourceLineNo">1647</span> }<a name="line.1647"></a>
-<span class="sourceLineNo">1648</span><a name="line.1648"></a>
-<span class="sourceLineNo">1649</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1649"></a>
-<span class="sourceLineNo">1650</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1650"></a>
-<span class="sourceLineNo">1651</span> // short circuit case<a name="line.1651"></a>
-<span class="sourceLineNo">1652</span> if (left == right &&<a name="line.1652"></a>
-<span class="sourceLineNo">1653</span> leftOffset == rightOffset &&<a name="line.1653"></a>
-<span class="sourceLineNo">1654</span> leftLen == rightLen) {<a name="line.1654"></a>
-<span class="sourceLineNo">1655</span> return true;<a name="line.1655"></a>
-<span class="sourceLineNo">1656</span> }<a name="line.1656"></a>
-<span class="sourceLineNo">1657</span> // different lengths fast check<a name="line.1657"></a>
-<span class="sourceLineNo">1658</span> if (leftLen != rightLen) {<a name="line.1658"></a>
-<span class="sourceLineNo">1659</span> return false;<a name="line.1659"></a>
-<span class="sourceLineNo">1660</span> }<a name="line.1660"></a>
-<span class="sourceLineNo">1661</span> if (leftLen == 0) {<a name="line.1661"></a>
-<span class="sourceLineNo">1662</span> return true;<a name="line.1662"></a>
-<span class="sourceLineNo">1663</span> }<a name="line.1663"></a>
+<span class="sourceLineNo">1641</span> return compareTo(left, right) == 0;<a name="line.1641"></a>
+<span class="sourceLineNo">1642</span> }<a name="line.1642"></a>
+<span class="sourceLineNo">1643</span><a name="line.1643"></a>
+<span class="sourceLineNo">1644</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1644"></a>
+<span class="sourceLineNo">1645</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1645"></a>
+<span class="sourceLineNo">1646</span> // short circuit case<a name="line.1646"></a>
+<span class="sourceLineNo">1647</span> if (left == right &&<a name="line.1647"></a>
+<span class="sourceLineNo">1648</span> leftOffset == rightOffset &&<a name="line.1648"></a>
+<span class="sourceLineNo">1649</span> leftLen == rightLen) {<a name="line.1649"></a>
+<span class="sourceLineNo">1650</span> return true;<a name="line.1650"></a>
+<span class="sourceLineNo">1651</span> }<a name="line.1651"></a>
+<span class="sourceLineNo">1652</span> // different lengths fast check<a name="line.1652"></a>
+<span class="sourceLineNo">1653</span> if (leftLen != rightLen) {<a name="line.1653"></a>
+<span class="sourceLineNo">1654</span> return false;<a name="line.1654"></a>
+<span class="sourceLineNo">1655</span> }<a name="line.1655"></a>
+<span class="sourceLineNo">1656</span> if (leftLen == 0) {<a name="line.1656"></a>
+<span class="sourceLineNo">1657</span> return true;<a name="line.1657"></a>
+<span class="sourceLineNo">1658</span> }<a name="line.1658"></a>
+<span class="sourceLineNo">1659</span><a name="line.1659"></a>
+<span class="sourceLineNo">1660</span> // Since we're often comparing adjacent sorted data,<a name="line.1660"></a>
+<span class="sourceLineNo">1661</span> // it's usual to have equal arrays except for the very last byte<a name="line.1661"></a>
+<span class="sourceLineNo">1662</span> // so check that first<a name="line.1662"></a>
+<span class="sourceLineNo">1663</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1663"></a>
<span class="sourceLineNo">1664</span><a name="line.1664"></a>
-<span class="sourceLineNo">1665</span> // Since we're often comparing adjacent sorted data,<a name="line.1665"></a>
-<span class="sourceLineNo">1666</span> // it's usual to have equal arrays except for the very last byte<a name="line.1666"></a>
-<span class="sourceLineNo">1667</span> // so check that first<a name="line.1667"></a>
-<span class="sourceLineNo">1668</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1668"></a>
+<span class="sourceLineNo">1665</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1665"></a>
+<span class="sourceLineNo">1666</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1666"></a>
+<span class="sourceLineNo">1667</span> }<a name="line.1667"></a>
+<span class="sourceLineNo">1668</span><a name="line.1668"></a>
<span class="sourceLineNo">1669</span><a name="line.1669"></a>
-<span class="sourceLineNo">1670</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1670"></a>
-<span class="sourceLineNo">1671</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1671"></a>
-<span class="sourceLineNo">1672</span> }<a name="line.1672"></a>
-<span class="sourceLineNo">1673</span><a name="line.1673"></a>
-<span class="sourceLineNo">1674</span><a name="line.1674"></a>
-<span class="sourceLineNo">1675</span> /**<a name="line.1675"></a>
-<span class="sourceLineNo">1676</span> * @param a left operand<a name="line.1676"></a>
-<span class="sourceLineNo">1677</span> * @param buf right operand<a name="line.1677"></a>
-<span class="sourceLineNo">1678</span> * @return True if equal<a name="line.1678"></a>
-<span class="sourceLineNo">1679</span> */<a name="line.1679"></a>
-<span class="sourceLineNo">1680</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1680"></a>
-<span class="sourceLineNo">1681</span> if (a == null) return buf == null;<a name="line.1681"></a>
-<span class="sourceLineNo">1682</span> if (buf == null) return false;<a name="line.1682"></a>
-<span class="sourceLineNo">1683</span> if (a.length != buf.remaining()) return false;<a name="line.1683"></a>
-<span class="sourceLineNo">1684</span><a name="line.1684"></a>
-<span class="sourceLineNo">1685</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1685"></a>
-<span class="sourceLineNo">1686</span> ByteBuffer b = buf.duplicate();<a name="line.1686"></a>
-<span class="sourceLineNo">1687</span> for (byte anA : a) {<a name="line.1687"></a>
-<span class="sourceLineNo">1688</span> if (anA != b.get()) {<a name="line.1688"></a>
-<span class="sourceLineNo">1689</span> return false;<a name="line.1689"></a>
-<span class="sourceLineNo">1690</span> }<a name="line.1690"></a>
-<span class="sourceLineNo">1691</span> }<a name="line.1691"></a>
-<span class="sourceLineNo">1692</span> return true;<a name="line.1692"></a>
-<span class="sourceLineNo">1693</span> }<a name="line.1693"></a>
-<span class="sourceLineNo">1694</span><a name="line.1694"></a>
-<span class="sourceLineNo">1695</span><a name="line.1695"></a>
-<span class="sourceLineNo">1696</span> /**<a name="line.1696"></a>
-<span class="sourceLineNo">1697</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1697"></a>
-<span class="sourceLineNo">1698</span> * array on the left.<a name="line.1698"></a>
-<span class="sourceLineNo">1699</span> */<a name="line.1699"></a>
-<span class="sourceLineNo">1700</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1700"></a>
-<span class="sourceLineNo">1701</span> return bytes != null && prefix != null &&<a name="line.1701"></a>
-<span class="sourceLineNo">1702</span> bytes.length >= prefix.length &&<a name="line.1702"></a>
-<span class="sourceLineNo">1703</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1703"></a>
-<span class="sourceLineNo">1704</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1704"></a>
-<span class="sourceLineNo">1705</span> }<a name="line.1705"></a>
-<span class="sourceLineNo">1706</span><a name="line.1706"></a>
-<span class="sourceLineNo">1707</span> /**<a name="line.1707"></a>
-<span class="sourceLineNo">1708</span> * @param b bytes to hash<a name="line.1708"></a>
-<span class="sourceLineNo">1709</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1709"></a>
-<span class="sourceLineNo">1710</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1710"></a>
-<span class="sourceLineNo">1711</span> * use calculating hash code.<a name="line.1711"></a>
-<span class="sourceLineNo">1712</span> */<a name="line.1712"></a>
-<span class="sourceLineNo">1713</span> public static int hashCode(final byte [] b) {<a name="line.1713"></a>
-<span class="sourceLineNo">1714</span> return hashCode(b, b.length);<a name="line.1714"></a>
-<span class="sourceLineNo">1715</span> }<a name="line.1715"></a>
-<span class="sourceLineNo">1716</span><a name="line.1716"></a>
-<span class="sourceLineNo">1717</span> /**<a name="line.1717"></a>
-<span class="sourceLineNo">1718</span> * @param b value<a name="line.1718"></a>
-<span class="sourceLineNo">1719</span> * @param length length of the value<a name="line.1719"></a>
-<span class="sourceLineNo">1720</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1720"></a>
-<span class="sourceLineNo">1721</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1721"></a>
-<span class="sourceLineNo">1722</span> * use calculating hash code.<a name="line.1722"></a>
-<span class="sourceLineNo">1723</span> */<a name="line.1723"></a>
-<span class="sourceLineNo">1724</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1724"></a>
-<span class="sourceLineNo">1725</span> return WritableComparator.hashBytes(b, length);<a name="line.1725"></a>
-<span class="sourceLineNo">1726</span> }<a name="line.1726"></a>
-<span class="sourceLineNo">1727</span><a name="line.1727"></a>
-<span class="sourceLineNo">1728</span> /**<a name="line.1728"></a>
-<span class="sourceLineNo">1729</span> * @param b bytes to hash<a name="line.1729"></a>
-<span class="sourceLineNo">1730</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1730"></a>
-<span class="sourceLineNo">1731</span> * Maps.<a name="line.1731"></a>
-<span class="sourceLineNo">1732</span> */<a name="line.1732"></a>
-<span class="sourceLineNo">1733</span> public static Integer mapKey(final byte [] b) {<a name="line.1733"></a>
-<span class="sourceLineNo">1734</span> return hashCode(b);<a name="line.1734"></a>
-<span class="sourceLineNo">1735</span> }<a name="line.1735"></a>
-<span class="sourceLineNo">1736</span><a name="line.1736"></a>
-<span class="sourceLineNo">1737</span> /**<a name="line.1737"></a>
-<span class="sourceLineNo">1738</span> * @param b bytes to hash<a name="line.1738"></a>
-<span class="sourceLineNo">1739</span> * @param length length to hash<a name="line.1739"></a>
-<span class="sourceLineNo">1740</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1740"></a>
-<span class="sourceLineNo">1741</span> * Maps.<a name="line.1741"></a>
-<span class="sourceLineNo">1742</span> */<a name="line.1742"></a>
-<span class="sourceLineNo">1743</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1743"></a>
-<span class="sourceLineNo">1744</span> return hashCode(b, length);<a name="line.1744"></a>
-<span class="sourceLineNo">1745</span> }<a name="line.1745"></a>
-<span class="sourceLineNo">1746</span><a name="line.1746"></a>
-<span class="sourceLineNo">1747</span> /**<a name="line.1747"></a>
-<span class="sourceLineNo">1748</span> * @param a lower half<a name="line.1748"></a>
-<span class="sourceLineNo">1749</span> * @param b upper half<a name="line.1749"></a>
-<span class="sourceLineNo">1750</span> * @return New array that has a in lower half and b in upper half.<a name="line.1750"></a>
-<span class="sourceLineNo">1751</span> */<a name="line.1751"></a>
-<span class="sourceLineNo">1752</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1752"></a>
-<span class="sourceLineNo">1753</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1753"></a>
-<span class="sourceLineNo">1754</span> }<a name="line.1754"></a>
-<span class="sourceLineNo">1755</span><a name="line.1755"></a>
-<span class="sourceLineNo">1756</span> /**<a name="line.1756"></a>
-<span class="sourceLineNo">1757</span> * @param a first third<a name="line.1757"></a>
-<span class="sourceLineNo">1758</span> * @param b second third<a name="line.1758"></a>
-<span class="sourceLineNo">1759</span> * @param c third third<a name="line.1759"></a>
-<span class="sourceLineNo">1760</span> * @return New array made from a, b and c<a name="line.1760"></a>
-<span class="sourceLineNo">1761</span> */<a name="line.1761"></a>
-<span class="sourceLineNo">1762</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1762"></a>
-<span class="sourceLineNo">1763</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1763"></a>
-<span class="sourceLineNo">1764</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1764"></a>
-<span class="sourceLineNo">1765</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1765"></a>
-<span class="sourceLineNo">1766</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1766"></a>
-<span class="sourceLineNo">1767</span> return result;<a name="line.1767"></a>
-<span class="sourceLineNo">1768</span> }<a name="line.1768"></a>
-<span class="sourceLineNo">1769</span><a name="line.1769"></a>
-<span class="sourceLineNo">1770</span> /**<a name="line.1770"></a>
-<span class="sourceLineNo">1771</span> * @param arrays all the arrays to concatenate together.<a name="line.1771"></a>
-<span class="sourceLineNo">1772</span> * @return New array made from the concatenation of the given arrays.<a name="line.1772"></a>
-<span class="sourceLineNo">1773</span> */<a name="line.1773"></a>
-<span class="sourceLineNo">1774</span> public static byte [] add(final byte [][] arrays) {<a name="line.1774"></a>
-<span class="sourceLineNo">1775</span> int length = 0;<a name="line.1775"></a>
+<span class="sourceLineNo">1670</span> /**<a name="line.1670"></a>
+<span class="sourceLineNo">1671</span> * @param a left operand<a name="line.1671"></a>
+<span class="sourceLineNo">1672</span> * @param buf right operand<a name="line.1672"></a>
+<span class="sourceLineNo">1673</span> * @return True if equal<a name="line.1673"></a>
+<span class="sourceLineNo">1674</span> */<a name="line.1674"></a>
+<span class="sourceLineNo">1675</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1675"></a>
+<span class="sourceLineNo">1676</span> if (a == null) return buf == null;<a name="line.1676"></a>
+<span class="sourceLineNo">1677</span> if (buf == null) return false;<a name="line.1677"></a>
+<span class="sourceLineNo">1678</span> if (a.length != buf.remaining()) return false;<a name="line.1678"></a>
+<span class="sourceLineNo">1679</span><a name="line.1679"></a>
+<span class="sourceLineNo">1680</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1680"></a>
+<span class="sourceLineNo">1681</span> ByteBuffer b = buf.duplicate();<a name="line.1681"></a>
+<span class="sourceLineNo">1682</span> for (byte anA : a) {<a name="line.1682"></a>
+<span class="sourceLineNo">1683</span> if (anA != b.get()) {<a name="line.1683"></a>
+<span class="sourceLineNo">1684</span> return false;<a name="line.1684"></a>
+<span class="sourceLineNo">1685</span> }<a name="line.1685"></a>
+<span class="sourceLineNo">1686</span> }<a name="line.1686"></a>
+<span class="sourceLineNo">1687</span> return true;<a name="line.1687"></a>
+<span class="sourceLineNo">1688</span> }<a name="line.1688"></a>
+<span class="sourceLineNo">1689</span><a name="line.1689"></a>
+<span class="sourceLineNo">1690</span><a name="line.1690"></a>
+<span class="sourceLineNo">1691</span> /**<a name="line.1691"></a>
+<span class="sourceLineNo">1692</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1692"></a>
+<span class="sourceLineNo">1693</span> * array on the left.<a name="line.1693"></a>
+<span class="sourceLineNo">1694</span> */<a name="line.1694"></a>
+<span class="sourceLineNo">1695</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1695"></a>
+<span class="sourceLineNo">1696</span> return bytes != null && prefix != null &&<a name="line.1696"></a>
+<span class="sourceLineNo">1697</span> bytes.length >= prefix.length &&<a name="line.1697"></a>
+<span class="sourceLineNo">1698</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1698"></a>
+<span class="sourceLineNo">1699</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1699"></a>
+<span class="sourceLineNo">1700</span> }<a name="line.1700"></a>
+<span class="sourceLineNo">1701</span><a name="line.1701"></a>
+<span class="sourceLineNo">1702</span> /**<a name="line.1702"></a>
+<span class="sourceLineNo">1703</span> * @param b bytes to hash<a name="line.1703"></a>
+<span class="sourceLineNo">1704</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1704"></a>
+<span class="sourceLineNo">1705</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1705"></a>
+<span class="sourceLineNo">1706</span> * use calculating hash code.<a name="line.1706"></a>
+<span class="sourceLineNo">1707</span> */<a name="line.1707"></a>
+<span class="sourceLineNo">1708</span> public static int hashCode(final byte [] b) {<a name="line.1708"></a>
+<span class="sourceLineNo">1709</span> return hashCode(b, b.length);<a name="line.1709"></a>
+<span class="sourceLineNo">1710</span> }<a name="line.1710"></a>
+<span class="sourceLineNo">1711</span><a name="line.1711"></a>
+<span class="sourceLineNo">1712</span> /**<a name="line.1712"></a>
+<span class="sourceLineNo">1713</span> * @param b value<a name="line.1713"></a>
+<span class="sourceLineNo">1714</span> * @param length length of the value<a name="line.1714"></a>
+<span class="sourceLineNo">1715</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1715"></a>
+<span class="sourceLineNo">1716</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1716"></a>
+<span class="sourceLineNo">1717</span> * use calculating hash code.<a name="line.1717"></a>
+<span class="sourceLineNo">1718</span> */<a name="line.1718"></a>
+<span class="sourceLineNo">1719</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1719"></a>
+<span class="sourceLineNo">1720</span> return WritableComparator.hashBytes(b, length);<a name="line.1720"></a>
+<span class="sourceLineNo">1721</span> }<a name="line.1721"></a>
+<span class="sourceLineNo">1722</span><a name="line.1722"></a>
+<span class="sourceLineNo">1723</span> /**<a name="line.1723"></a>
+<span class="sourceLineNo">1724</span> * @param b bytes to hash<a name="line.1724"></a>
+<span class="sourceLineNo">1725</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1725"></a>
+<span class="sourceLineNo">1726</span> * Maps.<a name="line.1726"></a>
+<span class="sourceLineNo">1727</span> */<a name="line.1727"></a>
+<span class="sourceLineNo">1728</span> public static Integer mapKey(final byte [] b) {<a name="line.1728"></a>
+<span class="sourceLineNo">1729</span> return hashCode(b);<a name="line.1729"></a>
+<span class="sourceLineNo">1730</span> }<a name="line.1730"></a>
+<span class="sourceLineNo">1731</span><a name="line.1731"></a>
+<span class="sourceLineNo">1732</span> /**<a name="line.1732"></a>
+<span class="sourceLineNo">1733</span> * @param b bytes to hash<a name="line.1733"></a>
+<span class="sourceLineNo">1734</span> * @param length length to hash<a name="line.1734"></a>
+<span class="sourceLineNo">1735</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1735"></a>
+<span class="sourceLineNo">1736</span> * Maps.<a name="line.1736"></a>
+<span class="sourceLineNo">1737</span> */<a name="line.1737"></a>
+<span class="sourceLineNo">1738</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1738"></a>
+<span class="sourceLineNo">1739</span> return hashCode(b, length);<a name="line.1739"></a>
+<span class="sourceLineNo">1740</span> }<a name="line.1740"></a>
+<span class="sourceLineNo">1741</span><a name="line.1741"></a>
+<span class="sourceLineNo">1742</span> /**<a name="line.1742"></a>
+<span class="sourceLineNo">1743</span> * @param a lower half<a name="line.1743"></a>
+<span class="sourceLineNo">1744</span> * @param b upper half<a name="line.1744"></a>
+<span class="sourceLineNo">1745</span> * @return New array that has a in lower half and b in upper half.<a name="line.1745"></a>
+<span class="sourceLineNo">1746</span> */<a name="line.1746"></a>
+<span class="sourceLineNo">1747</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1747"></a>
+<span class="sourceLineNo">1748</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1748"></a>
+<span class="sourceLineNo">1749</span> }<a name="line.1749"></a>
+<span class="sourceLineNo">1750</span><a name="line.1750"></a>
+<span class="sourceLineNo">1751</span> /**<a name="line.1751"></a>
+<span class="sourceLineNo">1752</span> * @param a first third<a name="line.1752"></a>
+<span class="sourceLineNo">1753</span> * @param b second third<a name="line.1753"></a>
+<span class="sourceLineNo">1754</span> * @param c third third<a name="line.1754"></a>
+<span class="sourceLineNo">1755</span> * @return New array made from a, b and c<a name="line.1755"></a>
+<span class="sourceLineNo">1756</span> */<a name="line.1756"></a>
+<span class="sourceLineNo">1757</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1757"></a>
+<span class="sourceLineNo">1758</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1758"></a>
+<span class="sourceLineNo">1759</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1759"></a>
+<span class="sourceLineNo">1760</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1760"></a>
+<span class="sourceLineNo">1761</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1761"></a>
+<span class="sourceLineNo">1762</span> return result;<a name="line.1762"></a>
+<span class="sourceLineNo">1763</span> }<a name="line.1763"></a>
+<span class="sourceLineNo">1764</span><a name="line.1764"></a>
+<span class="sourceLineNo">1765</span> /**<a name="line.1765"></a>
+<span class="sourceLineNo">1766</span> * @param arrays all the arrays to concatenate together.<a name="line.1766"></a>
+<span class="sourceLineNo">1767</span> * @return New array made from the concatenation of the given arrays.<a name="line.1767"></a>
+<span class="sourceLineNo">1768</span> */<a name="line.1768"></a>
+<span class="sourceLineNo">1769</span> public static byte [] add(final byte [][] arrays) {<a name="line.1769"></a>
+<span class="sourceLineNo">1770</span> int length = 0;<a name="line.1770"></a>
+<span class="sourceLineNo">1771</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1771"></a>
+<span class="sourceLineNo">1772</span> length += arrays[i].length;<a name="line.1772"></a>
+<span class="sourceLineNo">1773</span> }<a name="line.1773"></a>
+<span class="sourceLineNo">1774</span> byte [] result = new byte[length];<a name="line.1774"></a>
+<span class="sourceLineNo">1775</span> int index = 0;<a name="line.1775"></a>
<span class="sourceLineNo">1776</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1776"></a>
-<span class="sourceLineNo">1777</span> length += arrays[i].length;<a name="line.1777"></a>
-<span class="sourceLineNo">1778</span> }<a name="line.1778"></a>
-<span class="sourceLineNo">1779</span> byte [] result = new byte[length];<a name="line.1779"></a>
-<span class="sourceLineNo">1780</span> int index = 0;<a name="line.1780"></a>
-<span class="sourceLineNo">1781</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1781"></a>
-<span class="sourceLineNo">1782</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1782"></a>
-<span class="sourceLineNo">1783</span> index += arrays[i].length;<a name="line.1783"></a>
-<span class="sourceLineNo">1784</span> }<a name="line.1784"></a>
-<span class="sourceLineNo">1785</span> return result;<a name="line.1785"></a>
-<span class="sourceLineNo">1786</span> }<a name="line.1786"></a>
-<span class="sourceLineNo">1787</span><a name="line.1787"></a>
-<span class="sourceLineNo">1788</span> /**<a name="line.1788"></a>
-<span class="sourceLineNo">1789</span> * @param a array<a name="line.1789"></a>
-<span class="sourceLineNo">1790</span> * @param length amount of bytes to grab<a name="line.1790"></a>
-<span class="sourceLineNo">1791</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1791"></a>
-<span class="sourceLineNo">1792</span> */<a name="line.1792"></a>
-<span class="sourceLineNo">1793</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1793"></a>
-<span class="sourceLineNo">1794</span> if (a.length < length) {<a name="line.1794"></a>
-<span class="sourceLineNo">1795</span> return null;<a name="line.1795"></a>
-<span class="sourceLineNo">1796</span> }<a name="line.1796"></a>
-<span class="sourceLineNo">1797</span> byte [] result = new byte[length];<a name="line.1797"></a>
-<span class="sourceLineNo">1798</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1798"></a>
-<span class="sourceLineNo">1799</span> return result;<a name="line.1799"></a>
-<span class="sourceLineNo">1800</span> }<a name="line.1800"></a>
-<span class="sourceLineNo">1801</span><a name="line.1801"></a>
-<span class="sourceLineNo">1802</span> /**<a name="line.1802"></a>
-<span class="sourceLineNo">1803</span> * @param a array<a name="line.1803"></a>
-<span class="sourceLineNo">1804</span> * @param length amount of bytes to snarf<a name="line.1804"></a>
-<span class="sourceLineNo">1805</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1805"></a>
-<span class="sourceLineNo">1806</span> */<a name="line.1806"></a>
-<span class="sourceLineNo">1807</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1807"></a>
-<span class="sourceLineNo">1808</span> if (a.length < length) {<a name="line.1808"></a>
-<span class="sourceLineNo">1809</span> return null;<a name="line.1809"></a>
-<span class="sourceLineNo">1810</span> }<a name="line.1810"></a>
-<span class="sourceLineNo">1811</span> byte [] result = new byte[length];<a name="line.1811"></a>
-<span class="sourceLineNo">1812</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1812"></a>
-<span class="sourceLineNo">1813</span> return result;<a name="line.1813"></a>
-<span class="sourceLineNo">1814</span> }<a name="line.1814"></a>
-<span class="sourceLineNo">1815</span><a name="line.1815"></a>
-<span class="sourceLineNo">1816</span> /**<a name="line.1816"></a>
-<span class="sourceLineNo">1817</span> * @param a array<a name="line.1817"></a>
-<span class="sourceLineNo">1818</span> * @param length new array size<a name="line.1818"></a>
-<span class="sourceLineNo">1819</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1819"></a>
-<span class="sourceLineNo">1820</span> */<a name="line.1820"></a>
-<span class="sourceLineNo">1821</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1821"></a>
-<span class="sourceLineNo">1822</span> byte [] padding = new byte[length];<a name="line.1822"></a>
-<span class="sourceLineNo">1823</span> for (int i = 0; i < length; i++) {<a name="line.1823"></a>
-<span class="sourceLineNo">1824</span> padding[i] = 0;<a name="line.1824"></a>
-<span class="sourceLineNo">1825</span> }<a name="line.1825"></a>
-<span class="sourceLineNo">1826</span> return add(padding,a);<a name="line.1826"></a>
-<span class="sourceLineNo">1827</span> }<a name="line.1827"></a>
-<span class="sourceLineNo">1828</span><a name="line.1828"></a>
-<span class="sourceLineNo">1829</span> /**<a name="line.1829"></a>
-<span class="sourceLineNo">1830</span> * @param a array<a name="line.1830"></a>
-<span class="sourceLineNo">1831</span> * @param length new array size<a name="line.1831"></a>
-<span class="sourceLineNo">1832</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1832"></a>
-<span class="sourceLineNo">1833</span> */<a name="line.1833"></a>
-<span class="sourceLineNo">1834</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1834"></a>
-<span class="sourceLineNo">1835</span> byte [] padding = new byte[length];<a name="line.1835"></a>
-<span class="sourceLineNo">1836</span> for (int i = 0; i < length; i++) {<a name="line.1836"></a>
-<span class="sourceLineNo">1837</span> padding[i] = 0;<a name="line.1837"></a>
-<span class="sourceLineNo">1838</span> }<a name="line.1838"></a>
-<span class="sourceLineNo">1839</span> return add(a,padding);<a name="line.1839"></a>
-<span class="sourceLineNo">1840</span> }<a name="line.1840"></a>
-<span class="sourceLineNo">1841</span><a name="line.1841"></a>
-<span class="sourceLineNo">1842</span> /**<a name="line.1842"></a>
-<span class="sourceLineNo">1843</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1843"></a>
-<span class="sourceLineNo">1844</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1844"></a>
-<span class="sourceLineNo">1845</span> * @param a Beginning of range<a name="line.1845"></a>
-<span class="sourceLineNo">1846</span> * @param b End of range<a name="line.1846"></a>
-<span class="sourceLineNo">1847</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1847"></a>
-<span class="sourceLineNo">1848</span> * the range in two; i.e. one split.<a name="line.1848"></a>
-<span class="sourceLineNo">1849</span> * @return Array of dividing values<a name="line.1849"></a>
-<span class="sourceLineNo">1850</span> */<a name="line.1850"></a>
-<span class="sourceLineNo">1851</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1851"></a>
-<span class="sourceLineNo">1852</span> return split(a, b, false, num);<a name="line.1852"></a>
-<span class="sourceLineNo">1853</span> }<a name="line.1853"></a>
-<span class="sourceLineNo">1854</span><a name="line.1854"></a>
-<span class="sourceLineNo">1855</span> /**<a name="line.1855"></a>
-<span class="sourceLineNo">1856</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1856"></a>
-<span class="sourceLineNo">1857</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1857"></a>
-<span class="sourceLineNo">1858</span> * @param a Beginning of range<a name="line.1858"></a>
-<span class="sourceLineNo">1859</span> * @param b End of range<a name="line.1859"></a>
-<span class="sourceLineNo">1860</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1860"></a>
-<span class="sourceLineNo">1861</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1861"></a>
-<span class="sourceLineNo">1862</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1862"></a>
-<span class="sourceLineNo">1863</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1863"></a>
-<span class="sourceLineNo">1864</span> * the range in two; i.e. one split.<a name="line.1864"></a>
-<span class="sourceLineNo">1865</span> * @return Array of dividing values<a name="line.1865"></a>
-<span class="sourceLineNo">1866</span> */<a name="line.1866"></a>
-<span class="sourceLineNo">1867</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1867"></a>
-<span class="sourceLineNo">1868</span> boolean inclusive, final int num) {<a name="line.1868"></a>
-<span class="sourceLineNo">1869</span> byte[][] ret = new byte[num + 2][];<a name="line.1869"></a>
-<span class="sourceLineNo">1870</span> int i = 0;<a name="line.1870"></a>
-<span class="sourceLineNo">1871</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1871"></a>
-<span class="sourceLineNo">1872</span> if (iter == null)<a name="line.1872"></a>
-<span class="sourceLineNo">1873</span> return null;<a name="line.1873"></a>
-<span class="sourceLineNo">1874</span> for (byte[] elem : iter) {<a name="line.1874"></a>
-<span class="sourceLineNo">1875</span> ret[i++] = elem;<a name="line.1875"></a>
-<span class="sourceLineNo">1876</span> }<a name="line.1876"></a>
-<span class="sourceLineNo">1877</span> return ret;<a name="line.1877"></a>
-<span class="sourceLineNo">1878</span> }<a name="line.1878"></a>
-<span class="sourceLineNo">1879</span><a name="line.1879"></a>
-<span class="sourceLineNo">1880</span> /**<a name="line.1880"></a>
-<span class="sourceLineNo">1881</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1881"></a>
-<span class="sourceLineNo">1882</span> */<a name="line.1882"></a>
-<span class="sourceLineNo">1883</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1883"></a>
-<span class="sourceLineNo">1884</span> final byte[] b, final int num)<a name="line.1884"></a>
-<span class="sourceLineNo">1885</span> {<a name="line.1885"></a>
-<span class="sourceLineNo">1886</span> return iterateOnSplits(a, b, false, num);<a name="line.1886"></a>
-<span class="sourceLineNo">1887</span> }<a name="line.1887"></a>
-<span class="sourceLineNo">1888</span><a name="line.1888"></a>
-<span class="sourceLineNo">1889</span> /**<a name="line.1889"></a>
-<span class="sourceLineNo">1890</span> * Iterate over keys within the passed range.<a name="line.1890"></a>
-<span class="sourceLineNo">1891</span> */<a name="line.1891"></a>
-<span class="sourceLineNo">1892</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1892"></a>
-<span class="sourceLineNo">1893</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1893"></a>
-<span class="sourceLineNo">1894</span> {<a name="line.1894"></a>
-<span class="sourceLineNo">1895</span> byte [] aPadded;<a name="line.1895"></a>
-<span class="sourceLineNo">1896</span> byte [] bPadded;<a name="line.1896"></a>
-<span class="sourceLineNo">1897</span> if (a.length < b.length) {<a name="line.1897"></a>
-<span class="sourceLineNo">1898</span> aPadded = padTail(a, b.length - a.length);<a name="line.1898"></a>
-<span class="sourceLineNo">1899</span> bPadded = b;<a name="line.1899"></a>
-<span class="sourceLineNo">1900</span> } else if (b.length < a.length) {<a name="line.1900"></a>
-<span class="sourceLineNo">1901</span> aPadded = a;<a name="line.1901"></a>
-<span class="sourceLineNo">1902</span> bPadded = padTail(b, a.length - b.length);<a name="line.1902"></a>
-<span class="sourceLineNo">1903</span> } else {<a name="line.1903"></a>
-<span class="sourceLineNo">1904</span> aPadded = a;<a name="line.1904"></a>
-<span class="sourceLineNo">1905</span> bPadded = b;<a name="line.1905"></a>
-<span class="sourceLineNo">1906</span> }<a name="line.1906"></a>
-<span class="sourceLineNo">1907</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1907"></a>
-<span class="sourceLineNo">1908</span> throw new IllegalArgumentException("b <= a");<a name="line.1908"></a>
-<span class="sourceLineNo">1909</span> }<a name="line.1909"></a>
-<span class="sourceLineNo">1910</span> if (num <= 0) {<a name="line.1910"></a>
-<span class="sourceLineNo">1911</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1911"></a>
-<span class="sourceLineNo">1912</span> }<a name="line.1912"></a>
-<span class="sourceLineNo">1913</span> byte [] prependHeader = {1, 0};<a name="line.1913"></a>
-<span class="sourceLineNo">1914</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1914"></a>
-<span class="sourceLineNo">1915</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1915"></a>
-<span class="sourceLineNo">1916</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1916"></a>
-<span class="sourceLineNo">1917</span> if (inclusive) {<a name="line.1917"></a>
-<span class="sourceLineNo">1918</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1918"></a>
-<span class="sourceLineNo">1919</span> }<a name="line.1919"></a>
-<span class="sourceLineNo">1920</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1920"></a>
-<span class="sourceLineNo">1921</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1921"></a>
-<span class="sourceLineNo">1922</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1922"></a>
-<span class="sourceLineNo">1923</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1923"></a>
-<span class="sourceLineNo">1924</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1924"></a>
-<span class="sourceLineNo">1925</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1925"></a>
-<span class="sourceLineNo">1926</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1926"></a>
-<span class="sourceLineNo">1927</span> }<a name="line.1927"></a>
-<span class="sourceLineNo">1928</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1928"></a>
-<span class="sourceLineNo">1929</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1929"></a>
-<span class="sourceLineNo">1930</span> }<a name="line.1930"></a>
-<span class="sourceLineNo">1931</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1931"></a>
-<span class="sourceLineNo">1932</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1932"></a>
-<span class="sourceLineNo">1933</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1933"></a>
-<span class="sourceLineNo">1934</span> }<a name="line.1934"></a>
-<span class="sourceLineNo">1935</span> final BigInteger intervalBI;<a name="line.1935"></a>
-<span class="sourceLineNo">1936</span> try {<a name="line.1936"></a>
-<span class="sourceLineNo">1937</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1937"></a>
-<span class="sourceLineNo">1938</span> } catch(Exception e) {<a name="line.1938"></a>
-<span class="sourceLineNo">1939</span> LOG.error("Exception caught during division", e);<a name="line.1939"></a>
-<span class="sourceLineNo">1940</span> return null;<a name="line.1940"></a>
-<span class="sourceLineNo">1941</span> }<a name="line.1941"></a>
-<span class="sourceLineNo">1942</span><a name="line.1942"></a>
-<span class="sourceLineNo">1943</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1943"></a>
-<span class="sourceLineNo">1944</span> private int i = -1;<a name="line.1944"></a>
+<span class="sourceLineNo">1777</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1777"></a>
+<span class="sourceLineNo">1778</span> index += arrays[i].length;<a name="line.1778"></a>
+<span class="sourceLineNo">1779</span> }<a name="line.1779"></a>
+<span class="sourceLineNo">1780</span> return result;<a name="line.1780"></a>
+<span class="sourceLineNo">1781</span> }<a name="line.1781"></a>
+<span class="sourceLineNo">1782</span><a name="line.1782"></a>
+<span class="sourceLineNo">1783</span> /**<a name="line.1783"></a>
+<span class="sourceLineNo">1784</span> * @param a array<a name="line.1784"></a>
+<span class="sourceLineNo">1785</span> * @param length amount of bytes to grab<a name="line.1785"></a>
+<span class="sourceLineNo">1786</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1786"></a>
+<span class="sourceLineNo">1787</span> */<a name="line.1787"></a>
+<span class="sourceLineNo">1788</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1788"></a>
+<span class="sourceLineNo">1789</span> if (a.length < length) {<a name="line.1789"></a>
+<span class="sourceLineNo">1790</span> return null;<a name="line.1790"></a>
+<span class="sourceLineNo">1791</span> }<a name="line.1791"></a>
+<span class="sourceLineNo">1792</span> byte [] result = new byte[length];<a name="line.1792"></a>
+<span class="sourceLineNo">1793</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1793"></a>
+<span class="sourceLineNo">1794</span> return result;<a name="line.1794"></a>
+<span class="sourceLineNo">1795</span> }<a name="line.1795"></a>
+<span class="sourceLineNo">1796</span><a name="line.1796"></a>
+<span class="sourceLineNo">1797</span> /**<a name="line.1797"></a>
+<span class="sourceLineNo">1798</span> * @param a array<a name="line.1798"></a>
+<span class="sourceLineNo">1799</span> * @param length amount of bytes to snarf<a name="line.1799"></a>
+<span class="sourceLineNo">1800</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1800"></a>
+<span class="sourceLineNo">1801</span> */<a name="line.1801"></a>
+<span class="sourceLineNo">1802</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1802"></a>
+<span class="sourceLineNo">1803</span> if (a.length < length) {<a name="line.1803"></a>
+<span class="sourceLineNo">1804</span> return null;<a name="line.1804"></a>
+<span class="sourceLineNo">1805</span> }<a name="line.1805"></a>
+<span class="sourceLineNo">1806</span> byte [] result = new byte[length];<a name="line.1806"></a>
+<span class="sourceLineNo">1807</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1807"></a>
+<span class="sourceLineNo">1808</span> return result;<a name="line.1808"></a>
+<span class="sourceLineNo">1809</span> }<a name="line.1809"></a>
+<span class="sourceLineNo">1810</span><a name="line.1810"></a>
+<span class="sourceLineNo">1811</span> /**<a name="line.1811"></a>
+<span class="sourceLineNo">1812</span> * @param a array<a name="line.1812"></a>
+<span class="sourceLineNo">1813</span> * @param length new array size<a name="line.1813"></a>
+<span class="sourceLineNo">1814</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1814"></a>
+<span class="sourceLineNo">1815</span> */<a name="line.1815"></a>
+<span class="sourceLineNo">1816</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1816"></a>
+<span class="sourceLineNo">1817</span> byte [] padding = new byte[length];<a name="line.1817"></a>
+<span class="sourceLineNo">1818</span> for (int i = 0; i < length; i++) {<a name="line.1818"></a>
+<span class="sourceLineNo">1819</span> padding[i] = 0;<a name="line.1819"></a>
+<span class="sourceLineNo">1820</span> }<a name="line.1820"></a>
+<span class="sourceLineNo">1821</span> return add(padding,a);<a name="line.1821"></a>
+<span class="sourceLineNo">1822</span> }<a name="line.1822"></a>
+<span class="sourceLineNo">1823</span><a name="line.1823"></a>
+<span class="sourceLineNo">1824</span> /**<a name="line.1824"></a>
+<span class="sourceLineNo">1825</span> * @param a array<a name="line.1825"></a>
+<span class="sourceLineNo">1826</span> * @param length new array size<a name="line.1826"></a>
+<span class="sourceLineNo">1827</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1827"></a>
+<span class="sourceLineNo">1828</span> */<a name="line.1828"></a>
+<span class="sourceLineNo">1829</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1829"></a>
+<span class="sourceLineNo">1830</span> byte [] padding = new byte[length];<a name="line.1830"></a>
+<span class="sourceLineNo">1831</span> for (int i = 0; i < length; i++) {<a name="line.1831"></a>
+<span class="sourceLineNo">1832</span> padding[i] = 0;<a name="line.1832"></a>
+<span class="sourceLineNo">1833</span> }<a name="line.1833"></a>
+<span class="sourceLineNo">1834</span> return add(a,padding);<a name="line.1834"></a>
+<span class="sourceLineNo">1835</span> }<a name="line.1835"></a>
+<span class="sourceLineNo">1836</span><a name="line.1836"></a>
+<span class="sourceLineNo">1837</span> /**<a name="line.1837"></a>
+<span class="sourceLineNo">1838</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1838"></a>
+<span class="sourceLineNo">1839</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1839"></a>
+<span class="sourceLineNo">1840</span> * @param a Beginning of range<a name="line.1840"></a>
+<span class="sourceLineNo">1841</span> * @param b End of range<a name="line.1841"></a>
+<span class="sourceLineNo">1842</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1842"></a>
+<span class="sourceLineNo">1843</span> * the range in two; i.e. one split.<a name="line.1843"></a>
+<span class="sourceLineNo">1844</span> * @return Array of dividing values<a name="line.1844"></a>
+<span class="sourceLineNo">1845</span> */<a name="line.1845"></a>
+<span class="sourceLineNo">1846</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1846"></a>
+<span class="sourceLineNo">1847</span> return split(a, b, false, num);<a name="line.1847"></a>
+<span class="sourceLineNo">1848</span> }<a name="line.1848"></a>
+<span class="sourceLineNo">1849</span><a name="line.1849"></a>
+<span class="sourceLineNo">1850</span> /**<a name="line.1850"></a>
+<span class="sourceLineNo">1851</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1851"></a>
+<span class="sourceLineNo">1852</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1852"></a>
+<span class="sourceLineNo">1853</span> * @param a Beginning of range<a name="line.1853"></a>
+<span class="sourceLineNo">1854</span> * @param b End of range<a name="line.1854"></a>
+<span class="sourceLineNo">1855</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1855"></a>
+<span class="sourceLineNo">1856</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1856"></a>
+<span class="sourceLineNo">1857</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1857"></a>
+<span class="sourceLineNo">1858</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1858"></a>
+<span class="sourceLineNo">1859</span> * the range in two; i.e. one split.<a name="line.1859"></a>
+<span class="sourceLineNo">1860</span> * @return Array of dividing values<a name="line.1860"></a>
+<span class="sourceLineNo">1861</span> */<a name="line.1861"></a>
+<span class="sourceLineNo">1862</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1862"></a>
+<span class="sourceLineNo">1863</span> boolean inclusive, final int num) {<a name="line.1863"></a>
+<span class="sourceLineNo">1864</span> byte[][] ret = new byte[num + 2][];<a name="line.1864"></a>
+<span class="sourceLineNo">1865</span> int i = 0;<a name="line.1865"></a>
+<span class="sourceLineNo">1866</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1866"></a>
+<span class="sourceLineNo">1867</span> if (iter == null)<a name="line.1867"></a>
+<span class="sourceLineNo">1868</span> return null;<a name="line.1868"></a>
+<span class="sourceLineNo">1869</span> for (byte[] elem : iter) {<a name="line.1869"></a>
+<span class="sourceLineNo">1870</span> ret[i++] = elem;<a name="line.1870"></a>
+<span class="sourceLineNo">1871</span> }<a name="line.1871"></a>
+<span class="sourceLineNo">1872</span> return ret;<a name="line.1872"></a>
+<span class="sourceLineNo">1873</span> }<a name="line.1873"></a>
+<span class="sourceLineNo">1874</span><a name="line.1874"></a>
+<span class="sourceLineNo">1875</span> /**<a name="line.1875"></a>
+<span class="sourceLineNo">1876</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1876"></a>
+<span class="sourceLineNo">1877</span> */<a name="line.1877"></a>
+<span class="sourceLineNo">1878</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1878"></a>
+<span class="sourceLineNo">1879</span> final byte[] b, final int num)<a name="line.1879"></a>
+<span class="sourceLineNo">1880</span> {<a name="line.1880"></a>
+<span class="sourceLineNo">1881</span> return iterateOnSplits(a, b, false, num);<a name="line.1881"></a>
+<span class="sourceLineNo">1882</span> }<a name="line.1882"></a>
+<span class="sourceLineNo">1883</span><a name="line.1883"></a>
+<span class="sourceLineNo">1884</span> /**<a name="line.1884"></a>
+<span class="sourceLineNo">1885</span> * Iterate over keys within the passed range.<a name="line.1885"></a>
+<span class="sourceLineNo">1886</span> */<a name="line.1886"></a>
+<span class="sourceLineNo">1887</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1887"></a>
+<span class="sourceLineNo">1888</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1888"></a>
+<span class="sourceLineNo">1889</span> {<a name="line.1889"></a>
+<span class="sourceLineNo">1890</span> byte [] aPadded;<a name="line.1890"></a>
+<span class="sourceLineNo">1891</span> byte [] bPadded;<a name="line.1891"></a>
+<span class="sourceLineNo">1892</span> if (a.length < b.length) {<a name="line.1892"></a>
+<span class="sourceLineNo">1893</span> aPadded = padTail(a, b.length - a.length);<a name="line.1893"></a>
+<span class="sourceLineNo">1894</span> bPadded = b;<a name="line.1894"></a>
+<span class="sourceLineNo">1895</span> } else if (b.length < a.length) {<a name="line.1895"></a>
+<span class="sourceLineNo">1896</span> aPadded = a;<a name="line.1896"></a>
+<span class="sourceLineNo">1897</span> bPadded = padTail(b, a.length - b.length);<a name="line.1897"></a>
+<span class="sourceLineNo">1898</span> } else {<a name="line.1898"></a>
+<span class="sourceLineNo">1899</span> aPadded = a;<a name="line.1899"></a>
+<span class="sourceLineNo">1900</span> bPadded = b;<a name="line.1900"></a>
+<span class="sourceLineNo">1901</span> }<a name="line.1901"></a>
+<span class="sourceLineNo">1902</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1902"></a>
+<span class="sourceLineNo">1903</span> throw new IllegalArgumentException("b <= a");<a name="line.1903"></a>
+<span class="sourceLineNo">1904</span> }<a name="line.1904"></a>
+<span class="sourceLineNo">1905</span> if (num <= 0) {<a name="line.1905"></a>
+<span class="sourceLineNo">1906</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1906"></a>
+<span class="sourceLineNo">1907</span> }<a name="line.1907"></a>
+<span class="sourceLineNo">1908</span> byte [] prependHeader = {1, 0};<a name="line.1908"></a>
+<span class="sourceLineNo">1909</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1909"></a>
+<span class="sourceLineNo">1910</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1910"></a>
+<span class="sourceLineNo">1911</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1911"></a>
+<span class="sourceLineNo">1912</span> if (inclusive) {<a name="line.1912"></a>
+<span class="sourceLineNo">1913</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1913"></a>
+<span class="sourceLineNo">1914</span> }<a name="line.1914"></a>
+<span class="sourceLineNo">1915</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1915"></a>
+<span class="sourceLineNo">1916</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1916"></a>
+<span class="sourceLineNo">1917</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1917"></a>
+<span class="sourceLineNo">1918</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1918"></a>
+<span class="sourceLineNo">1919</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1919"></a>
+<span class="sourceLineNo">1920</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1920"></a>
+<span class="sourceLineNo">1921</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1921"></a>
+<span class="sourceLineNo">1922</span> }<a name="line.1922"></a>
+<span class="sourceLineNo">1923</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1923"></a>
+<span class="sourceLineNo">1924</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1924"></a>
+<span class="sourceLineNo">1925</span> }<a name="line.1925"></a>
+<span class="sourceLineNo">1926</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1926"></a>
+<span class="sourceLineNo">1927</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1927"></a>
+<span class="sourceLineNo">1928</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1928"></a>
+<span class="sourceLineNo">1929</span> }<a name="line.1929"></a>
+<span class="sourceLineNo">1930</span> final BigInteger intervalBI;<a name="line.1930"></a>
+<span class="sourceLineNo">1931</span> try {<a name="line.1931"></a>
+<span class="sourceLineNo">1932</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1932"></a>
+<span class="sourceLineNo">1933</span> } catch(Exception e) {<a name="line.1933"></a>
+<span class="sourceLineNo">1934</span> LOG.error("Exception caught during division", e);<a name="line.1934"></a>
+<span class="sourceLineNo">1935</span> return null;<a name="line.1935"></a>
+<span class="sourceLineNo">1936</span> }<a name="line.1936"></a>
+<span class="sourceLineNo">1937</span><a name="line.1937"></a>
+<span class="sourceLineNo">1938</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1938"></a>
+<span class="sourceLineNo">1939</span> private int i = -1;<a name="line.1939"></a>
+<span class="sourceLineNo">1940</span><a name="line.1940"></a>
+<span class="sourceLineNo">1941</span> @Override<a name="line.1941"></a>
+<span class="sourceLineNo">1942</span> public boolean hasNext() {<a name="line.1942"></a>
+<span class="sourceLineNo">1943</span> return i < num+1;<a name="line.1943"></a>
+<span class="sourceLineNo">1944</span> }<a name="line.1944"></a>
<span class="sourceLineNo">1945</span><a name="line.1945"></a>
<span class="sourceLineNo">1946</span> @Override<a name="line.1946"></a>
-<span class="sourceLineNo">1947</span> public boolean hasNext() {<a name="line.1947"></a>
-<span class="sourceLineNo">1948</span> return i < num+1;<a name="line.1948"></a>
-<span class="sourceLineNo">1949</span> }<a name="line.1949"></a>
-<span class="sourceLineNo">1950</span><a name="line.1950"></a>
-<span class="sourceLineNo">1951</span> @Override<a name="line.1951"></a>
-<span class="sourceLineNo">1952</span> public byte[] next() {<a name="line.1952"></a>
-<span class="sourceLineNo">1953</span> i++;<a name="line.1953"></a>
-<span class="sourceLineNo">1954</span> if (i == 0) return a;<a name="line.1954"></a>
-<span class="sourceLineNo">1955</span> if (i == num + 1) return b;<a name="line.1955"></a>
-<span class="sourceLineNo">1956</span><a name="line.1956"></a>
-<span class="sourceLineNo">1957</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1957"></a>
-<span class="sourceLineNo">1958</span> byte [] padded = curBI.toByteArray();<a name="line.1958"></a>
-<span class="sourceLineNo">1959</span> if (padded[1] == 0)<a name="line.1959"></a>
-<span class="sourceLineNo">1960</span> padded = tail(padded, padded.length - 2);<a name="line.1960"></a>
-<span class="sourceLineNo">1961</span> else<a name="line.1961"></a>
-<span class="sourceLineNo">1962</span> padded = tail(padded, padded.length - 1);<a name="line.1962"></a>
-<span class="sourceLineNo">1963</span> return padded;<a name="line.1963"></a>
+<span class="sourceLineNo">1947</span> public byte[] next() {<a name="line.1947"></a>
+<span class="sourceLineNo">1948</span> i++;<a name="line.1948"></a>
+<span class="sourceLineNo">1949</span> if (i == 0) return a;<a name="line.1949"></a>
+<span class="sourceLineNo">1950</span> if (i == num + 1) return b;<a name="line.1950"></a>
+<span class="sourceLineNo">1951</span><a name="line.1951"></a>
+<span class="sourceLineNo">1952</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1952"></a>
+<span class="sourceLineNo">1953</span> byte [] padded = curBI.toByteArray();<a name="line.1953"></a>
+<span class="sourceLineNo">1954</span> if (padded[1] == 0)<a name="line.1954"></a>
+<span class="sourceLineNo">1955</span> padded = tail(padded, padded.length - 2);<a name="line.1955"></a>
+<span class="sourceLineNo">1956</span> else<a name="line.1956"></a>
+<span class="sourceLineNo">1957</span> padded = tail(padded, padded.length - 1);<a name="line.1957"></a>
+<span class="sourceLineNo">1958</span> return padded;<a name="line.1958"></a>
+<span class="sourceLineNo">1959</span> }<a name="line.1959"></a>
+<span class="sourceLineNo">1960</span><a name="line.1960"></a>
+<span class="sourceLineNo">1961</span> @Override<a name="line.1961"></a>
+<span class="sourceLineNo">1962</span> public void remove() {<a name="line.1962"></a>
+<span class="sourceLineNo">1963</span> throw new UnsupportedOperationException();<a name="line.1963"></a>
<span class="sourceLineNo">1964</span> }<a name="line.1964"></a>
<span class="sourceLineNo">1965</span><a name="line.1965"></a>
-<span class="sourceLineNo">1966</span> @Override<a name="line.1966"></a>
-<span class="sourceLineNo">1967</span> public void remove() {<a name="line.1967"></a>
-<span class="sourceLineNo">1968</span> throw new UnsupportedOperationException();<a name="line.1968"></a>
-<span class="sourceLineNo">1969</span> }<a name="line.1969"></a>
-<span class="sourceLineNo">1970</span><a name="line.1970"></a>
-<span class="sourceLineNo">1971</span> };<a name="line.1971"></a>
-<span class="sourceLineNo">1972</span><a name="line.1972"></a>
-<span class="sourceLineNo">1973</span> return new Iterable<byte[]>() {<a name="line.1973"></a>
-<span class="sourceLineNo">1974</span> @Override<a name="line.1974"></a>
-<span class="sourceLineNo">1975</span> public Iterator<byte[]> iterator() {<a name="line.1975"></a>
-<span class="sourceLineNo">1976</span> return iterator;<a name="line.1976"></a>
-<span class="sourceLineNo">1977</span> }<a name="line.1977"></a>
-<span class="sourceLineNo">1978</span> };<a name="line.1978"></a>
-<span class="sourceLineNo">1979</span> }<a name="line.1979"></a>
-<span class="sourceLineNo">1980</span><a name="line.1980"></a>
-<span class="sourceLineNo">1981</span> /**<a name="line.1981"></a>
-<span class="sourceLineNo">1982</span> * @param bytes array to hash<a name="line.1982"></a>
-<span class="sourceLineNo">1983</span> * @param offset offset to start from<a name="line.1983"></a>
-<span class="sourceLineNo">1984</span> * @param length length to hash<a name="line.1984"></a>
-<span class="sourceLineNo">1985</span> * */<a name="line.1985"></a>
-<span class="sourceLineNo">1986</span> public static int hashCode(byte[] bytes, int offset, int length) {<a name="line.1986"></a>
-<span class="sourceLineNo">1987</span> int hash = 1;<a name="line.1987"></a>
-<span class="sourceLineNo">1988</span> for (int i = offset; i < offset + length; i++)<a name="line.1988"></a>
-<span class="sourceLineNo">1989</span> hash = (31 * hash) + (int) bytes[i];<a name="line.1989"></a>
-<span class="sourceLineNo">1990</span> return hash;<a name="line.1990"></a>
-<span class="sourceLineNo">1991</span> }<a name="line.1991"></a>
-<span class="sourceLineNo">1992</span><a name="line.1992"></a>
-<span class="sourceLineNo">1993</span> /**<a name="line.1993"></a>
-<span class="sourceLineNo">1994</span> * @param t operands<a name="line.1994"></a>
-<span class="sourceLineNo">1995</span> * @return Array of byte arrays made from passed array of Text<a name="line.1995"></a>
-<span class="sourceLineNo">1996</span> */<a name="line.1996"></a>
-<span class="sourceLineNo">1997</span> public static byte [][] toByteArrays(final String [] t) {<a name="line.1997"></a>
-<span class="sourceLineNo">1998</span> byte [][] result = new byte[t.length][];<a name="line.1998"></a>
-<span class="sourceLineNo">1999</span> for (int i = 0; i < t.length; i++) {<a name="line.1999"></a>
-<span class="sourceLineNo">2000</span> result[i] = Bytes.toBytes(t[i]);<a name="line.2000"></a>
-<span class="sourceLineNo">2001</span> }<a name="line.2001"></a>
-<span class="sourceLineNo">2002</span> return result;<a name="line.2002"></a>
-<span class="sourceLineNo">2003</span> }<a name="line.2003"></a>
-<span class="sourceLineNo">2004</span><a name="line.2004"></a>
-<span class="sourceLineNo">2005</span> /**<a name="line.2005"></a>
-<span class="sourceLineNo">2006</span> * @param t operands<a name="line.2006"></a>
-<span class="sourceLineNo">2007</span> * @return Array of binary byte arrays made from passed array of binary strings<a name="line.2007"></a>
-<span class="sourceLineNo">2008</span> */<a name="line.2008"></a>
-<span class="sourceLineNo">2009</span> public static byte[][] toBinaryByteArrays(final String[] t) {<a name="line.2009"></a>
-<span class="sourceLineNo">2010</span> byte[][] result = new byte[t.length][];<a name="line.2010"></a>
-<span class="sourceLineNo">2011</span> for (int i = 0; i < t.length; i++) {<a name="line.2011"></a>
-<span class="sourceLineNo">2012</span> result[i] = Bytes.toBytesBinary(t[i]);<a name="line.2012"></a>
-<span class="sourceLineNo">2013</span> }<a name="line.2013"></a>
-<span class="sourceLineNo">2014</span> return result;<a name="line.2014"></a>
-<span class="sourceLineNo">2015</span> }<a name="line.2015"></a>
-<span class="sourceLineNo">2016</span><a name="line.2016"></a>
-<span class="sourceLineNo">2017</span> /**<a name="line.2017"></a>
-<span class="sourceLineNo">2018</span> * @param column operand<a name="line.2018"></a>
-<span class="sourceLineNo">2019</span> * @return A byte array of a byte array where first and only entry is<a name="line.2019"></a>
-<span class="sourceLineNo">2020</span> * <code>column</code><a name="line.2020"></a>
-<span class="sourceLineNo">2021</span> */<a name="line.2021"></a>
-<span class="sourceLineNo">2022</span> public static byte [][] toByteArrays(final String column) {<a name="line.2022"></a>
-<span class="sourceLineNo">2023</span> return toByteArrays(toBytes(column));<a name="line.2023"></a>
-<span class="sourceLineNo">2024</span> }<a name="line.2024"></a>
-<span class="sourceLineNo">2025</span><a name="line.2025"></a>
-<span class="sourceLineNo">2026</span> /**<a name="line.2026"></a>
-<span class="sourceLineNo">2027</span> * @param column operand<a name="line.2027"></a>
-<span class="sourceLineNo">2028</span> * @return A byte array of a byte array where first and only entry is<a name="line.2028"></a>
-<span class="sourceLineNo">2029</span> * <code>column</code><a name="line.2029"></a>
-<span class="sourceLineNo">2030</span> */<a name="line.2030"></a>
-<span class="sourceLineNo">2031</span> public static byte [][] toByteArrays(final byte [] column) {<a name="line.2031"></a>
-<span class="sourceLineNo">2032</span> byte [][] result = new byte[1][];<a name="line.2032"></a>
-<span class="sourceLineNo">2033</span> result[0] = column;<a name="line.2033"></a>
-<span class="sourceLineNo">2034</span> return result;<a name="line.2034"></a>
-<span class="sourceLineNo">2035</span> }<a name="line.2035"></a>
-<span class="sourceLineNo">2036</span><a name="line.2036"></a>
-<span class="sourceLineNo">2037</span> /**<a name="line.2037"></a>
-<span class="sourceLineNo">2038</span> * Binary search for keys in indexes.<a name="line.2038"></a>
-<span class="sourceLineNo">2039</span> *<a name="line.2039"></a>
-<span class="sourceLineNo">2040</span> * @param arr array of byte arrays to search for<a name="line.2040"></a>
-<span class="sourceLineNo">2041</span> * @param key the key you want to find<a name="line.2041"></a>
-<span class="sourceLineNo">2042</span> * @param offset the offset in the key you want to find<a name="line.2042"></a>
-<span class="sourceLineNo">2043</span> * @param length the length of the key<a name="line.2043"></a>
-<span class="sourceLineNo">2044</span> * @param comparator a comparator to compare.<a name="line.2044"></a>
-<span class="sourceLineNo">2045</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2045"></a>
-<span class="sourceLineNo">2046</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2046"></a>
-<span class="sourceLineNo">2047</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2047"></a>
-<span class="sourceLineNo">2048</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2048"></a>
-<span class="sourceLineNo">2049</span> * means that this function can return 2N + 1 different values<a name="line.2049"></a>
-<span class="sourceLineNo">2050</span> * ranging from -(N + 1) to N - 1.<a name="line.2050"></a>
-<span class="sourceLineNo">2051</span> * @deprecated {@link Bytes#binarySearch(byte[][], byte[], int, int)}<a name="line.2051"></a>
-<span class="sourceLineNo">2052</span> */<a name="line.2052"></a>
-<span class="sourceLineNo">2053</span> @Deprecated<a name="line.2053"></a>
-<span class="sourceLineNo">2054</span> public static int binarySearch(byte [][]arr, byte []key, int offset,<a name="line.2054"></a>
-<span class="sourceLineNo">2055</span> int length, RawComparator<?> comparator) {<a name="line.2055"></a>
-<span class="sourceLineNo">2056</span> return binarySearch(arr, key, offset, length);<a name="line.2056"></a>
-<span class="sourceLineNo">2057</span> }<a name="line.2057"></a>
-<span class="sourceLineNo">2058</span><a name="line.2058"></a>
-<span class="sourceLineNo">2059</span> /**<a name="line.2059"></a>
-<span class="sourceLineNo">2060</span> * Binary search for keys in indexes using Bytes.BYTES_RAWCOMPARATOR.<a name="line.2060"></a>
-<span class="sourceLineNo">2061</span> *<a name="line.2061"></a>
-<span class="sourceLineNo">2062</span> * @param arr array of byte arrays to search for<a name="line.2062"></a>
-<span class="sourceLineNo">2063</span> * @param key the key you want to find<a name="line.2063"></a>
-<span class="sourceLineNo">2064</span> * @param offset the offset in the key you want to find<a name="line.2064"></a>
-<span class="sourceLineNo">2065</span> * @param length the length of the key<a name="line.2065"></a>
-<span class="sourceLineNo">2066</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2066"></a>
-<span class="sourceLineNo">2067</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2067"></a>
-<span class="sourceLineNo">2068</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2068"></a>
-<span class="sourceLineNo">2069</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2069"></a>
-<span class="sourceLineNo">2070</span> * means that this function can return 2N + 1 different values<a name="line.2070"></a>
-<span class="sourceLineNo">2071</span> * ranging from -(N + 1) to N - 1.<a name="line.2071"></a>
-<span class="sourceLineNo">2072</span> */<a name="line.2072"></a>
-<span class="sourceLineNo">2073</span> public static int binarySearch(byte[][] arr, byte[] key, int offset, int length) {<a name="line.2073"></a>
-<span class="sourceLineNo">2074</span> int low = 0;<a name="line.2074"></a>
-<span class="sourceLineNo">2075</span> int high = arr.length - 1;<a name="line.2075"></a>
-<span class="sourceLineNo">2076</span><a name="line.2076"></a>
-<span class="sourceLineNo">2077</span> while (low <= high) {<a name="line.2077"></a>
-<span class="sourceLineNo">2078</span> int mid = (low + high) >>> 1;<a name="line.2078"></a>
-<span class="sourceLineNo">2079</span> // we have to compare in this order, because the comparator order<a name="line.2079"></a>
-<span class="sourceLineNo">2080</span> // has special logic when the 'left side' is a special key.<a name="line.2080"></a>
-<span class="sourceLineNo">2081</span> int cmp = Bytes.BYTES_RAWCOMPARATOR<a name="line.2081"></a>
-<span class="sourceLineNo">2082</span> .compare(key, offset, length, arr[mid], 0, arr[mid].length);<a name="line.2082"></a>
-<span class="sourceLineNo">2083</span> // key lives above the midpoint<a name="line.2083"></a>
-<span class="sourceLineNo">2084</span> if (cmp > 0)<a name="line.2084"></a>
-<span class="sourceLineNo">2085</span> low = mid + 1;<a name="line.2085"></a>
-<span class="sourceLineNo">2086</span> // key lives below the midpoint<a name="line.2086"></a>
-<span class="sourceLineNo">2087</span> else if (cmp < 0)<a name="line.2087"></a>
-<span class="sourceLineNo">2088</span> high = mid - 1;<a name="line.2088"></a>
-<span class="sourceLineNo">2089</span> // BAM. how often does this really happen?<a name="line.2089"></a>
-<span class="sourceLineNo">2090</span> else<a name="line.2090"></a>
-<span class="sourceLineNo">2091</span> return mid;<a name="line.2091"></a>
-<span class="sourceLineNo">2092</span> }<a name="line.2092"></a>
-<span class="sourceLineNo">2093</span> return -(low + 1);<a name="line.2093"></a>
-<span class="sourceLineNo">2094</span> }<a name="line.2094"></a>
-<span class="sourceLineNo">2095</span><a name="line.2095"></a>
-<span class="sourceLineNo">2096</span> /**<a name="line.2096"></a>
-<span class="sourceLineNo">2097</span> * Binary search for keys in indexes.<a name="line.2097"></a>
-<span class="sourceLineNo">2098</span> *<a name="line.2098"></a>
-<span class="sourceLineNo">2099</span> * @param arr array of byte arrays to search for<a name="line.2099"></a>
-<span class="sourceLineNo">2100</span> * @param key the key you want to find<a name="line.2100"></a>
-<span class="sourceLineNo">2101</span> * @param comparator a comparator to compare.<a name="line.2101"></a>
-<span class="sourceLineNo">2102</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2102"></a>
-<span class="sourceLineNo">2103</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2103"></a>
-<span class="sourceLineNo">2104</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2104"></a>
-<span class="sourceLineNo">2105</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2105"></a>
-<span class="sourceLineNo">2106</span> * means that this function can return 2N + 1 different values<a name="line.2106"></a>
-<span class="sourceLineNo">2107</span> * ranging from -(N + 1) to N - 1.<a name="line.2107"></a>
-<span class="sourceLineNo">2108</span> * @return the index of the block<a name="line.2108"></a>
-<span class="sourceLineNo">2109</span> * @deprecated Use {@link Bytes#binarySearch(Cell[], Cell, CellComparator)}<a name="line.2109"></a>
-<span class="sourceLineNo">2110</span> */<a name="line.2110"></a>
-<span class="sourceLineNo">2111</span> @Deprecated<a name="line.2111"></a>
-<span class="sourceLineNo">2112</span> public static int binarySearch(byte[][] arr, Cell key, RawComparator<Cell> comparator) {<a name="line.2112"></a>
-<span class="sourceLineNo">2113</span> int low = 0;<a name="line.2113"></a>
-<span class="sourceLineNo">2114</span> int high = arr.length - 1;<a name="line.2114"></a>
-<span class="sourceLineNo">2115</span> KeyValue.KeyOnlyKeyValue r = new KeyValue.KeyOnlyKeyValue();<a name="line.2115"></a>
-<span class="sourceLineNo">2116</span> while (low <= high) {<a name="line.2116"></a>
-<span class="sourceLineNo">2117</span> int mid = (l
<TRUNCATED>
[03/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.RowEndKeyComparator.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.RowEndKeyComparator.html b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.RowEndKeyComparator.html
index 3c7d6b4..3dea877 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.RowEndKeyComparator.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.RowEndKeyComparator.html
@@ -1583,1089 +1583,1084 @@
<span class="sourceLineNo">1575</span> length1 == length2) {<a name="line.1575"></a>
<span class="sourceLineNo">1576</span> return 0;<a name="line.1576"></a>
<span class="sourceLineNo">1577</span> }<a name="line.1577"></a>
-<span class="sourceLineNo">1578</span> final int minLength = Math.min(length1, length2);<a name="line.1578"></a>
-<span class="sourceLineNo">1579</span> final int minWords = minLength / SIZEOF_LONG;<a name="line.1579"></a>
-<span class="sourceLineNo">1580</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1580"></a>
-<span class="sourceLineNo">1581</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
-<span class="sourceLineNo">1582</span><a name="line.1582"></a>
-<span class="sourceLineNo">1583</span> /*<a name="line.1583"></a>
-<span class="sourceLineNo">1584</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a<a name="line.1584"></a>
-<span class="sourceLineNo">1585</span> * time is no slower than comparing 4 bytes at a time even on 32-bit.<a name="line.1585"></a>
-<span class="sourceLineNo">1586</span> * On the other hand, it is substantially faster on 64-bit.<a name="line.1586"></a>
-<span class="sourceLineNo">1587</span> */<a name="line.1587"></a>
-<span class="sourceLineNo">1588</span> // This is the end offset of long parts.<a name="line.1588"></a>
-<span class="sourceLineNo">1589</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.1589"></a>
-<span class="sourceLineNo">1590</span> for (int i = 0; i < j; i += SIZEOF_LONG) {<a name="line.1590"></a>
-<span class="sourceLineNo">1591</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1591"></a>
-<span class="sourceLineNo">1592</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1592"></a>
-<span class="sourceLineNo">1593</span> long diff = lw ^ rw;<a name="line.1593"></a>
-<span class="sourceLineNo">1594</span> if (diff != 0) {<a name="line.1594"></a>
-<span class="sourceLineNo">1595</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.1595"></a>
-<span class="sourceLineNo">1596</span> }<a name="line.1596"></a>
-<span class="sourceLineNo">1597</span> }<a name="line.1597"></a>
-<span class="sourceLineNo">1598</span> int offset = j;<a name="line.1598"></a>
-<span class="sourceLineNo">1599</span><a name="line.1599"></a>
-<span class="sourceLineNo">1600</span> if (minLength - offset >= SIZEOF_INT) {<a name="line.1600"></a>
-<span class="sourceLineNo">1601</span> int il = theUnsafe.getInt(buffer1, offset1Adj + offset);<a name="line.1601"></a>
-<span class="sourceLineNo">1602</span> int ir = theUnsafe.getInt(buffer2, offset2Adj + offset);<a name="line.1602"></a>
-<span class="sourceLineNo">1603</span> if (il != ir) {<a name="line.1603"></a>
-<span class="sourceLineNo">1604</span> return lessThanUnsignedInt(il, ir) ? -1: 1;<a name="line.1604"></a>
-<span class="sourceLineNo">1605</span> }<a name="line.1605"></a>
-<span class="sourceLineNo">1606</span> offset += SIZEOF_INT;<a name="line.1606"></a>
-<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
-<span class="sourceLineNo">1608</span> if (minLength - offset >= SIZEOF_SHORT) {<a name="line.1608"></a>
-<span class="sourceLineNo">1609</span> short sl = theUnsafe.getShort(buffer1, offset1Adj + offset);<a name="line.1609"></a>
-<span class="sourceLineNo">1610</span> short sr = theUnsafe.getShort(buffer2, offset2Adj + offset);<a name="line.1610"></a>
-<span class="sourceLineNo">1611</span> if (sl != sr) {<a name="line.1611"></a>
-<span class="sourceLineNo">1612</span> return lessThanUnsignedShort(sl, sr) ? -1: 1;<a name="line.1612"></a>
-<span class="sourceLineNo">1613</span> }<a name="line.1613"></a>
-<span class="sourceLineNo">1614</span> offset += SIZEOF_SHORT;<a name="line.1614"></a>
-<span class="sourceLineNo">1615</span> }<a name="line.1615"></a>
-<span class="sourceLineNo">1616</span> if (minLength - offset == 1) {<a name="line.1616"></a>
-<span class="sourceLineNo">1617</span> int a = (buffer1[(int)(offset1 + offset)] & 0xff);<a name="line.1617"></a>
-<span class="sourceLineNo">1618</span> int b = (buffer2[(int)(offset2 + offset)] & 0xff);<a name="line.1618"></a>
-<span class="sourceLineNo">1619</span> if (a != b) {<a name="line.1619"></a>
-<span class="sourceLineNo">1620</span> return a - b;<a name="line.1620"></a>
-<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
-<span class="sourceLineNo">1622</span> }<a name="line.1622"></a>
-<span class="sourceLineNo">1623</span> return length1 - length2;<a name="line.1623"></a>
-<span class="sourceLineNo">1624</span> }<a name="line.1624"></a>
-<span class="sourceLineNo">1625</span> }<a name="line.1625"></a>
-<span class="sourceLineNo">1626</span> }<a name="line.1626"></a>
-<span class="sourceLineNo">1627</span><a name="line.1627"></a>
-<span class="sourceLineNo">1628</span> /**<a name="line.1628"></a>
-<span class="sourceLineNo">1629</span> * @param left left operand<a name="line.1629"></a>
-<span class="sourceLineNo">1630</span> * @param right right operand<a name="line.1630"></a>
-<span class="sourceLineNo">1631</span> * @return True if equal<a name="line.1631"></a>
-<span class="sourceLineNo">1632</span> */<a name="line.1632"></a>
-<span class="sourceLineNo">1633</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1633"></a>
-<span class="sourceLineNo">1634</span> // Could use Arrays.equals?<a name="line.1634"></a>
-<span class="sourceLineNo">1635</span> //noinspection SimplifiableConditionalExpression<a name="line.1635"></a>
-<span class="sourceLineNo">1636</span> if (left == right) return true;<a name="line.1636"></a>
-<span class="sourceLineNo">1637</span> if (left == null || right == null) return false;<a name="line.1637"></a>
-<span class="sourceLineNo">1638</span> if (left.length != right.length) return false;<a name="line.1638"></a>
-<span class="sourceLineNo">1639</span> if (left.length == 0) return true;<a name="line.1639"></a>
+<span class="sourceLineNo">1578</span> final int stride = 8;<a name="line.1578"></a>
+<span class="sourceLineNo">1579</span> final int minLength = Math.min(length1, length2);<a name="line.1579"></a>
+<span class="sourceLineNo">1580</span> int strideLimit = minLength & ~(stride - 1);<a name="line.1580"></a>
+<span class="sourceLineNo">1581</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
+<span class="sourceLineNo">1582</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1582"></a>
+<span class="sourceLineNo">1583</span> int i;<a name="line.1583"></a>
+<span class="sourceLineNo">1584</span><a name="line.1584"></a>
+<span class="sourceLineNo">1585</span> /*<a name="line.1585"></a>
+<span class="sourceLineNo">1586</span> * Compare 8 bytes at a time. Benchmarking on x86 shows a stride of 8 bytes is no slower<a name="line.1586"></a>
+<span class="sourceLineNo">1587</span> * than 4 bytes even on 32-bit. On the other hand, it is substantially faster on 64-bit.<a name="line.1587"></a>
+<span class="sourceLineNo">1588</span> */<a name="line.1588"></a>
+<span class="sourceLineNo">1589</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.1589"></a>
+<span class="sourceLineNo">1590</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1590"></a>
+<span class="sourceLineNo">1591</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1591"></a>
+<span class="sourceLineNo">1592</span> if (lw != rw) {<a name="line.1592"></a>
+<span class="sourceLineNo">1593</span> if(!UnsafeAccess.littleEndian) {<a name="line.1593"></a>
+<span class="sourceLineNo">1594</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.1594"></a>
+<span class="sourceLineNo">1595</span> }<a name="line.1595"></a>
+<span class="sourceLineNo">1596</span><a name="line.1596"></a>
+<span class="sourceLineNo">1597</span> /*<a name="line.1597"></a>
+<span class="sourceLineNo">1598</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.1598"></a>
+<span class="sourceLineNo">1599</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.1599"></a>
+<span class="sourceLineNo">1600</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.1600"></a>
+<span class="sourceLineNo">1601</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.1601"></a>
+<span class="sourceLineNo">1602</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.1602"></a>
+<span class="sourceLineNo">1603</span> * comparator from guava v21<a name="line.1603"></a>
+<span class="sourceLineNo">1604</span> */<a name="line.1604"></a>
+<span class="sourceLineNo">1605</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.1605"></a>
+<span class="sourceLineNo">1606</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.1606"></a>
+<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
+<span class="sourceLineNo">1608</span> }<a name="line.1608"></a>
+<span class="sourceLineNo">1609</span><a name="line.1609"></a>
+<span class="sourceLineNo">1610</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.1610"></a>
+<span class="sourceLineNo">1611</span> for (; i < minLength; i++) {<a name="line.1611"></a>
+<span class="sourceLineNo">1612</span> int a = (buffer1[offset1 + i] & 0xFF);<a name="line.1612"></a>
+<span class="sourceLineNo">1613</span> int b = (buffer2[offset2 + i] & 0xFF);<a name="line.1613"></a>
+<span class="sourceLineNo">1614</span> if (a != b) {<a name="line.1614"></a>
+<span class="sourceLineNo">1615</span> return a - b;<a name="line.1615"></a>
+<span class="sourceLineNo">1616</span> }<a name="line.1616"></a>
+<span class="sourceLineNo">1617</span> }<a name="line.1617"></a>
+<span class="sourceLineNo">1618</span> return length1 - length2;<a name="line.1618"></a>
+<span class="sourceLineNo">1619</span> }<a name="line.1619"></a>
+<span class="sourceLineNo">1620</span> }<a name="line.1620"></a>
+<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
+<span class="sourceLineNo">1622</span><a name="line.1622"></a>
+<span class="sourceLineNo">1623</span> /**<a name="line.1623"></a>
+<span class="sourceLineNo">1624</span> * @param left left operand<a name="line.1624"></a>
+<span class="sourceLineNo">1625</span> * @param right right operand<a name="line.1625"></a>
+<span class="sourceLineNo">1626</span> * @return True if equal<a name="line.1626"></a>
+<span class="sourceLineNo">1627</span> */<a name="line.1627"></a>
+<span class="sourceLineNo">1628</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1628"></a>
+<span class="sourceLineNo">1629</span> // Could use Arrays.equals?<a name="line.1629"></a>
+<span class="sourceLineNo">1630</span> //noinspection SimplifiableConditionalExpression<a name="line.1630"></a>
+<span class="sourceLineNo">1631</span> if (left == right) return true;<a name="line.1631"></a>
+<span class="sourceLineNo">1632</span> if (left == null || right == null) return false;<a name="line.1632"></a>
+<span class="sourceLineNo">1633</span> if (left.length != right.length) return false;<a name="line.1633"></a>
+<span class="sourceLineNo">1634</span> if (left.length == 0) return true;<a name="line.1634"></a>
+<span class="sourceLineNo">1635</span><a name="line.1635"></a>
+<span class="sourceLineNo">1636</span> // Since we're often comparing adjacent sorted data,<a name="line.1636"></a>
+<span class="sourceLineNo">1637</span> // it's usual to have equal arrays except for the very last byte<a name="line.1637"></a>
+<span class="sourceLineNo">1638</span> // so check that first<a name="line.1638"></a>
+<span class="sourceLineNo">1639</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1639"></a>
<span class="sourceLineNo">1640</span><a name="line.1640"></a>
-<span class="sourceLineNo">1641</span> // Since we're often comparing adjacent sorted data,<a name="line.1641"></a>
-<span class="sourceLineNo">1642</span> // it's usual to have equal arrays except for the very last byte<a name="line.1642"></a>
-<span class="sourceLineNo">1643</span> // so check that first<a name="line.1643"></a>
-<span class="sourceLineNo">1644</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1644"></a>
-<span class="sourceLineNo">1645</span><a name="line.1645"></a>
-<span class="sourceLineNo">1646</span> return compareTo(left, right) == 0;<a name="line.1646"></a>
-<span class="sourceLineNo">1647</span> }<a name="line.1647"></a>
-<span class="sourceLineNo">1648</span><a name="line.1648"></a>
-<span class="sourceLineNo">1649</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1649"></a>
-<span class="sourceLineNo">1650</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1650"></a>
-<span class="sourceLineNo">1651</span> // short circuit case<a name="line.1651"></a>
-<span class="sourceLineNo">1652</span> if (left == right &&<a name="line.1652"></a>
-<span class="sourceLineNo">1653</span> leftOffset == rightOffset &&<a name="line.1653"></a>
-<span class="sourceLineNo">1654</span> leftLen == rightLen) {<a name="line.1654"></a>
-<span class="sourceLineNo">1655</span> return true;<a name="line.1655"></a>
-<span class="sourceLineNo">1656</span> }<a name="line.1656"></a>
-<span class="sourceLineNo">1657</span> // different lengths fast check<a name="line.1657"></a>
-<span class="sourceLineNo">1658</span> if (leftLen != rightLen) {<a name="line.1658"></a>
-<span class="sourceLineNo">1659</span> return false;<a name="line.1659"></a>
-<span class="sourceLineNo">1660</span> }<a name="line.1660"></a>
-<span class="sourceLineNo">1661</span> if (leftLen == 0) {<a name="line.1661"></a>
-<span class="sourceLineNo">1662</span> return true;<a name="line.1662"></a>
-<span class="sourceLineNo">1663</span> }<a name="line.1663"></a>
+<span class="sourceLineNo">1641</span> return compareTo(left, right) == 0;<a name="line.1641"></a>
+<span class="sourceLineNo">1642</span> }<a name="line.1642"></a>
+<span class="sourceLineNo">1643</span><a name="line.1643"></a>
+<span class="sourceLineNo">1644</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1644"></a>
+<span class="sourceLineNo">1645</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1645"></a>
+<span class="sourceLineNo">1646</span> // short circuit case<a name="line.1646"></a>
+<span class="sourceLineNo">1647</span> if (left == right &&<a name="line.1647"></a>
+<span class="sourceLineNo">1648</span> leftOffset == rightOffset &&<a name="line.1648"></a>
+<span class="sourceLineNo">1649</span> leftLen == rightLen) {<a name="line.1649"></a>
+<span class="sourceLineNo">1650</span> return true;<a name="line.1650"></a>
+<span class="sourceLineNo">1651</span> }<a name="line.1651"></a>
+<span class="sourceLineNo">1652</span> // different lengths fast check<a name="line.1652"></a>
+<span class="sourceLineNo">1653</span> if (leftLen != rightLen) {<a name="line.1653"></a>
+<span class="sourceLineNo">1654</span> return false;<a name="line.1654"></a>
+<span class="sourceLineNo">1655</span> }<a name="line.1655"></a>
+<span class="sourceLineNo">1656</span> if (leftLen == 0) {<a name="line.1656"></a>
+<span class="sourceLineNo">1657</span> return true;<a name="line.1657"></a>
+<span class="sourceLineNo">1658</span> }<a name="line.1658"></a>
+<span class="sourceLineNo">1659</span><a name="line.1659"></a>
+<span class="sourceLineNo">1660</span> // Since we're often comparing adjacent sorted data,<a name="line.1660"></a>
+<span class="sourceLineNo">1661</span> // it's usual to have equal arrays except for the very last byte<a name="line.1661"></a>
+<span class="sourceLineNo">1662</span> // so check that first<a name="line.1662"></a>
+<span class="sourceLineNo">1663</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1663"></a>
<span class="sourceLineNo">1664</span><a name="line.1664"></a>
-<span class="sourceLineNo">1665</span> // Since we're often comparing adjacent sorted data,<a name="line.1665"></a>
-<span class="sourceLineNo">1666</span> // it's usual to have equal arrays except for the very last byte<a name="line.1666"></a>
-<span class="sourceLineNo">1667</span> // so check that first<a name="line.1667"></a>
-<span class="sourceLineNo">1668</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1668"></a>
+<span class="sourceLineNo">1665</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1665"></a>
+<span class="sourceLineNo">1666</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1666"></a>
+<span class="sourceLineNo">1667</span> }<a name="line.1667"></a>
+<span class="sourceLineNo">1668</span><a name="line.1668"></a>
<span class="sourceLineNo">1669</span><a name="line.1669"></a>
-<span class="sourceLineNo">1670</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1670"></a>
-<span class="sourceLineNo">1671</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1671"></a>
-<span class="sourceLineNo">1672</span> }<a name="line.1672"></a>
-<span class="sourceLineNo">1673</span><a name="line.1673"></a>
-<span class="sourceLineNo">1674</span><a name="line.1674"></a>
-<span class="sourceLineNo">1675</span> /**<a name="line.1675"></a>
-<span class="sourceLineNo">1676</span> * @param a left operand<a name="line.1676"></a>
-<span class="sourceLineNo">1677</span> * @param buf right operand<a name="line.1677"></a>
-<span class="sourceLineNo">1678</span> * @return True if equal<a name="line.1678"></a>
-<span class="sourceLineNo">1679</span> */<a name="line.1679"></a>
-<span class="sourceLineNo">1680</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1680"></a>
-<span class="sourceLineNo">1681</span> if (a == null) return buf == null;<a name="line.1681"></a>
-<span class="sourceLineNo">1682</span> if (buf == null) return false;<a name="line.1682"></a>
-<span class="sourceLineNo">1683</span> if (a.length != buf.remaining()) return false;<a name="line.1683"></a>
-<span class="sourceLineNo">1684</span><a name="line.1684"></a>
-<span class="sourceLineNo">1685</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1685"></a>
-<span class="sourceLineNo">1686</span> ByteBuffer b = buf.duplicate();<a name="line.1686"></a>
-<span class="sourceLineNo">1687</span> for (byte anA : a) {<a name="line.1687"></a>
-<span class="sourceLineNo">1688</span> if (anA != b.get()) {<a name="line.1688"></a>
-<span class="sourceLineNo">1689</span> return false;<a name="line.1689"></a>
-<span class="sourceLineNo">1690</span> }<a name="line.1690"></a>
-<span class="sourceLineNo">1691</span> }<a name="line.1691"></a>
-<span class="sourceLineNo">1692</span> return true;<a name="line.1692"></a>
-<span class="sourceLineNo">1693</span> }<a name="line.1693"></a>
-<span class="sourceLineNo">1694</span><a name="line.1694"></a>
-<span class="sourceLineNo">1695</span><a name="line.1695"></a>
-<span class="sourceLineNo">1696</span> /**<a name="line.1696"></a>
-<span class="sourceLineNo">1697</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1697"></a>
-<span class="sourceLineNo">1698</span> * array on the left.<a name="line.1698"></a>
-<span class="sourceLineNo">1699</span> */<a name="line.1699"></a>
-<span class="sourceLineNo">1700</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1700"></a>
-<span class="sourceLineNo">1701</span> return bytes != null && prefix != null &&<a name="line.1701"></a>
-<span class="sourceLineNo">1702</span> bytes.length >= prefix.length &&<a name="line.1702"></a>
-<span class="sourceLineNo">1703</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1703"></a>
-<span class="sourceLineNo">1704</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1704"></a>
-<span class="sourceLineNo">1705</span> }<a name="line.1705"></a>
-<span class="sourceLineNo">1706</span><a name="line.1706"></a>
-<span class="sourceLineNo">1707</span> /**<a name="line.1707"></a>
-<span class="sourceLineNo">1708</span> * @param b bytes to hash<a name="line.1708"></a>
-<span class="sourceLineNo">1709</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1709"></a>
-<span class="sourceLineNo">1710</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1710"></a>
-<span class="sourceLineNo">1711</span> * use calculating hash code.<a name="line.1711"></a>
-<span class="sourceLineNo">1712</span> */<a name="line.1712"></a>
-<span class="sourceLineNo">1713</span> public static int hashCode(final byte [] b) {<a name="line.1713"></a>
-<span class="sourceLineNo">1714</span> return hashCode(b, b.length);<a name="line.1714"></a>
-<span class="sourceLineNo">1715</span> }<a name="line.1715"></a>
-<span class="sourceLineNo">1716</span><a name="line.1716"></a>
-<span class="sourceLineNo">1717</span> /**<a name="line.1717"></a>
-<span class="sourceLineNo">1718</span> * @param b value<a name="line.1718"></a>
-<span class="sourceLineNo">1719</span> * @param length length of the value<a name="line.1719"></a>
-<span class="sourceLineNo">1720</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1720"></a>
-<span class="sourceLineNo">1721</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1721"></a>
-<span class="sourceLineNo">1722</span> * use calculating hash code.<a name="line.1722"></a>
-<span class="sourceLineNo">1723</span> */<a name="line.1723"></a>
-<span class="sourceLineNo">1724</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1724"></a>
-<span class="sourceLineNo">1725</span> return WritableComparator.hashBytes(b, length);<a name="line.1725"></a>
-<span class="sourceLineNo">1726</span> }<a name="line.1726"></a>
-<span class="sourceLineNo">1727</span><a name="line.1727"></a>
-<span class="sourceLineNo">1728</span> /**<a name="line.1728"></a>
-<span class="sourceLineNo">1729</span> * @param b bytes to hash<a name="line.1729"></a>
-<span class="sourceLineNo">1730</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1730"></a>
-<span class="sourceLineNo">1731</span> * Maps.<a name="line.1731"></a>
-<span class="sourceLineNo">1732</span> */<a name="line.1732"></a>
-<span class="sourceLineNo">1733</span> public static Integer mapKey(final byte [] b) {<a name="line.1733"></a>
-<span class="sourceLineNo">1734</span> return hashCode(b);<a name="line.1734"></a>
-<span class="sourceLineNo">1735</span> }<a name="line.1735"></a>
-<span class="sourceLineNo">1736</span><a name="line.1736"></a>
-<span class="sourceLineNo">1737</span> /**<a name="line.1737"></a>
-<span class="sourceLineNo">1738</span> * @param b bytes to hash<a name="line.1738"></a>
-<span class="sourceLineNo">1739</span> * @param length length to hash<a name="line.1739"></a>
-<span class="sourceLineNo">1740</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1740"></a>
-<span class="sourceLineNo">1741</span> * Maps.<a name="line.1741"></a>
-<span class="sourceLineNo">1742</span> */<a name="line.1742"></a>
-<span class="sourceLineNo">1743</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1743"></a>
-<span class="sourceLineNo">1744</span> return hashCode(b, length);<a name="line.1744"></a>
-<span class="sourceLineNo">1745</span> }<a name="line.1745"></a>
-<span class="sourceLineNo">1746</span><a name="line.1746"></a>
-<span class="sourceLineNo">1747</span> /**<a name="line.1747"></a>
-<span class="sourceLineNo">1748</span> * @param a lower half<a name="line.1748"></a>
-<span class="sourceLineNo">1749</span> * @param b upper half<a name="line.1749"></a>
-<span class="sourceLineNo">1750</span> * @return New array that has a in lower half and b in upper half.<a name="line.1750"></a>
-<span class="sourceLineNo">1751</span> */<a name="line.1751"></a>
-<span class="sourceLineNo">1752</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1752"></a>
-<span class="sourceLineNo">1753</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1753"></a>
-<span class="sourceLineNo">1754</span> }<a name="line.1754"></a>
-<span class="sourceLineNo">1755</span><a name="line.1755"></a>
-<span class="sourceLineNo">1756</span> /**<a name="line.1756"></a>
-<span class="sourceLineNo">1757</span> * @param a first third<a name="line.1757"></a>
-<span class="sourceLineNo">1758</span> * @param b second third<a name="line.1758"></a>
-<span class="sourceLineNo">1759</span> * @param c third third<a name="line.1759"></a>
-<span class="sourceLineNo">1760</span> * @return New array made from a, b and c<a name="line.1760"></a>
-<span class="sourceLineNo">1761</span> */<a name="line.1761"></a>
-<span class="sourceLineNo">1762</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1762"></a>
-<span class="sourceLineNo">1763</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1763"></a>
-<span class="sourceLineNo">1764</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1764"></a>
-<span class="sourceLineNo">1765</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1765"></a>
-<span class="sourceLineNo">1766</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1766"></a>
-<span class="sourceLineNo">1767</span> return result;<a name="line.1767"></a>
-<span class="sourceLineNo">1768</span> }<a name="line.1768"></a>
-<span class="sourceLineNo">1769</span><a name="line.1769"></a>
-<span class="sourceLineNo">1770</span> /**<a name="line.1770"></a>
-<span class="sourceLineNo">1771</span> * @param arrays all the arrays to concatenate together.<a name="line.1771"></a>
-<span class="sourceLineNo">1772</span> * @return New array made from the concatenation of the given arrays.<a name="line.1772"></a>
-<span class="sourceLineNo">1773</span> */<a name="line.1773"></a>
-<span class="sourceLineNo">1774</span> public static byte [] add(final byte [][] arrays) {<a name="line.1774"></a>
-<span class="sourceLineNo">1775</span> int length = 0;<a name="line.1775"></a>
+<span class="sourceLineNo">1670</span> /**<a name="line.1670"></a>
+<span class="sourceLineNo">1671</span> * @param a left operand<a name="line.1671"></a>
+<span class="sourceLineNo">1672</span> * @param buf right operand<a name="line.1672"></a>
+<span class="sourceLineNo">1673</span> * @return True if equal<a name="line.1673"></a>
+<span class="sourceLineNo">1674</span> */<a name="line.1674"></a>
+<span class="sourceLineNo">1675</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1675"></a>
+<span class="sourceLineNo">1676</span> if (a == null) return buf == null;<a name="line.1676"></a>
+<span class="sourceLineNo">1677</span> if (buf == null) return false;<a name="line.1677"></a>
+<span class="sourceLineNo">1678</span> if (a.length != buf.remaining()) return false;<a name="line.1678"></a>
+<span class="sourceLineNo">1679</span><a name="line.1679"></a>
+<span class="sourceLineNo">1680</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1680"></a>
+<span class="sourceLineNo">1681</span> ByteBuffer b = buf.duplicate();<a name="line.1681"></a>
+<span class="sourceLineNo">1682</span> for (byte anA : a) {<a name="line.1682"></a>
+<span class="sourceLineNo">1683</span> if (anA != b.get()) {<a name="line.1683"></a>
+<span class="sourceLineNo">1684</span> return false;<a name="line.1684"></a>
+<span class="sourceLineNo">1685</span> }<a name="line.1685"></a>
+<span class="sourceLineNo">1686</span> }<a name="line.1686"></a>
+<span class="sourceLineNo">1687</span> return true;<a name="line.1687"></a>
+<span class="sourceLineNo">1688</span> }<a name="line.1688"></a>
+<span class="sourceLineNo">1689</span><a name="line.1689"></a>
+<span class="sourceLineNo">1690</span><a name="line.1690"></a>
+<span class="sourceLineNo">1691</span> /**<a name="line.1691"></a>
+<span class="sourceLineNo">1692</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1692"></a>
+<span class="sourceLineNo">1693</span> * array on the left.<a name="line.1693"></a>
+<span class="sourceLineNo">1694</span> */<a name="line.1694"></a>
+<span class="sourceLineNo">1695</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1695"></a>
+<span class="sourceLineNo">1696</span> return bytes != null && prefix != null &&<a name="line.1696"></a>
+<span class="sourceLineNo">1697</span> bytes.length >= prefix.length &&<a name="line.1697"></a>
+<span class="sourceLineNo">1698</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1698"></a>
+<span class="sourceLineNo">1699</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1699"></a>
+<span class="sourceLineNo">1700</span> }<a name="line.1700"></a>
+<span class="sourceLineNo">1701</span><a name="line.1701"></a>
+<span class="sourceLineNo">1702</span> /**<a name="line.1702"></a>
+<span class="sourceLineNo">1703</span> * @param b bytes to hash<a name="line.1703"></a>
+<span class="sourceLineNo">1704</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1704"></a>
+<span class="sourceLineNo">1705</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1705"></a>
+<span class="sourceLineNo">1706</span> * use calculating hash code.<a name="line.1706"></a>
+<span class="sourceLineNo">1707</span> */<a name="line.1707"></a>
+<span class="sourceLineNo">1708</span> public static int hashCode(final byte [] b) {<a name="line.1708"></a>
+<span class="sourceLineNo">1709</span> return hashCode(b, b.length);<a name="line.1709"></a>
+<span class="sourceLineNo">1710</span> }<a name="line.1710"></a>
+<span class="sourceLineNo">1711</span><a name="line.1711"></a>
+<span class="sourceLineNo">1712</span> /**<a name="line.1712"></a>
+<span class="sourceLineNo">1713</span> * @param b value<a name="line.1713"></a>
+<span class="sourceLineNo">1714</span> * @param length length of the value<a name="line.1714"></a>
+<span class="sourceLineNo">1715</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1715"></a>
+<span class="sourceLineNo">1716</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1716"></a>
+<span class="sourceLineNo">1717</span> * use calculating hash code.<a name="line.1717"></a>
+<span class="sourceLineNo">1718</span> */<a name="line.1718"></a>
+<span class="sourceLineNo">1719</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1719"></a>
+<span class="sourceLineNo">1720</span> return WritableComparator.hashBytes(b, length);<a name="line.1720"></a>
+<span class="sourceLineNo">1721</span> }<a name="line.1721"></a>
+<span class="sourceLineNo">1722</span><a name="line.1722"></a>
+<span class="sourceLineNo">1723</span> /**<a name="line.1723"></a>
+<span class="sourceLineNo">1724</span> * @param b bytes to hash<a name="line.1724"></a>
+<span class="sourceLineNo">1725</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1725"></a>
+<span class="sourceLineNo">1726</span> * Maps.<a name="line.1726"></a>
+<span class="sourceLineNo">1727</span> */<a name="line.1727"></a>
+<span class="sourceLineNo">1728</span> public static Integer mapKey(final byte [] b) {<a name="line.1728"></a>
+<span class="sourceLineNo">1729</span> return hashCode(b);<a name="line.1729"></a>
+<span class="sourceLineNo">1730</span> }<a name="line.1730"></a>
+<span class="sourceLineNo">1731</span><a name="line.1731"></a>
+<span class="sourceLineNo">1732</span> /**<a name="line.1732"></a>
+<span class="sourceLineNo">1733</span> * @param b bytes to hash<a name="line.1733"></a>
+<span class="sourceLineNo">1734</span> * @param length length to hash<a name="line.1734"></a>
+<span class="sourceLineNo">1735</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1735"></a>
+<span class="sourceLineNo">1736</span> * Maps.<a name="line.1736"></a>
+<span class="sourceLineNo">1737</span> */<a name="line.1737"></a>
+<span class="sourceLineNo">1738</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1738"></a>
+<span class="sourceLineNo">1739</span> return hashCode(b, length);<a name="line.1739"></a>
+<span class="sourceLineNo">1740</span> }<a name="line.1740"></a>
+<span class="sourceLineNo">1741</span><a name="line.1741"></a>
+<span class="sourceLineNo">1742</span> /**<a name="line.1742"></a>
+<span class="sourceLineNo">1743</span> * @param a lower half<a name="line.1743"></a>
+<span class="sourceLineNo">1744</span> * @param b upper half<a name="line.1744"></a>
+<span class="sourceLineNo">1745</span> * @return New array that has a in lower half and b in upper half.<a name="line.1745"></a>
+<span class="sourceLineNo">1746</span> */<a name="line.1746"></a>
+<span class="sourceLineNo">1747</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1747"></a>
+<span class="sourceLineNo">1748</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1748"></a>
+<span class="sourceLineNo">1749</span> }<a name="line.1749"></a>
+<span class="sourceLineNo">1750</span><a name="line.1750"></a>
+<span class="sourceLineNo">1751</span> /**<a name="line.1751"></a>
+<span class="sourceLineNo">1752</span> * @param a first third<a name="line.1752"></a>
+<span class="sourceLineNo">1753</span> * @param b second third<a name="line.1753"></a>
+<span class="sourceLineNo">1754</span> * @param c third third<a name="line.1754"></a>
+<span class="sourceLineNo">1755</span> * @return New array made from a, b and c<a name="line.1755"></a>
+<span class="sourceLineNo">1756</span> */<a name="line.1756"></a>
+<span class="sourceLineNo">1757</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1757"></a>
+<span class="sourceLineNo">1758</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1758"></a>
+<span class="sourceLineNo">1759</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1759"></a>
+<span class="sourceLineNo">1760</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1760"></a>
+<span class="sourceLineNo">1761</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1761"></a>
+<span class="sourceLineNo">1762</span> return result;<a name="line.1762"></a>
+<span class="sourceLineNo">1763</span> }<a name="line.1763"></a>
+<span class="sourceLineNo">1764</span><a name="line.1764"></a>
+<span class="sourceLineNo">1765</span> /**<a name="line.1765"></a>
+<span class="sourceLineNo">1766</span> * @param arrays all the arrays to concatenate together.<a name="line.1766"></a>
+<span class="sourceLineNo">1767</span> * @return New array made from the concatenation of the given arrays.<a name="line.1767"></a>
+<span class="sourceLineNo">1768</span> */<a name="line.1768"></a>
+<span class="sourceLineNo">1769</span> public static byte [] add(final byte [][] arrays) {<a name="line.1769"></a>
+<span class="sourceLineNo">1770</span> int length = 0;<a name="line.1770"></a>
+<span class="sourceLineNo">1771</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1771"></a>
+<span class="sourceLineNo">1772</span> length += arrays[i].length;<a name="line.1772"></a>
+<span class="sourceLineNo">1773</span> }<a name="line.1773"></a>
+<span class="sourceLineNo">1774</span> byte [] result = new byte[length];<a name="line.1774"></a>
+<span class="sourceLineNo">1775</span> int index = 0;<a name="line.1775"></a>
<span class="sourceLineNo">1776</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1776"></a>
-<span class="sourceLineNo">1777</span> length += arrays[i].length;<a name="line.1777"></a>
-<span class="sourceLineNo">1778</span> }<a name="line.1778"></a>
-<span class="sourceLineNo">1779</span> byte [] result = new byte[length];<a name="line.1779"></a>
-<span class="sourceLineNo">1780</span> int index = 0;<a name="line.1780"></a>
-<span class="sourceLineNo">1781</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1781"></a>
-<span class="sourceLineNo">1782</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1782"></a>
-<span class="sourceLineNo">1783</span> index += arrays[i].length;<a name="line.1783"></a>
-<span class="sourceLineNo">1784</span> }<a name="line.1784"></a>
-<span class="sourceLineNo">1785</span> return result;<a name="line.1785"></a>
-<span class="sourceLineNo">1786</span> }<a name="line.1786"></a>
-<span class="sourceLineNo">1787</span><a name="line.1787"></a>
-<span class="sourceLineNo">1788</span> /**<a name="line.1788"></a>
-<span class="sourceLineNo">1789</span> * @param a array<a name="line.1789"></a>
-<span class="sourceLineNo">1790</span> * @param length amount of bytes to grab<a name="line.1790"></a>
-<span class="sourceLineNo">1791</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1791"></a>
-<span class="sourceLineNo">1792</span> */<a name="line.1792"></a>
-<span class="sourceLineNo">1793</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1793"></a>
-<span class="sourceLineNo">1794</span> if (a.length < length) {<a name="line.1794"></a>
-<span class="sourceLineNo">1795</span> return null;<a name="line.1795"></a>
-<span class="sourceLineNo">1796</span> }<a name="line.1796"></a>
-<span class="sourceLineNo">1797</span> byte [] result = new byte[length];<a name="line.1797"></a>
-<span class="sourceLineNo">1798</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1798"></a>
-<span class="sourceLineNo">1799</span> return result;<a name="line.1799"></a>
-<span class="sourceLineNo">1800</span> }<a name="line.1800"></a>
-<span class="sourceLineNo">1801</span><a name="line.1801"></a>
-<span class="sourceLineNo">1802</span> /**<a name="line.1802"></a>
-<span class="sourceLineNo">1803</span> * @param a array<a name="line.1803"></a>
-<span class="sourceLineNo">1804</span> * @param length amount of bytes to snarf<a name="line.1804"></a>
-<span class="sourceLineNo">1805</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1805"></a>
-<span class="sourceLineNo">1806</span> */<a name="line.1806"></a>
-<span class="sourceLineNo">1807</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1807"></a>
-<span class="sourceLineNo">1808</span> if (a.length < length) {<a name="line.1808"></a>
-<span class="sourceLineNo">1809</span> return null;<a name="line.1809"></a>
-<span class="sourceLineNo">1810</span> }<a name="line.1810"></a>
-<span class="sourceLineNo">1811</span> byte [] result = new byte[length];<a name="line.1811"></a>
-<span class="sourceLineNo">1812</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1812"></a>
-<span class="sourceLineNo">1813</span> return result;<a name="line.1813"></a>
-<span class="sourceLineNo">1814</span> }<a name="line.1814"></a>
-<span class="sourceLineNo">1815</span><a name="line.1815"></a>
-<span class="sourceLineNo">1816</span> /**<a name="line.1816"></a>
-<span class="sourceLineNo">1817</span> * @param a array<a name="line.1817"></a>
-<span class="sourceLineNo">1818</span> * @param length new array size<a name="line.1818"></a>
-<span class="sourceLineNo">1819</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1819"></a>
-<span class="sourceLineNo">1820</span> */<a name="line.1820"></a>
-<span class="sourceLineNo">1821</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1821"></a>
-<span class="sourceLineNo">1822</span> byte [] padding = new byte[length];<a name="line.1822"></a>
-<span class="sourceLineNo">1823</span> for (int i = 0; i < length; i++) {<a name="line.1823"></a>
-<span class="sourceLineNo">1824</span> padding[i] = 0;<a name="line.1824"></a>
-<span class="sourceLineNo">1825</span> }<a name="line.1825"></a>
-<span class="sourceLineNo">1826</span> return add(padding,a);<a name="line.1826"></a>
-<span class="sourceLineNo">1827</span> }<a name="line.1827"></a>
-<span class="sourceLineNo">1828</span><a name="line.1828"></a>
-<span class="sourceLineNo">1829</span> /**<a name="line.1829"></a>
-<span class="sourceLineNo">1830</span> * @param a array<a name="line.1830"></a>
-<span class="sourceLineNo">1831</span> * @param length new array size<a name="line.1831"></a>
-<span class="sourceLineNo">1832</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1832"></a>
-<span class="sourceLineNo">1833</span> */<a name="line.1833"></a>
-<span class="sourceLineNo">1834</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1834"></a>
-<span class="sourceLineNo">1835</span> byte [] padding = new byte[length];<a name="line.1835"></a>
-<span class="sourceLineNo">1836</span> for (int i = 0; i < length; i++) {<a name="line.1836"></a>
-<span class="sourceLineNo">1837</span> padding[i] = 0;<a name="line.1837"></a>
-<span class="sourceLineNo">1838</span> }<a name="line.1838"></a>
-<span class="sourceLineNo">1839</span> return add(a,padding);<a name="line.1839"></a>
-<span class="sourceLineNo">1840</span> }<a name="line.1840"></a>
-<span class="sourceLineNo">1841</span><a name="line.1841"></a>
-<span class="sourceLineNo">1842</span> /**<a name="line.1842"></a>
-<span class="sourceLineNo">1843</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1843"></a>
-<span class="sourceLineNo">1844</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1844"></a>
-<span class="sourceLineNo">1845</span> * @param a Beginning of range<a name="line.1845"></a>
-<span class="sourceLineNo">1846</span> * @param b End of range<a name="line.1846"></a>
-<span class="sourceLineNo">1847</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1847"></a>
-<span class="sourceLineNo">1848</span> * the range in two; i.e. one split.<a name="line.1848"></a>
-<span class="sourceLineNo">1849</span> * @return Array of dividing values<a name="line.1849"></a>
-<span class="sourceLineNo">1850</span> */<a name="line.1850"></a>
-<span class="sourceLineNo">1851</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1851"></a>
-<span class="sourceLineNo">1852</span> return split(a, b, false, num);<a name="line.1852"></a>
-<span class="sourceLineNo">1853</span> }<a name="line.1853"></a>
-<span class="sourceLineNo">1854</span><a name="line.1854"></a>
-<span class="sourceLineNo">1855</span> /**<a name="line.1855"></a>
-<span class="sourceLineNo">1856</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1856"></a>
-<span class="sourceLineNo">1857</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1857"></a>
-<span class="sourceLineNo">1858</span> * @param a Beginning of range<a name="line.1858"></a>
-<span class="sourceLineNo">1859</span> * @param b End of range<a name="line.1859"></a>
-<span class="sourceLineNo">1860</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1860"></a>
-<span class="sourceLineNo">1861</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1861"></a>
-<span class="sourceLineNo">1862</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1862"></a>
-<span class="sourceLineNo">1863</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1863"></a>
-<span class="sourceLineNo">1864</span> * the range in two; i.e. one split.<a name="line.1864"></a>
-<span class="sourceLineNo">1865</span> * @return Array of dividing values<a name="line.1865"></a>
-<span class="sourceLineNo">1866</span> */<a name="line.1866"></a>
-<span class="sourceLineNo">1867</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1867"></a>
-<span class="sourceLineNo">1868</span> boolean inclusive, final int num) {<a name="line.1868"></a>
-<span class="sourceLineNo">1869</span> byte[][] ret = new byte[num + 2][];<a name="line.1869"></a>
-<span class="sourceLineNo">1870</span> int i = 0;<a name="line.1870"></a>
-<span class="sourceLineNo">1871</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1871"></a>
-<span class="sourceLineNo">1872</span> if (iter == null)<a name="line.1872"></a>
-<span class="sourceLineNo">1873</span> return null;<a name="line.1873"></a>
-<span class="sourceLineNo">1874</span> for (byte[] elem : iter) {<a name="line.1874"></a>
-<span class="sourceLineNo">1875</span> ret[i++] = elem;<a name="line.1875"></a>
-<span class="sourceLineNo">1876</span> }<a name="line.1876"></a>
-<span class="sourceLineNo">1877</span> return ret;<a name="line.1877"></a>
-<span class="sourceLineNo">1878</span> }<a name="line.1878"></a>
-<span class="sourceLineNo">1879</span><a name="line.1879"></a>
-<span class="sourceLineNo">1880</span> /**<a name="line.1880"></a>
-<span class="sourceLineNo">1881</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1881"></a>
-<span class="sourceLineNo">1882</span> */<a name="line.1882"></a>
-<span class="sourceLineNo">1883</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1883"></a>
-<span class="sourceLineNo">1884</span> final byte[] b, final int num)<a name="line.1884"></a>
-<span class="sourceLineNo">1885</span> {<a name="line.1885"></a>
-<span class="sourceLineNo">1886</span> return iterateOnSplits(a, b, false, num);<a name="line.1886"></a>
-<span class="sourceLineNo">1887</span> }<a name="line.1887"></a>
-<span class="sourceLineNo">1888</span><a name="line.1888"></a>
-<span class="sourceLineNo">1889</span> /**<a name="line.1889"></a>
-<span class="sourceLineNo">1890</span> * Iterate over keys within the passed range.<a name="line.1890"></a>
-<span class="sourceLineNo">1891</span> */<a name="line.1891"></a>
-<span class="sourceLineNo">1892</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1892"></a>
-<span class="sourceLineNo">1893</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1893"></a>
-<span class="sourceLineNo">1894</span> {<a name="line.1894"></a>
-<span class="sourceLineNo">1895</span> byte [] aPadded;<a name="line.1895"></a>
-<span class="sourceLineNo">1896</span> byte [] bPadded;<a name="line.1896"></a>
-<span class="sourceLineNo">1897</span> if (a.length < b.length) {<a name="line.1897"></a>
-<span class="sourceLineNo">1898</span> aPadded = padTail(a, b.length - a.length);<a name="line.1898"></a>
-<span class="sourceLineNo">1899</span> bPadded = b;<a name="line.1899"></a>
-<span class="sourceLineNo">1900</span> } else if (b.length < a.length) {<a name="line.1900"></a>
-<span class="sourceLineNo">1901</span> aPadded = a;<a name="line.1901"></a>
-<span class="sourceLineNo">1902</span> bPadded = padTail(b, a.length - b.length);<a name="line.1902"></a>
-<span class="sourceLineNo">1903</span> } else {<a name="line.1903"></a>
-<span class="sourceLineNo">1904</span> aPadded = a;<a name="line.1904"></a>
-<span class="sourceLineNo">1905</span> bPadded = b;<a name="line.1905"></a>
-<span class="sourceLineNo">1906</span> }<a name="line.1906"></a>
-<span class="sourceLineNo">1907</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1907"></a>
-<span class="sourceLineNo">1908</span> throw new IllegalArgumentException("b <= a");<a name="line.1908"></a>
-<span class="sourceLineNo">1909</span> }<a name="line.1909"></a>
-<span class="sourceLineNo">1910</span> if (num <= 0) {<a name="line.1910"></a>
-<span class="sourceLineNo">1911</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1911"></a>
-<span class="sourceLineNo">1912</span> }<a name="line.1912"></a>
-<span class="sourceLineNo">1913</span> byte [] prependHeader = {1, 0};<a name="line.1913"></a>
-<span class="sourceLineNo">1914</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1914"></a>
-<span class="sourceLineNo">1915</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1915"></a>
-<span class="sourceLineNo">1916</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1916"></a>
-<span class="sourceLineNo">1917</span> if (inclusive) {<a name="line.1917"></a>
-<span class="sourceLineNo">1918</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1918"></a>
-<span class="sourceLineNo">1919</span> }<a name="line.1919"></a>
-<span class="sourceLineNo">1920</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1920"></a>
-<span class="sourceLineNo">1921</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1921"></a>
-<span class="sourceLineNo">1922</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1922"></a>
-<span class="sourceLineNo">1923</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1923"></a>
-<span class="sourceLineNo">1924</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1924"></a>
-<span class="sourceLineNo">1925</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1925"></a>
-<span class="sourceLineNo">1926</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1926"></a>
-<span class="sourceLineNo">1927</span> }<a name="line.1927"></a>
-<span class="sourceLineNo">1928</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1928"></a>
-<span class="sourceLineNo">1929</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1929"></a>
-<span class="sourceLineNo">1930</span> }<a name="line.1930"></a>
-<span class="sourceLineNo">1931</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1931"></a>
-<span class="sourceLineNo">1932</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1932"></a>
-<span class="sourceLineNo">1933</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1933"></a>
-<span class="sourceLineNo">1934</span> }<a name="line.1934"></a>
-<span class="sourceLineNo">1935</span> final BigInteger intervalBI;<a name="line.1935"></a>
-<span class="sourceLineNo">1936</span> try {<a name="line.1936"></a>
-<span class="sourceLineNo">1937</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1937"></a>
-<span class="sourceLineNo">1938</span> } catch(Exception e) {<a name="line.1938"></a>
-<span class="sourceLineNo">1939</span> LOG.error("Exception caught during division", e);<a name="line.1939"></a>
-<span class="sourceLineNo">1940</span> return null;<a name="line.1940"></a>
-<span class="sourceLineNo">1941</span> }<a name="line.1941"></a>
-<span class="sourceLineNo">1942</span><a name="line.1942"></a>
-<span class="sourceLineNo">1943</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1943"></a>
-<span class="sourceLineNo">1944</span> private int i = -1;<a name="line.1944"></a>
+<span class="sourceLineNo">1777</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1777"></a>
+<span class="sourceLineNo">1778</span> index += arrays[i].length;<a name="line.1778"></a>
+<span class="sourceLineNo">1779</span> }<a name="line.1779"></a>
+<span class="sourceLineNo">1780</span> return result;<a name="line.1780"></a>
+<span class="sourceLineNo">1781</span> }<a name="line.1781"></a>
+<span class="sourceLineNo">1782</span><a name="line.1782"></a>
+<span class="sourceLineNo">1783</span> /**<a name="line.1783"></a>
+<span class="sourceLineNo">1784</span> * @param a array<a name="line.1784"></a>
+<span class="sourceLineNo">1785</span> * @param length amount of bytes to grab<a name="line.1785"></a>
+<span class="sourceLineNo">1786</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1786"></a>
+<span class="sourceLineNo">1787</span> */<a name="line.1787"></a>
+<span class="sourceLineNo">1788</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1788"></a>
+<span class="sourceLineNo">1789</span> if (a.length < length) {<a name="line.1789"></a>
+<span class="sourceLineNo">1790</span> return null;<a name="line.1790"></a>
+<span class="sourceLineNo">1791</span> }<a name="line.1791"></a>
+<span class="sourceLineNo">1792</span> byte [] result = new byte[length];<a name="line.1792"></a>
+<span class="sourceLineNo">1793</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1793"></a>
+<span class="sourceLineNo">1794</span> return result;<a name="line.1794"></a>
+<span class="sourceLineNo">1795</span> }<a name="line.1795"></a>
+<span class="sourceLineNo">1796</span><a name="line.1796"></a>
+<span class="sourceLineNo">1797</span> /**<a name="line.1797"></a>
+<span class="sourceLineNo">1798</span> * @param a array<a name="line.1798"></a>
+<span class="sourceLineNo">1799</span> * @param length amount of bytes to snarf<a name="line.1799"></a>
+<span class="sourceLineNo">1800</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1800"></a>
+<span class="sourceLineNo">1801</span> */<a name="line.1801"></a>
+<span class="sourceLineNo">1802</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1802"></a>
+<span class="sourceLineNo">1803</span> if (a.length < length) {<a name="line.1803"></a>
+<span class="sourceLineNo">1804</span> return null;<a name="line.1804"></a>
+<span class="sourceLineNo">1805</span> }<a name="line.1805"></a>
+<span class="sourceLineNo">1806</span> byte [] result = new byte[length];<a name="line.1806"></a>
+<span class="sourceLineNo">1807</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1807"></a>
+<span class="sourceLineNo">1808</span> return result;<a name="line.1808"></a>
+<span class="sourceLineNo">1809</span> }<a name="line.1809"></a>
+<span class="sourceLineNo">1810</span><a name="line.1810"></a>
+<span class="sourceLineNo">1811</span> /**<a name="line.1811"></a>
+<span class="sourceLineNo">1812</span> * @param a array<a name="line.1812"></a>
+<span class="sourceLineNo">1813</span> * @param length new array size<a name="line.1813"></a>
+<span class="sourceLineNo">1814</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1814"></a>
+<span class="sourceLineNo">1815</span> */<a name="line.1815"></a>
+<span class="sourceLineNo">1816</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1816"></a>
+<span class="sourceLineNo">1817</span> byte [] padding = new byte[length];<a name="line.1817"></a>
+<span class="sourceLineNo">1818</span> for (int i = 0; i < length; i++) {<a name="line.1818"></a>
+<span class="sourceLineNo">1819</span> padding[i] = 0;<a name="line.1819"></a>
+<span class="sourceLineNo">1820</span> }<a name="line.1820"></a>
+<span class="sourceLineNo">1821</span> return add(padding,a);<a name="line.1821"></a>
+<span class="sourceLineNo">1822</span> }<a name="line.1822"></a>
+<span class="sourceLineNo">1823</span><a name="line.1823"></a>
+<span class="sourceLineNo">1824</span> /**<a name="line.1824"></a>
+<span class="sourceLineNo">1825</span> * @param a array<a name="line.1825"></a>
+<span class="sourceLineNo">1826</span> * @param length new array size<a name="line.1826"></a>
+<span class="sourceLineNo">1827</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1827"></a>
+<span class="sourceLineNo">1828</span> */<a name="line.1828"></a>
+<span class="sourceLineNo">1829</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1829"></a>
+<span class="sourceLineNo">1830</span> byte [] padding = new byte[length];<a name="line.1830"></a>
+<span class="sourceLineNo">1831</span> for (int i = 0; i < length; i++) {<a name="line.1831"></a>
+<span class="sourceLineNo">1832</span> padding[i] = 0;<a name="line.1832"></a>
+<span class="sourceLineNo">1833</span> }<a name="line.1833"></a>
+<span class="sourceLineNo">1834</span> return add(a,padding);<a name="line.1834"></a>
+<span class="sourceLineNo">1835</span> }<a name="line.1835"></a>
+<span class="sourceLineNo">1836</span><a name="line.1836"></a>
+<span class="sourceLineNo">1837</span> /**<a name="line.1837"></a>
+<span class="sourceLineNo">1838</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1838"></a>
+<span class="sourceLineNo">1839</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1839"></a>
+<span class="sourceLineNo">1840</span> * @param a Beginning of range<a name="line.1840"></a>
+<span class="sourceLineNo">1841</span> * @param b End of range<a name="line.1841"></a>
+<span class="sourceLineNo">1842</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1842"></a>
+<span class="sourceLineNo">1843</span> * the range in two; i.e. one split.<a name="line.1843"></a>
+<span class="sourceLineNo">1844</span> * @return Array of dividing values<a name="line.1844"></a>
+<span class="sourceLineNo">1845</span> */<a name="line.1845"></a>
+<span class="sourceLineNo">1846</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1846"></a>
+<span class="sourceLineNo">1847</span> return split(a, b, false, num);<a name="line.1847"></a>
+<span class="sourceLineNo">1848</span> }<a name="line.1848"></a>
+<span class="sourceLineNo">1849</span><a name="line.1849"></a>
+<span class="sourceLineNo">1850</span> /**<a name="line.1850"></a>
+<span class="sourceLineNo">1851</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1851"></a>
+<span class="sourceLineNo">1852</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1852"></a>
+<span class="sourceLineNo">1853</span> * @param a Beginning of range<a name="line.1853"></a>
+<span class="sourceLineNo">1854</span> * @param b End of range<a name="line.1854"></a>
+<span class="sourceLineNo">1855</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1855"></a>
+<span class="sourceLineNo">1856</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1856"></a>
+<span class="sourceLineNo">1857</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1857"></a>
+<span class="sourceLineNo">1858</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1858"></a>
+<span class="sourceLineNo">1859</span> * the range in two; i.e. one split.<a name="line.1859"></a>
+<span class="sourceLineNo">1860</span> * @return Array of dividing values<a name="line.1860"></a>
+<span class="sourceLineNo">1861</span> */<a name="line.1861"></a>
+<span class="sourceLineNo">1862</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1862"></a>
+<span class="sourceLineNo">1863</span> boolean inclusive, final int num) {<a name="line.1863"></a>
+<span class="sourceLineNo">1864</span> byte[][] ret = new byte[num + 2][];<a name="line.1864"></a>
+<span class="sourceLineNo">1865</span> int i = 0;<a name="line.1865"></a>
+<span class="sourceLineNo">1866</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1866"></a>
+<span class="sourceLineNo">1867</span> if (iter == null)<a name="line.1867"></a>
+<span class="sourceLineNo">1868</span> return null;<a name="line.1868"></a>
+<span class="sourceLineNo">1869</span> for (byte[] elem : iter) {<a name="line.1869"></a>
+<span class="sourceLineNo">1870</span> ret[i++] = elem;<a name="line.1870"></a>
+<span class="sourceLineNo">1871</span> }<a name="line.1871"></a>
+<span class="sourceLineNo">1872</span> return ret;<a name="line.1872"></a>
+<span class="sourceLineNo">1873</span> }<a name="line.1873"></a>
+<span class="sourceLineNo">1874</span><a name="line.1874"></a>
+<span class="sourceLineNo">1875</span> /**<a name="line.1875"></a>
+<span class="sourceLineNo">1876</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1876"></a>
+<span class="sourceLineNo">1877</span> */<a name="line.1877"></a>
+<span class="sourceLineNo">1878</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1878"></a>
+<span class="sourceLineNo">1879</span> final byte[] b, final int num)<a name="line.1879"></a>
+<span class="sourceLineNo">1880</span> {<a name="line.1880"></a>
+<span class="sourceLineNo">1881</span> return iterateOnSplits(a, b, false, num);<a name="line.1881"></a>
+<span class="sourceLineNo">1882</span> }<a name="line.1882"></a>
+<span class="sourceLineNo">1883</span><a name="line.1883"></a>
+<span class="sourceLineNo">1884</span> /**<a name="line.1884"></a>
+<span class="sourceLineNo">1885</span> * Iterate over keys within the passed range.<a name="line.1885"></a>
+<span class="sourceLineNo">1886</span> */<a name="line.1886"></a>
+<span class="sourceLineNo">1887</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1887"></a>
+<span class="sourceLineNo">1888</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1888"></a>
+<span class="sourceLineNo">1889</span> {<a name="line.1889"></a>
+<span class="sourceLineNo">1890</span> byte [] aPadded;<a name="line.1890"></a>
+<span class="sourceLineNo">1891</span> byte [] bPadded;<a name="line.1891"></a>
+<span class="sourceLineNo">1892</span> if (a.length < b.length) {<a name="line.1892"></a>
+<span class="sourceLineNo">1893</span> aPadded = padTail(a, b.length - a.length);<a name="line.1893"></a>
+<span class="sourceLineNo">1894</span> bPadded = b;<a name="line.1894"></a>
+<span class="sourceLineNo">1895</span> } else if (b.length < a.length) {<a name="line.1895"></a>
+<span class="sourceLineNo">1896</span> aPadded = a;<a name="line.1896"></a>
+<span class="sourceLineNo">1897</span> bPadded = padTail(b, a.length - b.length);<a name="line.1897"></a>
+<span class="sourceLineNo">1898</span> } else {<a name="line.1898"></a>
+<span class="sourceLineNo">1899</span> aPadded = a;<a name="line.1899"></a>
+<span class="sourceLineNo">1900</span> bPadded = b;<a name="line.1900"></a>
+<span class="sourceLineNo">1901</span> }<a name="line.1901"></a>
+<span class="sourceLineNo">1902</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1902"></a>
+<span class="sourceLineNo">1903</span> throw new IllegalArgumentException("b <= a");<a name="line.1903"></a>
+<span class="sourceLineNo">1904</span> }<a name="line.1904"></a>
+<span class="sourceLineNo">1905</span> if (num <= 0) {<a name="line.1905"></a>
+<span class="sourceLineNo">1906</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1906"></a>
+<span class="sourceLineNo">1907</span> }<a name="line.1907"></a>
+<span class="sourceLineNo">1908</span> byte [] prependHeader = {1, 0};<a name="line.1908"></a>
+<span class="sourceLineNo">1909</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1909"></a>
+<span class="sourceLineNo">1910</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1910"></a>
+<span class="sourceLineNo">1911</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1911"></a>
+<span class="sourceLineNo">1912</span> if (inclusive) {<a name="line.1912"></a>
+<span class="sourceLineNo">1913</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1913"></a>
+<span class="sourceLineNo">1914</span> }<a name="line.1914"></a>
+<span class="sourceLineNo">1915</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1915"></a>
+<span class="sourceLineNo">1916</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1916"></a>
+<span class="sourceLineNo">1917</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1917"></a>
+<span class="sourceLineNo">1918</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1918"></a>
+<span class="sourceLineNo">1919</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1919"></a>
+<span class="sourceLineNo">1920</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1920"></a>
+<span class="sourceLineNo">1921</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1921"></a>
+<span class="sourceLineNo">1922</span> }<a name="line.1922"></a>
+<span class="sourceLineNo">1923</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1923"></a>
+<span class="sourceLineNo">1924</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1924"></a>
+<span class="sourceLineNo">1925</span> }<a name="line.1925"></a>
+<span class="sourceLineNo">1926</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1926"></a>
+<span class="sourceLineNo">1927</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1927"></a>
+<span class="sourceLineNo">1928</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1928"></a>
+<span class="sourceLineNo">1929</span> }<a name="line.1929"></a>
+<span class="sourceLineNo">1930</span> final BigInteger intervalBI;<a name="line.1930"></a>
+<span class="sourceLineNo">1931</span> try {<a name="line.1931"></a>
+<span class="sourceLineNo">1932</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1932"></a>
+<span class="sourceLineNo">1933</span> } catch(Exception e) {<a name="line.1933"></a>
+<span class="sourceLineNo">1934</span> LOG.error("Exception caught during division", e);<a name="line.1934"></a>
+<span class="sourceLineNo">1935</span> return null;<a name="line.1935"></a>
+<span class="sourceLineNo">1936</span> }<a name="line.1936"></a>
+<span class="sourceLineNo">1937</span><a name="line.1937"></a>
+<span class="sourceLineNo">1938</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1938"></a>
+<span class="sourceLineNo">1939</span> private int i = -1;<a name="line.1939"></a>
+<span class="sourceLineNo">1940</span><a name="line.1940"></a>
+<span class="sourceLineNo">1941</span> @Override<a name="line.1941"></a>
+<span class="sourceLineNo">1942</span> public boolean hasNext() {<a name="line.1942"></a>
+<span class="sourceLineNo">1943</span> return i < num+1;<a name="line.1943"></a>
+<span class="sourceLineNo">1944</span> }<a name="line.1944"></a>
<span class="sourceLineNo">1945</span><a name="line.1945"></a>
<span class="sourceLineNo">1946</span> @Override<a name="line.1946"></a>
-<span class="sourceLineNo">1947</span> public boolean hasNext() {<a name="line.1947"></a>
-<span class="sourceLineNo">1948</span> return i < num+1;<a name="line.1948"></a>
-<span class="sourceLineNo">1949</span> }<a name="line.1949"></a>
-<span class="sourceLineNo">1950</span><a name="line.1950"></a>
-<span class="sourceLineNo">1951</span> @Override<a name="line.1951"></a>
-<span class="sourceLineNo">1952</span> public byte[] next() {<a name="line.1952"></a>
-<span class="sourceLineNo">1953</span> i++;<a name="line.1953"></a>
-<span class="sourceLineNo">1954</span> if (i == 0) return a;<a name="line.1954"></a>
-<span class="sourceLineNo">1955</span> if (i == num + 1) return b;<a name="line.1955"></a>
-<span class="sourceLineNo">1956</span><a name="line.1956"></a>
-<span class="sourceLineNo">1957</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1957"></a>
-<span class="sourceLineNo">1958</span> byte [] padded = curBI.toByteArray();<a name="line.1958"></a>
-<span class="sourceLineNo">1959</span> if (padded[1] == 0)<a name="line.1959"></a>
-<span class="sourceLineNo">1960</span> padded = tail(padded, padded.length - 2);<a name="line.1960"></a>
-<span class="sourceLineNo">1961</span> else<a name="line.1961"></a>
-<span class="sourceLineNo">1962</span> padded = tail(padded, padded.length - 1);<a name="line.1962"></a>
-<span class="sourceLineNo">1963</span> return padded;<a name="line.1963"></a>
+<span class="sourceLineNo">1947</span> public byte[] next() {<a name="line.1947"></a>
+<span class="sourceLineNo">1948</span> i++;<a name="line.1948"></a>
+<span class="sourceLineNo">1949</span> if (i == 0) return a;<a name="line.1949"></a>
+<span class="sourceLineNo">1950</span> if (i == num + 1) return b;<a name="line.1950"></a>
+<span class="sourceLineNo">1951</span><a name="line.1951"></a>
+<span class="sourceLineNo">1952</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1952"></a>
+<span class="sourceLineNo">1953</span> byte [] padded = curBI.toByteArray();<a name="line.1953"></a>
+<span class="sourceLineNo">1954</span> if (padded[1] == 0)<a name="line.1954"></a>
+<span class="sourceLineNo">1955</span> padded = tail(padded, padded.length - 2);<a name="line.1955"></a>
+<span class="sourceLineNo">1956</span> else<a name="line.1956"></a>
+<span class="sourceLineNo">1957</span> padded = tail(padded, padded.length - 1);<a name="line.1957"></a>
+<span class="sourceLineNo">1958</span> return padded;<a name="line.1958"></a>
+<span class="sourceLineNo">1959</span> }<a name="line.1959"></a>
+<span class="sourceLineNo">1960</span><a name="line.1960"></a>
+<span class="sourceLineNo">1961</span> @Override<a name="line.1961"></a>
+<span class="sourceLineNo">1962</span> public void remove() {<a name="line.1962"></a>
+<span class="sourceLineNo">1963</span> throw new UnsupportedOperationException();<a name="line.1963"></a>
<span class="sourceLineNo">1964</span> }<a name="line.1964"></a>
<span class="sourceLineNo">1965</span><a name="line.1965"></a>
-<span class="sourceLineNo">1966</span> @Override<a name="line.1966"></a>
-<span class="sourceLineNo">1967</span> public void remove() {<a name="line.1967"></a>
-<span class="sourceLineNo">1968</span> throw new UnsupportedOperationException();<a name="line.1968"></a>
-<span class="sourceLineNo">1969</span> }<a name="line.1969"></a>
-<span class="sourceLineNo">1970</span><a name="line.1970"></a>
-<span class="sourceLineNo">1971</span> };<a name="line.1971"></a>
-<span class="sourceLineNo">1972</span><a name="line.1972"></a>
-<span class="sourceLineNo">1973</span> return new Iterable<byte[]>() {<a name="line.1973"></a>
-<span class="sourceLineNo">1974</span> @Override<a name="line.1974"></a>
-<span class="sourceLineNo">1975</span> public Iterator<byte[]> iterator() {<a name="line.1975"></a>
-<span class="sourceLineNo">1976</span> return iterator;<a name="line.1976"></a>
-<span class="sourceLineNo">1977</span> }<a name="line.1977"></a>
-<span class="sourceLineNo">1978</span> };<a name="line.1978"></a>
-<span class="sourceLineNo">1979</span> }<a name="line.1979"></a>
-<span class="sourceLineNo">1980</span><a name="line.1980"></a>
-<span class="sourceLineNo">1981</span> /**<a name="line.1981"></a>
-<span class="sourceLineNo">1982</span> * @param bytes array to hash<a name="line.1982"></a>
-<span class="sourceLineNo">1983</span> * @param offset offset to start from<a name="line.1983"></a>
-<span class="sourceLineNo">1984</span> * @param length length to hash<a name="line.1984"></a>
-<span class="sourceLineNo">1985</span> * */<a name="line.1985"></a>
-<span class="sourceLineNo">1986</span> public static int hashCode(byte[] bytes, int offset, int length) {<a name="line.1986"></a>
-<span class="sourceLineNo">1987</span> int hash = 1;<a name="line.1987"></a>
-<span class="sourceLineNo">1988</span> for (int i = offset; i < offset + length; i++)<a name="line.1988"></a>
-<span class="sourceLineNo">1989</span> hash = (31 * hash) + (int) bytes[i];<a name="line.1989"></a>
-<span class="sourceLineNo">1990</span> return hash;<a name="line.1990"></a>
-<span class="sourceLineNo">1991</span> }<a name="line.1991"></a>
-<span class="sourceLineNo">1992</span><a name="line.1992"></a>
-<span class="sourceLineNo">1993</span> /**<a name="line.1993"></a>
-<span class="sourceLineNo">1994</span> * @param t operands<a name="line.1994"></a>
-<span class="sourceLineNo">1995</span> * @return Array of byte arrays made from passed array of Text<a name="line.1995"></a>
-<span class="sourceLineNo">1996</span> */<a name="line.1996"></a>
-<span class="sourceLineNo">1997</span> public static byte [][] toByteArrays(final String [] t) {<a name="line.1997"></a>
-<span class="sourceLineNo">1998</span> byte [][] result = new byte[t.length][];<a name="line.1998"></a>
-<span class="sourceLineNo">1999</span> for (int i = 0; i < t.length; i++) {<a name="line.1999"></a>
-<span class="sourceLineNo">2000</span> result[i] = Bytes.toBytes(t[i]);<a name="line.2000"></a>
-<span class="sourceLineNo">2001</span> }<a name="line.2001"></a>
-<span class="sourceLineNo">2002</span> return result;<a name="line.2002"></a>
-<span class="sourceLineNo">2003</span> }<a name="line.2003"></a>
-<span class="sourceLineNo">2004</span><a name="line.2004"></a>
-<span class="sourceLineNo">2005</span> /**<a name="line.2005"></a>
-<span class="sourceLineNo">2006</span> * @param t operands<a name="line.2006"></a>
-<span class="sourceLineNo">2007</span> * @return Array of binary byte arrays made from passed array of binary strings<a name="line.2007"></a>
-<span class="sourceLineNo">2008</span> */<a name="line.2008"></a>
-<span class="sourceLineNo">2009</span> public static byte[][] toBinaryByteArrays(final String[] t) {<a name="line.2009"></a>
-<span class="sourceLineNo">2010</span> byte[][] result = new byte[t.length][];<a name="line.2010"></a>
-<span class="sourceLineNo">2011</span> for (int i = 0; i < t.length; i++) {<a name="line.2011"></a>
-<span class="sourceLineNo">2012</span> result[i] = Bytes.toBytesBinary(t[i]);<a name="line.2012"></a>
-<span class="sourceLineNo">2013</span> }<a name="line.2013"></a>
-<span class="sourceLineNo">2014</span> return result;<a name="line.2014"></a>
-<span class="sourceLineNo">2015</span> }<a name="line.2015"></a>
-<span class="sourceLineNo">2016</span><a name="line.2016"></a>
-<span class="sourceLineNo">2017</span> /**<a name="line.2017"></a>
-<span class="sourceLineNo">2018</span> * @param column operand<a name="line.2018"></a>
-<span class="sourceLineNo">2019</span> * @return A byte array of a byte array where first and only entry is<a name="line.2019"></a>
-<span class="sourceLineNo">2020</span> * <code>column</code><a name="line.2020"></a>
-<span class="sourceLineNo">2021</span> */<a name="line.2021"></a>
-<span class="sourceLineNo">2022</span> public static byte [][] toByteArrays(final String column) {<a name="line.2022"></a>
-<span class="sourceLineNo">2023</span> return toByteArrays(toBytes(column));<a name="line.2023"></a>
-<span class="sourceLineNo">2024</span> }<a name="line.2024"></a>
-<span class="sourceLineNo">2025</span><a name="line.2025"></a>
-<span class="sourceLineNo">2026</span> /**<a name="line.2026"></a>
-<span class="sourceLineNo">2027</span> * @param column operand<a name="line.2027"></a>
-<span class="sourceLineNo">2028</span> * @return A byte array of a byte array where first and only entry is<a name="line.2028"></a>
-<span class="sourceLineNo">2029</span> * <code>column</code><a name="line.2029"></a>
-<span class="sourceLineNo">2030</span> */<a name="line.2030"></a>
-<span class="sourceLineNo">2031</span> public static byte [][] toByteArrays(final byte [] column) {<a name="line.2031"></a>
-<span class="sourceLineNo">2032</span> byte [][] result = new byte[1][];<a name="line.2032"></a>
-<span class="sourceLineNo">2033</span> result[0] = column;<a name="line.2033"></a>
-<span class="sourceLineNo">2034</span> return result;<a name="line.2034"></a>
-<span class="sourceLineNo">2035</span> }<a name="line.2035"></a>
-<span class="sourceLineNo">2036</span><a name="line.2036"></a>
-<span class="sourceLineNo">2037</span> /**<a name="line.2037"></a>
-<span class="sourceLineNo">2038</span> * Binary search for keys in indexes.<a name="line.2038"></a>
-<span class="sourceLineNo">2039</span> *<a name="line.2039"></a>
-<span class="sourceLineNo">2040</span> * @param arr array of byte arrays to search for<a name="line.2040"></a>
-<span class="sourceLineNo">2041</span> * @param key the key you want to find<a name="line.2041"></a>
-<span class="sourceLineNo">2042</span> * @param offset the offset in the key you want to find<a name="line.2042"></a>
-<span class="sourceLineNo">2043</span> * @param length the length of the key<a name="line.2043"></a>
-<span class="sourceLineNo">2044</span> * @param comparator a comparator to compare.<a name="line.2044"></a>
-<span class="sourceLineNo">2045</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2045"></a>
-<span class="sourceLineNo">2046</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2046"></a>
-<span class="sourceLineNo">2047</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2047"></a>
-<span class="sourceLineNo">2048</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2048"></a>
-<span class="sourceLineNo">2049</span> * means that this function can return 2N + 1 different values<a name="line.2049"></a>
-<span class="sourceLineNo">2050</span> * ranging from -(N + 1) to N - 1.<a name="line.2050"></a>
-<span class="sourceLineNo">2051</span> * @deprecated {@link Bytes#binarySearch(byte[][], byte[], int, int)}<a name="line.2051"></a>
-<span class="sourceLineNo">2052</span> */<a name="line.2052"></a>
-<span class="sourceLineNo">2053</span> @Deprecated<a name="line.2053"></a>
-<span class="sourceLineNo">2054</span> public static int binarySearch(byte [][]arr, byte []key, int offset,<a name="line.2054"></a>
-<span class="sourceLineNo">2055</span> int length, RawComparator<?> comparator) {<a name="line.2055"></a>
-<span class="sourceLineNo">2056</span> return binarySearch(arr, key, offset, length);<a name="line.2056"></a>
-<span class="sourceLineNo">2057</span> }<a name="line.2057"></a>
-<span class="sourceLineNo">2058</span><a name="line.2058"></a>
-<span class="sourceLineNo">2059</span> /**<a name="line.2059"></a>
-<span class="sourceLineNo">2060</span> * Binary search for keys in indexes using Bytes.BYTES_RAWCOMPARATOR.<a name="line.2060"></a>
-<span class="sourceLineNo">2061</span> *<a name="line.2061"></a>
-<span class="sourceLineNo">2062</span> * @param arr array of byte arrays to search for<a name="line.2062"></a>
-<span class="sourceLineNo">2063</span> * @param key the key you want to find<a name="line.2063"></a>
-<span class="sourceLineNo">2064</span> * @param offset the offset in the key you want to find<a name="line.2064"></a>
-<span class="sourceLineNo">2065</span> * @param length the length of the key<a name="line.2065"></a>
-<span class="sourceLineNo">2066</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2066"></a>
-<span class="sourceLineNo">2067</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2067"></a>
-<span class="sourceLineNo">2068</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2068"></a>
-<span class="sourceLineNo">2069</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2069"></a>
-<span class="sourceLineNo">2070</span> * means that this function can return 2N + 1 different values<a name="line.2070"></a>
-<span class="sourceLineNo">2071</span> * ranging from -(N + 1) to N - 1.<a name="line.2071"></a>
-<span class="sourceLineNo">2072</span> */<a name="line.2072"></a>
-<span class="sourceLineNo">2073</span> public static int binarySearch(byte[][] arr, byte[] key, int offset, int length) {<a name="line.2073"></a>
-<span class="sourceLineNo">2074</span> int low = 0;<a name="line.2074"></a>
-<span class="sourceLineNo">2075</span> int high = arr.length - 1;<a name="line.2075"></a>
-<span class="sourceLineNo">2076</span><a name="line.2076"></a>
-<span class="sourceLineNo">2077</span> while (low <= high) {<a name="line.2077"></a>
-<span class="sourceLineNo">2078</span> int mid = (low + high) >>> 1;<a name="line.2078"></a>
-<span class="sourceLineNo">2079</span> // we have to compare in this order, because the comparator order<a name="line.2079"></a>
-<span class="sourceLineNo">2080</span> // has special logic when the 'left side' is a special key.<a name="line.2080"></a>
-<span class="sourceLineNo">2081</span> int cmp = Bytes.BYTES_RAWCOMPARATOR<a name="line.2081"></a>
-<span class="sourceLineNo">2082</span> .compare(key, offset, length, arr[mid], 0, arr[mid].length);<a name="line.2082"></a>
-<span class="sourceLineNo">2083</span> // key lives above the midpoint<a name="line.2083"></a>
-<span class="sourceLineNo">2084</span> if (cmp > 0)<a name="line.2084"></a>
-<span class="sourceLineNo">2085</span> low = mid + 1;<a name="line.2085"></a>
-<span class="sourceLineNo">2086</span> // key lives below the midpoint<a name="line.2086"></a>
-<span class="sourceLineNo">2087</span> else if (cmp < 0)<a name="line.2087"></a>
-<span class="sourceLineNo">2088</span> high = mid - 1;<a name="line.2088"></a>
-<span class="sourceLineNo">2089</span> // BAM. how often does this really happen?<a name="line.2089"></a>
-<span class="sourceLineNo">2090</span> else<a name="line.2090"></a>
-<span class="sourceLineNo">2091</span> return mid;<a name="line.2091"></a>
-<span class="sourceLineNo">2092</span> }<a name="line.2092"></a>
-<span class="sourceLineNo">2093</span> return -(low + 1);<a name="line.2093"></a>
-<span class="sourceLineNo">2094</span> }<a name="line.2094"></a>
-<span class="sourceLineNo">2095</span><a name="line.2095"></a>
-<span class="sourceLineNo">2096</span> /**<a name="line.2096"></a>
-<span class="sourceLineNo">2097</span> * Binary search for keys in indexes.<a name="line.2097"></a>
-<span class="sourceLineNo">2098</span> *<a name="line.2098"></a>
-<span class="sourceLineNo">2099</span> * @param arr array of byte arrays to search for<a name="line.2099"></a>
-<span class="sourceLineNo">2100</span> * @param key the key you want to find<a name="line.2100"></a>
-<span class="sourceLineNo">2101</span> * @param comparator a comparator to compare.<a name="line.2101"></a>
-<span class="sourceLineNo">2102</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2102"></a>
-<span class="sourceLineNo">2103</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2103"></a>
-<span class="sourceLineNo">2104</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2104"></a>
-<span class="sourceLineNo">2105</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2105"></a>
-<span class="sourceLineNo">2106</span> * means that this function can return 2N + 1 different values<a name="line.2106"></a>
-<span class="sourceLineNo">2107</span> * ranging from -(N + 1) to N - 1.<a name="line.2107"></a>
-<span class="sourceLineNo">2108</span> * @return the index of the block<a name="line.2108"></a>
-<span class="sourceLineNo">2109</span> * @deprecated Use {@link Bytes#binarySearch(Cell[], Cell, CellComparator)}<a name="line.2109"></a>
-<span class="sourceLineNo">2110</span> */<a name="line.2110"></a>
-<span class="sourceLineNo">2111</span> @Deprecated<a name="line.2111"></a>
-<span class="sourceLineNo">2112</span> public static int binarySearch(byte[][] arr, Cell key, RawComparator<Cell> comparator) {<a name="line.2112"></a>
-<span class="sourceLineNo">2113</span> int low = 0;<a name="line.2113"></a>
-<span class="sourceLineNo">2114</span> int high = arr.length - 1;<a name="line.2114"></a>
-<span class="sourceLineNo">2115</span> KeyValue.KeyOnlyKeyValue r = new KeyValue.KeyOnlyKeyValue();<a name="line.2115"></a>
-<span class="sourceLineNo">2116</span> while (low <= high) {<a name="line.2116"></a>
-<span class="sourceLineNo">2117</span>
<TRUNCATED>
[19/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
Published site at 82d554e3783372cc6b05489452c815b57c06f6cd.
Project: http://git-wip-us.apache.org/repos/asf/hbase-site/repo
Commit: http://git-wip-us.apache.org/repos/asf/hbase-site/commit/f9332e6e
Tree: http://git-wip-us.apache.org/repos/asf/hbase-site/tree/f9332e6e
Diff: http://git-wip-us.apache.org/repos/asf/hbase-site/diff/f9332e6e
Branch: refs/heads/asf-site
Commit: f9332e6e2c57030e9bf9d7dee0ef615e7246eab4
Parents: 74b941d
Author: jenkins <bu...@apache.org>
Authored: Thu Apr 27 22:53:00 2017 +0000
Committer: jenkins <bu...@apache.org>
Committed: Thu Apr 27 22:53:00 2017 +0000
----------------------------------------------------------------------
apache_hbase_reference_guide.pdf | 4 +-
apache_hbase_reference_guide.pdfmarks | 4 +-
.../hadoop/hbase/util/ByteBufferUtils.html | 40 +-
apidocs/org/apache/hadoop/hbase/util/Bytes.html | 108 +-
.../hadoop/hbase/util/ByteBufferUtils.html | 731 +++--
.../hbase/util/Bytes.ByteArrayComparator.html | 2137 +++++++------
.../hbase/util/Bytes.RowEndKeyComparator.html | 2137 +++++++------
.../org/apache/hadoop/hbase/util/Bytes.html | 2137 +++++++------
checkstyle-aggregate.html | 2988 +++++++++---------
checkstyle.rss | 4 +-
devapidocs/constant-values.html | 6 +-
.../tmpl/master/MasterStatusTmpl.ImplData.html | 240 +-
.../hbase/tmpl/master/MasterStatusTmpl.html | 96 +-
.../hbase/tmpl/master/MasterStatusTmplImpl.html | 48 +-
.../regionserver/RSStatusTmpl.ImplData.html | 90 +-
.../hbase/tmpl/regionserver/RSStatusTmpl.html | 36 +-
.../tmpl/regionserver/RSStatusTmplImpl.html | 18 +-
.../hadoop/hbase/util/ByteBufferUtils.html | 46 +-
.../org/apache/hadoop/hbase/util/Bytes.html | 120 +-
.../org/apache/hadoop/hbase/Version.html | 6 +-
.../tmpl/master/MasterStatusTmpl.ImplData.html | 240 +-
.../tmpl/master/MasterStatusTmpl.Intf.html | 240 +-
.../hbase/tmpl/master/MasterStatusTmpl.html | 240 +-
.../hbase/tmpl/master/MasterStatusTmplImpl.html | 64 +-
.../regionserver/RSStatusTmpl.ImplData.html | 90 +-
.../tmpl/regionserver/RSStatusTmpl.Intf.html | 90 +-
.../hbase/tmpl/regionserver/RSStatusTmpl.html | 90 +-
.../tmpl/regionserver/RSStatusTmplImpl.html | 24 +-
.../hadoop/hbase/util/ByteBufferUtils.html | 731 +++--
.../hbase/util/Bytes.ByteArrayComparator.html | 2137 +++++++------
.../hadoop/hbase/util/Bytes.Comparer.html | 2137 +++++++------
...raphicalComparerHolder.PureJavaComparer.html | 2137 +++++++------
...ographicalComparerHolder.UnsafeComparer.html | 2137 +++++++------
.../Bytes.LexicographicalComparerHolder.html | 2137 +++++++------
.../hbase/util/Bytes.RowEndKeyComparator.html | 2137 +++++++------
.../org/apache/hadoop/hbase/util/Bytes.html | 2137 +++++++------
.../hbase-client-project/dependencies.html | 2 +-
.../dependencies.html | 2 +-
hbase-spark/dependencies.html | 2 +-
39 files changed, 13854 insertions(+), 13916 deletions(-)
----------------------------------------------------------------------
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/apache_hbase_reference_guide.pdf
----------------------------------------------------------------------
diff --git a/apache_hbase_reference_guide.pdf b/apache_hbase_reference_guide.pdf
index 35524aa..2a46a38 100644
--- a/apache_hbase_reference_guide.pdf
+++ b/apache_hbase_reference_guide.pdf
@@ -5,8 +5,8 @@
/Author (Apache HBase Team)
/Creator (Asciidoctor PDF 1.5.0.alpha.6, based on Prawn 1.2.1)
/Producer (Apache HBase Team)
-/CreationDate (D:20170427175311+00'00')
-/ModDate (D:20170427175311+00'00')
+/CreationDate (D:20170427224152+00'00')
+/ModDate (D:20170427224152+00'00')
>>
endobj
2 0 obj
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/apache_hbase_reference_guide.pdfmarks
----------------------------------------------------------------------
diff --git a/apache_hbase_reference_guide.pdfmarks b/apache_hbase_reference_guide.pdfmarks
index 095197e..b489188 100644
--- a/apache_hbase_reference_guide.pdfmarks
+++ b/apache_hbase_reference_guide.pdfmarks
@@ -2,8 +2,8 @@
/Author (Apache HBase Team)
/Subject ()
/Keywords ()
- /ModDate (D:20170427175433)
- /CreationDate (D:20170427175433)
+ /ModDate (D:20170427224317)
+ /CreationDate (D:20170427224317)
/Creator (Asciidoctor PDF 1.5.0.alpha.6, based on Prawn 1.2.1)
/Producer ()
/DOCINFO pdfmark
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/apidocs/org/apache/hadoop/hbase/util/ByteBufferUtils.html
----------------------------------------------------------------------
diff --git a/apidocs/org/apache/hadoop/hbase/util/ByteBufferUtils.html b/apidocs/org/apache/hadoop/hbase/util/ByteBufferUtils.html
index 63eb9b5..45706ad 100644
--- a/apidocs/org/apache/hadoop/hbase/util/ByteBufferUtils.html
+++ b/apidocs/org/apache/hadoop/hbase/util/ByteBufferUtils.html
@@ -1234,7 +1234,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toShort</h4>
-<pre>public static short <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.791">toShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static short <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.788">toShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int offset)</pre>
<div class="block">Reads a short value at the given buffer's offset.</div>
<dl>
@@ -1252,7 +1252,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toInt</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.802">toInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer)</pre>
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.799">toInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer)</pre>
<div class="block">Reads an int value at the given buffer's current position. Also advances the buffer's position</div>
</li>
</ul>
@@ -1262,7 +1262,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toInt</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.818">toInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.815">toInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int offset)</pre>
<div class="block">Reads an int value at the given buffer's offset.</div>
<dl>
@@ -1280,7 +1280,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>readAsInt</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.836">readAsInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buf,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.833">readAsInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buf,
int offset,
int length)</pre>
<div class="block">Converts a ByteBuffer to an int value</div>
@@ -1302,7 +1302,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toLong</h4>
-<pre>public static long <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.855">toLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static long <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.852">toLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int offset)</pre>
<div class="block">Reads a long value at the given buffer's offset.</div>
<dl>
@@ -1320,7 +1320,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putInt</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.869">putInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.866">putInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int val)</pre>
<div class="block">Put an int value out to the given ByteBuffer's current position in big-endian format.
This also advances the position in buffer by int size.</div>
@@ -1337,7 +1337,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putInt</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.878">putInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.875">putInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int index,
int val)</pre>
</li>
@@ -1348,7 +1348,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toDouble</h4>
-<pre>public static double <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.892">toDouble</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static double <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.889">toDouble</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int offset)</pre>
<div class="block">Reads a double value at the given buffer's offset.</div>
<dl>
@@ -1366,7 +1366,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toBigDecimal</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/math/BigDecimal.html?is-external=true" title="class or interface in java.math">BigDecimal</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.902">toBigDecimal</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/math/BigDecimal.html?is-external=true" title="class or interface in java.math">BigDecimal</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.899">toBigDecimal</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int offset,
int length)</pre>
<div class="block">Reads a BigDecimal value at the given buffer's offset.</div>
@@ -1385,7 +1385,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putShort</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.920">putShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.917">putShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
short val)</pre>
<div class="block">Put a short value out to the given ByteBuffer's current position in big-endian format.
This also advances the position in buffer by short size.</div>
@@ -1402,7 +1402,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putShort</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.929">putShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.926">putShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int index,
short val)</pre>
</li>
@@ -1413,7 +1413,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putAsShort</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.937">putAsShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buf,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.934">putAsShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buf,
int index,
int val)</pre>
</li>
@@ -1424,7 +1424,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putLong</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.950">putLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.947">putLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
long val)</pre>
<div class="block">Put a long value out to the given ByteBuffer's current position in big-endian format.
This also advances the position in buffer by long size.</div>
@@ -1441,7 +1441,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putLong</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.959">putLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.956">putLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int index,
long val)</pre>
</li>
@@ -1452,7 +1452,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>copyFromArrayToBuffer</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.975">copyFromArrayToBuffer</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> out,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.972">copyFromArrayToBuffer</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> out,
byte[] in,
int inOffset,
int length)</pre>
@@ -1473,7 +1473,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>copyFromArrayToBuffer</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.997">copyFromArrayToBuffer</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> out,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.994">copyFromArrayToBuffer</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> out,
int outOffset,
byte[] in,
int inOffset,
@@ -1495,7 +1495,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>copyFromBufferToArray</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1019">copyFromBufferToArray</a>(byte[] out,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1016">copyFromBufferToArray</a>(byte[] out,
<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> in,
int sourceOffset,
int destinationOffset,
@@ -1518,7 +1518,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>copyOfRange</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1039">copyOfRange</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> original,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1036">copyOfRange</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> original,
int from,
int to)</pre>
<div class="block">Similar to <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Arrays.html?is-external=true#copyOfRange-byte:A-int-int-" title="class or interface in java.util"><code>Arrays.copyOfRange(byte[], int, int)</code></a></div>
@@ -1538,7 +1538,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toStringBinary</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1048">toStringBinary</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> b,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1045">toStringBinary</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> b,
int off,
int len)</pre>
</li>
@@ -1549,7 +1549,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockListLast">
<li class="blockList">
<h4>toStringBinary</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1067">toStringBinary</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> b)</pre>
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1064">toStringBinary</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> b)</pre>
</li>
</ul>
</li>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/apidocs/org/apache/hadoop/hbase/util/Bytes.html
----------------------------------------------------------------------
diff --git a/apidocs/org/apache/hadoop/hbase/util/Bytes.html b/apidocs/org/apache/hadoop/hbase/util/Bytes.html
index 7f307cc..7921895 100644
--- a/apidocs/org/apache/hadoop/hbase/util/Bytes.html
+++ b/apidocs/org/apache/hadoop/hbase/util/Bytes.html
@@ -2877,7 +2877,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>equals</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1633">equals</a>(byte[] left,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1628">equals</a>(byte[] left,
byte[] right)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -2894,7 +2894,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>equals</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1649">equals</a>(byte[] left,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1644">equals</a>(byte[] left,
int leftOffset,
int leftLen,
byte[] right,
@@ -2908,7 +2908,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>equals</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1680">equals</a>(byte[] a,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1675">equals</a>(byte[] a,
<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buf)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -2925,7 +2925,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>startsWith</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1700">startsWith</a>(byte[] bytes,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1695">startsWith</a>(byte[] bytes,
byte[] prefix)</pre>
<div class="block">Return true if the byte array on the right is a prefix of the byte
array on the left.</div>
@@ -2937,7 +2937,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>hashCode</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1713">hashCode</a>(byte[] b)</pre>
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1708">hashCode</a>(byte[] b)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>b</code> - bytes to hash</dd>
@@ -2954,7 +2954,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>hashCode</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1724">hashCode</a>(byte[] b,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1719">hashCode</a>(byte[] b,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -2973,7 +2973,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>mapKey</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1733">mapKey</a>(byte[] b)</pre>
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1728">mapKey</a>(byte[] b)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>b</code> - bytes to hash</dd>
@@ -2989,7 +2989,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>mapKey</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1743">mapKey</a>(byte[] b,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1738">mapKey</a>(byte[] b,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3007,7 +3007,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1752">add</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1747">add</a>(byte[] a,
byte[] b)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3024,7 +3024,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1762">add</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1757">add</a>(byte[] a,
byte[] b,
byte[] c)</pre>
<dl>
@@ -3043,7 +3043,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1774">add</a>(byte[][] arrays)</pre>
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1769">add</a>(byte[][] arrays)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>arrays</code> - all the arrays to concatenate together.</dd>
@@ -3058,7 +3058,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>head</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1793">head</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1788">head</a>(byte[] a,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3075,7 +3075,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>tail</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1807">tail</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1802">tail</a>(byte[] a,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3092,7 +3092,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>padHead</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1821">padHead</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1816">padHead</a>(byte[] a,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3109,7 +3109,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>padTail</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1834">padTail</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1829">padTail</a>(byte[] a,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3126,7 +3126,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>split</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1851">split</a>(byte[] a,
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1846">split</a>(byte[] a,
byte[] b,
int num)</pre>
<div class="block">Split passed range. Expensive operation relatively. Uses BigInteger math.
@@ -3148,7 +3148,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>split</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1867">split</a>(byte[] a,
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1862">split</a>(byte[] a,
byte[] b,
boolean inclusive,
int num)</pre>
@@ -3174,7 +3174,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>iterateOnSplits</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Iterable.html?is-external=true" title="class or interface in java.lang">Iterable</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1883">iterateOnSplits</a>(byte[] a,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Iterable.html?is-external=true" title="class or interface in java.lang">Iterable</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1878">iterateOnSplits</a>(byte[] a,
byte[] b,
int num)</pre>
<div class="block">Iterate over keys within the passed range, splitting at an [a,b) boundary.</div>
@@ -3186,7 +3186,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>iterateOnSplits</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Iterable.html?is-external=true" title="class or interface in java.lang">Iterable</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1892">iterateOnSplits</a>(byte[] a,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Iterable.html?is-external=true" title="class or interface in java.lang">Iterable</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1887">iterateOnSplits</a>(byte[] a,
byte[] b,
boolean inclusive,
int num)</pre>
@@ -3199,7 +3199,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>hashCode</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1986">hashCode</a>(byte[] bytes,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1981">hashCode</a>(byte[] bytes,
int offset,
int length)</pre>
<dl>
@@ -3216,7 +3216,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>toByteArrays</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1997">toByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>[] t)</pre>
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1992">toByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>[] t)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>t</code> - operands</dd>
@@ -3231,7 +3231,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>toBinaryByteArrays</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2009">toBinaryByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>[] t)</pre>
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2004">toBinaryByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>[] t)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>t</code> - operands</dd>
@@ -3246,7 +3246,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>toByteArrays</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2022">toByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> column)</pre>
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2017">toByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> column)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>column</code> - operand</dd>
@@ -3262,7 +3262,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>toByteArrays</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2031">toByteArrays</a>(byte[] column)</pre>
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2026">toByteArrays</a>(byte[] column)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>column</code> - operand</dd>
@@ -3279,7 +3279,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<li class="blockList">
<h4>binarySearch</h4>
<pre><a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Deprecated.html?is-external=true" title="class or interface in java.lang">@Deprecated</a>
-public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2054">binarySearch</a>(byte[][] arr,
+public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2049">binarySearch</a>(byte[][] arr,
byte[] key,
int offset,
int length,
@@ -3309,7 +3309,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>binarySearch</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2073">binarySearch</a>(byte[][] arr,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2068">binarySearch</a>(byte[][] arr,
byte[] key,
int offset,
int length)</pre>
@@ -3337,7 +3337,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<li class="blockList">
<h4>binarySearch</h4>
<pre><a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Deprecated.html?is-external=true" title="class or interface in java.lang">@Deprecated</a>
-public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2112">binarySearch</a>(byte[][] arr,
+public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2107">binarySearch</a>(byte[][] arr,
<a href="../../../../../org/apache/hadoop/hbase/Cell.html" title="interface in org.apache.hadoop.hbase">Cell</a> key,
org.apache.hadoop.io.RawComparator<<a href="../../../../../org/apache/hadoop/hbase/Cell.html" title="interface in org.apache.hadoop.hbase">Cell</a>> comparator)</pre>
<div class="block"><span class="deprecatedLabel">Deprecated.</span> <span class="deprecationComment">Use <a href="../../../../../org/apache/hadoop/hbase/util/Bytes.html#binarySearch-org.apache.hadoop.hbase.Cell:A-org.apache.hadoop.hbase.Cell-org.apache.hadoop.hbase.CellComparator-"><code>binarySearch(Cell[], Cell, CellComparator)</code></a></span></div>
@@ -3363,7 +3363,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>binarySearch</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2149">binarySearch</a>(<a href="../../../../../org/apache/hadoop/hbase/Cell.html" title="interface in org.apache.hadoop.hbase">Cell</a>[] arr,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2144">binarySearch</a>(<a href="../../../../../org/apache/hadoop/hbase/Cell.html" title="interface in org.apache.hadoop.hbase">Cell</a>[] arr,
<a href="../../../../../org/apache/hadoop/hbase/Cell.html" title="interface in org.apache.hadoop.hbase">Cell</a> key,
org.apache.hadoop.hbase.CellComparator comparator)</pre>
<div class="block">Binary search for keys in indexes.</div>
@@ -3388,7 +3388,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>incrementBytes</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2178">incrementBytes</a>(byte[] value,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2173">incrementBytes</a>(byte[] value,
long amount)</pre>
<div class="block">Bytewise binary increment/deincrement of long contained in byte array
on given amount.</div>
@@ -3407,7 +3407,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>writeStringFixedSize</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2256">writeStringFixedSize</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/io/DataOutput.html?is-external=true" title="class or interface in java.io">DataOutput</a> out,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2251">writeStringFixedSize</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/io/DataOutput.html?is-external=true" title="class or interface in java.io">DataOutput</a> out,
<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> s,
int size)
throws <a href="http://docs.oracle.com/javase/8/docs/api/java/io/IOException.html?is-external=true" title="class or interface in java.io">IOException</a></pre>
@@ -3424,7 +3424,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>readStringFixedSize</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2272">readStringFixedSize</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/io/DataInput.html?is-external=true" title="class or interface in java.io">DataInput</a> in,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2267">readStringFixedSize</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/io/DataInput.html?is-external=true" title="class or interface in java.io">DataInput</a> in,
int size)
throws <a href="http://docs.oracle.com/javase/8/docs/api/java/io/IOException.html?is-external=true" title="class or interface in java.io">IOException</a></pre>
<div class="block">Reads a fixed-size field and interprets it as a string padded with zeros.</div>
@@ -3440,7 +3440,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>copy</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2289">copy</a>(byte[] bytes)</pre>
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2284">copy</a>(byte[] bytes)</pre>
<div class="block">Copy the byte array given in parameter and return an instance
of a new byte array with the same length and the same content.</div>
<dl>
@@ -3457,7 +3457,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>copy</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2304">copy</a>(byte[] bytes,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2299">copy</a>(byte[] bytes,
int offset,
int length)</pre>
<div class="block">Copy the byte array given in parameter and return an instance
@@ -3478,7 +3478,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>unsignedBinarySearch</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2321">unsignedBinarySearch</a>(byte[] a,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2316">unsignedBinarySearch</a>(byte[] a,
int fromIndex,
int toIndex,
byte key)</pre>
@@ -3502,7 +3502,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>unsignedCopyAndIncrement</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2348">unsignedCopyAndIncrement</a>(byte[] input)</pre>
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2343">unsignedCopyAndIncrement</a>(byte[] input)</pre>
<div class="block">Treat the byte[] as an unsigned series of bytes, most significant bits first. Start by adding
1 to the rightmost bit/byte and carry over all overflows to the more significant bits/bytes.</div>
<dl>
@@ -3519,7 +3519,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>equals</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2368">equals</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><byte[]> a,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2363">equals</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><byte[]> a,
<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><byte[]> b)</pre>
</li>
</ul>
@@ -3529,7 +3529,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>isSorted</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2389">isSorted</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Collection.html?is-external=true" title="class or interface in java.util">Collection</a><byte[]> arrays)</pre>
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2384">isSorted</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Collection.html?is-external=true" title="class or interface in java.util">Collection</a><byte[]> arrays)</pre>
</li>
</ul>
<a name="getUtf8ByteArrays-java.util.List-">
@@ -3538,7 +3538,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>getUtf8ByteArrays</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2400">getUtf8ByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>> strings)</pre>
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2395">getUtf8ByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>> strings)</pre>
</li>
</ul>
<a name="indexOf-byte:A-byte-">
@@ -3547,7 +3547,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>indexOf</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2417">indexOf</a>(byte[] array,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2412">indexOf</a>(byte[] array,
byte target)</pre>
<div class="block">Returns the index of the first appearance of the value <code>target</code> in
<code>array</code>.</div>
@@ -3567,7 +3567,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>indexOf</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2437">indexOf</a>(byte[] array,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2432">indexOf</a>(byte[] array,
byte[] target)</pre>
<div class="block">Returns the start position of the first occurrence of the specified <code>target</code> within <code>array</code>, or <code>-1</code> if there is no such occurrence.
@@ -3586,7 +3586,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>contains</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2461">contains</a>(byte[] array,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2456">contains</a>(byte[] array,
byte target)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3603,7 +3603,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>contains</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2470">contains</a>(byte[] array,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2465">contains</a>(byte[] array,
byte[] target)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3620,7 +3620,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>zero</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2478">zero</a>(byte[] b)</pre>
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2473">zero</a>(byte[] b)</pre>
<div class="block">Fill given array with zeros.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3634,7 +3634,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>zero</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2488">zero</a>(byte[] b,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2483">zero</a>(byte[] b,
int offset,
int length)</pre>
<div class="block">Fill given array with zeros at the specified position.</div>
@@ -3652,7 +3652,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>random</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2501">random</a>(byte[] b)</pre>
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2496">random</a>(byte[] b)</pre>
<div class="block">Fill given array with random bytes.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3666,7 +3666,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>random</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2511">random</a>(byte[] b,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2506">random</a>(byte[] b,
int offset,
int length)</pre>
<div class="block">Fill given array with random bytes at the specified position.</div>
@@ -3684,7 +3684,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>createMaxByteArray</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2525">createMaxByteArray</a>(int maxByteCount)</pre>
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2520">createMaxByteArray</a>(int maxByteCount)</pre>
<div class="block">Create a max byte array with the specified max byte count</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3700,7 +3700,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>multiple</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2539">multiple</a>(byte[] srcBytes,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2534">multiple</a>(byte[] srcBytes,
int multiNum)</pre>
<div class="block">Create a byte array which is multiple given bytes</div>
<dl>
@@ -3718,7 +3718,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>toHex</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2558">toHex</a>(byte[] b,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2553">toHex</a>(byte[] b,
int offset,
int length)</pre>
<div class="block">Convert a byte range into a hex string</div>
@@ -3730,7 +3730,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>toHex</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2574">toHex</a>(byte[] b)</pre>
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2569">toHex</a>(byte[] b)</pre>
<div class="block">Convert a byte array into a hex string</div>
</li>
</ul>
@@ -3740,7 +3740,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>fromHex</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2598">fromHex</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> hex)</pre>
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2593">fromHex</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> hex)</pre>
<div class="block">Create a byte array from a string of hash digits. The length of the
string must be a multiple of 2</div>
<dl>
@@ -3755,7 +3755,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>searchDelimiterIndex</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2613">searchDelimiterIndex</a>(byte[] b,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2608">searchDelimiterIndex</a>(byte[] b,
int offset,
int length,
int delimiter)</pre>
@@ -3774,7 +3774,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>searchDelimiterIndexInReverse</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2635">searchDelimiterIndexInReverse</a>(byte[] b,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2630">searchDelimiterIndexInReverse</a>(byte[] b,
int offset,
int length,
int delimiter)</pre>
@@ -3794,7 +3794,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockListLast">
<li class="blockList">
<h4>findCommonPrefix</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2650">findCommonPrefix</a>(byte[] left,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2645">findCommonPrefix</a>(byte[] left,
byte[] right,
int leftLength,
int rightLength,
[04/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.html b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.html
index 3c7d6b4..3dea877 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.html
@@ -1583,1089 +1583,1084 @@
<span class="sourceLineNo">1575</span> length1 == length2) {<a name="line.1575"></a>
<span class="sourceLineNo">1576</span> return 0;<a name="line.1576"></a>
<span class="sourceLineNo">1577</span> }<a name="line.1577"></a>
-<span class="sourceLineNo">1578</span> final int minLength = Math.min(length1, length2);<a name="line.1578"></a>
-<span class="sourceLineNo">1579</span> final int minWords = minLength / SIZEOF_LONG;<a name="line.1579"></a>
-<span class="sourceLineNo">1580</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1580"></a>
-<span class="sourceLineNo">1581</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
-<span class="sourceLineNo">1582</span><a name="line.1582"></a>
-<span class="sourceLineNo">1583</span> /*<a name="line.1583"></a>
-<span class="sourceLineNo">1584</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a<a name="line.1584"></a>
-<span class="sourceLineNo">1585</span> * time is no slower than comparing 4 bytes at a time even on 32-bit.<a name="line.1585"></a>
-<span class="sourceLineNo">1586</span> * On the other hand, it is substantially faster on 64-bit.<a name="line.1586"></a>
-<span class="sourceLineNo">1587</span> */<a name="line.1587"></a>
-<span class="sourceLineNo">1588</span> // This is the end offset of long parts.<a name="line.1588"></a>
-<span class="sourceLineNo">1589</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.1589"></a>
-<span class="sourceLineNo">1590</span> for (int i = 0; i < j; i += SIZEOF_LONG) {<a name="line.1590"></a>
-<span class="sourceLineNo">1591</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1591"></a>
-<span class="sourceLineNo">1592</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1592"></a>
-<span class="sourceLineNo">1593</span> long diff = lw ^ rw;<a name="line.1593"></a>
-<span class="sourceLineNo">1594</span> if (diff != 0) {<a name="line.1594"></a>
-<span class="sourceLineNo">1595</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.1595"></a>
-<span class="sourceLineNo">1596</span> }<a name="line.1596"></a>
-<span class="sourceLineNo">1597</span> }<a name="line.1597"></a>
-<span class="sourceLineNo">1598</span> int offset = j;<a name="line.1598"></a>
-<span class="sourceLineNo">1599</span><a name="line.1599"></a>
-<span class="sourceLineNo">1600</span> if (minLength - offset >= SIZEOF_INT) {<a name="line.1600"></a>
-<span class="sourceLineNo">1601</span> int il = theUnsafe.getInt(buffer1, offset1Adj + offset);<a name="line.1601"></a>
-<span class="sourceLineNo">1602</span> int ir = theUnsafe.getInt(buffer2, offset2Adj + offset);<a name="line.1602"></a>
-<span class="sourceLineNo">1603</span> if (il != ir) {<a name="line.1603"></a>
-<span class="sourceLineNo">1604</span> return lessThanUnsignedInt(il, ir) ? -1: 1;<a name="line.1604"></a>
-<span class="sourceLineNo">1605</span> }<a name="line.1605"></a>
-<span class="sourceLineNo">1606</span> offset += SIZEOF_INT;<a name="line.1606"></a>
-<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
-<span class="sourceLineNo">1608</span> if (minLength - offset >= SIZEOF_SHORT) {<a name="line.1608"></a>
-<span class="sourceLineNo">1609</span> short sl = theUnsafe.getShort(buffer1, offset1Adj + offset);<a name="line.1609"></a>
-<span class="sourceLineNo">1610</span> short sr = theUnsafe.getShort(buffer2, offset2Adj + offset);<a name="line.1610"></a>
-<span class="sourceLineNo">1611</span> if (sl != sr) {<a name="line.1611"></a>
-<span class="sourceLineNo">1612</span> return lessThanUnsignedShort(sl, sr) ? -1: 1;<a name="line.1612"></a>
-<span class="sourceLineNo">1613</span> }<a name="line.1613"></a>
-<span class="sourceLineNo">1614</span> offset += SIZEOF_SHORT;<a name="line.1614"></a>
-<span class="sourceLineNo">1615</span> }<a name="line.1615"></a>
-<span class="sourceLineNo">1616</span> if (minLength - offset == 1) {<a name="line.1616"></a>
-<span class="sourceLineNo">1617</span> int a = (buffer1[(int)(offset1 + offset)] & 0xff);<a name="line.1617"></a>
-<span class="sourceLineNo">1618</span> int b = (buffer2[(int)(offset2 + offset)] & 0xff);<a name="line.1618"></a>
-<span class="sourceLineNo">1619</span> if (a != b) {<a name="line.1619"></a>
-<span class="sourceLineNo">1620</span> return a - b;<a name="line.1620"></a>
-<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
-<span class="sourceLineNo">1622</span> }<a name="line.1622"></a>
-<span class="sourceLineNo">1623</span> return length1 - length2;<a name="line.1623"></a>
-<span class="sourceLineNo">1624</span> }<a name="line.1624"></a>
-<span class="sourceLineNo">1625</span> }<a name="line.1625"></a>
-<span class="sourceLineNo">1626</span> }<a name="line.1626"></a>
-<span class="sourceLineNo">1627</span><a name="line.1627"></a>
-<span class="sourceLineNo">1628</span> /**<a name="line.1628"></a>
-<span class="sourceLineNo">1629</span> * @param left left operand<a name="line.1629"></a>
-<span class="sourceLineNo">1630</span> * @param right right operand<a name="line.1630"></a>
-<span class="sourceLineNo">1631</span> * @return True if equal<a name="line.1631"></a>
-<span class="sourceLineNo">1632</span> */<a name="line.1632"></a>
-<span class="sourceLineNo">1633</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1633"></a>
-<span class="sourceLineNo">1634</span> // Could use Arrays.equals?<a name="line.1634"></a>
-<span class="sourceLineNo">1635</span> //noinspection SimplifiableConditionalExpression<a name="line.1635"></a>
-<span class="sourceLineNo">1636</span> if (left == right) return true;<a name="line.1636"></a>
-<span class="sourceLineNo">1637</span> if (left == null || right == null) return false;<a name="line.1637"></a>
-<span class="sourceLineNo">1638</span> if (left.length != right.length) return false;<a name="line.1638"></a>
-<span class="sourceLineNo">1639</span> if (left.length == 0) return true;<a name="line.1639"></a>
+<span class="sourceLineNo">1578</span> final int stride = 8;<a name="line.1578"></a>
+<span class="sourceLineNo">1579</span> final int minLength = Math.min(length1, length2);<a name="line.1579"></a>
+<span class="sourceLineNo">1580</span> int strideLimit = minLength & ~(stride - 1);<a name="line.1580"></a>
+<span class="sourceLineNo">1581</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
+<span class="sourceLineNo">1582</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1582"></a>
+<span class="sourceLineNo">1583</span> int i;<a name="line.1583"></a>
+<span class="sourceLineNo">1584</span><a name="line.1584"></a>
+<span class="sourceLineNo">1585</span> /*<a name="line.1585"></a>
+<span class="sourceLineNo">1586</span> * Compare 8 bytes at a time. Benchmarking on x86 shows a stride of 8 bytes is no slower<a name="line.1586"></a>
+<span class="sourceLineNo">1587</span> * than 4 bytes even on 32-bit. On the other hand, it is substantially faster on 64-bit.<a name="line.1587"></a>
+<span class="sourceLineNo">1588</span> */<a name="line.1588"></a>
+<span class="sourceLineNo">1589</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.1589"></a>
+<span class="sourceLineNo">1590</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1590"></a>
+<span class="sourceLineNo">1591</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1591"></a>
+<span class="sourceLineNo">1592</span> if (lw != rw) {<a name="line.1592"></a>
+<span class="sourceLineNo">1593</span> if(!UnsafeAccess.littleEndian) {<a name="line.1593"></a>
+<span class="sourceLineNo">1594</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.1594"></a>
+<span class="sourceLineNo">1595</span> }<a name="line.1595"></a>
+<span class="sourceLineNo">1596</span><a name="line.1596"></a>
+<span class="sourceLineNo">1597</span> /*<a name="line.1597"></a>
+<span class="sourceLineNo">1598</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.1598"></a>
+<span class="sourceLineNo">1599</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.1599"></a>
+<span class="sourceLineNo">1600</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.1600"></a>
+<span class="sourceLineNo">1601</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.1601"></a>
+<span class="sourceLineNo">1602</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.1602"></a>
+<span class="sourceLineNo">1603</span> * comparator from guava v21<a name="line.1603"></a>
+<span class="sourceLineNo">1604</span> */<a name="line.1604"></a>
+<span class="sourceLineNo">1605</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.1605"></a>
+<span class="sourceLineNo">1606</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.1606"></a>
+<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
+<span class="sourceLineNo">1608</span> }<a name="line.1608"></a>
+<span class="sourceLineNo">1609</span><a name="line.1609"></a>
+<span class="sourceLineNo">1610</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.1610"></a>
+<span class="sourceLineNo">1611</span> for (; i < minLength; i++) {<a name="line.1611"></a>
+<span class="sourceLineNo">1612</span> int a = (buffer1[offset1 + i] & 0xFF);<a name="line.1612"></a>
+<span class="sourceLineNo">1613</span> int b = (buffer2[offset2 + i] & 0xFF);<a name="line.1613"></a>
+<span class="sourceLineNo">1614</span> if (a != b) {<a name="line.1614"></a>
+<span class="sourceLineNo">1615</span> return a - b;<a name="line.1615"></a>
+<span class="sourceLineNo">1616</span> }<a name="line.1616"></a>
+<span class="sourceLineNo">1617</span> }<a name="line.1617"></a>
+<span class="sourceLineNo">1618</span> return length1 - length2;<a name="line.1618"></a>
+<span class="sourceLineNo">1619</span> }<a name="line.1619"></a>
+<span class="sourceLineNo">1620</span> }<a name="line.1620"></a>
+<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
+<span class="sourceLineNo">1622</span><a name="line.1622"></a>
+<span class="sourceLineNo">1623</span> /**<a name="line.1623"></a>
+<span class="sourceLineNo">1624</span> * @param left left operand<a name="line.1624"></a>
+<span class="sourceLineNo">1625</span> * @param right right operand<a name="line.1625"></a>
+<span class="sourceLineNo">1626</span> * @return True if equal<a name="line.1626"></a>
+<span class="sourceLineNo">1627</span> */<a name="line.1627"></a>
+<span class="sourceLineNo">1628</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1628"></a>
+<span class="sourceLineNo">1629</span> // Could use Arrays.equals?<a name="line.1629"></a>
+<span class="sourceLineNo">1630</span> //noinspection SimplifiableConditionalExpression<a name="line.1630"></a>
+<span class="sourceLineNo">1631</span> if (left == right) return true;<a name="line.1631"></a>
+<span class="sourceLineNo">1632</span> if (left == null || right == null) return false;<a name="line.1632"></a>
+<span class="sourceLineNo">1633</span> if (left.length != right.length) return false;<a name="line.1633"></a>
+<span class="sourceLineNo">1634</span> if (left.length == 0) return true;<a name="line.1634"></a>
+<span class="sourceLineNo">1635</span><a name="line.1635"></a>
+<span class="sourceLineNo">1636</span> // Since we're often comparing adjacent sorted data,<a name="line.1636"></a>
+<span class="sourceLineNo">1637</span> // it's usual to have equal arrays except for the very last byte<a name="line.1637"></a>
+<span class="sourceLineNo">1638</span> // so check that first<a name="line.1638"></a>
+<span class="sourceLineNo">1639</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1639"></a>
<span class="sourceLineNo">1640</span><a name="line.1640"></a>
-<span class="sourceLineNo">1641</span> // Since we're often comparing adjacent sorted data,<a name="line.1641"></a>
-<span class="sourceLineNo">1642</span> // it's usual to have equal arrays except for the very last byte<a name="line.1642"></a>
-<span class="sourceLineNo">1643</span> // so check that first<a name="line.1643"></a>
-<span class="sourceLineNo">1644</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1644"></a>
-<span class="sourceLineNo">1645</span><a name="line.1645"></a>
-<span class="sourceLineNo">1646</span> return compareTo(left, right) == 0;<a name="line.1646"></a>
-<span class="sourceLineNo">1647</span> }<a name="line.1647"></a>
-<span class="sourceLineNo">1648</span><a name="line.1648"></a>
-<span class="sourceLineNo">1649</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1649"></a>
-<span class="sourceLineNo">1650</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1650"></a>
-<span class="sourceLineNo">1651</span> // short circuit case<a name="line.1651"></a>
-<span class="sourceLineNo">1652</span> if (left == right &&<a name="line.1652"></a>
-<span class="sourceLineNo">1653</span> leftOffset == rightOffset &&<a name="line.1653"></a>
-<span class="sourceLineNo">1654</span> leftLen == rightLen) {<a name="line.1654"></a>
-<span class="sourceLineNo">1655</span> return true;<a name="line.1655"></a>
-<span class="sourceLineNo">1656</span> }<a name="line.1656"></a>
-<span class="sourceLineNo">1657</span> // different lengths fast check<a name="line.1657"></a>
-<span class="sourceLineNo">1658</span> if (leftLen != rightLen) {<a name="line.1658"></a>
-<span class="sourceLineNo">1659</span> return false;<a name="line.1659"></a>
-<span class="sourceLineNo">1660</span> }<a name="line.1660"></a>
-<span class="sourceLineNo">1661</span> if (leftLen == 0) {<a name="line.1661"></a>
-<span class="sourceLineNo">1662</span> return true;<a name="line.1662"></a>
-<span class="sourceLineNo">1663</span> }<a name="line.1663"></a>
+<span class="sourceLineNo">1641</span> return compareTo(left, right) == 0;<a name="line.1641"></a>
+<span class="sourceLineNo">1642</span> }<a name="line.1642"></a>
+<span class="sourceLineNo">1643</span><a name="line.1643"></a>
+<span class="sourceLineNo">1644</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1644"></a>
+<span class="sourceLineNo">1645</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1645"></a>
+<span class="sourceLineNo">1646</span> // short circuit case<a name="line.1646"></a>
+<span class="sourceLineNo">1647</span> if (left == right &&<a name="line.1647"></a>
+<span class="sourceLineNo">1648</span> leftOffset == rightOffset &&<a name="line.1648"></a>
+<span class="sourceLineNo">1649</span> leftLen == rightLen) {<a name="line.1649"></a>
+<span class="sourceLineNo">1650</span> return true;<a name="line.1650"></a>
+<span class="sourceLineNo">1651</span> }<a name="line.1651"></a>
+<span class="sourceLineNo">1652</span> // different lengths fast check<a name="line.1652"></a>
+<span class="sourceLineNo">1653</span> if (leftLen != rightLen) {<a name="line.1653"></a>
+<span class="sourceLineNo">1654</span> return false;<a name="line.1654"></a>
+<span class="sourceLineNo">1655</span> }<a name="line.1655"></a>
+<span class="sourceLineNo">1656</span> if (leftLen == 0) {<a name="line.1656"></a>
+<span class="sourceLineNo">1657</span> return true;<a name="line.1657"></a>
+<span class="sourceLineNo">1658</span> }<a name="line.1658"></a>
+<span class="sourceLineNo">1659</span><a name="line.1659"></a>
+<span class="sourceLineNo">1660</span> // Since we're often comparing adjacent sorted data,<a name="line.1660"></a>
+<span class="sourceLineNo">1661</span> // it's usual to have equal arrays except for the very last byte<a name="line.1661"></a>
+<span class="sourceLineNo">1662</span> // so check that first<a name="line.1662"></a>
+<span class="sourceLineNo">1663</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1663"></a>
<span class="sourceLineNo">1664</span><a name="line.1664"></a>
-<span class="sourceLineNo">1665</span> // Since we're often comparing adjacent sorted data,<a name="line.1665"></a>
-<span class="sourceLineNo">1666</span> // it's usual to have equal arrays except for the very last byte<a name="line.1666"></a>
-<span class="sourceLineNo">1667</span> // so check that first<a name="line.1667"></a>
-<span class="sourceLineNo">1668</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1668"></a>
+<span class="sourceLineNo">1665</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1665"></a>
+<span class="sourceLineNo">1666</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1666"></a>
+<span class="sourceLineNo">1667</span> }<a name="line.1667"></a>
+<span class="sourceLineNo">1668</span><a name="line.1668"></a>
<span class="sourceLineNo">1669</span><a name="line.1669"></a>
-<span class="sourceLineNo">1670</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1670"></a>
-<span class="sourceLineNo">1671</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1671"></a>
-<span class="sourceLineNo">1672</span> }<a name="line.1672"></a>
-<span class="sourceLineNo">1673</span><a name="line.1673"></a>
-<span class="sourceLineNo">1674</span><a name="line.1674"></a>
-<span class="sourceLineNo">1675</span> /**<a name="line.1675"></a>
-<span class="sourceLineNo">1676</span> * @param a left operand<a name="line.1676"></a>
-<span class="sourceLineNo">1677</span> * @param buf right operand<a name="line.1677"></a>
-<span class="sourceLineNo">1678</span> * @return True if equal<a name="line.1678"></a>
-<span class="sourceLineNo">1679</span> */<a name="line.1679"></a>
-<span class="sourceLineNo">1680</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1680"></a>
-<span class="sourceLineNo">1681</span> if (a == null) return buf == null;<a name="line.1681"></a>
-<span class="sourceLineNo">1682</span> if (buf == null) return false;<a name="line.1682"></a>
-<span class="sourceLineNo">1683</span> if (a.length != buf.remaining()) return false;<a name="line.1683"></a>
-<span class="sourceLineNo">1684</span><a name="line.1684"></a>
-<span class="sourceLineNo">1685</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1685"></a>
-<span class="sourceLineNo">1686</span> ByteBuffer b = buf.duplicate();<a name="line.1686"></a>
-<span class="sourceLineNo">1687</span> for (byte anA : a) {<a name="line.1687"></a>
-<span class="sourceLineNo">1688</span> if (anA != b.get()) {<a name="line.1688"></a>
-<span class="sourceLineNo">1689</span> return false;<a name="line.1689"></a>
-<span class="sourceLineNo">1690</span> }<a name="line.1690"></a>
-<span class="sourceLineNo">1691</span> }<a name="line.1691"></a>
-<span class="sourceLineNo">1692</span> return true;<a name="line.1692"></a>
-<span class="sourceLineNo">1693</span> }<a name="line.1693"></a>
-<span class="sourceLineNo">1694</span><a name="line.1694"></a>
-<span class="sourceLineNo">1695</span><a name="line.1695"></a>
-<span class="sourceLineNo">1696</span> /**<a name="line.1696"></a>
-<span class="sourceLineNo">1697</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1697"></a>
-<span class="sourceLineNo">1698</span> * array on the left.<a name="line.1698"></a>
-<span class="sourceLineNo">1699</span> */<a name="line.1699"></a>
-<span class="sourceLineNo">1700</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1700"></a>
-<span class="sourceLineNo">1701</span> return bytes != null && prefix != null &&<a name="line.1701"></a>
-<span class="sourceLineNo">1702</span> bytes.length >= prefix.length &&<a name="line.1702"></a>
-<span class="sourceLineNo">1703</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1703"></a>
-<span class="sourceLineNo">1704</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1704"></a>
-<span class="sourceLineNo">1705</span> }<a name="line.1705"></a>
-<span class="sourceLineNo">1706</span><a name="line.1706"></a>
-<span class="sourceLineNo">1707</span> /**<a name="line.1707"></a>
-<span class="sourceLineNo">1708</span> * @param b bytes to hash<a name="line.1708"></a>
-<span class="sourceLineNo">1709</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1709"></a>
-<span class="sourceLineNo">1710</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1710"></a>
-<span class="sourceLineNo">1711</span> * use calculating hash code.<a name="line.1711"></a>
-<span class="sourceLineNo">1712</span> */<a name="line.1712"></a>
-<span class="sourceLineNo">1713</span> public static int hashCode(final byte [] b) {<a name="line.1713"></a>
-<span class="sourceLineNo">1714</span> return hashCode(b, b.length);<a name="line.1714"></a>
-<span class="sourceLineNo">1715</span> }<a name="line.1715"></a>
-<span class="sourceLineNo">1716</span><a name="line.1716"></a>
-<span class="sourceLineNo">1717</span> /**<a name="line.1717"></a>
-<span class="sourceLineNo">1718</span> * @param b value<a name="line.1718"></a>
-<span class="sourceLineNo">1719</span> * @param length length of the value<a name="line.1719"></a>
-<span class="sourceLineNo">1720</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1720"></a>
-<span class="sourceLineNo">1721</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1721"></a>
-<span class="sourceLineNo">1722</span> * use calculating hash code.<a name="line.1722"></a>
-<span class="sourceLineNo">1723</span> */<a name="line.1723"></a>
-<span class="sourceLineNo">1724</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1724"></a>
-<span class="sourceLineNo">1725</span> return WritableComparator.hashBytes(b, length);<a name="line.1725"></a>
-<span class="sourceLineNo">1726</span> }<a name="line.1726"></a>
-<span class="sourceLineNo">1727</span><a name="line.1727"></a>
-<span class="sourceLineNo">1728</span> /**<a name="line.1728"></a>
-<span class="sourceLineNo">1729</span> * @param b bytes to hash<a name="line.1729"></a>
-<span class="sourceLineNo">1730</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1730"></a>
-<span class="sourceLineNo">1731</span> * Maps.<a name="line.1731"></a>
-<span class="sourceLineNo">1732</span> */<a name="line.1732"></a>
-<span class="sourceLineNo">1733</span> public static Integer mapKey(final byte [] b) {<a name="line.1733"></a>
-<span class="sourceLineNo">1734</span> return hashCode(b);<a name="line.1734"></a>
-<span class="sourceLineNo">1735</span> }<a name="line.1735"></a>
-<span class="sourceLineNo">1736</span><a name="line.1736"></a>
-<span class="sourceLineNo">1737</span> /**<a name="line.1737"></a>
-<span class="sourceLineNo">1738</span> * @param b bytes to hash<a name="line.1738"></a>
-<span class="sourceLineNo">1739</span> * @param length length to hash<a name="line.1739"></a>
-<span class="sourceLineNo">1740</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1740"></a>
-<span class="sourceLineNo">1741</span> * Maps.<a name="line.1741"></a>
-<span class="sourceLineNo">1742</span> */<a name="line.1742"></a>
-<span class="sourceLineNo">1743</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1743"></a>
-<span class="sourceLineNo">1744</span> return hashCode(b, length);<a name="line.1744"></a>
-<span class="sourceLineNo">1745</span> }<a name="line.1745"></a>
-<span class="sourceLineNo">1746</span><a name="line.1746"></a>
-<span class="sourceLineNo">1747</span> /**<a name="line.1747"></a>
-<span class="sourceLineNo">1748</span> * @param a lower half<a name="line.1748"></a>
-<span class="sourceLineNo">1749</span> * @param b upper half<a name="line.1749"></a>
-<span class="sourceLineNo">1750</span> * @return New array that has a in lower half and b in upper half.<a name="line.1750"></a>
-<span class="sourceLineNo">1751</span> */<a name="line.1751"></a>
-<span class="sourceLineNo">1752</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1752"></a>
-<span class="sourceLineNo">1753</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1753"></a>
-<span class="sourceLineNo">1754</span> }<a name="line.1754"></a>
-<span class="sourceLineNo">1755</span><a name="line.1755"></a>
-<span class="sourceLineNo">1756</span> /**<a name="line.1756"></a>
-<span class="sourceLineNo">1757</span> * @param a first third<a name="line.1757"></a>
-<span class="sourceLineNo">1758</span> * @param b second third<a name="line.1758"></a>
-<span class="sourceLineNo">1759</span> * @param c third third<a name="line.1759"></a>
-<span class="sourceLineNo">1760</span> * @return New array made from a, b and c<a name="line.1760"></a>
-<span class="sourceLineNo">1761</span> */<a name="line.1761"></a>
-<span class="sourceLineNo">1762</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1762"></a>
-<span class="sourceLineNo">1763</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1763"></a>
-<span class="sourceLineNo">1764</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1764"></a>
-<span class="sourceLineNo">1765</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1765"></a>
-<span class="sourceLineNo">1766</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1766"></a>
-<span class="sourceLineNo">1767</span> return result;<a name="line.1767"></a>
-<span class="sourceLineNo">1768</span> }<a name="line.1768"></a>
-<span class="sourceLineNo">1769</span><a name="line.1769"></a>
-<span class="sourceLineNo">1770</span> /**<a name="line.1770"></a>
-<span class="sourceLineNo">1771</span> * @param arrays all the arrays to concatenate together.<a name="line.1771"></a>
-<span class="sourceLineNo">1772</span> * @return New array made from the concatenation of the given arrays.<a name="line.1772"></a>
-<span class="sourceLineNo">1773</span> */<a name="line.1773"></a>
-<span class="sourceLineNo">1774</span> public static byte [] add(final byte [][] arrays) {<a name="line.1774"></a>
-<span class="sourceLineNo">1775</span> int length = 0;<a name="line.1775"></a>
+<span class="sourceLineNo">1670</span> /**<a name="line.1670"></a>
+<span class="sourceLineNo">1671</span> * @param a left operand<a name="line.1671"></a>
+<span class="sourceLineNo">1672</span> * @param buf right operand<a name="line.1672"></a>
+<span class="sourceLineNo">1673</span> * @return True if equal<a name="line.1673"></a>
+<span class="sourceLineNo">1674</span> */<a name="line.1674"></a>
+<span class="sourceLineNo">1675</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1675"></a>
+<span class="sourceLineNo">1676</span> if (a == null) return buf == null;<a name="line.1676"></a>
+<span class="sourceLineNo">1677</span> if (buf == null) return false;<a name="line.1677"></a>
+<span class="sourceLineNo">1678</span> if (a.length != buf.remaining()) return false;<a name="line.1678"></a>
+<span class="sourceLineNo">1679</span><a name="line.1679"></a>
+<span class="sourceLineNo">1680</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1680"></a>
+<span class="sourceLineNo">1681</span> ByteBuffer b = buf.duplicate();<a name="line.1681"></a>
+<span class="sourceLineNo">1682</span> for (byte anA : a) {<a name="line.1682"></a>
+<span class="sourceLineNo">1683</span> if (anA != b.get()) {<a name="line.1683"></a>
+<span class="sourceLineNo">1684</span> return false;<a name="line.1684"></a>
+<span class="sourceLineNo">1685</span> }<a name="line.1685"></a>
+<span class="sourceLineNo">1686</span> }<a name="line.1686"></a>
+<span class="sourceLineNo">1687</span> return true;<a name="line.1687"></a>
+<span class="sourceLineNo">1688</span> }<a name="line.1688"></a>
+<span class="sourceLineNo">1689</span><a name="line.1689"></a>
+<span class="sourceLineNo">1690</span><a name="line.1690"></a>
+<span class="sourceLineNo">1691</span> /**<a name="line.1691"></a>
+<span class="sourceLineNo">1692</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1692"></a>
+<span class="sourceLineNo">1693</span> * array on the left.<a name="line.1693"></a>
+<span class="sourceLineNo">1694</span> */<a name="line.1694"></a>
+<span class="sourceLineNo">1695</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1695"></a>
+<span class="sourceLineNo">1696</span> return bytes != null && prefix != null &&<a name="line.1696"></a>
+<span class="sourceLineNo">1697</span> bytes.length >= prefix.length &&<a name="line.1697"></a>
+<span class="sourceLineNo">1698</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1698"></a>
+<span class="sourceLineNo">1699</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1699"></a>
+<span class="sourceLineNo">1700</span> }<a name="line.1700"></a>
+<span class="sourceLineNo">1701</span><a name="line.1701"></a>
+<span class="sourceLineNo">1702</span> /**<a name="line.1702"></a>
+<span class="sourceLineNo">1703</span> * @param b bytes to hash<a name="line.1703"></a>
+<span class="sourceLineNo">1704</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1704"></a>
+<span class="sourceLineNo">1705</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1705"></a>
+<span class="sourceLineNo">1706</span> * use calculating hash code.<a name="line.1706"></a>
+<span class="sourceLineNo">1707</span> */<a name="line.1707"></a>
+<span class="sourceLineNo">1708</span> public static int hashCode(final byte [] b) {<a name="line.1708"></a>
+<span class="sourceLineNo">1709</span> return hashCode(b, b.length);<a name="line.1709"></a>
+<span class="sourceLineNo">1710</span> }<a name="line.1710"></a>
+<span class="sourceLineNo">1711</span><a name="line.1711"></a>
+<span class="sourceLineNo">1712</span> /**<a name="line.1712"></a>
+<span class="sourceLineNo">1713</span> * @param b value<a name="line.1713"></a>
+<span class="sourceLineNo">1714</span> * @param length length of the value<a name="line.1714"></a>
+<span class="sourceLineNo">1715</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1715"></a>
+<span class="sourceLineNo">1716</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1716"></a>
+<span class="sourceLineNo">1717</span> * use calculating hash code.<a name="line.1717"></a>
+<span class="sourceLineNo">1718</span> */<a name="line.1718"></a>
+<span class="sourceLineNo">1719</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1719"></a>
+<span class="sourceLineNo">1720</span> return WritableComparator.hashBytes(b, length);<a name="line.1720"></a>
+<span class="sourceLineNo">1721</span> }<a name="line.1721"></a>
+<span class="sourceLineNo">1722</span><a name="line.1722"></a>
+<span class="sourceLineNo">1723</span> /**<a name="line.1723"></a>
+<span class="sourceLineNo">1724</span> * @param b bytes to hash<a name="line.1724"></a>
+<span class="sourceLineNo">1725</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1725"></a>
+<span class="sourceLineNo">1726</span> * Maps.<a name="line.1726"></a>
+<span class="sourceLineNo">1727</span> */<a name="line.1727"></a>
+<span class="sourceLineNo">1728</span> public static Integer mapKey(final byte [] b) {<a name="line.1728"></a>
+<span class="sourceLineNo">1729</span> return hashCode(b);<a name="line.1729"></a>
+<span class="sourceLineNo">1730</span> }<a name="line.1730"></a>
+<span class="sourceLineNo">1731</span><a name="line.1731"></a>
+<span class="sourceLineNo">1732</span> /**<a name="line.1732"></a>
+<span class="sourceLineNo">1733</span> * @param b bytes to hash<a name="line.1733"></a>
+<span class="sourceLineNo">1734</span> * @param length length to hash<a name="line.1734"></a>
+<span class="sourceLineNo">1735</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1735"></a>
+<span class="sourceLineNo">1736</span> * Maps.<a name="line.1736"></a>
+<span class="sourceLineNo">1737</span> */<a name="line.1737"></a>
+<span class="sourceLineNo">1738</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1738"></a>
+<span class="sourceLineNo">1739</span> return hashCode(b, length);<a name="line.1739"></a>
+<span class="sourceLineNo">1740</span> }<a name="line.1740"></a>
+<span class="sourceLineNo">1741</span><a name="line.1741"></a>
+<span class="sourceLineNo">1742</span> /**<a name="line.1742"></a>
+<span class="sourceLineNo">1743</span> * @param a lower half<a name="line.1743"></a>
+<span class="sourceLineNo">1744</span> * @param b upper half<a name="line.1744"></a>
+<span class="sourceLineNo">1745</span> * @return New array that has a in lower half and b in upper half.<a name="line.1745"></a>
+<span class="sourceLineNo">1746</span> */<a name="line.1746"></a>
+<span class="sourceLineNo">1747</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1747"></a>
+<span class="sourceLineNo">1748</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1748"></a>
+<span class="sourceLineNo">1749</span> }<a name="line.1749"></a>
+<span class="sourceLineNo">1750</span><a name="line.1750"></a>
+<span class="sourceLineNo">1751</span> /**<a name="line.1751"></a>
+<span class="sourceLineNo">1752</span> * @param a first third<a name="line.1752"></a>
+<span class="sourceLineNo">1753</span> * @param b second third<a name="line.1753"></a>
+<span class="sourceLineNo">1754</span> * @param c third third<a name="line.1754"></a>
+<span class="sourceLineNo">1755</span> * @return New array made from a, b and c<a name="line.1755"></a>
+<span class="sourceLineNo">1756</span> */<a name="line.1756"></a>
+<span class="sourceLineNo">1757</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1757"></a>
+<span class="sourceLineNo">1758</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1758"></a>
+<span class="sourceLineNo">1759</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1759"></a>
+<span class="sourceLineNo">1760</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1760"></a>
+<span class="sourceLineNo">1761</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1761"></a>
+<span class="sourceLineNo">1762</span> return result;<a name="line.1762"></a>
+<span class="sourceLineNo">1763</span> }<a name="line.1763"></a>
+<span class="sourceLineNo">1764</span><a name="line.1764"></a>
+<span class="sourceLineNo">1765</span> /**<a name="line.1765"></a>
+<span class="sourceLineNo">1766</span> * @param arrays all the arrays to concatenate together.<a name="line.1766"></a>
+<span class="sourceLineNo">1767</span> * @return New array made from the concatenation of the given arrays.<a name="line.1767"></a>
+<span class="sourceLineNo">1768</span> */<a name="line.1768"></a>
+<span class="sourceLineNo">1769</span> public static byte [] add(final byte [][] arrays) {<a name="line.1769"></a>
+<span class="sourceLineNo">1770</span> int length = 0;<a name="line.1770"></a>
+<span class="sourceLineNo">1771</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1771"></a>
+<span class="sourceLineNo">1772</span> length += arrays[i].length;<a name="line.1772"></a>
+<span class="sourceLineNo">1773</span> }<a name="line.1773"></a>
+<span class="sourceLineNo">1774</span> byte [] result = new byte[length];<a name="line.1774"></a>
+<span class="sourceLineNo">1775</span> int index = 0;<a name="line.1775"></a>
<span class="sourceLineNo">1776</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1776"></a>
-<span class="sourceLineNo">1777</span> length += arrays[i].length;<a name="line.1777"></a>
-<span class="sourceLineNo">1778</span> }<a name="line.1778"></a>
-<span class="sourceLineNo">1779</span> byte [] result = new byte[length];<a name="line.1779"></a>
-<span class="sourceLineNo">1780</span> int index = 0;<a name="line.1780"></a>
-<span class="sourceLineNo">1781</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1781"></a>
-<span class="sourceLineNo">1782</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1782"></a>
-<span class="sourceLineNo">1783</span> index += arrays[i].length;<a name="line.1783"></a>
-<span class="sourceLineNo">1784</span> }<a name="line.1784"></a>
-<span class="sourceLineNo">1785</span> return result;<a name="line.1785"></a>
-<span class="sourceLineNo">1786</span> }<a name="line.1786"></a>
-<span class="sourceLineNo">1787</span><a name="line.1787"></a>
-<span class="sourceLineNo">1788</span> /**<a name="line.1788"></a>
-<span class="sourceLineNo">1789</span> * @param a array<a name="line.1789"></a>
-<span class="sourceLineNo">1790</span> * @param length amount of bytes to grab<a name="line.1790"></a>
-<span class="sourceLineNo">1791</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1791"></a>
-<span class="sourceLineNo">1792</span> */<a name="line.1792"></a>
-<span class="sourceLineNo">1793</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1793"></a>
-<span class="sourceLineNo">1794</span> if (a.length < length) {<a name="line.1794"></a>
-<span class="sourceLineNo">1795</span> return null;<a name="line.1795"></a>
-<span class="sourceLineNo">1796</span> }<a name="line.1796"></a>
-<span class="sourceLineNo">1797</span> byte [] result = new byte[length];<a name="line.1797"></a>
-<span class="sourceLineNo">1798</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1798"></a>
-<span class="sourceLineNo">1799</span> return result;<a name="line.1799"></a>
-<span class="sourceLineNo">1800</span> }<a name="line.1800"></a>
-<span class="sourceLineNo">1801</span><a name="line.1801"></a>
-<span class="sourceLineNo">1802</span> /**<a name="line.1802"></a>
-<span class="sourceLineNo">1803</span> * @param a array<a name="line.1803"></a>
-<span class="sourceLineNo">1804</span> * @param length amount of bytes to snarf<a name="line.1804"></a>
-<span class="sourceLineNo">1805</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1805"></a>
-<span class="sourceLineNo">1806</span> */<a name="line.1806"></a>
-<span class="sourceLineNo">1807</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1807"></a>
-<span class="sourceLineNo">1808</span> if (a.length < length) {<a name="line.1808"></a>
-<span class="sourceLineNo">1809</span> return null;<a name="line.1809"></a>
-<span class="sourceLineNo">1810</span> }<a name="line.1810"></a>
-<span class="sourceLineNo">1811</span> byte [] result = new byte[length];<a name="line.1811"></a>
-<span class="sourceLineNo">1812</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1812"></a>
-<span class="sourceLineNo">1813</span> return result;<a name="line.1813"></a>
-<span class="sourceLineNo">1814</span> }<a name="line.1814"></a>
-<span class="sourceLineNo">1815</span><a name="line.1815"></a>
-<span class="sourceLineNo">1816</span> /**<a name="line.1816"></a>
-<span class="sourceLineNo">1817</span> * @param a array<a name="line.1817"></a>
-<span class="sourceLineNo">1818</span> * @param length new array size<a name="line.1818"></a>
-<span class="sourceLineNo">1819</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1819"></a>
-<span class="sourceLineNo">1820</span> */<a name="line.1820"></a>
-<span class="sourceLineNo">1821</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1821"></a>
-<span class="sourceLineNo">1822</span> byte [] padding = new byte[length];<a name="line.1822"></a>
-<span class="sourceLineNo">1823</span> for (int i = 0; i < length; i++) {<a name="line.1823"></a>
-<span class="sourceLineNo">1824</span> padding[i] = 0;<a name="line.1824"></a>
-<span class="sourceLineNo">1825</span> }<a name="line.1825"></a>
-<span class="sourceLineNo">1826</span> return add(padding,a);<a name="line.1826"></a>
-<span class="sourceLineNo">1827</span> }<a name="line.1827"></a>
-<span class="sourceLineNo">1828</span><a name="line.1828"></a>
-<span class="sourceLineNo">1829</span> /**<a name="line.1829"></a>
-<span class="sourceLineNo">1830</span> * @param a array<a name="line.1830"></a>
-<span class="sourceLineNo">1831</span> * @param length new array size<a name="line.1831"></a>
-<span class="sourceLineNo">1832</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1832"></a>
-<span class="sourceLineNo">1833</span> */<a name="line.1833"></a>
-<span class="sourceLineNo">1834</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1834"></a>
-<span class="sourceLineNo">1835</span> byte [] padding = new byte[length];<a name="line.1835"></a>
-<span class="sourceLineNo">1836</span> for (int i = 0; i < length; i++) {<a name="line.1836"></a>
-<span class="sourceLineNo">1837</span> padding[i] = 0;<a name="line.1837"></a>
-<span class="sourceLineNo">1838</span> }<a name="line.1838"></a>
-<span class="sourceLineNo">1839</span> return add(a,padding);<a name="line.1839"></a>
-<span class="sourceLineNo">1840</span> }<a name="line.1840"></a>
-<span class="sourceLineNo">1841</span><a name="line.1841"></a>
-<span class="sourceLineNo">1842</span> /**<a name="line.1842"></a>
-<span class="sourceLineNo">1843</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1843"></a>
-<span class="sourceLineNo">1844</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1844"></a>
-<span class="sourceLineNo">1845</span> * @param a Beginning of range<a name="line.1845"></a>
-<span class="sourceLineNo">1846</span> * @param b End of range<a name="line.1846"></a>
-<span class="sourceLineNo">1847</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1847"></a>
-<span class="sourceLineNo">1848</span> * the range in two; i.e. one split.<a name="line.1848"></a>
-<span class="sourceLineNo">1849</span> * @return Array of dividing values<a name="line.1849"></a>
-<span class="sourceLineNo">1850</span> */<a name="line.1850"></a>
-<span class="sourceLineNo">1851</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1851"></a>
-<span class="sourceLineNo">1852</span> return split(a, b, false, num);<a name="line.1852"></a>
-<span class="sourceLineNo">1853</span> }<a name="line.1853"></a>
-<span class="sourceLineNo">1854</span><a name="line.1854"></a>
-<span class="sourceLineNo">1855</span> /**<a name="line.1855"></a>
-<span class="sourceLineNo">1856</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1856"></a>
-<span class="sourceLineNo">1857</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1857"></a>
-<span class="sourceLineNo">1858</span> * @param a Beginning of range<a name="line.1858"></a>
-<span class="sourceLineNo">1859</span> * @param b End of range<a name="line.1859"></a>
-<span class="sourceLineNo">1860</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1860"></a>
-<span class="sourceLineNo">1861</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1861"></a>
-<span class="sourceLineNo">1862</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1862"></a>
-<span class="sourceLineNo">1863</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1863"></a>
-<span class="sourceLineNo">1864</span> * the range in two; i.e. one split.<a name="line.1864"></a>
-<span class="sourceLineNo">1865</span> * @return Array of dividing values<a name="line.1865"></a>
-<span class="sourceLineNo">1866</span> */<a name="line.1866"></a>
-<span class="sourceLineNo">1867</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1867"></a>
-<span class="sourceLineNo">1868</span> boolean inclusive, final int num) {<a name="line.1868"></a>
-<span class="sourceLineNo">1869</span> byte[][] ret = new byte[num + 2][];<a name="line.1869"></a>
-<span class="sourceLineNo">1870</span> int i = 0;<a name="line.1870"></a>
-<span class="sourceLineNo">1871</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1871"></a>
-<span class="sourceLineNo">1872</span> if (iter == null)<a name="line.1872"></a>
-<span class="sourceLineNo">1873</span> return null;<a name="line.1873"></a>
-<span class="sourceLineNo">1874</span> for (byte[] elem : iter) {<a name="line.1874"></a>
-<span class="sourceLineNo">1875</span> ret[i++] = elem;<a name="line.1875"></a>
-<span class="sourceLineNo">1876</span> }<a name="line.1876"></a>
-<span class="sourceLineNo">1877</span> return ret;<a name="line.1877"></a>
-<span class="sourceLineNo">1878</span> }<a name="line.1878"></a>
-<span class="sourceLineNo">1879</span><a name="line.1879"></a>
-<span class="sourceLineNo">1880</span> /**<a name="line.1880"></a>
-<span class="sourceLineNo">1881</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1881"></a>
-<span class="sourceLineNo">1882</span> */<a name="line.1882"></a>
-<span class="sourceLineNo">1883</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1883"></a>
-<span class="sourceLineNo">1884</span> final byte[] b, final int num)<a name="line.1884"></a>
-<span class="sourceLineNo">1885</span> {<a name="line.1885"></a>
-<span class="sourceLineNo">1886</span> return iterateOnSplits(a, b, false, num);<a name="line.1886"></a>
-<span class="sourceLineNo">1887</span> }<a name="line.1887"></a>
-<span class="sourceLineNo">1888</span><a name="line.1888"></a>
-<span class="sourceLineNo">1889</span> /**<a name="line.1889"></a>
-<span class="sourceLineNo">1890</span> * Iterate over keys within the passed range.<a name="line.1890"></a>
-<span class="sourceLineNo">1891</span> */<a name="line.1891"></a>
-<span class="sourceLineNo">1892</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1892"></a>
-<span class="sourceLineNo">1893</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1893"></a>
-<span class="sourceLineNo">1894</span> {<a name="line.1894"></a>
-<span class="sourceLineNo">1895</span> byte [] aPadded;<a name="line.1895"></a>
-<span class="sourceLineNo">1896</span> byte [] bPadded;<a name="line.1896"></a>
-<span class="sourceLineNo">1897</span> if (a.length < b.length) {<a name="line.1897"></a>
-<span class="sourceLineNo">1898</span> aPadded = padTail(a, b.length - a.length);<a name="line.1898"></a>
-<span class="sourceLineNo">1899</span> bPadded = b;<a name="line.1899"></a>
-<span class="sourceLineNo">1900</span> } else if (b.length < a.length) {<a name="line.1900"></a>
-<span class="sourceLineNo">1901</span> aPadded = a;<a name="line.1901"></a>
-<span class="sourceLineNo">1902</span> bPadded = padTail(b, a.length - b.length);<a name="line.1902"></a>
-<span class="sourceLineNo">1903</span> } else {<a name="line.1903"></a>
-<span class="sourceLineNo">1904</span> aPadded = a;<a name="line.1904"></a>
-<span class="sourceLineNo">1905</span> bPadded = b;<a name="line.1905"></a>
-<span class="sourceLineNo">1906</span> }<a name="line.1906"></a>
-<span class="sourceLineNo">1907</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1907"></a>
-<span class="sourceLineNo">1908</span> throw new IllegalArgumentException("b <= a");<a name="line.1908"></a>
-<span class="sourceLineNo">1909</span> }<a name="line.1909"></a>
-<span class="sourceLineNo">1910</span> if (num <= 0) {<a name="line.1910"></a>
-<span class="sourceLineNo">1911</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1911"></a>
-<span class="sourceLineNo">1912</span> }<a name="line.1912"></a>
-<span class="sourceLineNo">1913</span> byte [] prependHeader = {1, 0};<a name="line.1913"></a>
-<span class="sourceLineNo">1914</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1914"></a>
-<span class="sourceLineNo">1915</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1915"></a>
-<span class="sourceLineNo">1916</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1916"></a>
-<span class="sourceLineNo">1917</span> if (inclusive) {<a name="line.1917"></a>
-<span class="sourceLineNo">1918</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1918"></a>
-<span class="sourceLineNo">1919</span> }<a name="line.1919"></a>
-<span class="sourceLineNo">1920</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1920"></a>
-<span class="sourceLineNo">1921</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1921"></a>
-<span class="sourceLineNo">1922</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1922"></a>
-<span class="sourceLineNo">1923</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1923"></a>
-<span class="sourceLineNo">1924</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1924"></a>
-<span class="sourceLineNo">1925</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1925"></a>
-<span class="sourceLineNo">1926</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1926"></a>
-<span class="sourceLineNo">1927</span> }<a name="line.1927"></a>
-<span class="sourceLineNo">1928</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1928"></a>
-<span class="sourceLineNo">1929</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1929"></a>
-<span class="sourceLineNo">1930</span> }<a name="line.1930"></a>
-<span class="sourceLineNo">1931</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1931"></a>
-<span class="sourceLineNo">1932</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1932"></a>
-<span class="sourceLineNo">1933</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1933"></a>
-<span class="sourceLineNo">1934</span> }<a name="line.1934"></a>
-<span class="sourceLineNo">1935</span> final BigInteger intervalBI;<a name="line.1935"></a>
-<span class="sourceLineNo">1936</span> try {<a name="line.1936"></a>
-<span class="sourceLineNo">1937</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1937"></a>
-<span class="sourceLineNo">1938</span> } catch(Exception e) {<a name="line.1938"></a>
-<span class="sourceLineNo">1939</span> LOG.error("Exception caught during division", e);<a name="line.1939"></a>
-<span class="sourceLineNo">1940</span> return null;<a name="line.1940"></a>
-<span class="sourceLineNo">1941</span> }<a name="line.1941"></a>
-<span class="sourceLineNo">1942</span><a name="line.1942"></a>
-<span class="sourceLineNo">1943</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1943"></a>
-<span class="sourceLineNo">1944</span> private int i = -1;<a name="line.1944"></a>
+<span class="sourceLineNo">1777</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1777"></a>
+<span class="sourceLineNo">1778</span> index += arrays[i].length;<a name="line.1778"></a>
+<span class="sourceLineNo">1779</span> }<a name="line.1779"></a>
+<span class="sourceLineNo">1780</span> return result;<a name="line.1780"></a>
+<span class="sourceLineNo">1781</span> }<a name="line.1781"></a>
+<span class="sourceLineNo">1782</span><a name="line.1782"></a>
+<span class="sourceLineNo">1783</span> /**<a name="line.1783"></a>
+<span class="sourceLineNo">1784</span> * @param a array<a name="line.1784"></a>
+<span class="sourceLineNo">1785</span> * @param length amount of bytes to grab<a name="line.1785"></a>
+<span class="sourceLineNo">1786</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1786"></a>
+<span class="sourceLineNo">1787</span> */<a name="line.1787"></a>
+<span class="sourceLineNo">1788</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1788"></a>
+<span class="sourceLineNo">1789</span> if (a.length < length) {<a name="line.1789"></a>
+<span class="sourceLineNo">1790</span> return null;<a name="line.1790"></a>
+<span class="sourceLineNo">1791</span> }<a name="line.1791"></a>
+<span class="sourceLineNo">1792</span> byte [] result = new byte[length];<a name="line.1792"></a>
+<span class="sourceLineNo">1793</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1793"></a>
+<span class="sourceLineNo">1794</span> return result;<a name="line.1794"></a>
+<span class="sourceLineNo">1795</span> }<a name="line.1795"></a>
+<span class="sourceLineNo">1796</span><a name="line.1796"></a>
+<span class="sourceLineNo">1797</span> /**<a name="line.1797"></a>
+<span class="sourceLineNo">1798</span> * @param a array<a name="line.1798"></a>
+<span class="sourceLineNo">1799</span> * @param length amount of bytes to snarf<a name="line.1799"></a>
+<span class="sourceLineNo">1800</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1800"></a>
+<span class="sourceLineNo">1801</span> */<a name="line.1801"></a>
+<span class="sourceLineNo">1802</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1802"></a>
+<span class="sourceLineNo">1803</span> if (a.length < length) {<a name="line.1803"></a>
+<span class="sourceLineNo">1804</span> return null;<a name="line.1804"></a>
+<span class="sourceLineNo">1805</span> }<a name="line.1805"></a>
+<span class="sourceLineNo">1806</span> byte [] result = new byte[length];<a name="line.1806"></a>
+<span class="sourceLineNo">1807</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1807"></a>
+<span class="sourceLineNo">1808</span> return result;<a name="line.1808"></a>
+<span class="sourceLineNo">1809</span> }<a name="line.1809"></a>
+<span class="sourceLineNo">1810</span><a name="line.1810"></a>
+<span class="sourceLineNo">1811</span> /**<a name="line.1811"></a>
+<span class="sourceLineNo">1812</span> * @param a array<a name="line.1812"></a>
+<span class="sourceLineNo">1813</span> * @param length new array size<a name="line.1813"></a>
+<span class="sourceLineNo">1814</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1814"></a>
+<span class="sourceLineNo">1815</span> */<a name="line.1815"></a>
+<span class="sourceLineNo">1816</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1816"></a>
+<span class="sourceLineNo">1817</span> byte [] padding = new byte[length];<a name="line.1817"></a>
+<span class="sourceLineNo">1818</span> for (int i = 0; i < length; i++) {<a name="line.1818"></a>
+<span class="sourceLineNo">1819</span> padding[i] = 0;<a name="line.1819"></a>
+<span class="sourceLineNo">1820</span> }<a name="line.1820"></a>
+<span class="sourceLineNo">1821</span> return add(padding,a);<a name="line.1821"></a>
+<span class="sourceLineNo">1822</span> }<a name="line.1822"></a>
+<span class="sourceLineNo">1823</span><a name="line.1823"></a>
+<span class="sourceLineNo">1824</span> /**<a name="line.1824"></a>
+<span class="sourceLineNo">1825</span> * @param a array<a name="line.1825"></a>
+<span class="sourceLineNo">1826</span> * @param length new array size<a name="line.1826"></a>
+<span class="sourceLineNo">1827</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1827"></a>
+<span class="sourceLineNo">1828</span> */<a name="line.1828"></a>
+<span class="sourceLineNo">1829</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1829"></a>
+<span class="sourceLineNo">1830</span> byte [] padding = new byte[length];<a name="line.1830"></a>
+<span class="sourceLineNo">1831</span> for (int i = 0; i < length; i++) {<a name="line.1831"></a>
+<span class="sourceLineNo">1832</span> padding[i] = 0;<a name="line.1832"></a>
+<span class="sourceLineNo">1833</span> }<a name="line.1833"></a>
+<span class="sourceLineNo">1834</span> return add(a,padding);<a name="line.1834"></a>
+<span class="sourceLineNo">1835</span> }<a name="line.1835"></a>
+<span class="sourceLineNo">1836</span><a name="line.1836"></a>
+<span class="sourceLineNo">1837</span> /**<a name="line.1837"></a>
+<span class="sourceLineNo">1838</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1838"></a>
+<span class="sourceLineNo">1839</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1839"></a>
+<span class="sourceLineNo">1840</span> * @param a Beginning of range<a name="line.1840"></a>
+<span class="sourceLineNo">1841</span> * @param b End of range<a name="line.1841"></a>
+<span class="sourceLineNo">1842</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1842"></a>
+<span class="sourceLineNo">1843</span> * the range in two; i.e. one split.<a name="line.1843"></a>
+<span class="sourceLineNo">1844</span> * @return Array of dividing values<a name="line.1844"></a>
+<span class="sourceLineNo">1845</span> */<a name="line.1845"></a>
+<span class="sourceLineNo">1846</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1846"></a>
+<span class="sourceLineNo">1847</span> return split(a, b, false, num);<a name="line.1847"></a>
+<span class="sourceLineNo">1848</span> }<a name="line.1848"></a>
+<span class="sourceLineNo">1849</span><a name="line.1849"></a>
+<span class="sourceLineNo">1850</span> /**<a name="line.1850"></a>
+<span class="sourceLineNo">1851</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1851"></a>
+<span class="sourceLineNo">1852</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1852"></a>
+<span class="sourceLineNo">1853</span> * @param a Beginning of range<a name="line.1853"></a>
+<span class="sourceLineNo">1854</span> * @param b End of range<a name="line.1854"></a>
+<span class="sourceLineNo">1855</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1855"></a>
+<span class="sourceLineNo">1856</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1856"></a>
+<span class="sourceLineNo">1857</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1857"></a>
+<span class="sourceLineNo">1858</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1858"></a>
+<span class="sourceLineNo">1859</span> * the range in two; i.e. one split.<a name="line.1859"></a>
+<span class="sourceLineNo">1860</span> * @return Array of dividing values<a name="line.1860"></a>
+<span class="sourceLineNo">1861</span> */<a name="line.1861"></a>
+<span class="sourceLineNo">1862</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1862"></a>
+<span class="sourceLineNo">1863</span> boolean inclusive, final int num) {<a name="line.1863"></a>
+<span class="sourceLineNo">1864</span> byte[][] ret = new byte[num + 2][];<a name="line.1864"></a>
+<span class="sourceLineNo">1865</span> int i = 0;<a name="line.1865"></a>
+<span class="sourceLineNo">1866</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1866"></a>
+<span class="sourceLineNo">1867</span> if (iter == null)<a name="line.1867"></a>
+<span class="sourceLineNo">1868</span> return null;<a name="line.1868"></a>
+<span class="sourceLineNo">1869</span> for (byte[] elem : iter) {<a name="line.1869"></a>
+<span class="sourceLineNo">1870</span> ret[i++] = elem;<a name="line.1870"></a>
+<span class="sourceLineNo">1871</span> }<a name="line.1871"></a>
+<span class="sourceLineNo">1872</span> return ret;<a name="line.1872"></a>
+<span class="sourceLineNo">1873</span> }<a name="line.1873"></a>
+<span class="sourceLineNo">1874</span><a name="line.1874"></a>
+<span class="sourceLineNo">1875</span> /**<a name="line.1875"></a>
+<span class="sourceLineNo">1876</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1876"></a>
+<span class="sourceLineNo">1877</span> */<a name="line.1877"></a>
+<span class="sourceLineNo">1878</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1878"></a>
+<span class="sourceLineNo">1879</span> final byte[] b, final int num)<a name="line.1879"></a>
+<span class="sourceLineNo">1880</span> {<a name="line.1880"></a>
+<span class="sourceLineNo">1881</span> return iterateOnSplits(a, b, false, num);<a name="line.1881"></a>
+<span class="sourceLineNo">1882</span> }<a name="line.1882"></a>
+<span class="sourceLineNo">1883</span><a name="line.1883"></a>
+<span class="sourceLineNo">1884</span> /**<a name="line.1884"></a>
+<span class="sourceLineNo">1885</span> * Iterate over keys within the passed range.<a name="line.1885"></a>
+<span class="sourceLineNo">1886</span> */<a name="line.1886"></a>
+<span class="sourceLineNo">1887</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1887"></a>
+<span class="sourceLineNo">1888</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1888"></a>
+<span class="sourceLineNo">1889</span> {<a name="line.1889"></a>
+<span class="sourceLineNo">1890</span> byte [] aPadded;<a name="line.1890"></a>
+<span class="sourceLineNo">1891</span> byte [] bPadded;<a name="line.1891"></a>
+<span class="sourceLineNo">1892</span> if (a.length < b.length) {<a name="line.1892"></a>
+<span class="sourceLineNo">1893</span> aPadded = padTail(a, b.length - a.length);<a name="line.1893"></a>
+<span class="sourceLineNo">1894</span> bPadded = b;<a name="line.1894"></a>
+<span class="sourceLineNo">1895</span> } else if (b.length < a.length) {<a name="line.1895"></a>
+<span class="sourceLineNo">1896</span> aPadded = a;<a name="line.1896"></a>
+<span class="sourceLineNo">1897</span> bPadded = padTail(b, a.length - b.length);<a name="line.1897"></a>
+<span class="sourceLineNo">1898</span> } else {<a name="line.1898"></a>
+<span class="sourceLineNo">1899</span> aPadded = a;<a name="line.1899"></a>
+<span class="sourceLineNo">1900</span> bPadded = b;<a name="line.1900"></a>
+<span class="sourceLineNo">1901</span> }<a name="line.1901"></a>
+<span class="sourceLineNo">1902</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1902"></a>
+<span class="sourceLineNo">1903</span> throw new IllegalArgumentException("b <= a");<a name="line.1903"></a>
+<span class="sourceLineNo">1904</span> }<a name="line.1904"></a>
+<span class="sourceLineNo">1905</span> if (num <= 0) {<a name="line.1905"></a>
+<span class="sourceLineNo">1906</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1906"></a>
+<span class="sourceLineNo">1907</span> }<a name="line.1907"></a>
+<span class="sourceLineNo">1908</span> byte [] prependHeader = {1, 0};<a name="line.1908"></a>
+<span class="sourceLineNo">1909</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1909"></a>
+<span class="sourceLineNo">1910</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1910"></a>
+<span class="sourceLineNo">1911</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1911"></a>
+<span class="sourceLineNo">1912</span> if (inclusive) {<a name="line.1912"></a>
+<span class="sourceLineNo">1913</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1913"></a>
+<span class="sourceLineNo">1914</span> }<a name="line.1914"></a>
+<span class="sourceLineNo">1915</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1915"></a>
+<span class="sourceLineNo">1916</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1916"></a>
+<span class="sourceLineNo">1917</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1917"></a>
+<span class="sourceLineNo">1918</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1918"></a>
+<span class="sourceLineNo">1919</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1919"></a>
+<span class="sourceLineNo">1920</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1920"></a>
+<span class="sourceLineNo">1921</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1921"></a>
+<span class="sourceLineNo">1922</span> }<a name="line.1922"></a>
+<span class="sourceLineNo">1923</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1923"></a>
+<span class="sourceLineNo">1924</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1924"></a>
+<span class="sourceLineNo">1925</span> }<a name="line.1925"></a>
+<span class="sourceLineNo">1926</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1926"></a>
+<span class="sourceLineNo">1927</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1927"></a>
+<span class="sourceLineNo">1928</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1928"></a>
+<span class="sourceLineNo">1929</span> }<a name="line.1929"></a>
+<span class="sourceLineNo">1930</span> final BigInteger intervalBI;<a name="line.1930"></a>
+<span class="sourceLineNo">1931</span> try {<a name="line.1931"></a>
+<span class="sourceLineNo">1932</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1932"></a>
+<span class="sourceLineNo">1933</span> } catch(Exception e) {<a name="line.1933"></a>
+<span class="sourceLineNo">1934</span> LOG.error("Exception caught during division", e);<a name="line.1934"></a>
+<span class="sourceLineNo">1935</span> return null;<a name="line.1935"></a>
+<span class="sourceLineNo">1936</span> }<a name="line.1936"></a>
+<span class="sourceLineNo">1937</span><a name="line.1937"></a>
+<span class="sourceLineNo">1938</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1938"></a>
+<span class="sourceLineNo">1939</span> private int i = -1;<a name="line.1939"></a>
+<span class="sourceLineNo">1940</span><a name="line.1940"></a>
+<span class="sourceLineNo">1941</span> @Override<a name="line.1941"></a>
+<span class="sourceLineNo">1942</span> public boolean hasNext() {<a name="line.1942"></a>
+<span class="sourceLineNo">1943</span> return i < num+1;<a name="line.1943"></a>
+<span class="sourceLineNo">1944</span> }<a name="line.1944"></a>
<span class="sourceLineNo">1945</span><a name="line.1945"></a>
<span class="sourceLineNo">1946</span> @Override<a name="line.1946"></a>
-<span class="sourceLineNo">1947</span> public boolean hasNext() {<a name="line.1947"></a>
-<span class="sourceLineNo">1948</span> return i < num+1;<a name="line.1948"></a>
-<span class="sourceLineNo">1949</span> }<a name="line.1949"></a>
-<span class="sourceLineNo">1950</span><a name="line.1950"></a>
-<span class="sourceLineNo">1951</span> @Override<a name="line.1951"></a>
-<span class="sourceLineNo">1952</span> public byte[] next() {<a name="line.1952"></a>
-<span class="sourceLineNo">1953</span> i++;<a name="line.1953"></a>
-<span class="sourceLineNo">1954</span> if (i == 0) return a;<a name="line.1954"></a>
-<span class="sourceLineNo">1955</span> if (i == num + 1) return b;<a name="line.1955"></a>
-<span class="sourceLineNo">1956</span><a name="line.1956"></a>
-<span class="sourceLineNo">1957</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1957"></a>
-<span class="sourceLineNo">1958</span> byte [] padded = curBI.toByteArray();<a name="line.1958"></a>
-<span class="sourceLineNo">1959</span> if (padded[1] == 0)<a name="line.1959"></a>
-<span class="sourceLineNo">1960</span> padded = tail(padded, padded.length - 2);<a name="line.1960"></a>
-<span class="sourceLineNo">1961</span> else<a name="line.1961"></a>
-<span class="sourceLineNo">1962</span> padded = tail(padded, padded.length - 1);<a name="line.1962"></a>
-<span class="sourceLineNo">1963</span> return padded;<a name="line.1963"></a>
+<span class="sourceLineNo">1947</span> public byte[] next() {<a name="line.1947"></a>
+<span class="sourceLineNo">1948</span> i++;<a name="line.1948"></a>
+<span class="sourceLineNo">1949</span> if (i == 0) return a;<a name="line.1949"></a>
+<span class="sourceLineNo">1950</span> if (i == num + 1) return b;<a name="line.1950"></a>
+<span class="sourceLineNo">1951</span><a name="line.1951"></a>
+<span class="sourceLineNo">1952</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1952"></a>
+<span class="sourceLineNo">1953</span> byte [] padded = curBI.toByteArray();<a name="line.1953"></a>
+<span class="sourceLineNo">1954</span> if (padded[1] == 0)<a name="line.1954"></a>
+<span class="sourceLineNo">1955</span> padded = tail(padded, padded.length - 2);<a name="line.1955"></a>
+<span class="sourceLineNo">1956</span> else<a name="line.1956"></a>
+<span class="sourceLineNo">1957</span> padded = tail(padded, padded.length - 1);<a name="line.1957"></a>
+<span class="sourceLineNo">1958</span> return padded;<a name="line.1958"></a>
+<span class="sourceLineNo">1959</span> }<a name="line.1959"></a>
+<span class="sourceLineNo">1960</span><a name="line.1960"></a>
+<span class="sourceLineNo">1961</span> @Override<a name="line.1961"></a>
+<span class="sourceLineNo">1962</span> public void remove() {<a name="line.1962"></a>
+<span class="sourceLineNo">1963</span> throw new UnsupportedOperationException();<a name="line.1963"></a>
<span class="sourceLineNo">1964</span> }<a name="line.1964"></a>
<span class="sourceLineNo">1965</span><a name="line.1965"></a>
-<span class="sourceLineNo">1966</span> @Override<a name="line.1966"></a>
-<span class="sourceLineNo">1967</span> public void remove() {<a name="line.1967"></a>
-<span class="sourceLineNo">1968</span> throw new UnsupportedOperationException();<a name="line.1968"></a>
-<span class="sourceLineNo">1969</span> }<a name="line.1969"></a>
-<span class="sourceLineNo">1970</span><a name="line.1970"></a>
-<span class="sourceLineNo">1971</span> };<a name="line.1971"></a>
-<span class="sourceLineNo">1972</span><a name="line.1972"></a>
-<span class="sourceLineNo">1973</span> return new Iterable<byte[]>() {<a name="line.1973"></a>
-<span class="sourceLineNo">1974</span> @Override<a name="line.1974"></a>
-<span class="sourceLineNo">1975</span> public Iterator<byte[]> iterator() {<a name="line.1975"></a>
-<span class="sourceLineNo">1976</span> return iterator;<a name="line.1976"></a>
-<span class="sourceLineNo">1977</span> }<a name="line.1977"></a>
-<span class="sourceLineNo">1978</span> };<a name="line.1978"></a>
-<span class="sourceLineNo">1979</span> }<a name="line.1979"></a>
-<span class="sourceLineNo">1980</span><a name="line.1980"></a>
-<span class="sourceLineNo">1981</span> /**<a name="line.1981"></a>
-<span class="sourceLineNo">1982</span> * @param bytes array to hash<a name="line.1982"></a>
-<span class="sourceLineNo">1983</span> * @param offset offset to start from<a name="line.1983"></a>
-<span class="sourceLineNo">1984</span> * @param length length to hash<a name="line.1984"></a>
-<span class="sourceLineNo">1985</span> * */<a name="line.1985"></a>
-<span class="sourceLineNo">1986</span> public static int hashCode(byte[] bytes, int offset, int length) {<a name="line.1986"></a>
-<span class="sourceLineNo">1987</span> int hash = 1;<a name="line.1987"></a>
-<span class="sourceLineNo">1988</span> for (int i = offset; i < offset + length; i++)<a name="line.1988"></a>
-<span class="sourceLineNo">1989</span> hash = (31 * hash) + (int) bytes[i];<a name="line.1989"></a>
-<span class="sourceLineNo">1990</span> return hash;<a name="line.1990"></a>
-<span class="sourceLineNo">1991</span> }<a name="line.1991"></a>
-<span class="sourceLineNo">1992</span><a name="line.1992"></a>
-<span class="sourceLineNo">1993</span> /**<a name="line.1993"></a>
-<span class="sourceLineNo">1994</span> * @param t operands<a name="line.1994"></a>
-<span class="sourceLineNo">1995</span> * @return Array of byte arrays made from passed array of Text<a name="line.1995"></a>
-<span class="sourceLineNo">1996</span> */<a name="line.1996"></a>
-<span class="sourceLineNo">1997</span> public static byte [][] toByteArrays(final String [] t) {<a name="line.1997"></a>
-<span class="sourceLineNo">1998</span> byte [][] result = new byte[t.length][];<a name="line.1998"></a>
-<span class="sourceLineNo">1999</span> for (int i = 0; i < t.length; i++) {<a name="line.1999"></a>
-<span class="sourceLineNo">2000</span> result[i] = Bytes.toBytes(t[i]);<a name="line.2000"></a>
-<span class="sourceLineNo">2001</span> }<a name="line.2001"></a>
-<span class="sourceLineNo">2002</span> return result;<a name="line.2002"></a>
-<span class="sourceLineNo">2003</span> }<a name="line.2003"></a>
-<span class="sourceLineNo">2004</span><a name="line.2004"></a>
-<span class="sourceLineNo">2005</span> /**<a name="line.2005"></a>
-<span class="sourceLineNo">2006</span> * @param t operands<a name="line.2006"></a>
-<span class="sourceLineNo">2007</span> * @return Array of binary byte arrays made from passed array of binary strings<a name="line.2007"></a>
-<span class="sourceLineNo">2008</span> */<a name="line.2008"></a>
-<span class="sourceLineNo">2009</span> public static byte[][] toBinaryByteArrays(final String[] t) {<a name="line.2009"></a>
-<span class="sourceLineNo">2010</span> byte[][] result = new byte[t.length][];<a name="line.2010"></a>
-<span class="sourceLineNo">2011</span> for (int i = 0; i < t.length; i++) {<a name="line.2011"></a>
-<span class="sourceLineNo">2012</span> result[i] = Bytes.toBytesBinary(t[i]);<a name="line.2012"></a>
-<span class="sourceLineNo">2013</span> }<a name="line.2013"></a>
-<span class="sourceLineNo">2014</span> return result;<a name="line.2014"></a>
-<span class="sourceLineNo">2015</span> }<a name="line.2015"></a>
-<span class="sourceLineNo">2016</span><a name="line.2016"></a>
-<span class="sourceLineNo">2017</span> /**<a name="line.2017"></a>
-<span class="sourceLineNo">2018</span> * @param column operand<a name="line.2018"></a>
-<span class="sourceLineNo">2019</span> * @return A byte array of a byte array where first and only entry is<a name="line.2019"></a>
-<span class="sourceLineNo">2020</span> * <code>column</code><a name="line.2020"></a>
-<span class="sourceLineNo">2021</span> */<a name="line.2021"></a>
-<span class="sourceLineNo">2022</span> public static byte [][] toByteArrays(final String column) {<a name="line.2022"></a>
-<span class="sourceLineNo">2023</span> return toByteArrays(toBytes(column));<a name="line.2023"></a>
-<span class="sourceLineNo">2024</span> }<a name="line.2024"></a>
-<span class="sourceLineNo">2025</span><a name="line.2025"></a>
-<span class="sourceLineNo">2026</span> /**<a name="line.2026"></a>
-<span class="sourceLineNo">2027</span> * @param column operand<a name="line.2027"></a>
-<span class="sourceLineNo">2028</span> * @return A byte array of a byte array where first and only entry is<a name="line.2028"></a>
-<span class="sourceLineNo">2029</span> * <code>column</code><a name="line.2029"></a>
-<span class="sourceLineNo">2030</span> */<a name="line.2030"></a>
-<span class="sourceLineNo">2031</span> public static byte [][] toByteArrays(final byte [] column) {<a name="line.2031"></a>
-<span class="sourceLineNo">2032</span> byte [][] result = new byte[1][];<a name="line.2032"></a>
-<span class="sourceLineNo">2033</span> result[0] = column;<a name="line.2033"></a>
-<span class="sourceLineNo">2034</span> return result;<a name="line.2034"></a>
-<span class="sourceLineNo">2035</span> }<a name="line.2035"></a>
-<span class="sourceLineNo">2036</span><a name="line.2036"></a>
-<span class="sourceLineNo">2037</span> /**<a name="line.2037"></a>
-<span class="sourceLineNo">2038</span> * Binary search for keys in indexes.<a name="line.2038"></a>
-<span class="sourceLineNo">2039</span> *<a name="line.2039"></a>
-<span class="sourceLineNo">2040</span> * @param arr array of byte arrays to search for<a name="line.2040"></a>
-<span class="sourceLineNo">2041</span> * @param key the key you want to find<a name="line.2041"></a>
-<span class="sourceLineNo">2042</span> * @param offset the offset in the key you want to find<a name="line.2042"></a>
-<span class="sourceLineNo">2043</span> * @param length the length of the key<a name="line.2043"></a>
-<span class="sourceLineNo">2044</span> * @param comparator a comparator to compare.<a name="line.2044"></a>
-<span class="sourceLineNo">2045</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2045"></a>
-<span class="sourceLineNo">2046</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2046"></a>
-<span class="sourceLineNo">2047</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2047"></a>
-<span class="sourceLineNo">2048</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2048"></a>
-<span class="sourceLineNo">2049</span> * means that this function can return 2N + 1 different values<a name="line.2049"></a>
-<span class="sourceLineNo">2050</span> * ranging from -(N + 1) to N - 1.<a name="line.2050"></a>
-<span class="sourceLineNo">2051</span> * @deprecated {@link Bytes#binarySearch(byte[][], byte[], int, int)}<a name="line.2051"></a>
-<span class="sourceLineNo">2052</span> */<a name="line.2052"></a>
-<span class="sourceLineNo">2053</span> @Deprecated<a name="line.2053"></a>
-<span class="sourceLineNo">2054</span> public static int binarySearch(byte [][]arr, byte []key, int offset,<a name="line.2054"></a>
-<span class="sourceLineNo">2055</span> int length, RawComparator<?> comparator) {<a name="line.2055"></a>
-<span class="sourceLineNo">2056</span> return binarySearch(arr, key, offset, length);<a name="line.2056"></a>
-<span class="sourceLineNo">2057</span> }<a name="line.2057"></a>
-<span class="sourceLineNo">2058</span><a name="line.2058"></a>
-<span class="sourceLineNo">2059</span> /**<a name="line.2059"></a>
-<span class="sourceLineNo">2060</span> * Binary search for keys in indexes using Bytes.BYTES_RAWCOMPARATOR.<a name="line.2060"></a>
-<span class="sourceLineNo">2061</span> *<a name="line.2061"></a>
-<span class="sourceLineNo">2062</span> * @param arr array of byte arrays to search for<a name="line.2062"></a>
-<span class="sourceLineNo">2063</span> * @param key the key you want to find<a name="line.2063"></a>
-<span class="sourceLineNo">2064</span> * @param offset the offset in the key you want to find<a name="line.2064"></a>
-<span class="sourceLineNo">2065</span> * @param length the length of the key<a name="line.2065"></a>
-<span class="sourceLineNo">2066</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2066"></a>
-<span class="sourceLineNo">2067</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2067"></a>
-<span class="sourceLineNo">2068</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2068"></a>
-<span class="sourceLineNo">2069</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2069"></a>
-<span class="sourceLineNo">2070</span> * means that this function can return 2N + 1 different values<a name="line.2070"></a>
-<span class="sourceLineNo">2071</span> * ranging from -(N + 1) to N - 1.<a name="line.2071"></a>
-<span class="sourceLineNo">2072</span> */<a name="line.2072"></a>
-<span class="sourceLineNo">2073</span> public static int binarySearch(byte[][] arr, byte[] key, int offset, int length) {<a name="line.2073"></a>
-<span class="sourceLineNo">2074</span> int low = 0;<a name="line.2074"></a>
-<span class="sourceLineNo">2075</span> int high = arr.length - 1;<a name="line.2075"></a>
-<span class="sourceLineNo">2076</span><a name="line.2076"></a>
-<span class="sourceLineNo">2077</span> while (low <= high) {<a name="line.2077"></a>
-<span class="sourceLineNo">2078</span> int mid = (low + high) >>> 1;<a name="line.2078"></a>
-<span class="sourceLineNo">2079</span> // we have to compare in this order, because the comparator order<a name="line.2079"></a>
-<span class="sourceLineNo">2080</span> // has special logic when the 'left side' is a special key.<a name="line.2080"></a>
-<span class="sourceLineNo">2081</span> int cmp = Bytes.BYTES_RAWCOMPARATOR<a name="line.2081"></a>
-<span class="sourceLineNo">2082</span> .compare(key, offset, length, arr[mid], 0, arr[mid].length);<a name="line.2082"></a>
-<span class="sourceLineNo">2083</span> // key lives above the midpoint<a name="line.2083"></a>
-<span class="sourceLineNo">2084</span> if (cmp > 0)<a name="line.2084"></a>
-<span class="sourceLineNo">2085</span> low = mid + 1;<a name="line.2085"></a>
-<span class="sourceLineNo">2086</span> // key lives below the midpoint<a name="line.2086"></a>
-<span class="sourceLineNo">2087</span> else if (cmp < 0)<a name="line.2087"></a>
-<span class="sourceLineNo">2088</span> high = mid - 1;<a name="line.2088"></a>
-<span class="sourceLineNo">2089</span> // BAM. how often does this really happen?<a name="line.2089"></a>
-<span class="sourceLineNo">2090</span> else<a name="line.2090"></a>
-<span class="sourceLineNo">2091</span> return mid;<a name="line.2091"></a>
-<span class="sourceLineNo">2092</span> }<a name="line.2092"></a>
-<span class="sourceLineNo">2093</span> return -(low + 1);<a name="line.2093"></a>
-<span class="sourceLineNo">2094</span> }<a name="line.2094"></a>
-<span class="sourceLineNo">2095</span><a name="line.2095"></a>
-<span class="sourceLineNo">2096</span> /**<a name="line.2096"></a>
-<span class="sourceLineNo">2097</span> * Binary search for keys in indexes.<a name="line.2097"></a>
-<span class="sourceLineNo">2098</span> *<a name="line.2098"></a>
-<span class="sourceLineNo">2099</span> * @param arr array of byte arrays to search for<a name="line.2099"></a>
-<span class="sourceLineNo">2100</span> * @param key the key you want to find<a name="line.2100"></a>
-<span class="sourceLineNo">2101</span> * @param comparator a comparator to compare.<a name="line.2101"></a>
-<span class="sourceLineNo">2102</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2102"></a>
-<span class="sourceLineNo">2103</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2103"></a>
-<span class="sourceLineNo">2104</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2104"></a>
-<span class="sourceLineNo">2105</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2105"></a>
-<span class="sourceLineNo">2106</span> * means that this function can return 2N + 1 different values<a name="line.2106"></a>
-<span class="sourceLineNo">2107</span> * ranging from -(N + 1) to N - 1.<a name="line.2107"></a>
-<span class="sourceLineNo">2108</span> * @return the index of the block<a name="line.2108"></a>
-<span class="sourceLineNo">2109</span> * @deprecated Use {@link Bytes#binarySearch(Cell[], Cell, CellComparator)}<a name="line.2109"></a>
-<span class="sourceLineNo">2110</span> */<a name="line.2110"></a>
-<span class="sourceLineNo">2111</span> @Deprecated<a name="line.2111"></a>
-<span class="sourceLineNo">2112</span> public static int binarySearch(byte[][] arr, Cell key, RawComparator<Cell> comparator) {<a name="line.2112"></a>
-<span class="sourceLineNo">2113</span> int low = 0;<a name="line.2113"></a>
-<span class="sourceLineNo">2114</span> int high = arr.length - 1;<a name="line.2114"></a>
-<span class="sourceLineNo">2115</span> KeyValue.KeyOnlyKeyValue r = new KeyValue.KeyOnlyKeyValue();<a name="line.2115"></a>
-<span class="sourceLineNo">2116</span> while (low <= high) {<a name="line.211
<TRUNCATED>
[17/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.ByteArrayComparator.html
----------------------------------------------------------------------
diff --git a/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.ByteArrayComparator.html b/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.ByteArrayComparator.html
index 3c7d6b4..3dea877 100644
--- a/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.ByteArrayComparator.html
+++ b/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.ByteArrayComparator.html
@@ -1583,1089 +1583,1084 @@
<span class="sourceLineNo">1575</span> length1 == length2) {<a name="line.1575"></a>
<span class="sourceLineNo">1576</span> return 0;<a name="line.1576"></a>
<span class="sourceLineNo">1577</span> }<a name="line.1577"></a>
-<span class="sourceLineNo">1578</span> final int minLength = Math.min(length1, length2);<a name="line.1578"></a>
-<span class="sourceLineNo">1579</span> final int minWords = minLength / SIZEOF_LONG;<a name="line.1579"></a>
-<span class="sourceLineNo">1580</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1580"></a>
-<span class="sourceLineNo">1581</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
-<span class="sourceLineNo">1582</span><a name="line.1582"></a>
-<span class="sourceLineNo">1583</span> /*<a name="line.1583"></a>
-<span class="sourceLineNo">1584</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a<a name="line.1584"></a>
-<span class="sourceLineNo">1585</span> * time is no slower than comparing 4 bytes at a time even on 32-bit.<a name="line.1585"></a>
-<span class="sourceLineNo">1586</span> * On the other hand, it is substantially faster on 64-bit.<a name="line.1586"></a>
-<span class="sourceLineNo">1587</span> */<a name="line.1587"></a>
-<span class="sourceLineNo">1588</span> // This is the end offset of long parts.<a name="line.1588"></a>
-<span class="sourceLineNo">1589</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.1589"></a>
-<span class="sourceLineNo">1590</span> for (int i = 0; i < j; i += SIZEOF_LONG) {<a name="line.1590"></a>
-<span class="sourceLineNo">1591</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1591"></a>
-<span class="sourceLineNo">1592</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1592"></a>
-<span class="sourceLineNo">1593</span> long diff = lw ^ rw;<a name="line.1593"></a>
-<span class="sourceLineNo">1594</span> if (diff != 0) {<a name="line.1594"></a>
-<span class="sourceLineNo">1595</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.1595"></a>
-<span class="sourceLineNo">1596</span> }<a name="line.1596"></a>
-<span class="sourceLineNo">1597</span> }<a name="line.1597"></a>
-<span class="sourceLineNo">1598</span> int offset = j;<a name="line.1598"></a>
-<span class="sourceLineNo">1599</span><a name="line.1599"></a>
-<span class="sourceLineNo">1600</span> if (minLength - offset >= SIZEOF_INT) {<a name="line.1600"></a>
-<span class="sourceLineNo">1601</span> int il = theUnsafe.getInt(buffer1, offset1Adj + offset);<a name="line.1601"></a>
-<span class="sourceLineNo">1602</span> int ir = theUnsafe.getInt(buffer2, offset2Adj + offset);<a name="line.1602"></a>
-<span class="sourceLineNo">1603</span> if (il != ir) {<a name="line.1603"></a>
-<span class="sourceLineNo">1604</span> return lessThanUnsignedInt(il, ir) ? -1: 1;<a name="line.1604"></a>
-<span class="sourceLineNo">1605</span> }<a name="line.1605"></a>
-<span class="sourceLineNo">1606</span> offset += SIZEOF_INT;<a name="line.1606"></a>
-<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
-<span class="sourceLineNo">1608</span> if (minLength - offset >= SIZEOF_SHORT) {<a name="line.1608"></a>
-<span class="sourceLineNo">1609</span> short sl = theUnsafe.getShort(buffer1, offset1Adj + offset);<a name="line.1609"></a>
-<span class="sourceLineNo">1610</span> short sr = theUnsafe.getShort(buffer2, offset2Adj + offset);<a name="line.1610"></a>
-<span class="sourceLineNo">1611</span> if (sl != sr) {<a name="line.1611"></a>
-<span class="sourceLineNo">1612</span> return lessThanUnsignedShort(sl, sr) ? -1: 1;<a name="line.1612"></a>
-<span class="sourceLineNo">1613</span> }<a name="line.1613"></a>
-<span class="sourceLineNo">1614</span> offset += SIZEOF_SHORT;<a name="line.1614"></a>
-<span class="sourceLineNo">1615</span> }<a name="line.1615"></a>
-<span class="sourceLineNo">1616</span> if (minLength - offset == 1) {<a name="line.1616"></a>
-<span class="sourceLineNo">1617</span> int a = (buffer1[(int)(offset1 + offset)] & 0xff);<a name="line.1617"></a>
-<span class="sourceLineNo">1618</span> int b = (buffer2[(int)(offset2 + offset)] & 0xff);<a name="line.1618"></a>
-<span class="sourceLineNo">1619</span> if (a != b) {<a name="line.1619"></a>
-<span class="sourceLineNo">1620</span> return a - b;<a name="line.1620"></a>
-<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
-<span class="sourceLineNo">1622</span> }<a name="line.1622"></a>
-<span class="sourceLineNo">1623</span> return length1 - length2;<a name="line.1623"></a>
-<span class="sourceLineNo">1624</span> }<a name="line.1624"></a>
-<span class="sourceLineNo">1625</span> }<a name="line.1625"></a>
-<span class="sourceLineNo">1626</span> }<a name="line.1626"></a>
-<span class="sourceLineNo">1627</span><a name="line.1627"></a>
-<span class="sourceLineNo">1628</span> /**<a name="line.1628"></a>
-<span class="sourceLineNo">1629</span> * @param left left operand<a name="line.1629"></a>
-<span class="sourceLineNo">1630</span> * @param right right operand<a name="line.1630"></a>
-<span class="sourceLineNo">1631</span> * @return True if equal<a name="line.1631"></a>
-<span class="sourceLineNo">1632</span> */<a name="line.1632"></a>
-<span class="sourceLineNo">1633</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1633"></a>
-<span class="sourceLineNo">1634</span> // Could use Arrays.equals?<a name="line.1634"></a>
-<span class="sourceLineNo">1635</span> //noinspection SimplifiableConditionalExpression<a name="line.1635"></a>
-<span class="sourceLineNo">1636</span> if (left == right) return true;<a name="line.1636"></a>
-<span class="sourceLineNo">1637</span> if (left == null || right == null) return false;<a name="line.1637"></a>
-<span class="sourceLineNo">1638</span> if (left.length != right.length) return false;<a name="line.1638"></a>
-<span class="sourceLineNo">1639</span> if (left.length == 0) return true;<a name="line.1639"></a>
+<span class="sourceLineNo">1578</span> final int stride = 8;<a name="line.1578"></a>
+<span class="sourceLineNo">1579</span> final int minLength = Math.min(length1, length2);<a name="line.1579"></a>
+<span class="sourceLineNo">1580</span> int strideLimit = minLength & ~(stride - 1);<a name="line.1580"></a>
+<span class="sourceLineNo">1581</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
+<span class="sourceLineNo">1582</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1582"></a>
+<span class="sourceLineNo">1583</span> int i;<a name="line.1583"></a>
+<span class="sourceLineNo">1584</span><a name="line.1584"></a>
+<span class="sourceLineNo">1585</span> /*<a name="line.1585"></a>
+<span class="sourceLineNo">1586</span> * Compare 8 bytes at a time. Benchmarking on x86 shows a stride of 8 bytes is no slower<a name="line.1586"></a>
+<span class="sourceLineNo">1587</span> * than 4 bytes even on 32-bit. On the other hand, it is substantially faster on 64-bit.<a name="line.1587"></a>
+<span class="sourceLineNo">1588</span> */<a name="line.1588"></a>
+<span class="sourceLineNo">1589</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.1589"></a>
+<span class="sourceLineNo">1590</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1590"></a>
+<span class="sourceLineNo">1591</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1591"></a>
+<span class="sourceLineNo">1592</span> if (lw != rw) {<a name="line.1592"></a>
+<span class="sourceLineNo">1593</span> if(!UnsafeAccess.littleEndian) {<a name="line.1593"></a>
+<span class="sourceLineNo">1594</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.1594"></a>
+<span class="sourceLineNo">1595</span> }<a name="line.1595"></a>
+<span class="sourceLineNo">1596</span><a name="line.1596"></a>
+<span class="sourceLineNo">1597</span> /*<a name="line.1597"></a>
+<span class="sourceLineNo">1598</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.1598"></a>
+<span class="sourceLineNo">1599</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.1599"></a>
+<span class="sourceLineNo">1600</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.1600"></a>
+<span class="sourceLineNo">1601</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.1601"></a>
+<span class="sourceLineNo">1602</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.1602"></a>
+<span class="sourceLineNo">1603</span> * comparator from guava v21<a name="line.1603"></a>
+<span class="sourceLineNo">1604</span> */<a name="line.1604"></a>
+<span class="sourceLineNo">1605</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.1605"></a>
+<span class="sourceLineNo">1606</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.1606"></a>
+<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
+<span class="sourceLineNo">1608</span> }<a name="line.1608"></a>
+<span class="sourceLineNo">1609</span><a name="line.1609"></a>
+<span class="sourceLineNo">1610</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.1610"></a>
+<span class="sourceLineNo">1611</span> for (; i < minLength; i++) {<a name="line.1611"></a>
+<span class="sourceLineNo">1612</span> int a = (buffer1[offset1 + i] & 0xFF);<a name="line.1612"></a>
+<span class="sourceLineNo">1613</span> int b = (buffer2[offset2 + i] & 0xFF);<a name="line.1613"></a>
+<span class="sourceLineNo">1614</span> if (a != b) {<a name="line.1614"></a>
+<span class="sourceLineNo">1615</span> return a - b;<a name="line.1615"></a>
+<span class="sourceLineNo">1616</span> }<a name="line.1616"></a>
+<span class="sourceLineNo">1617</span> }<a name="line.1617"></a>
+<span class="sourceLineNo">1618</span> return length1 - length2;<a name="line.1618"></a>
+<span class="sourceLineNo">1619</span> }<a name="line.1619"></a>
+<span class="sourceLineNo">1620</span> }<a name="line.1620"></a>
+<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
+<span class="sourceLineNo">1622</span><a name="line.1622"></a>
+<span class="sourceLineNo">1623</span> /**<a name="line.1623"></a>
+<span class="sourceLineNo">1624</span> * @param left left operand<a name="line.1624"></a>
+<span class="sourceLineNo">1625</span> * @param right right operand<a name="line.1625"></a>
+<span class="sourceLineNo">1626</span> * @return True if equal<a name="line.1626"></a>
+<span class="sourceLineNo">1627</span> */<a name="line.1627"></a>
+<span class="sourceLineNo">1628</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1628"></a>
+<span class="sourceLineNo">1629</span> // Could use Arrays.equals?<a name="line.1629"></a>
+<span class="sourceLineNo">1630</span> //noinspection SimplifiableConditionalExpression<a name="line.1630"></a>
+<span class="sourceLineNo">1631</span> if (left == right) return true;<a name="line.1631"></a>
+<span class="sourceLineNo">1632</span> if (left == null || right == null) return false;<a name="line.1632"></a>
+<span class="sourceLineNo">1633</span> if (left.length != right.length) return false;<a name="line.1633"></a>
+<span class="sourceLineNo">1634</span> if (left.length == 0) return true;<a name="line.1634"></a>
+<span class="sourceLineNo">1635</span><a name="line.1635"></a>
+<span class="sourceLineNo">1636</span> // Since we're often comparing adjacent sorted data,<a name="line.1636"></a>
+<span class="sourceLineNo">1637</span> // it's usual to have equal arrays except for the very last byte<a name="line.1637"></a>
+<span class="sourceLineNo">1638</span> // so check that first<a name="line.1638"></a>
+<span class="sourceLineNo">1639</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1639"></a>
<span class="sourceLineNo">1640</span><a name="line.1640"></a>
-<span class="sourceLineNo">1641</span> // Since we're often comparing adjacent sorted data,<a name="line.1641"></a>
-<span class="sourceLineNo">1642</span> // it's usual to have equal arrays except for the very last byte<a name="line.1642"></a>
-<span class="sourceLineNo">1643</span> // so check that first<a name="line.1643"></a>
-<span class="sourceLineNo">1644</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1644"></a>
-<span class="sourceLineNo">1645</span><a name="line.1645"></a>
-<span class="sourceLineNo">1646</span> return compareTo(left, right) == 0;<a name="line.1646"></a>
-<span class="sourceLineNo">1647</span> }<a name="line.1647"></a>
-<span class="sourceLineNo">1648</span><a name="line.1648"></a>
-<span class="sourceLineNo">1649</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1649"></a>
-<span class="sourceLineNo">1650</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1650"></a>
-<span class="sourceLineNo">1651</span> // short circuit case<a name="line.1651"></a>
-<span class="sourceLineNo">1652</span> if (left == right &&<a name="line.1652"></a>
-<span class="sourceLineNo">1653</span> leftOffset == rightOffset &&<a name="line.1653"></a>
-<span class="sourceLineNo">1654</span> leftLen == rightLen) {<a name="line.1654"></a>
-<span class="sourceLineNo">1655</span> return true;<a name="line.1655"></a>
-<span class="sourceLineNo">1656</span> }<a name="line.1656"></a>
-<span class="sourceLineNo">1657</span> // different lengths fast check<a name="line.1657"></a>
-<span class="sourceLineNo">1658</span> if (leftLen != rightLen) {<a name="line.1658"></a>
-<span class="sourceLineNo">1659</span> return false;<a name="line.1659"></a>
-<span class="sourceLineNo">1660</span> }<a name="line.1660"></a>
-<span class="sourceLineNo">1661</span> if (leftLen == 0) {<a name="line.1661"></a>
-<span class="sourceLineNo">1662</span> return true;<a name="line.1662"></a>
-<span class="sourceLineNo">1663</span> }<a name="line.1663"></a>
+<span class="sourceLineNo">1641</span> return compareTo(left, right) == 0;<a name="line.1641"></a>
+<span class="sourceLineNo">1642</span> }<a name="line.1642"></a>
+<span class="sourceLineNo">1643</span><a name="line.1643"></a>
+<span class="sourceLineNo">1644</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1644"></a>
+<span class="sourceLineNo">1645</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1645"></a>
+<span class="sourceLineNo">1646</span> // short circuit case<a name="line.1646"></a>
+<span class="sourceLineNo">1647</span> if (left == right &&<a name="line.1647"></a>
+<span class="sourceLineNo">1648</span> leftOffset == rightOffset &&<a name="line.1648"></a>
+<span class="sourceLineNo">1649</span> leftLen == rightLen) {<a name="line.1649"></a>
+<span class="sourceLineNo">1650</span> return true;<a name="line.1650"></a>
+<span class="sourceLineNo">1651</span> }<a name="line.1651"></a>
+<span class="sourceLineNo">1652</span> // different lengths fast check<a name="line.1652"></a>
+<span class="sourceLineNo">1653</span> if (leftLen != rightLen) {<a name="line.1653"></a>
+<span class="sourceLineNo">1654</span> return false;<a name="line.1654"></a>
+<span class="sourceLineNo">1655</span> }<a name="line.1655"></a>
+<span class="sourceLineNo">1656</span> if (leftLen == 0) {<a name="line.1656"></a>
+<span class="sourceLineNo">1657</span> return true;<a name="line.1657"></a>
+<span class="sourceLineNo">1658</span> }<a name="line.1658"></a>
+<span class="sourceLineNo">1659</span><a name="line.1659"></a>
+<span class="sourceLineNo">1660</span> // Since we're often comparing adjacent sorted data,<a name="line.1660"></a>
+<span class="sourceLineNo">1661</span> // it's usual to have equal arrays except for the very last byte<a name="line.1661"></a>
+<span class="sourceLineNo">1662</span> // so check that first<a name="line.1662"></a>
+<span class="sourceLineNo">1663</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1663"></a>
<span class="sourceLineNo">1664</span><a name="line.1664"></a>
-<span class="sourceLineNo">1665</span> // Since we're often comparing adjacent sorted data,<a name="line.1665"></a>
-<span class="sourceLineNo">1666</span> // it's usual to have equal arrays except for the very last byte<a name="line.1666"></a>
-<span class="sourceLineNo">1667</span> // so check that first<a name="line.1667"></a>
-<span class="sourceLineNo">1668</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1668"></a>
+<span class="sourceLineNo">1665</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1665"></a>
+<span class="sourceLineNo">1666</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1666"></a>
+<span class="sourceLineNo">1667</span> }<a name="line.1667"></a>
+<span class="sourceLineNo">1668</span><a name="line.1668"></a>
<span class="sourceLineNo">1669</span><a name="line.1669"></a>
-<span class="sourceLineNo">1670</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1670"></a>
-<span class="sourceLineNo">1671</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1671"></a>
-<span class="sourceLineNo">1672</span> }<a name="line.1672"></a>
-<span class="sourceLineNo">1673</span><a name="line.1673"></a>
-<span class="sourceLineNo">1674</span><a name="line.1674"></a>
-<span class="sourceLineNo">1675</span> /**<a name="line.1675"></a>
-<span class="sourceLineNo">1676</span> * @param a left operand<a name="line.1676"></a>
-<span class="sourceLineNo">1677</span> * @param buf right operand<a name="line.1677"></a>
-<span class="sourceLineNo">1678</span> * @return True if equal<a name="line.1678"></a>
-<span class="sourceLineNo">1679</span> */<a name="line.1679"></a>
-<span class="sourceLineNo">1680</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1680"></a>
-<span class="sourceLineNo">1681</span> if (a == null) return buf == null;<a name="line.1681"></a>
-<span class="sourceLineNo">1682</span> if (buf == null) return false;<a name="line.1682"></a>
-<span class="sourceLineNo">1683</span> if (a.length != buf.remaining()) return false;<a name="line.1683"></a>
-<span class="sourceLineNo">1684</span><a name="line.1684"></a>
-<span class="sourceLineNo">1685</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1685"></a>
-<span class="sourceLineNo">1686</span> ByteBuffer b = buf.duplicate();<a name="line.1686"></a>
-<span class="sourceLineNo">1687</span> for (byte anA : a) {<a name="line.1687"></a>
-<span class="sourceLineNo">1688</span> if (anA != b.get()) {<a name="line.1688"></a>
-<span class="sourceLineNo">1689</span> return false;<a name="line.1689"></a>
-<span class="sourceLineNo">1690</span> }<a name="line.1690"></a>
-<span class="sourceLineNo">1691</span> }<a name="line.1691"></a>
-<span class="sourceLineNo">1692</span> return true;<a name="line.1692"></a>
-<span class="sourceLineNo">1693</span> }<a name="line.1693"></a>
-<span class="sourceLineNo">1694</span><a name="line.1694"></a>
-<span class="sourceLineNo">1695</span><a name="line.1695"></a>
-<span class="sourceLineNo">1696</span> /**<a name="line.1696"></a>
-<span class="sourceLineNo">1697</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1697"></a>
-<span class="sourceLineNo">1698</span> * array on the left.<a name="line.1698"></a>
-<span class="sourceLineNo">1699</span> */<a name="line.1699"></a>
-<span class="sourceLineNo">1700</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1700"></a>
-<span class="sourceLineNo">1701</span> return bytes != null && prefix != null &&<a name="line.1701"></a>
-<span class="sourceLineNo">1702</span> bytes.length >= prefix.length &&<a name="line.1702"></a>
-<span class="sourceLineNo">1703</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1703"></a>
-<span class="sourceLineNo">1704</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1704"></a>
-<span class="sourceLineNo">1705</span> }<a name="line.1705"></a>
-<span class="sourceLineNo">1706</span><a name="line.1706"></a>
-<span class="sourceLineNo">1707</span> /**<a name="line.1707"></a>
-<span class="sourceLineNo">1708</span> * @param b bytes to hash<a name="line.1708"></a>
-<span class="sourceLineNo">1709</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1709"></a>
-<span class="sourceLineNo">1710</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1710"></a>
-<span class="sourceLineNo">1711</span> * use calculating hash code.<a name="line.1711"></a>
-<span class="sourceLineNo">1712</span> */<a name="line.1712"></a>
-<span class="sourceLineNo">1713</span> public static int hashCode(final byte [] b) {<a name="line.1713"></a>
-<span class="sourceLineNo">1714</span> return hashCode(b, b.length);<a name="line.1714"></a>
-<span class="sourceLineNo">1715</span> }<a name="line.1715"></a>
-<span class="sourceLineNo">1716</span><a name="line.1716"></a>
-<span class="sourceLineNo">1717</span> /**<a name="line.1717"></a>
-<span class="sourceLineNo">1718</span> * @param b value<a name="line.1718"></a>
-<span class="sourceLineNo">1719</span> * @param length length of the value<a name="line.1719"></a>
-<span class="sourceLineNo">1720</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1720"></a>
-<span class="sourceLineNo">1721</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1721"></a>
-<span class="sourceLineNo">1722</span> * use calculating hash code.<a name="line.1722"></a>
-<span class="sourceLineNo">1723</span> */<a name="line.1723"></a>
-<span class="sourceLineNo">1724</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1724"></a>
-<span class="sourceLineNo">1725</span> return WritableComparator.hashBytes(b, length);<a name="line.1725"></a>
-<span class="sourceLineNo">1726</span> }<a name="line.1726"></a>
-<span class="sourceLineNo">1727</span><a name="line.1727"></a>
-<span class="sourceLineNo">1728</span> /**<a name="line.1728"></a>
-<span class="sourceLineNo">1729</span> * @param b bytes to hash<a name="line.1729"></a>
-<span class="sourceLineNo">1730</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1730"></a>
-<span class="sourceLineNo">1731</span> * Maps.<a name="line.1731"></a>
-<span class="sourceLineNo">1732</span> */<a name="line.1732"></a>
-<span class="sourceLineNo">1733</span> public static Integer mapKey(final byte [] b) {<a name="line.1733"></a>
-<span class="sourceLineNo">1734</span> return hashCode(b);<a name="line.1734"></a>
-<span class="sourceLineNo">1735</span> }<a name="line.1735"></a>
-<span class="sourceLineNo">1736</span><a name="line.1736"></a>
-<span class="sourceLineNo">1737</span> /**<a name="line.1737"></a>
-<span class="sourceLineNo">1738</span> * @param b bytes to hash<a name="line.1738"></a>
-<span class="sourceLineNo">1739</span> * @param length length to hash<a name="line.1739"></a>
-<span class="sourceLineNo">1740</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1740"></a>
-<span class="sourceLineNo">1741</span> * Maps.<a name="line.1741"></a>
-<span class="sourceLineNo">1742</span> */<a name="line.1742"></a>
-<span class="sourceLineNo">1743</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1743"></a>
-<span class="sourceLineNo">1744</span> return hashCode(b, length);<a name="line.1744"></a>
-<span class="sourceLineNo">1745</span> }<a name="line.1745"></a>
-<span class="sourceLineNo">1746</span><a name="line.1746"></a>
-<span class="sourceLineNo">1747</span> /**<a name="line.1747"></a>
-<span class="sourceLineNo">1748</span> * @param a lower half<a name="line.1748"></a>
-<span class="sourceLineNo">1749</span> * @param b upper half<a name="line.1749"></a>
-<span class="sourceLineNo">1750</span> * @return New array that has a in lower half and b in upper half.<a name="line.1750"></a>
-<span class="sourceLineNo">1751</span> */<a name="line.1751"></a>
-<span class="sourceLineNo">1752</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1752"></a>
-<span class="sourceLineNo">1753</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1753"></a>
-<span class="sourceLineNo">1754</span> }<a name="line.1754"></a>
-<span class="sourceLineNo">1755</span><a name="line.1755"></a>
-<span class="sourceLineNo">1756</span> /**<a name="line.1756"></a>
-<span class="sourceLineNo">1757</span> * @param a first third<a name="line.1757"></a>
-<span class="sourceLineNo">1758</span> * @param b second third<a name="line.1758"></a>
-<span class="sourceLineNo">1759</span> * @param c third third<a name="line.1759"></a>
-<span class="sourceLineNo">1760</span> * @return New array made from a, b and c<a name="line.1760"></a>
-<span class="sourceLineNo">1761</span> */<a name="line.1761"></a>
-<span class="sourceLineNo">1762</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1762"></a>
-<span class="sourceLineNo">1763</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1763"></a>
-<span class="sourceLineNo">1764</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1764"></a>
-<span class="sourceLineNo">1765</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1765"></a>
-<span class="sourceLineNo">1766</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1766"></a>
-<span class="sourceLineNo">1767</span> return result;<a name="line.1767"></a>
-<span class="sourceLineNo">1768</span> }<a name="line.1768"></a>
-<span class="sourceLineNo">1769</span><a name="line.1769"></a>
-<span class="sourceLineNo">1770</span> /**<a name="line.1770"></a>
-<span class="sourceLineNo">1771</span> * @param arrays all the arrays to concatenate together.<a name="line.1771"></a>
-<span class="sourceLineNo">1772</span> * @return New array made from the concatenation of the given arrays.<a name="line.1772"></a>
-<span class="sourceLineNo">1773</span> */<a name="line.1773"></a>
-<span class="sourceLineNo">1774</span> public static byte [] add(final byte [][] arrays) {<a name="line.1774"></a>
-<span class="sourceLineNo">1775</span> int length = 0;<a name="line.1775"></a>
+<span class="sourceLineNo">1670</span> /**<a name="line.1670"></a>
+<span class="sourceLineNo">1671</span> * @param a left operand<a name="line.1671"></a>
+<span class="sourceLineNo">1672</span> * @param buf right operand<a name="line.1672"></a>
+<span class="sourceLineNo">1673</span> * @return True if equal<a name="line.1673"></a>
+<span class="sourceLineNo">1674</span> */<a name="line.1674"></a>
+<span class="sourceLineNo">1675</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1675"></a>
+<span class="sourceLineNo">1676</span> if (a == null) return buf == null;<a name="line.1676"></a>
+<span class="sourceLineNo">1677</span> if (buf == null) return false;<a name="line.1677"></a>
+<span class="sourceLineNo">1678</span> if (a.length != buf.remaining()) return false;<a name="line.1678"></a>
+<span class="sourceLineNo">1679</span><a name="line.1679"></a>
+<span class="sourceLineNo">1680</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1680"></a>
+<span class="sourceLineNo">1681</span> ByteBuffer b = buf.duplicate();<a name="line.1681"></a>
+<span class="sourceLineNo">1682</span> for (byte anA : a) {<a name="line.1682"></a>
+<span class="sourceLineNo">1683</span> if (anA != b.get()) {<a name="line.1683"></a>
+<span class="sourceLineNo">1684</span> return false;<a name="line.1684"></a>
+<span class="sourceLineNo">1685</span> }<a name="line.1685"></a>
+<span class="sourceLineNo">1686</span> }<a name="line.1686"></a>
+<span class="sourceLineNo">1687</span> return true;<a name="line.1687"></a>
+<span class="sourceLineNo">1688</span> }<a name="line.1688"></a>
+<span class="sourceLineNo">1689</span><a name="line.1689"></a>
+<span class="sourceLineNo">1690</span><a name="line.1690"></a>
+<span class="sourceLineNo">1691</span> /**<a name="line.1691"></a>
+<span class="sourceLineNo">1692</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1692"></a>
+<span class="sourceLineNo">1693</span> * array on the left.<a name="line.1693"></a>
+<span class="sourceLineNo">1694</span> */<a name="line.1694"></a>
+<span class="sourceLineNo">1695</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1695"></a>
+<span class="sourceLineNo">1696</span> return bytes != null && prefix != null &&<a name="line.1696"></a>
+<span class="sourceLineNo">1697</span> bytes.length >= prefix.length &&<a name="line.1697"></a>
+<span class="sourceLineNo">1698</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1698"></a>
+<span class="sourceLineNo">1699</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1699"></a>
+<span class="sourceLineNo">1700</span> }<a name="line.1700"></a>
+<span class="sourceLineNo">1701</span><a name="line.1701"></a>
+<span class="sourceLineNo">1702</span> /**<a name="line.1702"></a>
+<span class="sourceLineNo">1703</span> * @param b bytes to hash<a name="line.1703"></a>
+<span class="sourceLineNo">1704</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1704"></a>
+<span class="sourceLineNo">1705</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1705"></a>
+<span class="sourceLineNo">1706</span> * use calculating hash code.<a name="line.1706"></a>
+<span class="sourceLineNo">1707</span> */<a name="line.1707"></a>
+<span class="sourceLineNo">1708</span> public static int hashCode(final byte [] b) {<a name="line.1708"></a>
+<span class="sourceLineNo">1709</span> return hashCode(b, b.length);<a name="line.1709"></a>
+<span class="sourceLineNo">1710</span> }<a name="line.1710"></a>
+<span class="sourceLineNo">1711</span><a name="line.1711"></a>
+<span class="sourceLineNo">1712</span> /**<a name="line.1712"></a>
+<span class="sourceLineNo">1713</span> * @param b value<a name="line.1713"></a>
+<span class="sourceLineNo">1714</span> * @param length length of the value<a name="line.1714"></a>
+<span class="sourceLineNo">1715</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1715"></a>
+<span class="sourceLineNo">1716</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1716"></a>
+<span class="sourceLineNo">1717</span> * use calculating hash code.<a name="line.1717"></a>
+<span class="sourceLineNo">1718</span> */<a name="line.1718"></a>
+<span class="sourceLineNo">1719</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1719"></a>
+<span class="sourceLineNo">1720</span> return WritableComparator.hashBytes(b, length);<a name="line.1720"></a>
+<span class="sourceLineNo">1721</span> }<a name="line.1721"></a>
+<span class="sourceLineNo">1722</span><a name="line.1722"></a>
+<span class="sourceLineNo">1723</span> /**<a name="line.1723"></a>
+<span class="sourceLineNo">1724</span> * @param b bytes to hash<a name="line.1724"></a>
+<span class="sourceLineNo">1725</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1725"></a>
+<span class="sourceLineNo">1726</span> * Maps.<a name="line.1726"></a>
+<span class="sourceLineNo">1727</span> */<a name="line.1727"></a>
+<span class="sourceLineNo">1728</span> public static Integer mapKey(final byte [] b) {<a name="line.1728"></a>
+<span class="sourceLineNo">1729</span> return hashCode(b);<a name="line.1729"></a>
+<span class="sourceLineNo">1730</span> }<a name="line.1730"></a>
+<span class="sourceLineNo">1731</span><a name="line.1731"></a>
+<span class="sourceLineNo">1732</span> /**<a name="line.1732"></a>
+<span class="sourceLineNo">1733</span> * @param b bytes to hash<a name="line.1733"></a>
+<span class="sourceLineNo">1734</span> * @param length length to hash<a name="line.1734"></a>
+<span class="sourceLineNo">1735</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1735"></a>
+<span class="sourceLineNo">1736</span> * Maps.<a name="line.1736"></a>
+<span class="sourceLineNo">1737</span> */<a name="line.1737"></a>
+<span class="sourceLineNo">1738</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1738"></a>
+<span class="sourceLineNo">1739</span> return hashCode(b, length);<a name="line.1739"></a>
+<span class="sourceLineNo">1740</span> }<a name="line.1740"></a>
+<span class="sourceLineNo">1741</span><a name="line.1741"></a>
+<span class="sourceLineNo">1742</span> /**<a name="line.1742"></a>
+<span class="sourceLineNo">1743</span> * @param a lower half<a name="line.1743"></a>
+<span class="sourceLineNo">1744</span> * @param b upper half<a name="line.1744"></a>
+<span class="sourceLineNo">1745</span> * @return New array that has a in lower half and b in upper half.<a name="line.1745"></a>
+<span class="sourceLineNo">1746</span> */<a name="line.1746"></a>
+<span class="sourceLineNo">1747</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1747"></a>
+<span class="sourceLineNo">1748</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1748"></a>
+<span class="sourceLineNo">1749</span> }<a name="line.1749"></a>
+<span class="sourceLineNo">1750</span><a name="line.1750"></a>
+<span class="sourceLineNo">1751</span> /**<a name="line.1751"></a>
+<span class="sourceLineNo">1752</span> * @param a first third<a name="line.1752"></a>
+<span class="sourceLineNo">1753</span> * @param b second third<a name="line.1753"></a>
+<span class="sourceLineNo">1754</span> * @param c third third<a name="line.1754"></a>
+<span class="sourceLineNo">1755</span> * @return New array made from a, b and c<a name="line.1755"></a>
+<span class="sourceLineNo">1756</span> */<a name="line.1756"></a>
+<span class="sourceLineNo">1757</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1757"></a>
+<span class="sourceLineNo">1758</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1758"></a>
+<span class="sourceLineNo">1759</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1759"></a>
+<span class="sourceLineNo">1760</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1760"></a>
+<span class="sourceLineNo">1761</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1761"></a>
+<span class="sourceLineNo">1762</span> return result;<a name="line.1762"></a>
+<span class="sourceLineNo">1763</span> }<a name="line.1763"></a>
+<span class="sourceLineNo">1764</span><a name="line.1764"></a>
+<span class="sourceLineNo">1765</span> /**<a name="line.1765"></a>
+<span class="sourceLineNo">1766</span> * @param arrays all the arrays to concatenate together.<a name="line.1766"></a>
+<span class="sourceLineNo">1767</span> * @return New array made from the concatenation of the given arrays.<a name="line.1767"></a>
+<span class="sourceLineNo">1768</span> */<a name="line.1768"></a>
+<span class="sourceLineNo">1769</span> public static byte [] add(final byte [][] arrays) {<a name="line.1769"></a>
+<span class="sourceLineNo">1770</span> int length = 0;<a name="line.1770"></a>
+<span class="sourceLineNo">1771</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1771"></a>
+<span class="sourceLineNo">1772</span> length += arrays[i].length;<a name="line.1772"></a>
+<span class="sourceLineNo">1773</span> }<a name="line.1773"></a>
+<span class="sourceLineNo">1774</span> byte [] result = new byte[length];<a name="line.1774"></a>
+<span class="sourceLineNo">1775</span> int index = 0;<a name="line.1775"></a>
<span class="sourceLineNo">1776</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1776"></a>
-<span class="sourceLineNo">1777</span> length += arrays[i].length;<a name="line.1777"></a>
-<span class="sourceLineNo">1778</span> }<a name="line.1778"></a>
-<span class="sourceLineNo">1779</span> byte [] result = new byte[length];<a name="line.1779"></a>
-<span class="sourceLineNo">1780</span> int index = 0;<a name="line.1780"></a>
-<span class="sourceLineNo">1781</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1781"></a>
-<span class="sourceLineNo">1782</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1782"></a>
-<span class="sourceLineNo">1783</span> index += arrays[i].length;<a name="line.1783"></a>
-<span class="sourceLineNo">1784</span> }<a name="line.1784"></a>
-<span class="sourceLineNo">1785</span> return result;<a name="line.1785"></a>
-<span class="sourceLineNo">1786</span> }<a name="line.1786"></a>
-<span class="sourceLineNo">1787</span><a name="line.1787"></a>
-<span class="sourceLineNo">1788</span> /**<a name="line.1788"></a>
-<span class="sourceLineNo">1789</span> * @param a array<a name="line.1789"></a>
-<span class="sourceLineNo">1790</span> * @param length amount of bytes to grab<a name="line.1790"></a>
-<span class="sourceLineNo">1791</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1791"></a>
-<span class="sourceLineNo">1792</span> */<a name="line.1792"></a>
-<span class="sourceLineNo">1793</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1793"></a>
-<span class="sourceLineNo">1794</span> if (a.length < length) {<a name="line.1794"></a>
-<span class="sourceLineNo">1795</span> return null;<a name="line.1795"></a>
-<span class="sourceLineNo">1796</span> }<a name="line.1796"></a>
-<span class="sourceLineNo">1797</span> byte [] result = new byte[length];<a name="line.1797"></a>
-<span class="sourceLineNo">1798</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1798"></a>
-<span class="sourceLineNo">1799</span> return result;<a name="line.1799"></a>
-<span class="sourceLineNo">1800</span> }<a name="line.1800"></a>
-<span class="sourceLineNo">1801</span><a name="line.1801"></a>
-<span class="sourceLineNo">1802</span> /**<a name="line.1802"></a>
-<span class="sourceLineNo">1803</span> * @param a array<a name="line.1803"></a>
-<span class="sourceLineNo">1804</span> * @param length amount of bytes to snarf<a name="line.1804"></a>
-<span class="sourceLineNo">1805</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1805"></a>
-<span class="sourceLineNo">1806</span> */<a name="line.1806"></a>
-<span class="sourceLineNo">1807</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1807"></a>
-<span class="sourceLineNo">1808</span> if (a.length < length) {<a name="line.1808"></a>
-<span class="sourceLineNo">1809</span> return null;<a name="line.1809"></a>
-<span class="sourceLineNo">1810</span> }<a name="line.1810"></a>
-<span class="sourceLineNo">1811</span> byte [] result = new byte[length];<a name="line.1811"></a>
-<span class="sourceLineNo">1812</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1812"></a>
-<span class="sourceLineNo">1813</span> return result;<a name="line.1813"></a>
-<span class="sourceLineNo">1814</span> }<a name="line.1814"></a>
-<span class="sourceLineNo">1815</span><a name="line.1815"></a>
-<span class="sourceLineNo">1816</span> /**<a name="line.1816"></a>
-<span class="sourceLineNo">1817</span> * @param a array<a name="line.1817"></a>
-<span class="sourceLineNo">1818</span> * @param length new array size<a name="line.1818"></a>
-<span class="sourceLineNo">1819</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1819"></a>
-<span class="sourceLineNo">1820</span> */<a name="line.1820"></a>
-<span class="sourceLineNo">1821</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1821"></a>
-<span class="sourceLineNo">1822</span> byte [] padding = new byte[length];<a name="line.1822"></a>
-<span class="sourceLineNo">1823</span> for (int i = 0; i < length; i++) {<a name="line.1823"></a>
-<span class="sourceLineNo">1824</span> padding[i] = 0;<a name="line.1824"></a>
-<span class="sourceLineNo">1825</span> }<a name="line.1825"></a>
-<span class="sourceLineNo">1826</span> return add(padding,a);<a name="line.1826"></a>
-<span class="sourceLineNo">1827</span> }<a name="line.1827"></a>
-<span class="sourceLineNo">1828</span><a name="line.1828"></a>
-<span class="sourceLineNo">1829</span> /**<a name="line.1829"></a>
-<span class="sourceLineNo">1830</span> * @param a array<a name="line.1830"></a>
-<span class="sourceLineNo">1831</span> * @param length new array size<a name="line.1831"></a>
-<span class="sourceLineNo">1832</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1832"></a>
-<span class="sourceLineNo">1833</span> */<a name="line.1833"></a>
-<span class="sourceLineNo">1834</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1834"></a>
-<span class="sourceLineNo">1835</span> byte [] padding = new byte[length];<a name="line.1835"></a>
-<span class="sourceLineNo">1836</span> for (int i = 0; i < length; i++) {<a name="line.1836"></a>
-<span class="sourceLineNo">1837</span> padding[i] = 0;<a name="line.1837"></a>
-<span class="sourceLineNo">1838</span> }<a name="line.1838"></a>
-<span class="sourceLineNo">1839</span> return add(a,padding);<a name="line.1839"></a>
-<span class="sourceLineNo">1840</span> }<a name="line.1840"></a>
-<span class="sourceLineNo">1841</span><a name="line.1841"></a>
-<span class="sourceLineNo">1842</span> /**<a name="line.1842"></a>
-<span class="sourceLineNo">1843</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1843"></a>
-<span class="sourceLineNo">1844</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1844"></a>
-<span class="sourceLineNo">1845</span> * @param a Beginning of range<a name="line.1845"></a>
-<span class="sourceLineNo">1846</span> * @param b End of range<a name="line.1846"></a>
-<span class="sourceLineNo">1847</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1847"></a>
-<span class="sourceLineNo">1848</span> * the range in two; i.e. one split.<a name="line.1848"></a>
-<span class="sourceLineNo">1849</span> * @return Array of dividing values<a name="line.1849"></a>
-<span class="sourceLineNo">1850</span> */<a name="line.1850"></a>
-<span class="sourceLineNo">1851</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1851"></a>
-<span class="sourceLineNo">1852</span> return split(a, b, false, num);<a name="line.1852"></a>
-<span class="sourceLineNo">1853</span> }<a name="line.1853"></a>
-<span class="sourceLineNo">1854</span><a name="line.1854"></a>
-<span class="sourceLineNo">1855</span> /**<a name="line.1855"></a>
-<span class="sourceLineNo">1856</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1856"></a>
-<span class="sourceLineNo">1857</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1857"></a>
-<span class="sourceLineNo">1858</span> * @param a Beginning of range<a name="line.1858"></a>
-<span class="sourceLineNo">1859</span> * @param b End of range<a name="line.1859"></a>
-<span class="sourceLineNo">1860</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1860"></a>
-<span class="sourceLineNo">1861</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1861"></a>
-<span class="sourceLineNo">1862</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1862"></a>
-<span class="sourceLineNo">1863</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1863"></a>
-<span class="sourceLineNo">1864</span> * the range in two; i.e. one split.<a name="line.1864"></a>
-<span class="sourceLineNo">1865</span> * @return Array of dividing values<a name="line.1865"></a>
-<span class="sourceLineNo">1866</span> */<a name="line.1866"></a>
-<span class="sourceLineNo">1867</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1867"></a>
-<span class="sourceLineNo">1868</span> boolean inclusive, final int num) {<a name="line.1868"></a>
-<span class="sourceLineNo">1869</span> byte[][] ret = new byte[num + 2][];<a name="line.1869"></a>
-<span class="sourceLineNo">1870</span> int i = 0;<a name="line.1870"></a>
-<span class="sourceLineNo">1871</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1871"></a>
-<span class="sourceLineNo">1872</span> if (iter == null)<a name="line.1872"></a>
-<span class="sourceLineNo">1873</span> return null;<a name="line.1873"></a>
-<span class="sourceLineNo">1874</span> for (byte[] elem : iter) {<a name="line.1874"></a>
-<span class="sourceLineNo">1875</span> ret[i++] = elem;<a name="line.1875"></a>
-<span class="sourceLineNo">1876</span> }<a name="line.1876"></a>
-<span class="sourceLineNo">1877</span> return ret;<a name="line.1877"></a>
-<span class="sourceLineNo">1878</span> }<a name="line.1878"></a>
-<span class="sourceLineNo">1879</span><a name="line.1879"></a>
-<span class="sourceLineNo">1880</span> /**<a name="line.1880"></a>
-<span class="sourceLineNo">1881</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1881"></a>
-<span class="sourceLineNo">1882</span> */<a name="line.1882"></a>
-<span class="sourceLineNo">1883</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1883"></a>
-<span class="sourceLineNo">1884</span> final byte[] b, final int num)<a name="line.1884"></a>
-<span class="sourceLineNo">1885</span> {<a name="line.1885"></a>
-<span class="sourceLineNo">1886</span> return iterateOnSplits(a, b, false, num);<a name="line.1886"></a>
-<span class="sourceLineNo">1887</span> }<a name="line.1887"></a>
-<span class="sourceLineNo">1888</span><a name="line.1888"></a>
-<span class="sourceLineNo">1889</span> /**<a name="line.1889"></a>
-<span class="sourceLineNo">1890</span> * Iterate over keys within the passed range.<a name="line.1890"></a>
-<span class="sourceLineNo">1891</span> */<a name="line.1891"></a>
-<span class="sourceLineNo">1892</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1892"></a>
-<span class="sourceLineNo">1893</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1893"></a>
-<span class="sourceLineNo">1894</span> {<a name="line.1894"></a>
-<span class="sourceLineNo">1895</span> byte [] aPadded;<a name="line.1895"></a>
-<span class="sourceLineNo">1896</span> byte [] bPadded;<a name="line.1896"></a>
-<span class="sourceLineNo">1897</span> if (a.length < b.length) {<a name="line.1897"></a>
-<span class="sourceLineNo">1898</span> aPadded = padTail(a, b.length - a.length);<a name="line.1898"></a>
-<span class="sourceLineNo">1899</span> bPadded = b;<a name="line.1899"></a>
-<span class="sourceLineNo">1900</span> } else if (b.length < a.length) {<a name="line.1900"></a>
-<span class="sourceLineNo">1901</span> aPadded = a;<a name="line.1901"></a>
-<span class="sourceLineNo">1902</span> bPadded = padTail(b, a.length - b.length);<a name="line.1902"></a>
-<span class="sourceLineNo">1903</span> } else {<a name="line.1903"></a>
-<span class="sourceLineNo">1904</span> aPadded = a;<a name="line.1904"></a>
-<span class="sourceLineNo">1905</span> bPadded = b;<a name="line.1905"></a>
-<span class="sourceLineNo">1906</span> }<a name="line.1906"></a>
-<span class="sourceLineNo">1907</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1907"></a>
-<span class="sourceLineNo">1908</span> throw new IllegalArgumentException("b <= a");<a name="line.1908"></a>
-<span class="sourceLineNo">1909</span> }<a name="line.1909"></a>
-<span class="sourceLineNo">1910</span> if (num <= 0) {<a name="line.1910"></a>
-<span class="sourceLineNo">1911</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1911"></a>
-<span class="sourceLineNo">1912</span> }<a name="line.1912"></a>
-<span class="sourceLineNo">1913</span> byte [] prependHeader = {1, 0};<a name="line.1913"></a>
-<span class="sourceLineNo">1914</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1914"></a>
-<span class="sourceLineNo">1915</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1915"></a>
-<span class="sourceLineNo">1916</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1916"></a>
-<span class="sourceLineNo">1917</span> if (inclusive) {<a name="line.1917"></a>
-<span class="sourceLineNo">1918</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1918"></a>
-<span class="sourceLineNo">1919</span> }<a name="line.1919"></a>
-<span class="sourceLineNo">1920</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1920"></a>
-<span class="sourceLineNo">1921</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1921"></a>
-<span class="sourceLineNo">1922</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1922"></a>
-<span class="sourceLineNo">1923</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1923"></a>
-<span class="sourceLineNo">1924</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1924"></a>
-<span class="sourceLineNo">1925</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1925"></a>
-<span class="sourceLineNo">1926</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1926"></a>
-<span class="sourceLineNo">1927</span> }<a name="line.1927"></a>
-<span class="sourceLineNo">1928</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1928"></a>
-<span class="sourceLineNo">1929</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1929"></a>
-<span class="sourceLineNo">1930</span> }<a name="line.1930"></a>
-<span class="sourceLineNo">1931</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1931"></a>
-<span class="sourceLineNo">1932</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1932"></a>
-<span class="sourceLineNo">1933</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1933"></a>
-<span class="sourceLineNo">1934</span> }<a name="line.1934"></a>
-<span class="sourceLineNo">1935</span> final BigInteger intervalBI;<a name="line.1935"></a>
-<span class="sourceLineNo">1936</span> try {<a name="line.1936"></a>
-<span class="sourceLineNo">1937</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1937"></a>
-<span class="sourceLineNo">1938</span> } catch(Exception e) {<a name="line.1938"></a>
-<span class="sourceLineNo">1939</span> LOG.error("Exception caught during division", e);<a name="line.1939"></a>
-<span class="sourceLineNo">1940</span> return null;<a name="line.1940"></a>
-<span class="sourceLineNo">1941</span> }<a name="line.1941"></a>
-<span class="sourceLineNo">1942</span><a name="line.1942"></a>
-<span class="sourceLineNo">1943</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1943"></a>
-<span class="sourceLineNo">1944</span> private int i = -1;<a name="line.1944"></a>
+<span class="sourceLineNo">1777</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1777"></a>
+<span class="sourceLineNo">1778</span> index += arrays[i].length;<a name="line.1778"></a>
+<span class="sourceLineNo">1779</span> }<a name="line.1779"></a>
+<span class="sourceLineNo">1780</span> return result;<a name="line.1780"></a>
+<span class="sourceLineNo">1781</span> }<a name="line.1781"></a>
+<span class="sourceLineNo">1782</span><a name="line.1782"></a>
+<span class="sourceLineNo">1783</span> /**<a name="line.1783"></a>
+<span class="sourceLineNo">1784</span> * @param a array<a name="line.1784"></a>
+<span class="sourceLineNo">1785</span> * @param length amount of bytes to grab<a name="line.1785"></a>
+<span class="sourceLineNo">1786</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1786"></a>
+<span class="sourceLineNo">1787</span> */<a name="line.1787"></a>
+<span class="sourceLineNo">1788</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1788"></a>
+<span class="sourceLineNo">1789</span> if (a.length < length) {<a name="line.1789"></a>
+<span class="sourceLineNo">1790</span> return null;<a name="line.1790"></a>
+<span class="sourceLineNo">1791</span> }<a name="line.1791"></a>
+<span class="sourceLineNo">1792</span> byte [] result = new byte[length];<a name="line.1792"></a>
+<span class="sourceLineNo">1793</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1793"></a>
+<span class="sourceLineNo">1794</span> return result;<a name="line.1794"></a>
+<span class="sourceLineNo">1795</span> }<a name="line.1795"></a>
+<span class="sourceLineNo">1796</span><a name="line.1796"></a>
+<span class="sourceLineNo">1797</span> /**<a name="line.1797"></a>
+<span class="sourceLineNo">1798</span> * @param a array<a name="line.1798"></a>
+<span class="sourceLineNo">1799</span> * @param length amount of bytes to snarf<a name="line.1799"></a>
+<span class="sourceLineNo">1800</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1800"></a>
+<span class="sourceLineNo">1801</span> */<a name="line.1801"></a>
+<span class="sourceLineNo">1802</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1802"></a>
+<span class="sourceLineNo">1803</span> if (a.length < length) {<a name="line.1803"></a>
+<span class="sourceLineNo">1804</span> return null;<a name="line.1804"></a>
+<span class="sourceLineNo">1805</span> }<a name="line.1805"></a>
+<span class="sourceLineNo">1806</span> byte [] result = new byte[length];<a name="line.1806"></a>
+<span class="sourceLineNo">1807</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1807"></a>
+<span class="sourceLineNo">1808</span> return result;<a name="line.1808"></a>
+<span class="sourceLineNo">1809</span> }<a name="line.1809"></a>
+<span class="sourceLineNo">1810</span><a name="line.1810"></a>
+<span class="sourceLineNo">1811</span> /**<a name="line.1811"></a>
+<span class="sourceLineNo">1812</span> * @param a array<a name="line.1812"></a>
+<span class="sourceLineNo">1813</span> * @param length new array size<a name="line.1813"></a>
+<span class="sourceLineNo">1814</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1814"></a>
+<span class="sourceLineNo">1815</span> */<a name="line.1815"></a>
+<span class="sourceLineNo">1816</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1816"></a>
+<span class="sourceLineNo">1817</span> byte [] padding = new byte[length];<a name="line.1817"></a>
+<span class="sourceLineNo">1818</span> for (int i = 0; i < length; i++) {<a name="line.1818"></a>
+<span class="sourceLineNo">1819</span> padding[i] = 0;<a name="line.1819"></a>
+<span class="sourceLineNo">1820</span> }<a name="line.1820"></a>
+<span class="sourceLineNo">1821</span> return add(padding,a);<a name="line.1821"></a>
+<span class="sourceLineNo">1822</span> }<a name="line.1822"></a>
+<span class="sourceLineNo">1823</span><a name="line.1823"></a>
+<span class="sourceLineNo">1824</span> /**<a name="line.1824"></a>
+<span class="sourceLineNo">1825</span> * @param a array<a name="line.1825"></a>
+<span class="sourceLineNo">1826</span> * @param length new array size<a name="line.1826"></a>
+<span class="sourceLineNo">1827</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1827"></a>
+<span class="sourceLineNo">1828</span> */<a name="line.1828"></a>
+<span class="sourceLineNo">1829</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1829"></a>
+<span class="sourceLineNo">1830</span> byte [] padding = new byte[length];<a name="line.1830"></a>
+<span class="sourceLineNo">1831</span> for (int i = 0; i < length; i++) {<a name="line.1831"></a>
+<span class="sourceLineNo">1832</span> padding[i] = 0;<a name="line.1832"></a>
+<span class="sourceLineNo">1833</span> }<a name="line.1833"></a>
+<span class="sourceLineNo">1834</span> return add(a,padding);<a name="line.1834"></a>
+<span class="sourceLineNo">1835</span> }<a name="line.1835"></a>
+<span class="sourceLineNo">1836</span><a name="line.1836"></a>
+<span class="sourceLineNo">1837</span> /**<a name="line.1837"></a>
+<span class="sourceLineNo">1838</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1838"></a>
+<span class="sourceLineNo">1839</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1839"></a>
+<span class="sourceLineNo">1840</span> * @param a Beginning of range<a name="line.1840"></a>
+<span class="sourceLineNo">1841</span> * @param b End of range<a name="line.1841"></a>
+<span class="sourceLineNo">1842</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1842"></a>
+<span class="sourceLineNo">1843</span> * the range in two; i.e. one split.<a name="line.1843"></a>
+<span class="sourceLineNo">1844</span> * @return Array of dividing values<a name="line.1844"></a>
+<span class="sourceLineNo">1845</span> */<a name="line.1845"></a>
+<span class="sourceLineNo">1846</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1846"></a>
+<span class="sourceLineNo">1847</span> return split(a, b, false, num);<a name="line.1847"></a>
+<span class="sourceLineNo">1848</span> }<a name="line.1848"></a>
+<span class="sourceLineNo">1849</span><a name="line.1849"></a>
+<span class="sourceLineNo">1850</span> /**<a name="line.1850"></a>
+<span class="sourceLineNo">1851</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1851"></a>
+<span class="sourceLineNo">1852</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1852"></a>
+<span class="sourceLineNo">1853</span> * @param a Beginning of range<a name="line.1853"></a>
+<span class="sourceLineNo">1854</span> * @param b End of range<a name="line.1854"></a>
+<span class="sourceLineNo">1855</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1855"></a>
+<span class="sourceLineNo">1856</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1856"></a>
+<span class="sourceLineNo">1857</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1857"></a>
+<span class="sourceLineNo">1858</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1858"></a>
+<span class="sourceLineNo">1859</span> * the range in two; i.e. one split.<a name="line.1859"></a>
+<span class="sourceLineNo">1860</span> * @return Array of dividing values<a name="line.1860"></a>
+<span class="sourceLineNo">1861</span> */<a name="line.1861"></a>
+<span class="sourceLineNo">1862</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1862"></a>
+<span class="sourceLineNo">1863</span> boolean inclusive, final int num) {<a name="line.1863"></a>
+<span class="sourceLineNo">1864</span> byte[][] ret = new byte[num + 2][];<a name="line.1864"></a>
+<span class="sourceLineNo">1865</span> int i = 0;<a name="line.1865"></a>
+<span class="sourceLineNo">1866</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1866"></a>
+<span class="sourceLineNo">1867</span> if (iter == null)<a name="line.1867"></a>
+<span class="sourceLineNo">1868</span> return null;<a name="line.1868"></a>
+<span class="sourceLineNo">1869</span> for (byte[] elem : iter) {<a name="line.1869"></a>
+<span class="sourceLineNo">1870</span> ret[i++] = elem;<a name="line.1870"></a>
+<span class="sourceLineNo">1871</span> }<a name="line.1871"></a>
+<span class="sourceLineNo">1872</span> return ret;<a name="line.1872"></a>
+<span class="sourceLineNo">1873</span> }<a name="line.1873"></a>
+<span class="sourceLineNo">1874</span><a name="line.1874"></a>
+<span class="sourceLineNo">1875</span> /**<a name="line.1875"></a>
+<span class="sourceLineNo">1876</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1876"></a>
+<span class="sourceLineNo">1877</span> */<a name="line.1877"></a>
+<span class="sourceLineNo">1878</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1878"></a>
+<span class="sourceLineNo">1879</span> final byte[] b, final int num)<a name="line.1879"></a>
+<span class="sourceLineNo">1880</span> {<a name="line.1880"></a>
+<span class="sourceLineNo">1881</span> return iterateOnSplits(a, b, false, num);<a name="line.1881"></a>
+<span class="sourceLineNo">1882</span> }<a name="line.1882"></a>
+<span class="sourceLineNo">1883</span><a name="line.1883"></a>
+<span class="sourceLineNo">1884</span> /**<a name="line.1884"></a>
+<span class="sourceLineNo">1885</span> * Iterate over keys within the passed range.<a name="line.1885"></a>
+<span class="sourceLineNo">1886</span> */<a name="line.1886"></a>
+<span class="sourceLineNo">1887</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1887"></a>
+<span class="sourceLineNo">1888</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1888"></a>
+<span class="sourceLineNo">1889</span> {<a name="line.1889"></a>
+<span class="sourceLineNo">1890</span> byte [] aPadded;<a name="line.1890"></a>
+<span class="sourceLineNo">1891</span> byte [] bPadded;<a name="line.1891"></a>
+<span class="sourceLineNo">1892</span> if (a.length < b.length) {<a name="line.1892"></a>
+<span class="sourceLineNo">1893</span> aPadded = padTail(a, b.length - a.length);<a name="line.1893"></a>
+<span class="sourceLineNo">1894</span> bPadded = b;<a name="line.1894"></a>
+<span class="sourceLineNo">1895</span> } else if (b.length < a.length) {<a name="line.1895"></a>
+<span class="sourceLineNo">1896</span> aPadded = a;<a name="line.1896"></a>
+<span class="sourceLineNo">1897</span> bPadded = padTail(b, a.length - b.length);<a name="line.1897"></a>
+<span class="sourceLineNo">1898</span> } else {<a name="line.1898"></a>
+<span class="sourceLineNo">1899</span> aPadded = a;<a name="line.1899"></a>
+<span class="sourceLineNo">1900</span> bPadded = b;<a name="line.1900"></a>
+<span class="sourceLineNo">1901</span> }<a name="line.1901"></a>
+<span class="sourceLineNo">1902</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1902"></a>
+<span class="sourceLineNo">1903</span> throw new IllegalArgumentException("b <= a");<a name="line.1903"></a>
+<span class="sourceLineNo">1904</span> }<a name="line.1904"></a>
+<span class="sourceLineNo">1905</span> if (num <= 0) {<a name="line.1905"></a>
+<span class="sourceLineNo">1906</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1906"></a>
+<span class="sourceLineNo">1907</span> }<a name="line.1907"></a>
+<span class="sourceLineNo">1908</span> byte [] prependHeader = {1, 0};<a name="line.1908"></a>
+<span class="sourceLineNo">1909</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1909"></a>
+<span class="sourceLineNo">1910</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1910"></a>
+<span class="sourceLineNo">1911</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1911"></a>
+<span class="sourceLineNo">1912</span> if (inclusive) {<a name="line.1912"></a>
+<span class="sourceLineNo">1913</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1913"></a>
+<span class="sourceLineNo">1914</span> }<a name="line.1914"></a>
+<span class="sourceLineNo">1915</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1915"></a>
+<span class="sourceLineNo">1916</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1916"></a>
+<span class="sourceLineNo">1917</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1917"></a>
+<span class="sourceLineNo">1918</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1918"></a>
+<span class="sourceLineNo">1919</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1919"></a>
+<span class="sourceLineNo">1920</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1920"></a>
+<span class="sourceLineNo">1921</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1921"></a>
+<span class="sourceLineNo">1922</span> }<a name="line.1922"></a>
+<span class="sourceLineNo">1923</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1923"></a>
+<span class="sourceLineNo">1924</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1924"></a>
+<span class="sourceLineNo">1925</span> }<a name="line.1925"></a>
+<span class="sourceLineNo">1926</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1926"></a>
+<span class="sourceLineNo">1927</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1927"></a>
+<span class="sourceLineNo">1928</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1928"></a>
+<span class="sourceLineNo">1929</span> }<a name="line.1929"></a>
+<span class="sourceLineNo">1930</span> final BigInteger intervalBI;<a name="line.1930"></a>
+<span class="sourceLineNo">1931</span> try {<a name="line.1931"></a>
+<span class="sourceLineNo">1932</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1932"></a>
+<span class="sourceLineNo">1933</span> } catch(Exception e) {<a name="line.1933"></a>
+<span class="sourceLineNo">1934</span> LOG.error("Exception caught during division", e);<a name="line.1934"></a>
+<span class="sourceLineNo">1935</span> return null;<a name="line.1935"></a>
+<span class="sourceLineNo">1936</span> }<a name="line.1936"></a>
+<span class="sourceLineNo">1937</span><a name="line.1937"></a>
+<span class="sourceLineNo">1938</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1938"></a>
+<span class="sourceLineNo">1939</span> private int i = -1;<a name="line.1939"></a>
+<span class="sourceLineNo">1940</span><a name="line.1940"></a>
+<span class="sourceLineNo">1941</span> @Override<a name="line.1941"></a>
+<span class="sourceLineNo">1942</span> public boolean hasNext() {<a name="line.1942"></a>
+<span class="sourceLineNo">1943</span> return i < num+1;<a name="line.1943"></a>
+<span class="sourceLineNo">1944</span> }<a name="line.1944"></a>
<span class="sourceLineNo">1945</span><a name="line.1945"></a>
<span class="sourceLineNo">1946</span> @Override<a name="line.1946"></a>
-<span class="sourceLineNo">1947</span> public boolean hasNext() {<a name="line.1947"></a>
-<span class="sourceLineNo">1948</span> return i < num+1;<a name="line.1948"></a>
-<span class="sourceLineNo">1949</span> }<a name="line.1949"></a>
-<span class="sourceLineNo">1950</span><a name="line.1950"></a>
-<span class="sourceLineNo">1951</span> @Override<a name="line.1951"></a>
-<span class="sourceLineNo">1952</span> public byte[] next() {<a name="line.1952"></a>
-<span class="sourceLineNo">1953</span> i++;<a name="line.1953"></a>
-<span class="sourceLineNo">1954</span> if (i == 0) return a;<a name="line.1954"></a>
-<span class="sourceLineNo">1955</span> if (i == num + 1) return b;<a name="line.1955"></a>
-<span class="sourceLineNo">1956</span><a name="line.1956"></a>
-<span class="sourceLineNo">1957</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1957"></a>
-<span class="sourceLineNo">1958</span> byte [] padded = curBI.toByteArray();<a name="line.1958"></a>
-<span class="sourceLineNo">1959</span> if (padded[1] == 0)<a name="line.1959"></a>
-<span class="sourceLineNo">1960</span> padded = tail(padded, padded.length - 2);<a name="line.1960"></a>
-<span class="sourceLineNo">1961</span> else<a name="line.1961"></a>
-<span class="sourceLineNo">1962</span> padded = tail(padded, padded.length - 1);<a name="line.1962"></a>
-<span class="sourceLineNo">1963</span> return padded;<a name="line.1963"></a>
+<span class="sourceLineNo">1947</span> public byte[] next() {<a name="line.1947"></a>
+<span class="sourceLineNo">1948</span> i++;<a name="line.1948"></a>
+<span class="sourceLineNo">1949</span> if (i == 0) return a;<a name="line.1949"></a>
+<span class="sourceLineNo">1950</span> if (i == num + 1) return b;<a name="line.1950"></a>
+<span class="sourceLineNo">1951</span><a name="line.1951"></a>
+<span class="sourceLineNo">1952</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1952"></a>
+<span class="sourceLineNo">1953</span> byte [] padded = curBI.toByteArray();<a name="line.1953"></a>
+<span class="sourceLineNo">1954</span> if (padded[1] == 0)<a name="line.1954"></a>
+<span class="sourceLineNo">1955</span> padded = tail(padded, padded.length - 2);<a name="line.1955"></a>
+<span class="sourceLineNo">1956</span> else<a name="line.1956"></a>
+<span class="sourceLineNo">1957</span> padded = tail(padded, padded.length - 1);<a name="line.1957"></a>
+<span class="sourceLineNo">1958</span> return padded;<a name="line.1958"></a>
+<span class="sourceLineNo">1959</span> }<a name="line.1959"></a>
+<span class="sourceLineNo">1960</span><a name="line.1960"></a>
+<span class="sourceLineNo">1961</span> @Override<a name="line.1961"></a>
+<span class="sourceLineNo">1962</span> public void remove() {<a name="line.1962"></a>
+<span class="sourceLineNo">1963</span> throw new UnsupportedOperationException();<a name="line.1963"></a>
<span class="sourceLineNo">1964</span> }<a name="line.1964"></a>
<span class="sourceLineNo">1965</span><a name="line.1965"></a>
-<span class="sourceLineNo">1966</span> @Override<a name="line.1966"></a>
-<span class="sourceLineNo">1967</span> public void remove() {<a name="line.1967"></a>
-<span class="sourceLineNo">1968</span> throw new UnsupportedOperationException();<a name="line.1968"></a>
-<span class="sourceLineNo">1969</span> }<a name="line.1969"></a>
-<span class="sourceLineNo">1970</span><a name="line.1970"></a>
-<span class="sourceLineNo">1971</span> };<a name="line.1971"></a>
-<span class="sourceLineNo">1972</span><a name="line.1972"></a>
-<span class="sourceLineNo">1973</span> return new Iterable<byte[]>() {<a name="line.1973"></a>
-<span class="sourceLineNo">1974</span> @Override<a name="line.1974"></a>
-<span class="sourceLineNo">1975</span> public Iterator<byte[]> iterator() {<a name="line.1975"></a>
-<span class="sourceLineNo">1976</span> return iterator;<a name="line.1976"></a>
-<span class="sourceLineNo">1977</span> }<a name="line.1977"></a>
-<span class="sourceLineNo">1978</span> };<a name="line.1978"></a>
-<span class="sourceLineNo">1979</span> }<a name="line.1979"></a>
-<span class="sourceLineNo">1980</span><a name="line.1980"></a>
-<span class="sourceLineNo">1981</span> /**<a name="line.1981"></a>
-<span class="sourceLineNo">1982</span> * @param bytes array to hash<a name="line.1982"></a>
-<span class="sourceLineNo">1983</span> * @param offset offset to start from<a name="line.1983"></a>
-<span class="sourceLineNo">1984</span> * @param length length to hash<a name="line.1984"></a>
-<span class="sourceLineNo">1985</span> * */<a name="line.1985"></a>
-<span class="sourceLineNo">1986</span> public static int hashCode(byte[] bytes, int offset, int length) {<a name="line.1986"></a>
-<span class="sourceLineNo">1987</span> int hash = 1;<a name="line.1987"></a>
-<span class="sourceLineNo">1988</span> for (int i = offset; i < offset + length; i++)<a name="line.1988"></a>
-<span class="sourceLineNo">1989</span> hash = (31 * hash) + (int) bytes[i];<a name="line.1989"></a>
-<span class="sourceLineNo">1990</span> return hash;<a name="line.1990"></a>
-<span class="sourceLineNo">1991</span> }<a name="line.1991"></a>
-<span class="sourceLineNo">1992</span><a name="line.1992"></a>
-<span class="sourceLineNo">1993</span> /**<a name="line.1993"></a>
-<span class="sourceLineNo">1994</span> * @param t operands<a name="line.1994"></a>
-<span class="sourceLineNo">1995</span> * @return Array of byte arrays made from passed array of Text<a name="line.1995"></a>
-<span class="sourceLineNo">1996</span> */<a name="line.1996"></a>
-<span class="sourceLineNo">1997</span> public static byte [][] toByteArrays(final String [] t) {<a name="line.1997"></a>
-<span class="sourceLineNo">1998</span> byte [][] result = new byte[t.length][];<a name="line.1998"></a>
-<span class="sourceLineNo">1999</span> for (int i = 0; i < t.length; i++) {<a name="line.1999"></a>
-<span class="sourceLineNo">2000</span> result[i] = Bytes.toBytes(t[i]);<a name="line.2000"></a>
-<span class="sourceLineNo">2001</span> }<a name="line.2001"></a>
-<span class="sourceLineNo">2002</span> return result;<a name="line.2002"></a>
-<span class="sourceLineNo">2003</span> }<a name="line.2003"></a>
-<span class="sourceLineNo">2004</span><a name="line.2004"></a>
-<span class="sourceLineNo">2005</span> /**<a name="line.2005"></a>
-<span class="sourceLineNo">2006</span> * @param t operands<a name="line.2006"></a>
-<span class="sourceLineNo">2007</span> * @return Array of binary byte arrays made from passed array of binary strings<a name="line.2007"></a>
-<span class="sourceLineNo">2008</span> */<a name="line.2008"></a>
-<span class="sourceLineNo">2009</span> public static byte[][] toBinaryByteArrays(final String[] t) {<a name="line.2009"></a>
-<span class="sourceLineNo">2010</span> byte[][] result = new byte[t.length][];<a name="line.2010"></a>
-<span class="sourceLineNo">2011</span> for (int i = 0; i < t.length; i++) {<a name="line.2011"></a>
-<span class="sourceLineNo">2012</span> result[i] = Bytes.toBytesBinary(t[i]);<a name="line.2012"></a>
-<span class="sourceLineNo">2013</span> }<a name="line.2013"></a>
-<span class="sourceLineNo">2014</span> return result;<a name="line.2014"></a>
-<span class="sourceLineNo">2015</span> }<a name="line.2015"></a>
-<span class="sourceLineNo">2016</span><a name="line.2016"></a>
-<span class="sourceLineNo">2017</span> /**<a name="line.2017"></a>
-<span class="sourceLineNo">2018</span> * @param column operand<a name="line.2018"></a>
-<span class="sourceLineNo">2019</span> * @return A byte array of a byte array where first and only entry is<a name="line.2019"></a>
-<span class="sourceLineNo">2020</span> * <code>column</code><a name="line.2020"></a>
-<span class="sourceLineNo">2021</span> */<a name="line.2021"></a>
-<span class="sourceLineNo">2022</span> public static byte [][] toByteArrays(final String column) {<a name="line.2022"></a>
-<span class="sourceLineNo">2023</span> return toByteArrays(toBytes(column));<a name="line.2023"></a>
-<span class="sourceLineNo">2024</span> }<a name="line.2024"></a>
-<span class="sourceLineNo">2025</span><a name="line.2025"></a>
-<span class="sourceLineNo">2026</span> /**<a name="line.2026"></a>
-<span class="sourceLineNo">2027</span> * @param column operand<a name="line.2027"></a>
-<span class="sourceLineNo">2028</span> * @return A byte array of a byte array where first and only entry is<a name="line.2028"></a>
-<span class="sourceLineNo">2029</span> * <code>column</code><a name="line.2029"></a>
-<span class="sourceLineNo">2030</span> */<a name="line.2030"></a>
-<span class="sourceLineNo">2031</span> public static byte [][] toByteArrays(final byte [] column) {<a name="line.2031"></a>
-<span class="sourceLineNo">2032</span> byte [][] result = new byte[1][];<a name="line.2032"></a>
-<span class="sourceLineNo">2033</span> result[0] = column;<a name="line.2033"></a>
-<span class="sourceLineNo">2034</span> return result;<a name="line.2034"></a>
-<span class="sourceLineNo">2035</span> }<a name="line.2035"></a>
-<span class="sourceLineNo">2036</span><a name="line.2036"></a>
-<span class="sourceLineNo">2037</span> /**<a name="line.2037"></a>
-<span class="sourceLineNo">2038</span> * Binary search for keys in indexes.<a name="line.2038"></a>
-<span class="sourceLineNo">2039</span> *<a name="line.2039"></a>
-<span class="sourceLineNo">2040</span> * @param arr array of byte arrays to search for<a name="line.2040"></a>
-<span class="sourceLineNo">2041</span> * @param key the key you want to find<a name="line.2041"></a>
-<span class="sourceLineNo">2042</span> * @param offset the offset in the key you want to find<a name="line.2042"></a>
-<span class="sourceLineNo">2043</span> * @param length the length of the key<a name="line.2043"></a>
-<span class="sourceLineNo">2044</span> * @param comparator a comparator to compare.<a name="line.2044"></a>
-<span class="sourceLineNo">2045</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2045"></a>
-<span class="sourceLineNo">2046</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2046"></a>
-<span class="sourceLineNo">2047</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2047"></a>
-<span class="sourceLineNo">2048</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2048"></a>
-<span class="sourceLineNo">2049</span> * means that this function can return 2N + 1 different values<a name="line.2049"></a>
-<span class="sourceLineNo">2050</span> * ranging from -(N + 1) to N - 1.<a name="line.2050"></a>
-<span class="sourceLineNo">2051</span> * @deprecated {@link Bytes#binarySearch(byte[][], byte[], int, int)}<a name="line.2051"></a>
-<span class="sourceLineNo">2052</span> */<a name="line.2052"></a>
-<span class="sourceLineNo">2053</span> @Deprecated<a name="line.2053"></a>
-<span class="sourceLineNo">2054</span> public static int binarySearch(byte [][]arr, byte []key, int offset,<a name="line.2054"></a>
-<span class="sourceLineNo">2055</span> int length, RawComparator<?> comparator) {<a name="line.2055"></a>
-<span class="sourceLineNo">2056</span> return binarySearch(arr, key, offset, length);<a name="line.2056"></a>
-<span class="sourceLineNo">2057</span> }<a name="line.2057"></a>
-<span class="sourceLineNo">2058</span><a name="line.2058"></a>
-<span class="sourceLineNo">2059</span> /**<a name="line.2059"></a>
-<span class="sourceLineNo">2060</span> * Binary search for keys in indexes using Bytes.BYTES_RAWCOMPARATOR.<a name="line.2060"></a>
-<span class="sourceLineNo">2061</span> *<a name="line.2061"></a>
-<span class="sourceLineNo">2062</span> * @param arr array of byte arrays to search for<a name="line.2062"></a>
-<span class="sourceLineNo">2063</span> * @param key the key you want to find<a name="line.2063"></a>
-<span class="sourceLineNo">2064</span> * @param offset the offset in the key you want to find<a name="line.2064"></a>
-<span class="sourceLineNo">2065</span> * @param length the length of the key<a name="line.2065"></a>
-<span class="sourceLineNo">2066</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2066"></a>
-<span class="sourceLineNo">2067</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2067"></a>
-<span class="sourceLineNo">2068</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2068"></a>
-<span class="sourceLineNo">2069</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2069"></a>
-<span class="sourceLineNo">2070</span> * means that this function can return 2N + 1 different values<a name="line.2070"></a>
-<span class="sourceLineNo">2071</span> * ranging from -(N + 1) to N - 1.<a name="line.2071"></a>
-<span class="sourceLineNo">2072</span> */<a name="line.2072"></a>
-<span class="sourceLineNo">2073</span> public static int binarySearch(byte[][] arr, byte[] key, int offset, int length) {<a name="line.2073"></a>
-<span class="sourceLineNo">2074</span> int low = 0;<a name="line.2074"></a>
-<span class="sourceLineNo">2075</span> int high = arr.length - 1;<a name="line.2075"></a>
-<span class="sourceLineNo">2076</span><a name="line.2076"></a>
-<span class="sourceLineNo">2077</span> while (low <= high) {<a name="line.2077"></a>
-<span class="sourceLineNo">2078</span> int mid = (low + high) >>> 1;<a name="line.2078"></a>
-<span class="sourceLineNo">2079</span> // we have to compare in this order, because the comparator order<a name="line.2079"></a>
-<span class="sourceLineNo">2080</span> // has special logic when the 'left side' is a special key.<a name="line.2080"></a>
-<span class="sourceLineNo">2081</span> int cmp = Bytes.BYTES_RAWCOMPARATOR<a name="line.2081"></a>
-<span class="sourceLineNo">2082</span> .compare(key, offset, length, arr[mid], 0, arr[mid].length);<a name="line.2082"></a>
-<span class="sourceLineNo">2083</span> // key lives above the midpoint<a name="line.2083"></a>
-<span class="sourceLineNo">2084</span> if (cmp > 0)<a name="line.2084"></a>
-<span class="sourceLineNo">2085</span> low = mid + 1;<a name="line.2085"></a>
-<span class="sourceLineNo">2086</span> // key lives below the midpoint<a name="line.2086"></a>
-<span class="sourceLineNo">2087</span> else if (cmp < 0)<a name="line.2087"></a>
-<span class="sourceLineNo">2088</span> high = mid - 1;<a name="line.2088"></a>
-<span class="sourceLineNo">2089</span> // BAM. how often does this really happen?<a name="line.2089"></a>
-<span class="sourceLineNo">2090</span> else<a name="line.2090"></a>
-<span class="sourceLineNo">2091</span> return mid;<a name="line.2091"></a>
-<span class="sourceLineNo">2092</span> }<a name="line.2092"></a>
-<span class="sourceLineNo">2093</span> return -(low + 1);<a name="line.2093"></a>
-<span class="sourceLineNo">2094</span> }<a name="line.2094"></a>
-<span class="sourceLineNo">2095</span><a name="line.2095"></a>
-<span class="sourceLineNo">2096</span> /**<a name="line.2096"></a>
-<span class="sourceLineNo">2097</span> * Binary search for keys in indexes.<a name="line.2097"></a>
-<span class="sourceLineNo">2098</span> *<a name="line.2098"></a>
-<span class="sourceLineNo">2099</span> * @param arr array of byte arrays to search for<a name="line.2099"></a>
-<span class="sourceLineNo">2100</span> * @param key the key you want to find<a name="line.2100"></a>
-<span class="sourceLineNo">2101</span> * @param comparator a comparator to compare.<a name="line.2101"></a>
-<span class="sourceLineNo">2102</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2102"></a>
-<span class="sourceLineNo">2103</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2103"></a>
-<span class="sourceLineNo">2104</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2104"></a>
-<span class="sourceLineNo">2105</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2105"></a>
-<span class="sourceLineNo">2106</span> * means that this function can return 2N + 1 different values<a name="line.2106"></a>
-<span class="sourceLineNo">2107</span> * ranging from -(N + 1) to N - 1.<a name="line.2107"></a>
-<span class="sourceLineNo">2108</span> * @return the index of the block<a name="line.2108"></a>
-<span class="sourceLineNo">2109</span> * @deprecated Use {@link Bytes#binarySearch(Cell[], Cell, CellComparator)}<a name="line.2109"></a>
-<span class="sourceLineNo">2110</span> */<a name="line.2110"></a>
-<span class="sourceLineNo">2111</span> @Deprecated<a name="line.2111"></a>
-<span class="sourceLineNo">2112</span> public static int binarySearch(byte[][] arr, Cell key, RawComparator<Cell> comparator) {<a name="line.2112"></a>
-<span class="sourceLineNo">2113</span> int low = 0;<a name="line.2113"></a>
-<span class="sourceLineNo">2114</span> int high = arr.length - 1;<a name="line.2114"></a>
-<span class="sourceLineNo">2115</span> KeyValue.KeyOnlyKeyValue r = new KeyValue.KeyOnlyKeyValue();<a name="line.2115"></a>
-<span class="sourceLineNo">2116</span> while (low <= high) {<a name="line.2116"></a>
-<span class="sourceLineNo">2117</span> int mid = (l
<TRUNCATED>
[11/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html
index 0a314ea..db4cf91 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html
@@ -69,15 +69,15 @@
<span class="sourceLineNo">061</span> requiredArguments = {<a name="line.61"></a>
<span class="sourceLineNo">062</span> @org.jamon.annotations.Argument(name = "master", type = "HMaster")},<a name="line.62"></a>
<span class="sourceLineNo">063</span> optionalArguments = {<a name="line.63"></a>
-<span class="sourceLineNo">064</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.64"></a>
-<span class="sourceLineNo">065</span> @org.jamon.annotations.Argument(name = "catalogJanitorEnabled", type = "boolean"),<a name="line.65"></a>
-<span class="sourceLineNo">066</span> @org.jamon.annotations.Argument(name = "metaLocation", type = "ServerName"),<a name="line.66"></a>
-<span class="sourceLineNo">067</span> @org.jamon.annotations.Argument(name = "assignmentManager", type = "AssignmentManager"),<a name="line.67"></a>
-<span class="sourceLineNo">068</span> @org.jamon.annotations.Argument(name = "frags", type = "Map<String,Integer>"),<a name="line.68"></a>
-<span class="sourceLineNo">069</span> @org.jamon.annotations.Argument(name = "deadServers", type = "Set<ServerName>"),<a name="line.69"></a>
-<span class="sourceLineNo">070</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.70"></a>
+<span class="sourceLineNo">064</span> @org.jamon.annotations.Argument(name = "servers", type = "List<ServerName>"),<a name="line.64"></a>
+<span class="sourceLineNo">065</span> @org.jamon.annotations.Argument(name = "deadServers", type = "Set<ServerName>"),<a name="line.65"></a>
+<span class="sourceLineNo">066</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.66"></a>
+<span class="sourceLineNo">067</span> @org.jamon.annotations.Argument(name = "catalogJanitorEnabled", type = "boolean"),<a name="line.67"></a>
+<span class="sourceLineNo">068</span> @org.jamon.annotations.Argument(name = "metaLocation", type = "ServerName"),<a name="line.68"></a>
+<span class="sourceLineNo">069</span> @org.jamon.annotations.Argument(name = "assignmentManager", type = "AssignmentManager"),<a name="line.69"></a>
+<span class="sourceLineNo">070</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.70"></a>
<span class="sourceLineNo">071</span> @org.jamon.annotations.Argument(name = "serverManager", type = "ServerManager"),<a name="line.71"></a>
-<span class="sourceLineNo">072</span> @org.jamon.annotations.Argument(name = "servers", type = "List<ServerName>")})<a name="line.72"></a>
+<span class="sourceLineNo">072</span> @org.jamon.annotations.Argument(name = "frags", type = "Map<String,Integer>")})<a name="line.72"></a>
<span class="sourceLineNo">073</span>public class MasterStatusTmpl<a name="line.73"></a>
<span class="sourceLineNo">074</span> extends org.jamon.AbstractTemplateProxy<a name="line.74"></a>
<span class="sourceLineNo">075</span>{<a name="line.75"></a>
@@ -118,125 +118,125 @@
<span class="sourceLineNo">110</span> return m_master;<a name="line.110"></a>
<span class="sourceLineNo">111</span> }<a name="line.111"></a>
<span class="sourceLineNo">112</span> private HMaster m_master;<a name="line.112"></a>
-<span class="sourceLineNo">113</span> // 26, 1<a name="line.113"></a>
-<span class="sourceLineNo">114</span> public void setFilter(String filter)<a name="line.114"></a>
+<span class="sourceLineNo">113</span> // 23, 1<a name="line.113"></a>
+<span class="sourceLineNo">114</span> public void setServers(List<ServerName> servers)<a name="line.114"></a>
<span class="sourceLineNo">115</span> {<a name="line.115"></a>
-<span class="sourceLineNo">116</span> // 26, 1<a name="line.116"></a>
-<span class="sourceLineNo">117</span> m_filter = filter;<a name="line.117"></a>
-<span class="sourceLineNo">118</span> m_filter__IsNotDefault = true;<a name="line.118"></a>
+<span class="sourceLineNo">116</span> // 23, 1<a name="line.116"></a>
+<span class="sourceLineNo">117</span> m_servers = servers;<a name="line.117"></a>
+<span class="sourceLineNo">118</span> m_servers__IsNotDefault = true;<a name="line.118"></a>
<span class="sourceLineNo">119</span> }<a name="line.119"></a>
-<span class="sourceLineNo">120</span> public String getFilter()<a name="line.120"></a>
+<span class="sourceLineNo">120</span> public List<ServerName> getServers()<a name="line.120"></a>
<span class="sourceLineNo">121</span> {<a name="line.121"></a>
-<span class="sourceLineNo">122</span> return m_filter;<a name="line.122"></a>
+<span class="sourceLineNo">122</span> return m_servers;<a name="line.122"></a>
<span class="sourceLineNo">123</span> }<a name="line.123"></a>
-<span class="sourceLineNo">124</span> private String m_filter;<a name="line.124"></a>
-<span class="sourceLineNo">125</span> public boolean getFilter__IsNotDefault()<a name="line.125"></a>
+<span class="sourceLineNo">124</span> private List<ServerName> m_servers;<a name="line.124"></a>
+<span class="sourceLineNo">125</span> public boolean getServers__IsNotDefault()<a name="line.125"></a>
<span class="sourceLineNo">126</span> {<a name="line.126"></a>
-<span class="sourceLineNo">127</span> return m_filter__IsNotDefault;<a name="line.127"></a>
+<span class="sourceLineNo">127</span> return m_servers__IsNotDefault;<a name="line.127"></a>
<span class="sourceLineNo">128</span> }<a name="line.128"></a>
-<span class="sourceLineNo">129</span> private boolean m_filter__IsNotDefault;<a name="line.129"></a>
-<span class="sourceLineNo">130</span> // 25, 1<a name="line.130"></a>
-<span class="sourceLineNo">131</span> public void setCatalogJanitorEnabled(boolean catalogJanitorEnabled)<a name="line.131"></a>
+<span class="sourceLineNo">129</span> private boolean m_servers__IsNotDefault;<a name="line.129"></a>
+<span class="sourceLineNo">130</span> // 24, 1<a name="line.130"></a>
+<span class="sourceLineNo">131</span> public void setDeadServers(Set<ServerName> deadServers)<a name="line.131"></a>
<span class="sourceLineNo">132</span> {<a name="line.132"></a>
-<span class="sourceLineNo">133</span> // 25, 1<a name="line.133"></a>
-<span class="sourceLineNo">134</span> m_catalogJanitorEnabled = catalogJanitorEnabled;<a name="line.134"></a>
-<span class="sourceLineNo">135</span> m_catalogJanitorEnabled__IsNotDefault = true;<a name="line.135"></a>
+<span class="sourceLineNo">133</span> // 24, 1<a name="line.133"></a>
+<span class="sourceLineNo">134</span> m_deadServers = deadServers;<a name="line.134"></a>
+<span class="sourceLineNo">135</span> m_deadServers__IsNotDefault = true;<a name="line.135"></a>
<span class="sourceLineNo">136</span> }<a name="line.136"></a>
-<span class="sourceLineNo">137</span> public boolean getCatalogJanitorEnabled()<a name="line.137"></a>
+<span class="sourceLineNo">137</span> public Set<ServerName> getDeadServers()<a name="line.137"></a>
<span class="sourceLineNo">138</span> {<a name="line.138"></a>
-<span class="sourceLineNo">139</span> return m_catalogJanitorEnabled;<a name="line.139"></a>
+<span class="sourceLineNo">139</span> return m_deadServers;<a name="line.139"></a>
<span class="sourceLineNo">140</span> }<a name="line.140"></a>
-<span class="sourceLineNo">141</span> private boolean m_catalogJanitorEnabled;<a name="line.141"></a>
-<span class="sourceLineNo">142</span> public boolean getCatalogJanitorEnabled__IsNotDefault()<a name="line.142"></a>
+<span class="sourceLineNo">141</span> private Set<ServerName> m_deadServers;<a name="line.141"></a>
+<span class="sourceLineNo">142</span> public boolean getDeadServers__IsNotDefault()<a name="line.142"></a>
<span class="sourceLineNo">143</span> {<a name="line.143"></a>
-<span class="sourceLineNo">144</span> return m_catalogJanitorEnabled__IsNotDefault;<a name="line.144"></a>
+<span class="sourceLineNo">144</span> return m_deadServers__IsNotDefault;<a name="line.144"></a>
<span class="sourceLineNo">145</span> }<a name="line.145"></a>
-<span class="sourceLineNo">146</span> private boolean m_catalogJanitorEnabled__IsNotDefault;<a name="line.146"></a>
-<span class="sourceLineNo">147</span> // 22, 1<a name="line.147"></a>
-<span class="sourceLineNo">148</span> public void setMetaLocation(ServerName metaLocation)<a name="line.148"></a>
+<span class="sourceLineNo">146</span> private boolean m_deadServers__IsNotDefault;<a name="line.146"></a>
+<span class="sourceLineNo">147</span> // 27, 1<a name="line.147"></a>
+<span class="sourceLineNo">148</span> public void setFormat(String format)<a name="line.148"></a>
<span class="sourceLineNo">149</span> {<a name="line.149"></a>
-<span class="sourceLineNo">150</span> // 22, 1<a name="line.150"></a>
-<span class="sourceLineNo">151</span> m_metaLocation = metaLocation;<a name="line.151"></a>
-<span class="sourceLineNo">152</span> m_metaLocation__IsNotDefault = true;<a name="line.152"></a>
+<span class="sourceLineNo">150</span> // 27, 1<a name="line.150"></a>
+<span class="sourceLineNo">151</span> m_format = format;<a name="line.151"></a>
+<span class="sourceLineNo">152</span> m_format__IsNotDefault = true;<a name="line.152"></a>
<span class="sourceLineNo">153</span> }<a name="line.153"></a>
-<span class="sourceLineNo">154</span> public ServerName getMetaLocation()<a name="line.154"></a>
+<span class="sourceLineNo">154</span> public String getFormat()<a name="line.154"></a>
<span class="sourceLineNo">155</span> {<a name="line.155"></a>
-<span class="sourceLineNo">156</span> return m_metaLocation;<a name="line.156"></a>
+<span class="sourceLineNo">156</span> return m_format;<a name="line.156"></a>
<span class="sourceLineNo">157</span> }<a name="line.157"></a>
-<span class="sourceLineNo">158</span> private ServerName m_metaLocation;<a name="line.158"></a>
-<span class="sourceLineNo">159</span> public boolean getMetaLocation__IsNotDefault()<a name="line.159"></a>
+<span class="sourceLineNo">158</span> private String m_format;<a name="line.158"></a>
+<span class="sourceLineNo">159</span> public boolean getFormat__IsNotDefault()<a name="line.159"></a>
<span class="sourceLineNo">160</span> {<a name="line.160"></a>
-<span class="sourceLineNo">161</span> return m_metaLocation__IsNotDefault;<a name="line.161"></a>
+<span class="sourceLineNo">161</span> return m_format__IsNotDefault;<a name="line.161"></a>
<span class="sourceLineNo">162</span> }<a name="line.162"></a>
-<span class="sourceLineNo">163</span> private boolean m_metaLocation__IsNotDefault;<a name="line.163"></a>
-<span class="sourceLineNo">164</span> // 29, 1<a name="line.164"></a>
-<span class="sourceLineNo">165</span> public void setAssignmentManager(AssignmentManager assignmentManager)<a name="line.165"></a>
+<span class="sourceLineNo">163</span> private boolean m_format__IsNotDefault;<a name="line.163"></a>
+<span class="sourceLineNo">164</span> // 25, 1<a name="line.164"></a>
+<span class="sourceLineNo">165</span> public void setCatalogJanitorEnabled(boolean catalogJanitorEnabled)<a name="line.165"></a>
<span class="sourceLineNo">166</span> {<a name="line.166"></a>
-<span class="sourceLineNo">167</span> // 29, 1<a name="line.167"></a>
-<span class="sourceLineNo">168</span> m_assignmentManager = assignmentManager;<a name="line.168"></a>
-<span class="sourceLineNo">169</span> m_assignmentManager__IsNotDefault = true;<a name="line.169"></a>
+<span class="sourceLineNo">167</span> // 25, 1<a name="line.167"></a>
+<span class="sourceLineNo">168</span> m_catalogJanitorEnabled = catalogJanitorEnabled;<a name="line.168"></a>
+<span class="sourceLineNo">169</span> m_catalogJanitorEnabled__IsNotDefault = true;<a name="line.169"></a>
<span class="sourceLineNo">170</span> }<a name="line.170"></a>
-<span class="sourceLineNo">171</span> public AssignmentManager getAssignmentManager()<a name="line.171"></a>
+<span class="sourceLineNo">171</span> public boolean getCatalogJanitorEnabled()<a name="line.171"></a>
<span class="sourceLineNo">172</span> {<a name="line.172"></a>
-<span class="sourceLineNo">173</span> return m_assignmentManager;<a name="line.173"></a>
+<span class="sourceLineNo">173</span> return m_catalogJanitorEnabled;<a name="line.173"></a>
<span class="sourceLineNo">174</span> }<a name="line.174"></a>
-<span class="sourceLineNo">175</span> private AssignmentManager m_assignmentManager;<a name="line.175"></a>
-<span class="sourceLineNo">176</span> public boolean getAssignmentManager__IsNotDefault()<a name="line.176"></a>
+<span class="sourceLineNo">175</span> private boolean m_catalogJanitorEnabled;<a name="line.175"></a>
+<span class="sourceLineNo">176</span> public boolean getCatalogJanitorEnabled__IsNotDefault()<a name="line.176"></a>
<span class="sourceLineNo">177</span> {<a name="line.177"></a>
-<span class="sourceLineNo">178</span> return m_assignmentManager__IsNotDefault;<a name="line.178"></a>
+<span class="sourceLineNo">178</span> return m_catalogJanitorEnabled__IsNotDefault;<a name="line.178"></a>
<span class="sourceLineNo">179</span> }<a name="line.179"></a>
-<span class="sourceLineNo">180</span> private boolean m_assignmentManager__IsNotDefault;<a name="line.180"></a>
-<span class="sourceLineNo">181</span> // 21, 1<a name="line.181"></a>
-<span class="sourceLineNo">182</span> public void setFrags(Map<String,Integer> frags)<a name="line.182"></a>
+<span class="sourceLineNo">180</span> private boolean m_catalogJanitorEnabled__IsNotDefault;<a name="line.180"></a>
+<span class="sourceLineNo">181</span> // 22, 1<a name="line.181"></a>
+<span class="sourceLineNo">182</span> public void setMetaLocation(ServerName metaLocation)<a name="line.182"></a>
<span class="sourceLineNo">183</span> {<a name="line.183"></a>
-<span class="sourceLineNo">184</span> // 21, 1<a name="line.184"></a>
-<span class="sourceLineNo">185</span> m_frags = frags;<a name="line.185"></a>
-<span class="sourceLineNo">186</span> m_frags__IsNotDefault = true;<a name="line.186"></a>
+<span class="sourceLineNo">184</span> // 22, 1<a name="line.184"></a>
+<span class="sourceLineNo">185</span> m_metaLocation = metaLocation;<a name="line.185"></a>
+<span class="sourceLineNo">186</span> m_metaLocation__IsNotDefault = true;<a name="line.186"></a>
<span class="sourceLineNo">187</span> }<a name="line.187"></a>
-<span class="sourceLineNo">188</span> public Map<String,Integer> getFrags()<a name="line.188"></a>
+<span class="sourceLineNo">188</span> public ServerName getMetaLocation()<a name="line.188"></a>
<span class="sourceLineNo">189</span> {<a name="line.189"></a>
-<span class="sourceLineNo">190</span> return m_frags;<a name="line.190"></a>
+<span class="sourceLineNo">190</span> return m_metaLocation;<a name="line.190"></a>
<span class="sourceLineNo">191</span> }<a name="line.191"></a>
-<span class="sourceLineNo">192</span> private Map<String,Integer> m_frags;<a name="line.192"></a>
-<span class="sourceLineNo">193</span> public boolean getFrags__IsNotDefault()<a name="line.193"></a>
+<span class="sourceLineNo">192</span> private ServerName m_metaLocation;<a name="line.192"></a>
+<span class="sourceLineNo">193</span> public boolean getMetaLocation__IsNotDefault()<a name="line.193"></a>
<span class="sourceLineNo">194</span> {<a name="line.194"></a>
-<span class="sourceLineNo">195</span> return m_frags__IsNotDefault;<a name="line.195"></a>
+<span class="sourceLineNo">195</span> return m_metaLocation__IsNotDefault;<a name="line.195"></a>
<span class="sourceLineNo">196</span> }<a name="line.196"></a>
-<span class="sourceLineNo">197</span> private boolean m_frags__IsNotDefault;<a name="line.197"></a>
-<span class="sourceLineNo">198</span> // 24, 1<a name="line.198"></a>
-<span class="sourceLineNo">199</span> public void setDeadServers(Set<ServerName> deadServers)<a name="line.199"></a>
+<span class="sourceLineNo">197</span> private boolean m_metaLocation__IsNotDefault;<a name="line.197"></a>
+<span class="sourceLineNo">198</span> // 29, 1<a name="line.198"></a>
+<span class="sourceLineNo">199</span> public void setAssignmentManager(AssignmentManager assignmentManager)<a name="line.199"></a>
<span class="sourceLineNo">200</span> {<a name="line.200"></a>
-<span class="sourceLineNo">201</span> // 24, 1<a name="line.201"></a>
-<span class="sourceLineNo">202</span> m_deadServers = deadServers;<a name="line.202"></a>
-<span class="sourceLineNo">203</span> m_deadServers__IsNotDefault = true;<a name="line.203"></a>
+<span class="sourceLineNo">201</span> // 29, 1<a name="line.201"></a>
+<span class="sourceLineNo">202</span> m_assignmentManager = assignmentManager;<a name="line.202"></a>
+<span class="sourceLineNo">203</span> m_assignmentManager__IsNotDefault = true;<a name="line.203"></a>
<span class="sourceLineNo">204</span> }<a name="line.204"></a>
-<span class="sourceLineNo">205</span> public Set<ServerName> getDeadServers()<a name="line.205"></a>
+<span class="sourceLineNo">205</span> public AssignmentManager getAssignmentManager()<a name="line.205"></a>
<span class="sourceLineNo">206</span> {<a name="line.206"></a>
-<span class="sourceLineNo">207</span> return m_deadServers;<a name="line.207"></a>
+<span class="sourceLineNo">207</span> return m_assignmentManager;<a name="line.207"></a>
<span class="sourceLineNo">208</span> }<a name="line.208"></a>
-<span class="sourceLineNo">209</span> private Set<ServerName> m_deadServers;<a name="line.209"></a>
-<span class="sourceLineNo">210</span> public boolean getDeadServers__IsNotDefault()<a name="line.210"></a>
+<span class="sourceLineNo">209</span> private AssignmentManager m_assignmentManager;<a name="line.209"></a>
+<span class="sourceLineNo">210</span> public boolean getAssignmentManager__IsNotDefault()<a name="line.210"></a>
<span class="sourceLineNo">211</span> {<a name="line.211"></a>
-<span class="sourceLineNo">212</span> return m_deadServers__IsNotDefault;<a name="line.212"></a>
+<span class="sourceLineNo">212</span> return m_assignmentManager__IsNotDefault;<a name="line.212"></a>
<span class="sourceLineNo">213</span> }<a name="line.213"></a>
-<span class="sourceLineNo">214</span> private boolean m_deadServers__IsNotDefault;<a name="line.214"></a>
-<span class="sourceLineNo">215</span> // 27, 1<a name="line.215"></a>
-<span class="sourceLineNo">216</span> public void setFormat(String format)<a name="line.216"></a>
+<span class="sourceLineNo">214</span> private boolean m_assignmentManager__IsNotDefault;<a name="line.214"></a>
+<span class="sourceLineNo">215</span> // 26, 1<a name="line.215"></a>
+<span class="sourceLineNo">216</span> public void setFilter(String filter)<a name="line.216"></a>
<span class="sourceLineNo">217</span> {<a name="line.217"></a>
-<span class="sourceLineNo">218</span> // 27, 1<a name="line.218"></a>
-<span class="sourceLineNo">219</span> m_format = format;<a name="line.219"></a>
-<span class="sourceLineNo">220</span> m_format__IsNotDefault = true;<a name="line.220"></a>
+<span class="sourceLineNo">218</span> // 26, 1<a name="line.218"></a>
+<span class="sourceLineNo">219</span> m_filter = filter;<a name="line.219"></a>
+<span class="sourceLineNo">220</span> m_filter__IsNotDefault = true;<a name="line.220"></a>
<span class="sourceLineNo">221</span> }<a name="line.221"></a>
-<span class="sourceLineNo">222</span> public String getFormat()<a name="line.222"></a>
+<span class="sourceLineNo">222</span> public String getFilter()<a name="line.222"></a>
<span class="sourceLineNo">223</span> {<a name="line.223"></a>
-<span class="sourceLineNo">224</span> return m_format;<a name="line.224"></a>
+<span class="sourceLineNo">224</span> return m_filter;<a name="line.224"></a>
<span class="sourceLineNo">225</span> }<a name="line.225"></a>
-<span class="sourceLineNo">226</span> private String m_format;<a name="line.226"></a>
-<span class="sourceLineNo">227</span> public boolean getFormat__IsNotDefault()<a name="line.227"></a>
+<span class="sourceLineNo">226</span> private String m_filter;<a name="line.226"></a>
+<span class="sourceLineNo">227</span> public boolean getFilter__IsNotDefault()<a name="line.227"></a>
<span class="sourceLineNo">228</span> {<a name="line.228"></a>
-<span class="sourceLineNo">229</span> return m_format__IsNotDefault;<a name="line.229"></a>
+<span class="sourceLineNo">229</span> return m_filter__IsNotDefault;<a name="line.229"></a>
<span class="sourceLineNo">230</span> }<a name="line.230"></a>
-<span class="sourceLineNo">231</span> private boolean m_format__IsNotDefault;<a name="line.231"></a>
+<span class="sourceLineNo">231</span> private boolean m_filter__IsNotDefault;<a name="line.231"></a>
<span class="sourceLineNo">232</span> // 28, 1<a name="line.232"></a>
<span class="sourceLineNo">233</span> public void setServerManager(ServerManager serverManager)<a name="line.233"></a>
<span class="sourceLineNo">234</span> {<a name="line.234"></a>
@@ -254,23 +254,23 @@
<span class="sourceLineNo">246</span> return m_serverManager__IsNotDefault;<a name="line.246"></a>
<span class="sourceLineNo">247</span> }<a name="line.247"></a>
<span class="sourceLineNo">248</span> private boolean m_serverManager__IsNotDefault;<a name="line.248"></a>
-<span class="sourceLineNo">249</span> // 23, 1<a name="line.249"></a>
-<span class="sourceLineNo">250</span> public void setServers(List<ServerName> servers)<a name="line.250"></a>
+<span class="sourceLineNo">249</span> // 21, 1<a name="line.249"></a>
+<span class="sourceLineNo">250</span> public void setFrags(Map<String,Integer> frags)<a name="line.250"></a>
<span class="sourceLineNo">251</span> {<a name="line.251"></a>
-<span class="sourceLineNo">252</span> // 23, 1<a name="line.252"></a>
-<span class="sourceLineNo">253</span> m_servers = servers;<a name="line.253"></a>
-<span class="sourceLineNo">254</span> m_servers__IsNotDefault = true;<a name="line.254"></a>
+<span class="sourceLineNo">252</span> // 21, 1<a name="line.252"></a>
+<span class="sourceLineNo">253</span> m_frags = frags;<a name="line.253"></a>
+<span class="sourceLineNo">254</span> m_frags__IsNotDefault = true;<a name="line.254"></a>
<span class="sourceLineNo">255</span> }<a name="line.255"></a>
-<span class="sourceLineNo">256</span> public List<ServerName> getServers()<a name="line.256"></a>
+<span class="sourceLineNo">256</span> public Map<String,Integer> getFrags()<a name="line.256"></a>
<span class="sourceLineNo">257</span> {<a name="line.257"></a>
-<span class="sourceLineNo">258</span> return m_servers;<a name="line.258"></a>
+<span class="sourceLineNo">258</span> return m_frags;<a name="line.258"></a>
<span class="sourceLineNo">259</span> }<a name="line.259"></a>
-<span class="sourceLineNo">260</span> private List<ServerName> m_servers;<a name="line.260"></a>
-<span class="sourceLineNo">261</span> public boolean getServers__IsNotDefault()<a name="line.261"></a>
+<span class="sourceLineNo">260</span> private Map<String,Integer> m_frags;<a name="line.260"></a>
+<span class="sourceLineNo">261</span> public boolean getFrags__IsNotDefault()<a name="line.261"></a>
<span class="sourceLineNo">262</span> {<a name="line.262"></a>
-<span class="sourceLineNo">263</span> return m_servers__IsNotDefault;<a name="line.263"></a>
+<span class="sourceLineNo">263</span> return m_frags__IsNotDefault;<a name="line.263"></a>
<span class="sourceLineNo">264</span> }<a name="line.264"></a>
-<span class="sourceLineNo">265</span> private boolean m_servers__IsNotDefault;<a name="line.265"></a>
+<span class="sourceLineNo">265</span> private boolean m_frags__IsNotDefault;<a name="line.265"></a>
<span class="sourceLineNo">266</span> }<a name="line.266"></a>
<span class="sourceLineNo">267</span> @Override<a name="line.267"></a>
<span class="sourceLineNo">268</span> protected org.jamon.AbstractTemplateProxy.ImplData makeImplData()<a name="line.268"></a>
@@ -282,52 +282,52 @@
<span class="sourceLineNo">274</span> return (ImplData) super.getImplData();<a name="line.274"></a>
<span class="sourceLineNo">275</span> }<a name="line.275"></a>
<span class="sourceLineNo">276</span> <a name="line.276"></a>
-<span class="sourceLineNo">277</span> protected String filter;<a name="line.277"></a>
-<span class="sourceLineNo">278</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFilter(String p_filter)<a name="line.278"></a>
+<span class="sourceLineNo">277</span> protected List<ServerName> servers;<a name="line.277"></a>
+<span class="sourceLineNo">278</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setServers(List<ServerName> p_servers)<a name="line.278"></a>
<span class="sourceLineNo">279</span> {<a name="line.279"></a>
-<span class="sourceLineNo">280</span> (getImplData()).setFilter(p_filter);<a name="line.280"></a>
+<span class="sourceLineNo">280</span> (getImplData()).setServers(p_servers);<a name="line.280"></a>
<span class="sourceLineNo">281</span> return this;<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> protected boolean catalogJanitorEnabled;<a name="line.284"></a>
-<span class="sourceLineNo">285</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setCatalogJanitorEnabled(boolean p_catalogJanitorEnabled)<a name="line.285"></a>
+<span class="sourceLineNo">284</span> protected Set<ServerName> deadServers;<a name="line.284"></a>
+<span class="sourceLineNo">285</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setDeadServers(Set<ServerName> p_deadServers)<a name="line.285"></a>
<span class="sourceLineNo">286</span> {<a name="line.286"></a>
-<span class="sourceLineNo">287</span> (getImplData()).setCatalogJanitorEnabled(p_catalogJanitorEnabled);<a name="line.287"></a>
+<span class="sourceLineNo">287</span> (getImplData()).setDeadServers(p_deadServers);<a name="line.287"></a>
<span class="sourceLineNo">288</span> return this;<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> protected ServerName metaLocation;<a name="line.291"></a>
-<span class="sourceLineNo">292</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setMetaLocation(ServerName p_metaLocation)<a name="line.292"></a>
+<span class="sourceLineNo">291</span> protected String format;<a name="line.291"></a>
+<span class="sourceLineNo">292</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFormat(String p_format)<a name="line.292"></a>
<span class="sourceLineNo">293</span> {<a name="line.293"></a>
-<span class="sourceLineNo">294</span> (getImplData()).setMetaLocation(p_metaLocation);<a name="line.294"></a>
+<span class="sourceLineNo">294</span> (getImplData()).setFormat(p_format);<a name="line.294"></a>
<span class="sourceLineNo">295</span> return this;<a name="line.295"></a>
<span class="sourceLineNo">296</span> }<a name="line.296"></a>
<span class="sourceLineNo">297</span> <a name="line.297"></a>
-<span class="sourceLineNo">298</span> protected AssignmentManager assignmentManager;<a name="line.298"></a>
-<span class="sourceLineNo">299</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setAssignmentManager(AssignmentManager p_assignmentManager)<a name="line.299"></a>
+<span class="sourceLineNo">298</span> protected boolean catalogJanitorEnabled;<a name="line.298"></a>
+<span class="sourceLineNo">299</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setCatalogJanitorEnabled(boolean p_catalogJanitorEnabled)<a name="line.299"></a>
<span class="sourceLineNo">300</span> {<a name="line.300"></a>
-<span class="sourceLineNo">301</span> (getImplData()).setAssignmentManager(p_assignmentManager);<a name="line.301"></a>
+<span class="sourceLineNo">301</span> (getImplData()).setCatalogJanitorEnabled(p_catalogJanitorEnabled);<a name="line.301"></a>
<span class="sourceLineNo">302</span> return this;<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> protected Map<String,Integer> frags;<a name="line.305"></a>
-<span class="sourceLineNo">306</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFrags(Map<String,Integer> p_frags)<a name="line.306"></a>
+<span class="sourceLineNo">305</span> protected ServerName metaLocation;<a name="line.305"></a>
+<span class="sourceLineNo">306</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setMetaLocation(ServerName p_metaLocation)<a name="line.306"></a>
<span class="sourceLineNo">307</span> {<a name="line.307"></a>
-<span class="sourceLineNo">308</span> (getImplData()).setFrags(p_frags);<a name="line.308"></a>
+<span class="sourceLineNo">308</span> (getImplData()).setMetaLocation(p_metaLocation);<a name="line.308"></a>
<span class="sourceLineNo">309</span> return this;<a name="line.309"></a>
<span class="sourceLineNo">310</span> }<a name="line.310"></a>
<span class="sourceLineNo">311</span> <a name="line.311"></a>
-<span class="sourceLineNo">312</span> protected Set<ServerName> deadServers;<a name="line.312"></a>
-<span class="sourceLineNo">313</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setDeadServers(Set<ServerName> p_deadServers)<a name="line.313"></a>
+<span class="sourceLineNo">312</span> protected AssignmentManager assignmentManager;<a name="line.312"></a>
+<span class="sourceLineNo">313</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setAssignmentManager(AssignmentManager p_assignmentManager)<a name="line.313"></a>
<span class="sourceLineNo">314</span> {<a name="line.314"></a>
-<span class="sourceLineNo">315</span> (getImplData()).setDeadServers(p_deadServers);<a name="line.315"></a>
+<span class="sourceLineNo">315</span> (getImplData()).setAssignmentManager(p_assignmentManager);<a name="line.315"></a>
<span class="sourceLineNo">316</span> return this;<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> protected String format;<a name="line.319"></a>
-<span class="sourceLineNo">320</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFormat(String p_format)<a name="line.320"></a>
+<span class="sourceLineNo">319</span> protected String filter;<a name="line.319"></a>
+<span class="sourceLineNo">320</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFilter(String p_filter)<a name="line.320"></a>
<span class="sourceLineNo">321</span> {<a name="line.321"></a>
-<span class="sourceLineNo">322</span> (getImplData()).setFormat(p_format);<a name="line.322"></a>
+<span class="sourceLineNo">322</span> (getImplData()).setFilter(p_filter);<a name="line.322"></a>
<span class="sourceLineNo">323</span> return this;<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>
@@ -338,10 +338,10 @@
<span class="sourceLineNo">330</span> return this;<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> protected List<ServerName> servers;<a name="line.333"></a>
-<span class="sourceLineNo">334</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setServers(List<ServerName> p_servers)<a name="line.334"></a>
+<span class="sourceLineNo">333</span> protected Map<String,Integer> frags;<a name="line.333"></a>
+<span class="sourceLineNo">334</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFrags(Map<String,Integer> p_frags)<a name="line.334"></a>
<span class="sourceLineNo">335</span> {<a name="line.335"></a>
-<span class="sourceLineNo">336</span> (getImplData()).setServers(p_servers);<a name="line.336"></a>
+<span class="sourceLineNo">336</span> (getImplData()).setFrags(p_frags);<a name="line.336"></a>
<span class="sourceLineNo">337</span> return this;<a name="line.337"></a>
<span class="sourceLineNo">338</span> }<a name="line.338"></a>
<span class="sourceLineNo">339</span> <a name="line.339"></a>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.Intf.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.Intf.html b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.Intf.html
index 0a314ea..db4cf91 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.Intf.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.Intf.html
@@ -69,15 +69,15 @@
<span class="sourceLineNo">061</span> requiredArguments = {<a name="line.61"></a>
<span class="sourceLineNo">062</span> @org.jamon.annotations.Argument(name = "master", type = "HMaster")},<a name="line.62"></a>
<span class="sourceLineNo">063</span> optionalArguments = {<a name="line.63"></a>
-<span class="sourceLineNo">064</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.64"></a>
-<span class="sourceLineNo">065</span> @org.jamon.annotations.Argument(name = "catalogJanitorEnabled", type = "boolean"),<a name="line.65"></a>
-<span class="sourceLineNo">066</span> @org.jamon.annotations.Argument(name = "metaLocation", type = "ServerName"),<a name="line.66"></a>
-<span class="sourceLineNo">067</span> @org.jamon.annotations.Argument(name = "assignmentManager", type = "AssignmentManager"),<a name="line.67"></a>
-<span class="sourceLineNo">068</span> @org.jamon.annotations.Argument(name = "frags", type = "Map<String,Integer>"),<a name="line.68"></a>
-<span class="sourceLineNo">069</span> @org.jamon.annotations.Argument(name = "deadServers", type = "Set<ServerName>"),<a name="line.69"></a>
-<span class="sourceLineNo">070</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.70"></a>
+<span class="sourceLineNo">064</span> @org.jamon.annotations.Argument(name = "servers", type = "List<ServerName>"),<a name="line.64"></a>
+<span class="sourceLineNo">065</span> @org.jamon.annotations.Argument(name = "deadServers", type = "Set<ServerName>"),<a name="line.65"></a>
+<span class="sourceLineNo">066</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.66"></a>
+<span class="sourceLineNo">067</span> @org.jamon.annotations.Argument(name = "catalogJanitorEnabled", type = "boolean"),<a name="line.67"></a>
+<span class="sourceLineNo">068</span> @org.jamon.annotations.Argument(name = "metaLocation", type = "ServerName"),<a name="line.68"></a>
+<span class="sourceLineNo">069</span> @org.jamon.annotations.Argument(name = "assignmentManager", type = "AssignmentManager"),<a name="line.69"></a>
+<span class="sourceLineNo">070</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.70"></a>
<span class="sourceLineNo">071</span> @org.jamon.annotations.Argument(name = "serverManager", type = "ServerManager"),<a name="line.71"></a>
-<span class="sourceLineNo">072</span> @org.jamon.annotations.Argument(name = "servers", type = "List<ServerName>")})<a name="line.72"></a>
+<span class="sourceLineNo">072</span> @org.jamon.annotations.Argument(name = "frags", type = "Map<String,Integer>")})<a name="line.72"></a>
<span class="sourceLineNo">073</span>public class MasterStatusTmpl<a name="line.73"></a>
<span class="sourceLineNo">074</span> extends org.jamon.AbstractTemplateProxy<a name="line.74"></a>
<span class="sourceLineNo">075</span>{<a name="line.75"></a>
@@ -118,125 +118,125 @@
<span class="sourceLineNo">110</span> return m_master;<a name="line.110"></a>
<span class="sourceLineNo">111</span> }<a name="line.111"></a>
<span class="sourceLineNo">112</span> private HMaster m_master;<a name="line.112"></a>
-<span class="sourceLineNo">113</span> // 26, 1<a name="line.113"></a>
-<span class="sourceLineNo">114</span> public void setFilter(String filter)<a name="line.114"></a>
+<span class="sourceLineNo">113</span> // 23, 1<a name="line.113"></a>
+<span class="sourceLineNo">114</span> public void setServers(List<ServerName> servers)<a name="line.114"></a>
<span class="sourceLineNo">115</span> {<a name="line.115"></a>
-<span class="sourceLineNo">116</span> // 26, 1<a name="line.116"></a>
-<span class="sourceLineNo">117</span> m_filter = filter;<a name="line.117"></a>
-<span class="sourceLineNo">118</span> m_filter__IsNotDefault = true;<a name="line.118"></a>
+<span class="sourceLineNo">116</span> // 23, 1<a name="line.116"></a>
+<span class="sourceLineNo">117</span> m_servers = servers;<a name="line.117"></a>
+<span class="sourceLineNo">118</span> m_servers__IsNotDefault = true;<a name="line.118"></a>
<span class="sourceLineNo">119</span> }<a name="line.119"></a>
-<span class="sourceLineNo">120</span> public String getFilter()<a name="line.120"></a>
+<span class="sourceLineNo">120</span> public List<ServerName> getServers()<a name="line.120"></a>
<span class="sourceLineNo">121</span> {<a name="line.121"></a>
-<span class="sourceLineNo">122</span> return m_filter;<a name="line.122"></a>
+<span class="sourceLineNo">122</span> return m_servers;<a name="line.122"></a>
<span class="sourceLineNo">123</span> }<a name="line.123"></a>
-<span class="sourceLineNo">124</span> private String m_filter;<a name="line.124"></a>
-<span class="sourceLineNo">125</span> public boolean getFilter__IsNotDefault()<a name="line.125"></a>
+<span class="sourceLineNo">124</span> private List<ServerName> m_servers;<a name="line.124"></a>
+<span class="sourceLineNo">125</span> public boolean getServers__IsNotDefault()<a name="line.125"></a>
<span class="sourceLineNo">126</span> {<a name="line.126"></a>
-<span class="sourceLineNo">127</span> return m_filter__IsNotDefault;<a name="line.127"></a>
+<span class="sourceLineNo">127</span> return m_servers__IsNotDefault;<a name="line.127"></a>
<span class="sourceLineNo">128</span> }<a name="line.128"></a>
-<span class="sourceLineNo">129</span> private boolean m_filter__IsNotDefault;<a name="line.129"></a>
-<span class="sourceLineNo">130</span> // 25, 1<a name="line.130"></a>
-<span class="sourceLineNo">131</span> public void setCatalogJanitorEnabled(boolean catalogJanitorEnabled)<a name="line.131"></a>
+<span class="sourceLineNo">129</span> private boolean m_servers__IsNotDefault;<a name="line.129"></a>
+<span class="sourceLineNo">130</span> // 24, 1<a name="line.130"></a>
+<span class="sourceLineNo">131</span> public void setDeadServers(Set<ServerName> deadServers)<a name="line.131"></a>
<span class="sourceLineNo">132</span> {<a name="line.132"></a>
-<span class="sourceLineNo">133</span> // 25, 1<a name="line.133"></a>
-<span class="sourceLineNo">134</span> m_catalogJanitorEnabled = catalogJanitorEnabled;<a name="line.134"></a>
-<span class="sourceLineNo">135</span> m_catalogJanitorEnabled__IsNotDefault = true;<a name="line.135"></a>
+<span class="sourceLineNo">133</span> // 24, 1<a name="line.133"></a>
+<span class="sourceLineNo">134</span> m_deadServers = deadServers;<a name="line.134"></a>
+<span class="sourceLineNo">135</span> m_deadServers__IsNotDefault = true;<a name="line.135"></a>
<span class="sourceLineNo">136</span> }<a name="line.136"></a>
-<span class="sourceLineNo">137</span> public boolean getCatalogJanitorEnabled()<a name="line.137"></a>
+<span class="sourceLineNo">137</span> public Set<ServerName> getDeadServers()<a name="line.137"></a>
<span class="sourceLineNo">138</span> {<a name="line.138"></a>
-<span class="sourceLineNo">139</span> return m_catalogJanitorEnabled;<a name="line.139"></a>
+<span class="sourceLineNo">139</span> return m_deadServers;<a name="line.139"></a>
<span class="sourceLineNo">140</span> }<a name="line.140"></a>
-<span class="sourceLineNo">141</span> private boolean m_catalogJanitorEnabled;<a name="line.141"></a>
-<span class="sourceLineNo">142</span> public boolean getCatalogJanitorEnabled__IsNotDefault()<a name="line.142"></a>
+<span class="sourceLineNo">141</span> private Set<ServerName> m_deadServers;<a name="line.141"></a>
+<span class="sourceLineNo">142</span> public boolean getDeadServers__IsNotDefault()<a name="line.142"></a>
<span class="sourceLineNo">143</span> {<a name="line.143"></a>
-<span class="sourceLineNo">144</span> return m_catalogJanitorEnabled__IsNotDefault;<a name="line.144"></a>
+<span class="sourceLineNo">144</span> return m_deadServers__IsNotDefault;<a name="line.144"></a>
<span class="sourceLineNo">145</span> }<a name="line.145"></a>
-<span class="sourceLineNo">146</span> private boolean m_catalogJanitorEnabled__IsNotDefault;<a name="line.146"></a>
-<span class="sourceLineNo">147</span> // 22, 1<a name="line.147"></a>
-<span class="sourceLineNo">148</span> public void setMetaLocation(ServerName metaLocation)<a name="line.148"></a>
+<span class="sourceLineNo">146</span> private boolean m_deadServers__IsNotDefault;<a name="line.146"></a>
+<span class="sourceLineNo">147</span> // 27, 1<a name="line.147"></a>
+<span class="sourceLineNo">148</span> public void setFormat(String format)<a name="line.148"></a>
<span class="sourceLineNo">149</span> {<a name="line.149"></a>
-<span class="sourceLineNo">150</span> // 22, 1<a name="line.150"></a>
-<span class="sourceLineNo">151</span> m_metaLocation = metaLocation;<a name="line.151"></a>
-<span class="sourceLineNo">152</span> m_metaLocation__IsNotDefault = true;<a name="line.152"></a>
+<span class="sourceLineNo">150</span> // 27, 1<a name="line.150"></a>
+<span class="sourceLineNo">151</span> m_format = format;<a name="line.151"></a>
+<span class="sourceLineNo">152</span> m_format__IsNotDefault = true;<a name="line.152"></a>
<span class="sourceLineNo">153</span> }<a name="line.153"></a>
-<span class="sourceLineNo">154</span> public ServerName getMetaLocation()<a name="line.154"></a>
+<span class="sourceLineNo">154</span> public String getFormat()<a name="line.154"></a>
<span class="sourceLineNo">155</span> {<a name="line.155"></a>
-<span class="sourceLineNo">156</span> return m_metaLocation;<a name="line.156"></a>
+<span class="sourceLineNo">156</span> return m_format;<a name="line.156"></a>
<span class="sourceLineNo">157</span> }<a name="line.157"></a>
-<span class="sourceLineNo">158</span> private ServerName m_metaLocation;<a name="line.158"></a>
-<span class="sourceLineNo">159</span> public boolean getMetaLocation__IsNotDefault()<a name="line.159"></a>
+<span class="sourceLineNo">158</span> private String m_format;<a name="line.158"></a>
+<span class="sourceLineNo">159</span> public boolean getFormat__IsNotDefault()<a name="line.159"></a>
<span class="sourceLineNo">160</span> {<a name="line.160"></a>
-<span class="sourceLineNo">161</span> return m_metaLocation__IsNotDefault;<a name="line.161"></a>
+<span class="sourceLineNo">161</span> return m_format__IsNotDefault;<a name="line.161"></a>
<span class="sourceLineNo">162</span> }<a name="line.162"></a>
-<span class="sourceLineNo">163</span> private boolean m_metaLocation__IsNotDefault;<a name="line.163"></a>
-<span class="sourceLineNo">164</span> // 29, 1<a name="line.164"></a>
-<span class="sourceLineNo">165</span> public void setAssignmentManager(AssignmentManager assignmentManager)<a name="line.165"></a>
+<span class="sourceLineNo">163</span> private boolean m_format__IsNotDefault;<a name="line.163"></a>
+<span class="sourceLineNo">164</span> // 25, 1<a name="line.164"></a>
+<span class="sourceLineNo">165</span> public void setCatalogJanitorEnabled(boolean catalogJanitorEnabled)<a name="line.165"></a>
<span class="sourceLineNo">166</span> {<a name="line.166"></a>
-<span class="sourceLineNo">167</span> // 29, 1<a name="line.167"></a>
-<span class="sourceLineNo">168</span> m_assignmentManager = assignmentManager;<a name="line.168"></a>
-<span class="sourceLineNo">169</span> m_assignmentManager__IsNotDefault = true;<a name="line.169"></a>
+<span class="sourceLineNo">167</span> // 25, 1<a name="line.167"></a>
+<span class="sourceLineNo">168</span> m_catalogJanitorEnabled = catalogJanitorEnabled;<a name="line.168"></a>
+<span class="sourceLineNo">169</span> m_catalogJanitorEnabled__IsNotDefault = true;<a name="line.169"></a>
<span class="sourceLineNo">170</span> }<a name="line.170"></a>
-<span class="sourceLineNo">171</span> public AssignmentManager getAssignmentManager()<a name="line.171"></a>
+<span class="sourceLineNo">171</span> public boolean getCatalogJanitorEnabled()<a name="line.171"></a>
<span class="sourceLineNo">172</span> {<a name="line.172"></a>
-<span class="sourceLineNo">173</span> return m_assignmentManager;<a name="line.173"></a>
+<span class="sourceLineNo">173</span> return m_catalogJanitorEnabled;<a name="line.173"></a>
<span class="sourceLineNo">174</span> }<a name="line.174"></a>
-<span class="sourceLineNo">175</span> private AssignmentManager m_assignmentManager;<a name="line.175"></a>
-<span class="sourceLineNo">176</span> public boolean getAssignmentManager__IsNotDefault()<a name="line.176"></a>
+<span class="sourceLineNo">175</span> private boolean m_catalogJanitorEnabled;<a name="line.175"></a>
+<span class="sourceLineNo">176</span> public boolean getCatalogJanitorEnabled__IsNotDefault()<a name="line.176"></a>
<span class="sourceLineNo">177</span> {<a name="line.177"></a>
-<span class="sourceLineNo">178</span> return m_assignmentManager__IsNotDefault;<a name="line.178"></a>
+<span class="sourceLineNo">178</span> return m_catalogJanitorEnabled__IsNotDefault;<a name="line.178"></a>
<span class="sourceLineNo">179</span> }<a name="line.179"></a>
-<span class="sourceLineNo">180</span> private boolean m_assignmentManager__IsNotDefault;<a name="line.180"></a>
-<span class="sourceLineNo">181</span> // 21, 1<a name="line.181"></a>
-<span class="sourceLineNo">182</span> public void setFrags(Map<String,Integer> frags)<a name="line.182"></a>
+<span class="sourceLineNo">180</span> private boolean m_catalogJanitorEnabled__IsNotDefault;<a name="line.180"></a>
+<span class="sourceLineNo">181</span> // 22, 1<a name="line.181"></a>
+<span class="sourceLineNo">182</span> public void setMetaLocation(ServerName metaLocation)<a name="line.182"></a>
<span class="sourceLineNo">183</span> {<a name="line.183"></a>
-<span class="sourceLineNo">184</span> // 21, 1<a name="line.184"></a>
-<span class="sourceLineNo">185</span> m_frags = frags;<a name="line.185"></a>
-<span class="sourceLineNo">186</span> m_frags__IsNotDefault = true;<a name="line.186"></a>
+<span class="sourceLineNo">184</span> // 22, 1<a name="line.184"></a>
+<span class="sourceLineNo">185</span> m_metaLocation = metaLocation;<a name="line.185"></a>
+<span class="sourceLineNo">186</span> m_metaLocation__IsNotDefault = true;<a name="line.186"></a>
<span class="sourceLineNo">187</span> }<a name="line.187"></a>
-<span class="sourceLineNo">188</span> public Map<String,Integer> getFrags()<a name="line.188"></a>
+<span class="sourceLineNo">188</span> public ServerName getMetaLocation()<a name="line.188"></a>
<span class="sourceLineNo">189</span> {<a name="line.189"></a>
-<span class="sourceLineNo">190</span> return m_frags;<a name="line.190"></a>
+<span class="sourceLineNo">190</span> return m_metaLocation;<a name="line.190"></a>
<span class="sourceLineNo">191</span> }<a name="line.191"></a>
-<span class="sourceLineNo">192</span> private Map<String,Integer> m_frags;<a name="line.192"></a>
-<span class="sourceLineNo">193</span> public boolean getFrags__IsNotDefault()<a name="line.193"></a>
+<span class="sourceLineNo">192</span> private ServerName m_metaLocation;<a name="line.192"></a>
+<span class="sourceLineNo">193</span> public boolean getMetaLocation__IsNotDefault()<a name="line.193"></a>
<span class="sourceLineNo">194</span> {<a name="line.194"></a>
-<span class="sourceLineNo">195</span> return m_frags__IsNotDefault;<a name="line.195"></a>
+<span class="sourceLineNo">195</span> return m_metaLocation__IsNotDefault;<a name="line.195"></a>
<span class="sourceLineNo">196</span> }<a name="line.196"></a>
-<span class="sourceLineNo">197</span> private boolean m_frags__IsNotDefault;<a name="line.197"></a>
-<span class="sourceLineNo">198</span> // 24, 1<a name="line.198"></a>
-<span class="sourceLineNo">199</span> public void setDeadServers(Set<ServerName> deadServers)<a name="line.199"></a>
+<span class="sourceLineNo">197</span> private boolean m_metaLocation__IsNotDefault;<a name="line.197"></a>
+<span class="sourceLineNo">198</span> // 29, 1<a name="line.198"></a>
+<span class="sourceLineNo">199</span> public void setAssignmentManager(AssignmentManager assignmentManager)<a name="line.199"></a>
<span class="sourceLineNo">200</span> {<a name="line.200"></a>
-<span class="sourceLineNo">201</span> // 24, 1<a name="line.201"></a>
-<span class="sourceLineNo">202</span> m_deadServers = deadServers;<a name="line.202"></a>
-<span class="sourceLineNo">203</span> m_deadServers__IsNotDefault = true;<a name="line.203"></a>
+<span class="sourceLineNo">201</span> // 29, 1<a name="line.201"></a>
+<span class="sourceLineNo">202</span> m_assignmentManager = assignmentManager;<a name="line.202"></a>
+<span class="sourceLineNo">203</span> m_assignmentManager__IsNotDefault = true;<a name="line.203"></a>
<span class="sourceLineNo">204</span> }<a name="line.204"></a>
-<span class="sourceLineNo">205</span> public Set<ServerName> getDeadServers()<a name="line.205"></a>
+<span class="sourceLineNo">205</span> public AssignmentManager getAssignmentManager()<a name="line.205"></a>
<span class="sourceLineNo">206</span> {<a name="line.206"></a>
-<span class="sourceLineNo">207</span> return m_deadServers;<a name="line.207"></a>
+<span class="sourceLineNo">207</span> return m_assignmentManager;<a name="line.207"></a>
<span class="sourceLineNo">208</span> }<a name="line.208"></a>
-<span class="sourceLineNo">209</span> private Set<ServerName> m_deadServers;<a name="line.209"></a>
-<span class="sourceLineNo">210</span> public boolean getDeadServers__IsNotDefault()<a name="line.210"></a>
+<span class="sourceLineNo">209</span> private AssignmentManager m_assignmentManager;<a name="line.209"></a>
+<span class="sourceLineNo">210</span> public boolean getAssignmentManager__IsNotDefault()<a name="line.210"></a>
<span class="sourceLineNo">211</span> {<a name="line.211"></a>
-<span class="sourceLineNo">212</span> return m_deadServers__IsNotDefault;<a name="line.212"></a>
+<span class="sourceLineNo">212</span> return m_assignmentManager__IsNotDefault;<a name="line.212"></a>
<span class="sourceLineNo">213</span> }<a name="line.213"></a>
-<span class="sourceLineNo">214</span> private boolean m_deadServers__IsNotDefault;<a name="line.214"></a>
-<span class="sourceLineNo">215</span> // 27, 1<a name="line.215"></a>
-<span class="sourceLineNo">216</span> public void setFormat(String format)<a name="line.216"></a>
+<span class="sourceLineNo">214</span> private boolean m_assignmentManager__IsNotDefault;<a name="line.214"></a>
+<span class="sourceLineNo">215</span> // 26, 1<a name="line.215"></a>
+<span class="sourceLineNo">216</span> public void setFilter(String filter)<a name="line.216"></a>
<span class="sourceLineNo">217</span> {<a name="line.217"></a>
-<span class="sourceLineNo">218</span> // 27, 1<a name="line.218"></a>
-<span class="sourceLineNo">219</span> m_format = format;<a name="line.219"></a>
-<span class="sourceLineNo">220</span> m_format__IsNotDefault = true;<a name="line.220"></a>
+<span class="sourceLineNo">218</span> // 26, 1<a name="line.218"></a>
+<span class="sourceLineNo">219</span> m_filter = filter;<a name="line.219"></a>
+<span class="sourceLineNo">220</span> m_filter__IsNotDefault = true;<a name="line.220"></a>
<span class="sourceLineNo">221</span> }<a name="line.221"></a>
-<span class="sourceLineNo">222</span> public String getFormat()<a name="line.222"></a>
+<span class="sourceLineNo">222</span> public String getFilter()<a name="line.222"></a>
<span class="sourceLineNo">223</span> {<a name="line.223"></a>
-<span class="sourceLineNo">224</span> return m_format;<a name="line.224"></a>
+<span class="sourceLineNo">224</span> return m_filter;<a name="line.224"></a>
<span class="sourceLineNo">225</span> }<a name="line.225"></a>
-<span class="sourceLineNo">226</span> private String m_format;<a name="line.226"></a>
-<span class="sourceLineNo">227</span> public boolean getFormat__IsNotDefault()<a name="line.227"></a>
+<span class="sourceLineNo">226</span> private String m_filter;<a name="line.226"></a>
+<span class="sourceLineNo">227</span> public boolean getFilter__IsNotDefault()<a name="line.227"></a>
<span class="sourceLineNo">228</span> {<a name="line.228"></a>
-<span class="sourceLineNo">229</span> return m_format__IsNotDefault;<a name="line.229"></a>
+<span class="sourceLineNo">229</span> return m_filter__IsNotDefault;<a name="line.229"></a>
<span class="sourceLineNo">230</span> }<a name="line.230"></a>
-<span class="sourceLineNo">231</span> private boolean m_format__IsNotDefault;<a name="line.231"></a>
+<span class="sourceLineNo">231</span> private boolean m_filter__IsNotDefault;<a name="line.231"></a>
<span class="sourceLineNo">232</span> // 28, 1<a name="line.232"></a>
<span class="sourceLineNo">233</span> public void setServerManager(ServerManager serverManager)<a name="line.233"></a>
<span class="sourceLineNo">234</span> {<a name="line.234"></a>
@@ -254,23 +254,23 @@
<span class="sourceLineNo">246</span> return m_serverManager__IsNotDefault;<a name="line.246"></a>
<span class="sourceLineNo">247</span> }<a name="line.247"></a>
<span class="sourceLineNo">248</span> private boolean m_serverManager__IsNotDefault;<a name="line.248"></a>
-<span class="sourceLineNo">249</span> // 23, 1<a name="line.249"></a>
-<span class="sourceLineNo">250</span> public void setServers(List<ServerName> servers)<a name="line.250"></a>
+<span class="sourceLineNo">249</span> // 21, 1<a name="line.249"></a>
+<span class="sourceLineNo">250</span> public void setFrags(Map<String,Integer> frags)<a name="line.250"></a>
<span class="sourceLineNo">251</span> {<a name="line.251"></a>
-<span class="sourceLineNo">252</span> // 23, 1<a name="line.252"></a>
-<span class="sourceLineNo">253</span> m_servers = servers;<a name="line.253"></a>
-<span class="sourceLineNo">254</span> m_servers__IsNotDefault = true;<a name="line.254"></a>
+<span class="sourceLineNo">252</span> // 21, 1<a name="line.252"></a>
+<span class="sourceLineNo">253</span> m_frags = frags;<a name="line.253"></a>
+<span class="sourceLineNo">254</span> m_frags__IsNotDefault = true;<a name="line.254"></a>
<span class="sourceLineNo">255</span> }<a name="line.255"></a>
-<span class="sourceLineNo">256</span> public List<ServerName> getServers()<a name="line.256"></a>
+<span class="sourceLineNo">256</span> public Map<String,Integer> getFrags()<a name="line.256"></a>
<span class="sourceLineNo">257</span> {<a name="line.257"></a>
-<span class="sourceLineNo">258</span> return m_servers;<a name="line.258"></a>
+<span class="sourceLineNo">258</span> return m_frags;<a name="line.258"></a>
<span class="sourceLineNo">259</span> }<a name="line.259"></a>
-<span class="sourceLineNo">260</span> private List<ServerName> m_servers;<a name="line.260"></a>
-<span class="sourceLineNo">261</span> public boolean getServers__IsNotDefault()<a name="line.261"></a>
+<span class="sourceLineNo">260</span> private Map<String,Integer> m_frags;<a name="line.260"></a>
+<span class="sourceLineNo">261</span> public boolean getFrags__IsNotDefault()<a name="line.261"></a>
<span class="sourceLineNo">262</span> {<a name="line.262"></a>
-<span class="sourceLineNo">263</span> return m_servers__IsNotDefault;<a name="line.263"></a>
+<span class="sourceLineNo">263</span> return m_frags__IsNotDefault;<a name="line.263"></a>
<span class="sourceLineNo">264</span> }<a name="line.264"></a>
-<span class="sourceLineNo">265</span> private boolean m_servers__IsNotDefault;<a name="line.265"></a>
+<span class="sourceLineNo">265</span> private boolean m_frags__IsNotDefault;<a name="line.265"></a>
<span class="sourceLineNo">266</span> }<a name="line.266"></a>
<span class="sourceLineNo">267</span> @Override<a name="line.267"></a>
<span class="sourceLineNo">268</span> protected org.jamon.AbstractTemplateProxy.ImplData makeImplData()<a name="line.268"></a>
@@ -282,52 +282,52 @@
<span class="sourceLineNo">274</span> return (ImplData) super.getImplData();<a name="line.274"></a>
<span class="sourceLineNo">275</span> }<a name="line.275"></a>
<span class="sourceLineNo">276</span> <a name="line.276"></a>
-<span class="sourceLineNo">277</span> protected String filter;<a name="line.277"></a>
-<span class="sourceLineNo">278</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFilter(String p_filter)<a name="line.278"></a>
+<span class="sourceLineNo">277</span> protected List<ServerName> servers;<a name="line.277"></a>
+<span class="sourceLineNo">278</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setServers(List<ServerName> p_servers)<a name="line.278"></a>
<span class="sourceLineNo">279</span> {<a name="line.279"></a>
-<span class="sourceLineNo">280</span> (getImplData()).setFilter(p_filter);<a name="line.280"></a>
+<span class="sourceLineNo">280</span> (getImplData()).setServers(p_servers);<a name="line.280"></a>
<span class="sourceLineNo">281</span> return this;<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> protected boolean catalogJanitorEnabled;<a name="line.284"></a>
-<span class="sourceLineNo">285</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setCatalogJanitorEnabled(boolean p_catalogJanitorEnabled)<a name="line.285"></a>
+<span class="sourceLineNo">284</span> protected Set<ServerName> deadServers;<a name="line.284"></a>
+<span class="sourceLineNo">285</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setDeadServers(Set<ServerName> p_deadServers)<a name="line.285"></a>
<span class="sourceLineNo">286</span> {<a name="line.286"></a>
-<span class="sourceLineNo">287</span> (getImplData()).setCatalogJanitorEnabled(p_catalogJanitorEnabled);<a name="line.287"></a>
+<span class="sourceLineNo">287</span> (getImplData()).setDeadServers(p_deadServers);<a name="line.287"></a>
<span class="sourceLineNo">288</span> return this;<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> protected ServerName metaLocation;<a name="line.291"></a>
-<span class="sourceLineNo">292</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setMetaLocation(ServerName p_metaLocation)<a name="line.292"></a>
+<span class="sourceLineNo">291</span> protected String format;<a name="line.291"></a>
+<span class="sourceLineNo">292</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFormat(String p_format)<a name="line.292"></a>
<span class="sourceLineNo">293</span> {<a name="line.293"></a>
-<span class="sourceLineNo">294</span> (getImplData()).setMetaLocation(p_metaLocation);<a name="line.294"></a>
+<span class="sourceLineNo">294</span> (getImplData()).setFormat(p_format);<a name="line.294"></a>
<span class="sourceLineNo">295</span> return this;<a name="line.295"></a>
<span class="sourceLineNo">296</span> }<a name="line.296"></a>
<span class="sourceLineNo">297</span> <a name="line.297"></a>
-<span class="sourceLineNo">298</span> protected AssignmentManager assignmentManager;<a name="line.298"></a>
-<span class="sourceLineNo">299</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setAssignmentManager(AssignmentManager p_assignmentManager)<a name="line.299"></a>
+<span class="sourceLineNo">298</span> protected boolean catalogJanitorEnabled;<a name="line.298"></a>
+<span class="sourceLineNo">299</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setCatalogJanitorEnabled(boolean p_catalogJanitorEnabled)<a name="line.299"></a>
<span class="sourceLineNo">300</span> {<a name="line.300"></a>
-<span class="sourceLineNo">301</span> (getImplData()).setAssignmentManager(p_assignmentManager);<a name="line.301"></a>
+<span class="sourceLineNo">301</span> (getImplData()).setCatalogJanitorEnabled(p_catalogJanitorEnabled);<a name="line.301"></a>
<span class="sourceLineNo">302</span> return this;<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> protected Map<String,Integer> frags;<a name="line.305"></a>
-<span class="sourceLineNo">306</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFrags(Map<String,Integer> p_frags)<a name="line.306"></a>
+<span class="sourceLineNo">305</span> protected ServerName metaLocation;<a name="line.305"></a>
+<span class="sourceLineNo">306</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setMetaLocation(ServerName p_metaLocation)<a name="line.306"></a>
<span class="sourceLineNo">307</span> {<a name="line.307"></a>
-<span class="sourceLineNo">308</span> (getImplData()).setFrags(p_frags);<a name="line.308"></a>
+<span class="sourceLineNo">308</span> (getImplData()).setMetaLocation(p_metaLocation);<a name="line.308"></a>
<span class="sourceLineNo">309</span> return this;<a name="line.309"></a>
<span class="sourceLineNo">310</span> }<a name="line.310"></a>
<span class="sourceLineNo">311</span> <a name="line.311"></a>
-<span class="sourceLineNo">312</span> protected Set<ServerName> deadServers;<a name="line.312"></a>
-<span class="sourceLineNo">313</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setDeadServers(Set<ServerName> p_deadServers)<a name="line.313"></a>
+<span class="sourceLineNo">312</span> protected AssignmentManager assignmentManager;<a name="line.312"></a>
+<span class="sourceLineNo">313</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setAssignmentManager(AssignmentManager p_assignmentManager)<a name="line.313"></a>
<span class="sourceLineNo">314</span> {<a name="line.314"></a>
-<span class="sourceLineNo">315</span> (getImplData()).setDeadServers(p_deadServers);<a name="line.315"></a>
+<span class="sourceLineNo">315</span> (getImplData()).setAssignmentManager(p_assignmentManager);<a name="line.315"></a>
<span class="sourceLineNo">316</span> return this;<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> protected String format;<a name="line.319"></a>
-<span class="sourceLineNo">320</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFormat(String p_format)<a name="line.320"></a>
+<span class="sourceLineNo">319</span> protected String filter;<a name="line.319"></a>
+<span class="sourceLineNo">320</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFilter(String p_filter)<a name="line.320"></a>
<span class="sourceLineNo">321</span> {<a name="line.321"></a>
-<span class="sourceLineNo">322</span> (getImplData()).setFormat(p_format);<a name="line.322"></a>
+<span class="sourceLineNo">322</span> (getImplData()).setFilter(p_filter);<a name="line.322"></a>
<span class="sourceLineNo">323</span> return this;<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>
@@ -338,10 +338,10 @@
<span class="sourceLineNo">330</span> return this;<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> protected List<ServerName> servers;<a name="line.333"></a>
-<span class="sourceLineNo">334</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setServers(List<ServerName> p_servers)<a name="line.334"></a>
+<span class="sourceLineNo">333</span> protected Map<String,Integer> frags;<a name="line.333"></a>
+<span class="sourceLineNo">334</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFrags(Map<String,Integer> p_frags)<a name="line.334"></a>
<span class="sourceLineNo">335</span> {<a name="line.335"></a>
-<span class="sourceLineNo">336</span> (getImplData()).setServers(p_servers);<a name="line.336"></a>
+<span class="sourceLineNo">336</span> (getImplData()).setFrags(p_frags);<a name="line.336"></a>
<span class="sourceLineNo">337</span> return this;<a name="line.337"></a>
<span class="sourceLineNo">338</span> }<a name="line.338"></a>
<span class="sourceLineNo">339</span> <a name="line.339"></a>
[10/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html
index 0a314ea..db4cf91 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html
@@ -69,15 +69,15 @@
<span class="sourceLineNo">061</span> requiredArguments = {<a name="line.61"></a>
<span class="sourceLineNo">062</span> @org.jamon.annotations.Argument(name = "master", type = "HMaster")},<a name="line.62"></a>
<span class="sourceLineNo">063</span> optionalArguments = {<a name="line.63"></a>
-<span class="sourceLineNo">064</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.64"></a>
-<span class="sourceLineNo">065</span> @org.jamon.annotations.Argument(name = "catalogJanitorEnabled", type = "boolean"),<a name="line.65"></a>
-<span class="sourceLineNo">066</span> @org.jamon.annotations.Argument(name = "metaLocation", type = "ServerName"),<a name="line.66"></a>
-<span class="sourceLineNo">067</span> @org.jamon.annotations.Argument(name = "assignmentManager", type = "AssignmentManager"),<a name="line.67"></a>
-<span class="sourceLineNo">068</span> @org.jamon.annotations.Argument(name = "frags", type = "Map<String,Integer>"),<a name="line.68"></a>
-<span class="sourceLineNo">069</span> @org.jamon.annotations.Argument(name = "deadServers", type = "Set<ServerName>"),<a name="line.69"></a>
-<span class="sourceLineNo">070</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.70"></a>
+<span class="sourceLineNo">064</span> @org.jamon.annotations.Argument(name = "servers", type = "List<ServerName>"),<a name="line.64"></a>
+<span class="sourceLineNo">065</span> @org.jamon.annotations.Argument(name = "deadServers", type = "Set<ServerName>"),<a name="line.65"></a>
+<span class="sourceLineNo">066</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.66"></a>
+<span class="sourceLineNo">067</span> @org.jamon.annotations.Argument(name = "catalogJanitorEnabled", type = "boolean"),<a name="line.67"></a>
+<span class="sourceLineNo">068</span> @org.jamon.annotations.Argument(name = "metaLocation", type = "ServerName"),<a name="line.68"></a>
+<span class="sourceLineNo">069</span> @org.jamon.annotations.Argument(name = "assignmentManager", type = "AssignmentManager"),<a name="line.69"></a>
+<span class="sourceLineNo">070</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.70"></a>
<span class="sourceLineNo">071</span> @org.jamon.annotations.Argument(name = "serverManager", type = "ServerManager"),<a name="line.71"></a>
-<span class="sourceLineNo">072</span> @org.jamon.annotations.Argument(name = "servers", type = "List<ServerName>")})<a name="line.72"></a>
+<span class="sourceLineNo">072</span> @org.jamon.annotations.Argument(name = "frags", type = "Map<String,Integer>")})<a name="line.72"></a>
<span class="sourceLineNo">073</span>public class MasterStatusTmpl<a name="line.73"></a>
<span class="sourceLineNo">074</span> extends org.jamon.AbstractTemplateProxy<a name="line.74"></a>
<span class="sourceLineNo">075</span>{<a name="line.75"></a>
@@ -118,125 +118,125 @@
<span class="sourceLineNo">110</span> return m_master;<a name="line.110"></a>
<span class="sourceLineNo">111</span> }<a name="line.111"></a>
<span class="sourceLineNo">112</span> private HMaster m_master;<a name="line.112"></a>
-<span class="sourceLineNo">113</span> // 26, 1<a name="line.113"></a>
-<span class="sourceLineNo">114</span> public void setFilter(String filter)<a name="line.114"></a>
+<span class="sourceLineNo">113</span> // 23, 1<a name="line.113"></a>
+<span class="sourceLineNo">114</span> public void setServers(List<ServerName> servers)<a name="line.114"></a>
<span class="sourceLineNo">115</span> {<a name="line.115"></a>
-<span class="sourceLineNo">116</span> // 26, 1<a name="line.116"></a>
-<span class="sourceLineNo">117</span> m_filter = filter;<a name="line.117"></a>
-<span class="sourceLineNo">118</span> m_filter__IsNotDefault = true;<a name="line.118"></a>
+<span class="sourceLineNo">116</span> // 23, 1<a name="line.116"></a>
+<span class="sourceLineNo">117</span> m_servers = servers;<a name="line.117"></a>
+<span class="sourceLineNo">118</span> m_servers__IsNotDefault = true;<a name="line.118"></a>
<span class="sourceLineNo">119</span> }<a name="line.119"></a>
-<span class="sourceLineNo">120</span> public String getFilter()<a name="line.120"></a>
+<span class="sourceLineNo">120</span> public List<ServerName> getServers()<a name="line.120"></a>
<span class="sourceLineNo">121</span> {<a name="line.121"></a>
-<span class="sourceLineNo">122</span> return m_filter;<a name="line.122"></a>
+<span class="sourceLineNo">122</span> return m_servers;<a name="line.122"></a>
<span class="sourceLineNo">123</span> }<a name="line.123"></a>
-<span class="sourceLineNo">124</span> private String m_filter;<a name="line.124"></a>
-<span class="sourceLineNo">125</span> public boolean getFilter__IsNotDefault()<a name="line.125"></a>
+<span class="sourceLineNo">124</span> private List<ServerName> m_servers;<a name="line.124"></a>
+<span class="sourceLineNo">125</span> public boolean getServers__IsNotDefault()<a name="line.125"></a>
<span class="sourceLineNo">126</span> {<a name="line.126"></a>
-<span class="sourceLineNo">127</span> return m_filter__IsNotDefault;<a name="line.127"></a>
+<span class="sourceLineNo">127</span> return m_servers__IsNotDefault;<a name="line.127"></a>
<span class="sourceLineNo">128</span> }<a name="line.128"></a>
-<span class="sourceLineNo">129</span> private boolean m_filter__IsNotDefault;<a name="line.129"></a>
-<span class="sourceLineNo">130</span> // 25, 1<a name="line.130"></a>
-<span class="sourceLineNo">131</span> public void setCatalogJanitorEnabled(boolean catalogJanitorEnabled)<a name="line.131"></a>
+<span class="sourceLineNo">129</span> private boolean m_servers__IsNotDefault;<a name="line.129"></a>
+<span class="sourceLineNo">130</span> // 24, 1<a name="line.130"></a>
+<span class="sourceLineNo">131</span> public void setDeadServers(Set<ServerName> deadServers)<a name="line.131"></a>
<span class="sourceLineNo">132</span> {<a name="line.132"></a>
-<span class="sourceLineNo">133</span> // 25, 1<a name="line.133"></a>
-<span class="sourceLineNo">134</span> m_catalogJanitorEnabled = catalogJanitorEnabled;<a name="line.134"></a>
-<span class="sourceLineNo">135</span> m_catalogJanitorEnabled__IsNotDefault = true;<a name="line.135"></a>
+<span class="sourceLineNo">133</span> // 24, 1<a name="line.133"></a>
+<span class="sourceLineNo">134</span> m_deadServers = deadServers;<a name="line.134"></a>
+<span class="sourceLineNo">135</span> m_deadServers__IsNotDefault = true;<a name="line.135"></a>
<span class="sourceLineNo">136</span> }<a name="line.136"></a>
-<span class="sourceLineNo">137</span> public boolean getCatalogJanitorEnabled()<a name="line.137"></a>
+<span class="sourceLineNo">137</span> public Set<ServerName> getDeadServers()<a name="line.137"></a>
<span class="sourceLineNo">138</span> {<a name="line.138"></a>
-<span class="sourceLineNo">139</span> return m_catalogJanitorEnabled;<a name="line.139"></a>
+<span class="sourceLineNo">139</span> return m_deadServers;<a name="line.139"></a>
<span class="sourceLineNo">140</span> }<a name="line.140"></a>
-<span class="sourceLineNo">141</span> private boolean m_catalogJanitorEnabled;<a name="line.141"></a>
-<span class="sourceLineNo">142</span> public boolean getCatalogJanitorEnabled__IsNotDefault()<a name="line.142"></a>
+<span class="sourceLineNo">141</span> private Set<ServerName> m_deadServers;<a name="line.141"></a>
+<span class="sourceLineNo">142</span> public boolean getDeadServers__IsNotDefault()<a name="line.142"></a>
<span class="sourceLineNo">143</span> {<a name="line.143"></a>
-<span class="sourceLineNo">144</span> return m_catalogJanitorEnabled__IsNotDefault;<a name="line.144"></a>
+<span class="sourceLineNo">144</span> return m_deadServers__IsNotDefault;<a name="line.144"></a>
<span class="sourceLineNo">145</span> }<a name="line.145"></a>
-<span class="sourceLineNo">146</span> private boolean m_catalogJanitorEnabled__IsNotDefault;<a name="line.146"></a>
-<span class="sourceLineNo">147</span> // 22, 1<a name="line.147"></a>
-<span class="sourceLineNo">148</span> public void setMetaLocation(ServerName metaLocation)<a name="line.148"></a>
+<span class="sourceLineNo">146</span> private boolean m_deadServers__IsNotDefault;<a name="line.146"></a>
+<span class="sourceLineNo">147</span> // 27, 1<a name="line.147"></a>
+<span class="sourceLineNo">148</span> public void setFormat(String format)<a name="line.148"></a>
<span class="sourceLineNo">149</span> {<a name="line.149"></a>
-<span class="sourceLineNo">150</span> // 22, 1<a name="line.150"></a>
-<span class="sourceLineNo">151</span> m_metaLocation = metaLocation;<a name="line.151"></a>
-<span class="sourceLineNo">152</span> m_metaLocation__IsNotDefault = true;<a name="line.152"></a>
+<span class="sourceLineNo">150</span> // 27, 1<a name="line.150"></a>
+<span class="sourceLineNo">151</span> m_format = format;<a name="line.151"></a>
+<span class="sourceLineNo">152</span> m_format__IsNotDefault = true;<a name="line.152"></a>
<span class="sourceLineNo">153</span> }<a name="line.153"></a>
-<span class="sourceLineNo">154</span> public ServerName getMetaLocation()<a name="line.154"></a>
+<span class="sourceLineNo">154</span> public String getFormat()<a name="line.154"></a>
<span class="sourceLineNo">155</span> {<a name="line.155"></a>
-<span class="sourceLineNo">156</span> return m_metaLocation;<a name="line.156"></a>
+<span class="sourceLineNo">156</span> return m_format;<a name="line.156"></a>
<span class="sourceLineNo">157</span> }<a name="line.157"></a>
-<span class="sourceLineNo">158</span> private ServerName m_metaLocation;<a name="line.158"></a>
-<span class="sourceLineNo">159</span> public boolean getMetaLocation__IsNotDefault()<a name="line.159"></a>
+<span class="sourceLineNo">158</span> private String m_format;<a name="line.158"></a>
+<span class="sourceLineNo">159</span> public boolean getFormat__IsNotDefault()<a name="line.159"></a>
<span class="sourceLineNo">160</span> {<a name="line.160"></a>
-<span class="sourceLineNo">161</span> return m_metaLocation__IsNotDefault;<a name="line.161"></a>
+<span class="sourceLineNo">161</span> return m_format__IsNotDefault;<a name="line.161"></a>
<span class="sourceLineNo">162</span> }<a name="line.162"></a>
-<span class="sourceLineNo">163</span> private boolean m_metaLocation__IsNotDefault;<a name="line.163"></a>
-<span class="sourceLineNo">164</span> // 29, 1<a name="line.164"></a>
-<span class="sourceLineNo">165</span> public void setAssignmentManager(AssignmentManager assignmentManager)<a name="line.165"></a>
+<span class="sourceLineNo">163</span> private boolean m_format__IsNotDefault;<a name="line.163"></a>
+<span class="sourceLineNo">164</span> // 25, 1<a name="line.164"></a>
+<span class="sourceLineNo">165</span> public void setCatalogJanitorEnabled(boolean catalogJanitorEnabled)<a name="line.165"></a>
<span class="sourceLineNo">166</span> {<a name="line.166"></a>
-<span class="sourceLineNo">167</span> // 29, 1<a name="line.167"></a>
-<span class="sourceLineNo">168</span> m_assignmentManager = assignmentManager;<a name="line.168"></a>
-<span class="sourceLineNo">169</span> m_assignmentManager__IsNotDefault = true;<a name="line.169"></a>
+<span class="sourceLineNo">167</span> // 25, 1<a name="line.167"></a>
+<span class="sourceLineNo">168</span> m_catalogJanitorEnabled = catalogJanitorEnabled;<a name="line.168"></a>
+<span class="sourceLineNo">169</span> m_catalogJanitorEnabled__IsNotDefault = true;<a name="line.169"></a>
<span class="sourceLineNo">170</span> }<a name="line.170"></a>
-<span class="sourceLineNo">171</span> public AssignmentManager getAssignmentManager()<a name="line.171"></a>
+<span class="sourceLineNo">171</span> public boolean getCatalogJanitorEnabled()<a name="line.171"></a>
<span class="sourceLineNo">172</span> {<a name="line.172"></a>
-<span class="sourceLineNo">173</span> return m_assignmentManager;<a name="line.173"></a>
+<span class="sourceLineNo">173</span> return m_catalogJanitorEnabled;<a name="line.173"></a>
<span class="sourceLineNo">174</span> }<a name="line.174"></a>
-<span class="sourceLineNo">175</span> private AssignmentManager m_assignmentManager;<a name="line.175"></a>
-<span class="sourceLineNo">176</span> public boolean getAssignmentManager__IsNotDefault()<a name="line.176"></a>
+<span class="sourceLineNo">175</span> private boolean m_catalogJanitorEnabled;<a name="line.175"></a>
+<span class="sourceLineNo">176</span> public boolean getCatalogJanitorEnabled__IsNotDefault()<a name="line.176"></a>
<span class="sourceLineNo">177</span> {<a name="line.177"></a>
-<span class="sourceLineNo">178</span> return m_assignmentManager__IsNotDefault;<a name="line.178"></a>
+<span class="sourceLineNo">178</span> return m_catalogJanitorEnabled__IsNotDefault;<a name="line.178"></a>
<span class="sourceLineNo">179</span> }<a name="line.179"></a>
-<span class="sourceLineNo">180</span> private boolean m_assignmentManager__IsNotDefault;<a name="line.180"></a>
-<span class="sourceLineNo">181</span> // 21, 1<a name="line.181"></a>
-<span class="sourceLineNo">182</span> public void setFrags(Map<String,Integer> frags)<a name="line.182"></a>
+<span class="sourceLineNo">180</span> private boolean m_catalogJanitorEnabled__IsNotDefault;<a name="line.180"></a>
+<span class="sourceLineNo">181</span> // 22, 1<a name="line.181"></a>
+<span class="sourceLineNo">182</span> public void setMetaLocation(ServerName metaLocation)<a name="line.182"></a>
<span class="sourceLineNo">183</span> {<a name="line.183"></a>
-<span class="sourceLineNo">184</span> // 21, 1<a name="line.184"></a>
-<span class="sourceLineNo">185</span> m_frags = frags;<a name="line.185"></a>
-<span class="sourceLineNo">186</span> m_frags__IsNotDefault = true;<a name="line.186"></a>
+<span class="sourceLineNo">184</span> // 22, 1<a name="line.184"></a>
+<span class="sourceLineNo">185</span> m_metaLocation = metaLocation;<a name="line.185"></a>
+<span class="sourceLineNo">186</span> m_metaLocation__IsNotDefault = true;<a name="line.186"></a>
<span class="sourceLineNo">187</span> }<a name="line.187"></a>
-<span class="sourceLineNo">188</span> public Map<String,Integer> getFrags()<a name="line.188"></a>
+<span class="sourceLineNo">188</span> public ServerName getMetaLocation()<a name="line.188"></a>
<span class="sourceLineNo">189</span> {<a name="line.189"></a>
-<span class="sourceLineNo">190</span> return m_frags;<a name="line.190"></a>
+<span class="sourceLineNo">190</span> return m_metaLocation;<a name="line.190"></a>
<span class="sourceLineNo">191</span> }<a name="line.191"></a>
-<span class="sourceLineNo">192</span> private Map<String,Integer> m_frags;<a name="line.192"></a>
-<span class="sourceLineNo">193</span> public boolean getFrags__IsNotDefault()<a name="line.193"></a>
+<span class="sourceLineNo">192</span> private ServerName m_metaLocation;<a name="line.192"></a>
+<span class="sourceLineNo">193</span> public boolean getMetaLocation__IsNotDefault()<a name="line.193"></a>
<span class="sourceLineNo">194</span> {<a name="line.194"></a>
-<span class="sourceLineNo">195</span> return m_frags__IsNotDefault;<a name="line.195"></a>
+<span class="sourceLineNo">195</span> return m_metaLocation__IsNotDefault;<a name="line.195"></a>
<span class="sourceLineNo">196</span> }<a name="line.196"></a>
-<span class="sourceLineNo">197</span> private boolean m_frags__IsNotDefault;<a name="line.197"></a>
-<span class="sourceLineNo">198</span> // 24, 1<a name="line.198"></a>
-<span class="sourceLineNo">199</span> public void setDeadServers(Set<ServerName> deadServers)<a name="line.199"></a>
+<span class="sourceLineNo">197</span> private boolean m_metaLocation__IsNotDefault;<a name="line.197"></a>
+<span class="sourceLineNo">198</span> // 29, 1<a name="line.198"></a>
+<span class="sourceLineNo">199</span> public void setAssignmentManager(AssignmentManager assignmentManager)<a name="line.199"></a>
<span class="sourceLineNo">200</span> {<a name="line.200"></a>
-<span class="sourceLineNo">201</span> // 24, 1<a name="line.201"></a>
-<span class="sourceLineNo">202</span> m_deadServers = deadServers;<a name="line.202"></a>
-<span class="sourceLineNo">203</span> m_deadServers__IsNotDefault = true;<a name="line.203"></a>
+<span class="sourceLineNo">201</span> // 29, 1<a name="line.201"></a>
+<span class="sourceLineNo">202</span> m_assignmentManager = assignmentManager;<a name="line.202"></a>
+<span class="sourceLineNo">203</span> m_assignmentManager__IsNotDefault = true;<a name="line.203"></a>
<span class="sourceLineNo">204</span> }<a name="line.204"></a>
-<span class="sourceLineNo">205</span> public Set<ServerName> getDeadServers()<a name="line.205"></a>
+<span class="sourceLineNo">205</span> public AssignmentManager getAssignmentManager()<a name="line.205"></a>
<span class="sourceLineNo">206</span> {<a name="line.206"></a>
-<span class="sourceLineNo">207</span> return m_deadServers;<a name="line.207"></a>
+<span class="sourceLineNo">207</span> return m_assignmentManager;<a name="line.207"></a>
<span class="sourceLineNo">208</span> }<a name="line.208"></a>
-<span class="sourceLineNo">209</span> private Set<ServerName> m_deadServers;<a name="line.209"></a>
-<span class="sourceLineNo">210</span> public boolean getDeadServers__IsNotDefault()<a name="line.210"></a>
+<span class="sourceLineNo">209</span> private AssignmentManager m_assignmentManager;<a name="line.209"></a>
+<span class="sourceLineNo">210</span> public boolean getAssignmentManager__IsNotDefault()<a name="line.210"></a>
<span class="sourceLineNo">211</span> {<a name="line.211"></a>
-<span class="sourceLineNo">212</span> return m_deadServers__IsNotDefault;<a name="line.212"></a>
+<span class="sourceLineNo">212</span> return m_assignmentManager__IsNotDefault;<a name="line.212"></a>
<span class="sourceLineNo">213</span> }<a name="line.213"></a>
-<span class="sourceLineNo">214</span> private boolean m_deadServers__IsNotDefault;<a name="line.214"></a>
-<span class="sourceLineNo">215</span> // 27, 1<a name="line.215"></a>
-<span class="sourceLineNo">216</span> public void setFormat(String format)<a name="line.216"></a>
+<span class="sourceLineNo">214</span> private boolean m_assignmentManager__IsNotDefault;<a name="line.214"></a>
+<span class="sourceLineNo">215</span> // 26, 1<a name="line.215"></a>
+<span class="sourceLineNo">216</span> public void setFilter(String filter)<a name="line.216"></a>
<span class="sourceLineNo">217</span> {<a name="line.217"></a>
-<span class="sourceLineNo">218</span> // 27, 1<a name="line.218"></a>
-<span class="sourceLineNo">219</span> m_format = format;<a name="line.219"></a>
-<span class="sourceLineNo">220</span> m_format__IsNotDefault = true;<a name="line.220"></a>
+<span class="sourceLineNo">218</span> // 26, 1<a name="line.218"></a>
+<span class="sourceLineNo">219</span> m_filter = filter;<a name="line.219"></a>
+<span class="sourceLineNo">220</span> m_filter__IsNotDefault = true;<a name="line.220"></a>
<span class="sourceLineNo">221</span> }<a name="line.221"></a>
-<span class="sourceLineNo">222</span> public String getFormat()<a name="line.222"></a>
+<span class="sourceLineNo">222</span> public String getFilter()<a name="line.222"></a>
<span class="sourceLineNo">223</span> {<a name="line.223"></a>
-<span class="sourceLineNo">224</span> return m_format;<a name="line.224"></a>
+<span class="sourceLineNo">224</span> return m_filter;<a name="line.224"></a>
<span class="sourceLineNo">225</span> }<a name="line.225"></a>
-<span class="sourceLineNo">226</span> private String m_format;<a name="line.226"></a>
-<span class="sourceLineNo">227</span> public boolean getFormat__IsNotDefault()<a name="line.227"></a>
+<span class="sourceLineNo">226</span> private String m_filter;<a name="line.226"></a>
+<span class="sourceLineNo">227</span> public boolean getFilter__IsNotDefault()<a name="line.227"></a>
<span class="sourceLineNo">228</span> {<a name="line.228"></a>
-<span class="sourceLineNo">229</span> return m_format__IsNotDefault;<a name="line.229"></a>
+<span class="sourceLineNo">229</span> return m_filter__IsNotDefault;<a name="line.229"></a>
<span class="sourceLineNo">230</span> }<a name="line.230"></a>
-<span class="sourceLineNo">231</span> private boolean m_format__IsNotDefault;<a name="line.231"></a>
+<span class="sourceLineNo">231</span> private boolean m_filter__IsNotDefault;<a name="line.231"></a>
<span class="sourceLineNo">232</span> // 28, 1<a name="line.232"></a>
<span class="sourceLineNo">233</span> public void setServerManager(ServerManager serverManager)<a name="line.233"></a>
<span class="sourceLineNo">234</span> {<a name="line.234"></a>
@@ -254,23 +254,23 @@
<span class="sourceLineNo">246</span> return m_serverManager__IsNotDefault;<a name="line.246"></a>
<span class="sourceLineNo">247</span> }<a name="line.247"></a>
<span class="sourceLineNo">248</span> private boolean m_serverManager__IsNotDefault;<a name="line.248"></a>
-<span class="sourceLineNo">249</span> // 23, 1<a name="line.249"></a>
-<span class="sourceLineNo">250</span> public void setServers(List<ServerName> servers)<a name="line.250"></a>
+<span class="sourceLineNo">249</span> // 21, 1<a name="line.249"></a>
+<span class="sourceLineNo">250</span> public void setFrags(Map<String,Integer> frags)<a name="line.250"></a>
<span class="sourceLineNo">251</span> {<a name="line.251"></a>
-<span class="sourceLineNo">252</span> // 23, 1<a name="line.252"></a>
-<span class="sourceLineNo">253</span> m_servers = servers;<a name="line.253"></a>
-<span class="sourceLineNo">254</span> m_servers__IsNotDefault = true;<a name="line.254"></a>
+<span class="sourceLineNo">252</span> // 21, 1<a name="line.252"></a>
+<span class="sourceLineNo">253</span> m_frags = frags;<a name="line.253"></a>
+<span class="sourceLineNo">254</span> m_frags__IsNotDefault = true;<a name="line.254"></a>
<span class="sourceLineNo">255</span> }<a name="line.255"></a>
-<span class="sourceLineNo">256</span> public List<ServerName> getServers()<a name="line.256"></a>
+<span class="sourceLineNo">256</span> public Map<String,Integer> getFrags()<a name="line.256"></a>
<span class="sourceLineNo">257</span> {<a name="line.257"></a>
-<span class="sourceLineNo">258</span> return m_servers;<a name="line.258"></a>
+<span class="sourceLineNo">258</span> return m_frags;<a name="line.258"></a>
<span class="sourceLineNo">259</span> }<a name="line.259"></a>
-<span class="sourceLineNo">260</span> private List<ServerName> m_servers;<a name="line.260"></a>
-<span class="sourceLineNo">261</span> public boolean getServers__IsNotDefault()<a name="line.261"></a>
+<span class="sourceLineNo">260</span> private Map<String,Integer> m_frags;<a name="line.260"></a>
+<span class="sourceLineNo">261</span> public boolean getFrags__IsNotDefault()<a name="line.261"></a>
<span class="sourceLineNo">262</span> {<a name="line.262"></a>
-<span class="sourceLineNo">263</span> return m_servers__IsNotDefault;<a name="line.263"></a>
+<span class="sourceLineNo">263</span> return m_frags__IsNotDefault;<a name="line.263"></a>
<span class="sourceLineNo">264</span> }<a name="line.264"></a>
-<span class="sourceLineNo">265</span> private boolean m_servers__IsNotDefault;<a name="line.265"></a>
+<span class="sourceLineNo">265</span> private boolean m_frags__IsNotDefault;<a name="line.265"></a>
<span class="sourceLineNo">266</span> }<a name="line.266"></a>
<span class="sourceLineNo">267</span> @Override<a name="line.267"></a>
<span class="sourceLineNo">268</span> protected org.jamon.AbstractTemplateProxy.ImplData makeImplData()<a name="line.268"></a>
@@ -282,52 +282,52 @@
<span class="sourceLineNo">274</span> return (ImplData) super.getImplData();<a name="line.274"></a>
<span class="sourceLineNo">275</span> }<a name="line.275"></a>
<span class="sourceLineNo">276</span> <a name="line.276"></a>
-<span class="sourceLineNo">277</span> protected String filter;<a name="line.277"></a>
-<span class="sourceLineNo">278</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFilter(String p_filter)<a name="line.278"></a>
+<span class="sourceLineNo">277</span> protected List<ServerName> servers;<a name="line.277"></a>
+<span class="sourceLineNo">278</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setServers(List<ServerName> p_servers)<a name="line.278"></a>
<span class="sourceLineNo">279</span> {<a name="line.279"></a>
-<span class="sourceLineNo">280</span> (getImplData()).setFilter(p_filter);<a name="line.280"></a>
+<span class="sourceLineNo">280</span> (getImplData()).setServers(p_servers);<a name="line.280"></a>
<span class="sourceLineNo">281</span> return this;<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> protected boolean catalogJanitorEnabled;<a name="line.284"></a>
-<span class="sourceLineNo">285</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setCatalogJanitorEnabled(boolean p_catalogJanitorEnabled)<a name="line.285"></a>
+<span class="sourceLineNo">284</span> protected Set<ServerName> deadServers;<a name="line.284"></a>
+<span class="sourceLineNo">285</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setDeadServers(Set<ServerName> p_deadServers)<a name="line.285"></a>
<span class="sourceLineNo">286</span> {<a name="line.286"></a>
-<span class="sourceLineNo">287</span> (getImplData()).setCatalogJanitorEnabled(p_catalogJanitorEnabled);<a name="line.287"></a>
+<span class="sourceLineNo">287</span> (getImplData()).setDeadServers(p_deadServers);<a name="line.287"></a>
<span class="sourceLineNo">288</span> return this;<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> protected ServerName metaLocation;<a name="line.291"></a>
-<span class="sourceLineNo">292</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setMetaLocation(ServerName p_metaLocation)<a name="line.292"></a>
+<span class="sourceLineNo">291</span> protected String format;<a name="line.291"></a>
+<span class="sourceLineNo">292</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFormat(String p_format)<a name="line.292"></a>
<span class="sourceLineNo">293</span> {<a name="line.293"></a>
-<span class="sourceLineNo">294</span> (getImplData()).setMetaLocation(p_metaLocation);<a name="line.294"></a>
+<span class="sourceLineNo">294</span> (getImplData()).setFormat(p_format);<a name="line.294"></a>
<span class="sourceLineNo">295</span> return this;<a name="line.295"></a>
<span class="sourceLineNo">296</span> }<a name="line.296"></a>
<span class="sourceLineNo">297</span> <a name="line.297"></a>
-<span class="sourceLineNo">298</span> protected AssignmentManager assignmentManager;<a name="line.298"></a>
-<span class="sourceLineNo">299</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setAssignmentManager(AssignmentManager p_assignmentManager)<a name="line.299"></a>
+<span class="sourceLineNo">298</span> protected boolean catalogJanitorEnabled;<a name="line.298"></a>
+<span class="sourceLineNo">299</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setCatalogJanitorEnabled(boolean p_catalogJanitorEnabled)<a name="line.299"></a>
<span class="sourceLineNo">300</span> {<a name="line.300"></a>
-<span class="sourceLineNo">301</span> (getImplData()).setAssignmentManager(p_assignmentManager);<a name="line.301"></a>
+<span class="sourceLineNo">301</span> (getImplData()).setCatalogJanitorEnabled(p_catalogJanitorEnabled);<a name="line.301"></a>
<span class="sourceLineNo">302</span> return this;<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> protected Map<String,Integer> frags;<a name="line.305"></a>
-<span class="sourceLineNo">306</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFrags(Map<String,Integer> p_frags)<a name="line.306"></a>
+<span class="sourceLineNo">305</span> protected ServerName metaLocation;<a name="line.305"></a>
+<span class="sourceLineNo">306</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setMetaLocation(ServerName p_metaLocation)<a name="line.306"></a>
<span class="sourceLineNo">307</span> {<a name="line.307"></a>
-<span class="sourceLineNo">308</span> (getImplData()).setFrags(p_frags);<a name="line.308"></a>
+<span class="sourceLineNo">308</span> (getImplData()).setMetaLocation(p_metaLocation);<a name="line.308"></a>
<span class="sourceLineNo">309</span> return this;<a name="line.309"></a>
<span class="sourceLineNo">310</span> }<a name="line.310"></a>
<span class="sourceLineNo">311</span> <a name="line.311"></a>
-<span class="sourceLineNo">312</span> protected Set<ServerName> deadServers;<a name="line.312"></a>
-<span class="sourceLineNo">313</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setDeadServers(Set<ServerName> p_deadServers)<a name="line.313"></a>
+<span class="sourceLineNo">312</span> protected AssignmentManager assignmentManager;<a name="line.312"></a>
+<span class="sourceLineNo">313</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setAssignmentManager(AssignmentManager p_assignmentManager)<a name="line.313"></a>
<span class="sourceLineNo">314</span> {<a name="line.314"></a>
-<span class="sourceLineNo">315</span> (getImplData()).setDeadServers(p_deadServers);<a name="line.315"></a>
+<span class="sourceLineNo">315</span> (getImplData()).setAssignmentManager(p_assignmentManager);<a name="line.315"></a>
<span class="sourceLineNo">316</span> return this;<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> protected String format;<a name="line.319"></a>
-<span class="sourceLineNo">320</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFormat(String p_format)<a name="line.320"></a>
+<span class="sourceLineNo">319</span> protected String filter;<a name="line.319"></a>
+<span class="sourceLineNo">320</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFilter(String p_filter)<a name="line.320"></a>
<span class="sourceLineNo">321</span> {<a name="line.321"></a>
-<span class="sourceLineNo">322</span> (getImplData()).setFormat(p_format);<a name="line.322"></a>
+<span class="sourceLineNo">322</span> (getImplData()).setFilter(p_filter);<a name="line.322"></a>
<span class="sourceLineNo">323</span> return this;<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>
@@ -338,10 +338,10 @@
<span class="sourceLineNo">330</span> return this;<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> protected List<ServerName> servers;<a name="line.333"></a>
-<span class="sourceLineNo">334</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setServers(List<ServerName> p_servers)<a name="line.334"></a>
+<span class="sourceLineNo">333</span> protected Map<String,Integer> frags;<a name="line.333"></a>
+<span class="sourceLineNo">334</span> public final org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl setFrags(Map<String,Integer> p_frags)<a name="line.334"></a>
<span class="sourceLineNo">335</span> {<a name="line.335"></a>
-<span class="sourceLineNo">336</span> (getImplData()).setServers(p_servers);<a name="line.336"></a>
+<span class="sourceLineNo">336</span> (getImplData()).setFrags(p_frags);<a name="line.336"></a>
<span class="sourceLineNo">337</span> return this;<a name="line.337"></a>
<span class="sourceLineNo">338</span> }<a name="line.338"></a>
<span class="sourceLineNo">339</span> <a name="line.339"></a>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html
index 57e66df..f942ec4 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html
@@ -70,15 +70,15 @@
<span class="sourceLineNo">062</span><a name="line.62"></a>
<span class="sourceLineNo">063</span>{<a name="line.63"></a>
<span class="sourceLineNo">064</span> private final HMaster master;<a name="line.64"></a>
-<span class="sourceLineNo">065</span> private final String filter;<a name="line.65"></a>
-<span class="sourceLineNo">066</span> private final boolean catalogJanitorEnabled;<a name="line.66"></a>
-<span class="sourceLineNo">067</span> private final ServerName metaLocation;<a name="line.67"></a>
-<span class="sourceLineNo">068</span> private final AssignmentManager assignmentManager;<a name="line.68"></a>
-<span class="sourceLineNo">069</span> private final Map<String,Integer> frags;<a name="line.69"></a>
-<span class="sourceLineNo">070</span> private final Set<ServerName> deadServers;<a name="line.70"></a>
-<span class="sourceLineNo">071</span> private final String format;<a name="line.71"></a>
+<span class="sourceLineNo">065</span> private final List<ServerName> servers;<a name="line.65"></a>
+<span class="sourceLineNo">066</span> private final Set<ServerName> deadServers;<a name="line.66"></a>
+<span class="sourceLineNo">067</span> private final String format;<a name="line.67"></a>
+<span class="sourceLineNo">068</span> private final boolean catalogJanitorEnabled;<a name="line.68"></a>
+<span class="sourceLineNo">069</span> private final ServerName metaLocation;<a name="line.69"></a>
+<span class="sourceLineNo">070</span> private final AssignmentManager assignmentManager;<a name="line.70"></a>
+<span class="sourceLineNo">071</span> private final String filter;<a name="line.71"></a>
<span class="sourceLineNo">072</span> private final ServerManager serverManager;<a name="line.72"></a>
-<span class="sourceLineNo">073</span> private final List<ServerName> servers;<a name="line.73"></a>
+<span class="sourceLineNo">073</span> private final Map<String,Integer> frags;<a name="line.73"></a>
<span class="sourceLineNo">074</span> // 69, 1<a name="line.74"></a>
<span class="sourceLineNo">075</span> <a name="line.75"></a>
<span class="sourceLineNo">076</span> public String formatZKString() {<a name="line.76"></a>
@@ -108,41 +108,41 @@
<span class="sourceLineNo">100</span><a name="line.100"></a>
<span class="sourceLineNo">101</span> protected static org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl.ImplData __jamon_setOptionalArguments(org.apache.hadoop.hbase.tmpl.master.MasterStatusTmpl.ImplData p_implData)<a name="line.101"></a>
<span class="sourceLineNo">102</span> {<a name="line.102"></a>
-<span class="sourceLineNo">103</span> if(! p_implData.getFilter__IsNotDefault())<a name="line.103"></a>
+<span class="sourceLineNo">103</span> if(! p_implData.getServers__IsNotDefault())<a name="line.103"></a>
<span class="sourceLineNo">104</span> {<a name="line.104"></a>
-<span class="sourceLineNo">105</span> p_implData.setFilter("general");<a name="line.105"></a>
+<span class="sourceLineNo">105</span> p_implData.setServers(null);<a name="line.105"></a>
<span class="sourceLineNo">106</span> }<a name="line.106"></a>
-<span class="sourceLineNo">107</span> if(! p_implData.getCatalogJanitorEnabled__IsNotDefault())<a name="line.107"></a>
+<span class="sourceLineNo">107</span> if(! p_implData.getDeadServers__IsNotDefault())<a name="line.107"></a>
<span class="sourceLineNo">108</span> {<a name="line.108"></a>
-<span class="sourceLineNo">109</span> p_implData.setCatalogJanitorEnabled(true);<a name="line.109"></a>
+<span class="sourceLineNo">109</span> p_implData.setDeadServers(null);<a name="line.109"></a>
<span class="sourceLineNo">110</span> }<a name="line.110"></a>
-<span class="sourceLineNo">111</span> if(! p_implData.getMetaLocation__IsNotDefault())<a name="line.111"></a>
+<span class="sourceLineNo">111</span> if(! p_implData.getFormat__IsNotDefault())<a name="line.111"></a>
<span class="sourceLineNo">112</span> {<a name="line.112"></a>
-<span class="sourceLineNo">113</span> p_implData.setMetaLocation(null);<a name="line.113"></a>
+<span class="sourceLineNo">113</span> p_implData.setFormat("html");<a name="line.113"></a>
<span class="sourceLineNo">114</span> }<a name="line.114"></a>
-<span class="sourceLineNo">115</span> if(! p_implData.getAssignmentManager__IsNotDefault())<a name="line.115"></a>
+<span class="sourceLineNo">115</span> if(! p_implData.getCatalogJanitorEnabled__IsNotDefault())<a name="line.115"></a>
<span class="sourceLineNo">116</span> {<a name="line.116"></a>
-<span class="sourceLineNo">117</span> p_implData.setAssignmentManager(null);<a name="line.117"></a>
+<span class="sourceLineNo">117</span> p_implData.setCatalogJanitorEnabled(true);<a name="line.117"></a>
<span class="sourceLineNo">118</span> }<a name="line.118"></a>
-<span class="sourceLineNo">119</span> if(! p_implData.getFrags__IsNotDefault())<a name="line.119"></a>
+<span class="sourceLineNo">119</span> if(! p_implData.getMetaLocation__IsNotDefault())<a name="line.119"></a>
<span class="sourceLineNo">120</span> {<a name="line.120"></a>
-<span class="sourceLineNo">121</span> p_implData.setFrags(null);<a name="line.121"></a>
+<span class="sourceLineNo">121</span> p_implData.setMetaLocation(null);<a name="line.121"></a>
<span class="sourceLineNo">122</span> }<a name="line.122"></a>
-<span class="sourceLineNo">123</span> if(! p_implData.getDeadServers__IsNotDefault())<a name="line.123"></a>
+<span class="sourceLineNo">123</span> if(! p_implData.getAssignmentManager__IsNotDefault())<a name="line.123"></a>
<span class="sourceLineNo">124</span> {<a name="line.124"></a>
-<span class="sourceLineNo">125</span> p_implData.setDeadServers(null);<a name="line.125"></a>
+<span class="sourceLineNo">125</span> p_implData.setAssignmentManager(null);<a name="line.125"></a>
<span class="sourceLineNo">126</span> }<a name="line.126"></a>
-<span class="sourceLineNo">127</span> if(! p_implData.getFormat__IsNotDefault())<a name="line.127"></a>
+<span class="sourceLineNo">127</span> if(! p_implData.getFilter__IsNotDefault())<a name="line.127"></a>
<span class="sourceLineNo">128</span> {<a name="line.128"></a>
-<span class="sourceLineNo">129</span> p_implData.setFormat("html");<a name="line.129"></a>
+<span class="sourceLineNo">129</span> p_implData.setFilter("general");<a name="line.129"></a>
<span class="sourceLineNo">130</span> }<a name="line.130"></a>
<span class="sourceLineNo">131</span> if(! p_implData.getServerManager__IsNotDefault())<a name="line.131"></a>
<span class="sourceLineNo">132</span> {<a name="line.132"></a>
<span class="sourceLineNo">133</span> p_implData.setServerManager(null);<a name="line.133"></a>
<span class="sourceLineNo">134</span> }<a name="line.134"></a>
-<span class="sourceLineNo">135</span> if(! p_implData.getServers__IsNotDefault())<a name="line.135"></a>
+<span class="sourceLineNo">135</span> if(! p_implData.getFrags__IsNotDefault())<a name="line.135"></a>
<span class="sourceLineNo">136</span> {<a name="line.136"></a>
-<span class="sourceLineNo">137</span> p_implData.setServers(null);<a name="line.137"></a>
+<span class="sourceLineNo">137</span> p_implData.setFrags(null);<a name="line.137"></a>
<span class="sourceLineNo">138</span> }<a name="line.138"></a>
<span class="sourceLineNo">139</span> return p_implData;<a name="line.139"></a>
<span class="sourceLineNo">140</span> }<a name="line.140"></a>
@@ -150,15 +150,15 @@
<span class="sourceLineNo">142</span> {<a name="line.142"></a>
<span class="sourceLineNo">143</span> super(p_templateManager, __jamon_setOptionalArguments(p_implData));<a name="line.143"></a>
<span class="sourceLineNo">144</span> master = p_implData.getMaster();<a name="line.144"></a>
-<span class="sourceLineNo">145</span> filter = p_implData.getFilter();<a name="line.145"></a>
-<span class="sourceLineNo">146</span> catalogJanitorEnabled = p_implData.getCatalogJanitorEnabled();<a name="line.146"></a>
-<span class="sourceLineNo">147</span> metaLocation = p_implData.getMetaLocation();<a name="line.147"></a>
-<span class="sourceLineNo">148</span> assignmentManager = p_implData.getAssignmentManager();<a name="line.148"></a>
-<span class="sourceLineNo">149</span> frags = p_implData.getFrags();<a name="line.149"></a>
-<span class="sourceLineNo">150</span> deadServers = p_implData.getDeadServers();<a name="line.150"></a>
-<span class="sourceLineNo">151</span> format = p_implData.getFormat();<a name="line.151"></a>
+<span class="sourceLineNo">145</span> servers = p_implData.getServers();<a name="line.145"></a>
+<span class="sourceLineNo">146</span> deadServers = p_implData.getDeadServers();<a name="line.146"></a>
+<span class="sourceLineNo">147</span> format = p_implData.getFormat();<a name="line.147"></a>
+<span class="sourceLineNo">148</span> catalogJanitorEnabled = p_implData.getCatalogJanitorEnabled();<a name="line.148"></a>
+<span class="sourceLineNo">149</span> metaLocation = p_implData.getMetaLocation();<a name="line.149"></a>
+<span class="sourceLineNo">150</span> assignmentManager = p_implData.getAssignmentManager();<a name="line.150"></a>
+<span class="sourceLineNo">151</span> filter = p_implData.getFilter();<a name="line.151"></a>
<span class="sourceLineNo">152</span> serverManager = p_implData.getServerManager();<a name="line.152"></a>
-<span class="sourceLineNo">153</span> servers = p_implData.getServers();<a name="line.153"></a>
+<span class="sourceLineNo">153</span> frags = p_implData.getFrags();<a name="line.153"></a>
<span class="sourceLineNo">154</span> }<a name="line.154"></a>
<span class="sourceLineNo">155</span> <a name="line.155"></a>
<span class="sourceLineNo">156</span> @Override public void renderNoFlush(final java.io.Writer jamonWriter)<a name="line.156"></a>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html
index 70efd17..5ee360d 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html
@@ -33,9 +33,9 @@
<span class="sourceLineNo">025</span> requiredArguments = {<a name="line.25"></a>
<span class="sourceLineNo">026</span> @org.jamon.annotations.Argument(name = "regionServer", type = "HRegionServer")},<a name="line.26"></a>
<span class="sourceLineNo">027</span> optionalArguments = {<a name="line.27"></a>
-<span class="sourceLineNo">028</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.28"></a>
-<span class="sourceLineNo">029</span> @org.jamon.annotations.Argument(name = "bcv", type = "String"),<a name="line.29"></a>
-<span class="sourceLineNo">030</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.30"></a>
+<span class="sourceLineNo">028</span> @org.jamon.annotations.Argument(name = "bcv", type = "String"),<a name="line.28"></a>
+<span class="sourceLineNo">029</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.29"></a>
+<span class="sourceLineNo">030</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.30"></a>
<span class="sourceLineNo">031</span> @org.jamon.annotations.Argument(name = "bcn", type = "String")})<a name="line.31"></a>
<span class="sourceLineNo">032</span>public class RSStatusTmpl<a name="line.32"></a>
<span class="sourceLineNo">033</span> extends org.jamon.AbstractTemplateProxy<a name="line.33"></a>
@@ -77,57 +77,57 @@
<span class="sourceLineNo">069</span> return m_regionServer;<a name="line.69"></a>
<span class="sourceLineNo">070</span> }<a name="line.70"></a>
<span class="sourceLineNo">071</span> private HRegionServer m_regionServer;<a name="line.71"></a>
-<span class="sourceLineNo">072</span> // 21, 1<a name="line.72"></a>
-<span class="sourceLineNo">073</span> public void setFilter(String filter)<a name="line.73"></a>
+<span class="sourceLineNo">072</span> // 24, 1<a name="line.72"></a>
+<span class="sourceLineNo">073</span> public void setBcv(String bcv)<a name="line.73"></a>
<span class="sourceLineNo">074</span> {<a name="line.74"></a>
-<span class="sourceLineNo">075</span> // 21, 1<a name="line.75"></a>
-<span class="sourceLineNo">076</span> m_filter = filter;<a name="line.76"></a>
-<span class="sourceLineNo">077</span> m_filter__IsNotDefault = true;<a name="line.77"></a>
+<span class="sourceLineNo">075</span> // 24, 1<a name="line.75"></a>
+<span class="sourceLineNo">076</span> m_bcv = bcv;<a name="line.76"></a>
+<span class="sourceLineNo">077</span> m_bcv__IsNotDefault = true;<a name="line.77"></a>
<span class="sourceLineNo">078</span> }<a name="line.78"></a>
-<span class="sourceLineNo">079</span> public String getFilter()<a name="line.79"></a>
+<span class="sourceLineNo">079</span> public String getBcv()<a name="line.79"></a>
<span class="sourceLineNo">080</span> {<a name="line.80"></a>
-<span class="sourceLineNo">081</span> return m_filter;<a name="line.81"></a>
+<span class="sourceLineNo">081</span> return m_bcv;<a name="line.81"></a>
<span class="sourceLineNo">082</span> }<a name="line.82"></a>
-<span class="sourceLineNo">083</span> private String m_filter;<a name="line.83"></a>
-<span class="sourceLineNo">084</span> public boolean getFilter__IsNotDefault()<a name="line.84"></a>
+<span class="sourceLineNo">083</span> private String m_bcv;<a name="line.83"></a>
+<span class="sourceLineNo">084</span> public boolean getBcv__IsNotDefault()<a name="line.84"></a>
<span class="sourceLineNo">085</span> {<a name="line.85"></a>
-<span class="sourceLineNo">086</span> return m_filter__IsNotDefault;<a name="line.86"></a>
+<span class="sourceLineNo">086</span> return m_bcv__IsNotDefault;<a name="line.86"></a>
<span class="sourceLineNo">087</span> }<a name="line.87"></a>
-<span class="sourceLineNo">088</span> private boolean m_filter__IsNotDefault;<a name="line.88"></a>
-<span class="sourceLineNo">089</span> // 24, 1<a name="line.89"></a>
-<span class="sourceLineNo">090</span> public void setBcv(String bcv)<a name="line.90"></a>
+<span class="sourceLineNo">088</span> private boolean m_bcv__IsNotDefault;<a name="line.88"></a>
+<span class="sourceLineNo">089</span> // 22, 1<a name="line.89"></a>
+<span class="sourceLineNo">090</span> public void setFormat(String format)<a name="line.90"></a>
<span class="sourceLineNo">091</span> {<a name="line.91"></a>
-<span class="sourceLineNo">092</span> // 24, 1<a name="line.92"></a>
-<span class="sourceLineNo">093</span> m_bcv = bcv;<a name="line.93"></a>
-<span class="sourceLineNo">094</span> m_bcv__IsNotDefault = true;<a name="line.94"></a>
+<span class="sourceLineNo">092</span> // 22, 1<a name="line.92"></a>
+<span class="sourceLineNo">093</span> m_format = format;<a name="line.93"></a>
+<span class="sourceLineNo">094</span> m_format__IsNotDefault = true;<a name="line.94"></a>
<span class="sourceLineNo">095</span> }<a name="line.95"></a>
-<span class="sourceLineNo">096</span> public String getBcv()<a name="line.96"></a>
+<span class="sourceLineNo">096</span> public String getFormat()<a name="line.96"></a>
<span class="sourceLineNo">097</span> {<a name="line.97"></a>
-<span class="sourceLineNo">098</span> return m_bcv;<a name="line.98"></a>
+<span class="sourceLineNo">098</span> return m_format;<a name="line.98"></a>
<span class="sourceLineNo">099</span> }<a name="line.99"></a>
-<span class="sourceLineNo">100</span> private String m_bcv;<a name="line.100"></a>
-<span class="sourceLineNo">101</span> public boolean getBcv__IsNotDefault()<a name="line.101"></a>
+<span class="sourceLineNo">100</span> private String m_format;<a name="line.100"></a>
+<span class="sourceLineNo">101</span> public boolean getFormat__IsNotDefault()<a name="line.101"></a>
<span class="sourceLineNo">102</span> {<a name="line.102"></a>
-<span class="sourceLineNo">103</span> return m_bcv__IsNotDefault;<a name="line.103"></a>
+<span class="sourceLineNo">103</span> return m_format__IsNotDefault;<a name="line.103"></a>
<span class="sourceLineNo">104</span> }<a name="line.104"></a>
-<span class="sourceLineNo">105</span> private boolean m_bcv__IsNotDefault;<a name="line.105"></a>
-<span class="sourceLineNo">106</span> // 22, 1<a name="line.106"></a>
-<span class="sourceLineNo">107</span> public void setFormat(String format)<a name="line.107"></a>
+<span class="sourceLineNo">105</span> private boolean m_format__IsNotDefault;<a name="line.105"></a>
+<span class="sourceLineNo">106</span> // 21, 1<a name="line.106"></a>
+<span class="sourceLineNo">107</span> public void setFilter(String filter)<a name="line.107"></a>
<span class="sourceLineNo">108</span> {<a name="line.108"></a>
-<span class="sourceLineNo">109</span> // 22, 1<a name="line.109"></a>
-<span class="sourceLineNo">110</span> m_format = format;<a name="line.110"></a>
-<span class="sourceLineNo">111</span> m_format__IsNotDefault = true;<a name="line.111"></a>
+<span class="sourceLineNo">109</span> // 21, 1<a name="line.109"></a>
+<span class="sourceLineNo">110</span> m_filter = filter;<a name="line.110"></a>
+<span class="sourceLineNo">111</span> m_filter__IsNotDefault = true;<a name="line.111"></a>
<span class="sourceLineNo">112</span> }<a name="line.112"></a>
-<span class="sourceLineNo">113</span> public String getFormat()<a name="line.113"></a>
+<span class="sourceLineNo">113</span> public String getFilter()<a name="line.113"></a>
<span class="sourceLineNo">114</span> {<a name="line.114"></a>
-<span class="sourceLineNo">115</span> return m_format;<a name="line.115"></a>
+<span class="sourceLineNo">115</span> return m_filter;<a name="line.115"></a>
<span class="sourceLineNo">116</span> }<a name="line.116"></a>
-<span class="sourceLineNo">117</span> private String m_format;<a name="line.117"></a>
-<span class="sourceLineNo">118</span> public boolean getFormat__IsNotDefault()<a name="line.118"></a>
+<span class="sourceLineNo">117</span> private String m_filter;<a name="line.117"></a>
+<span class="sourceLineNo">118</span> public boolean getFilter__IsNotDefault()<a name="line.118"></a>
<span class="sourceLineNo">119</span> {<a name="line.119"></a>
-<span class="sourceLineNo">120</span> return m_format__IsNotDefault;<a name="line.120"></a>
+<span class="sourceLineNo">120</span> return m_filter__IsNotDefault;<a name="line.120"></a>
<span class="sourceLineNo">121</span> }<a name="line.121"></a>
-<span class="sourceLineNo">122</span> private boolean m_format__IsNotDefault;<a name="line.122"></a>
+<span class="sourceLineNo">122</span> private boolean m_filter__IsNotDefault;<a name="line.122"></a>
<span class="sourceLineNo">123</span> // 23, 1<a name="line.123"></a>
<span class="sourceLineNo">124</span> public void setBcn(String bcn)<a name="line.124"></a>
<span class="sourceLineNo">125</span> {<a name="line.125"></a>
@@ -156,24 +156,24 @@
<span class="sourceLineNo">148</span> return (ImplData) super.getImplData();<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> protected String filter;<a name="line.151"></a>
-<span class="sourceLineNo">152</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFilter(String p_filter)<a name="line.152"></a>
+<span class="sourceLineNo">151</span> protected String bcv;<a name="line.151"></a>
+<span class="sourceLineNo">152</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setBcv(String p_bcv)<a name="line.152"></a>
<span class="sourceLineNo">153</span> {<a name="line.153"></a>
-<span class="sourceLineNo">154</span> (getImplData()).setFilter(p_filter);<a name="line.154"></a>
+<span class="sourceLineNo">154</span> (getImplData()).setBcv(p_bcv);<a name="line.154"></a>
<span class="sourceLineNo">155</span> return this;<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> protected String bcv;<a name="line.158"></a>
-<span class="sourceLineNo">159</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setBcv(String p_bcv)<a name="line.159"></a>
+<span class="sourceLineNo">158</span> protected String format;<a name="line.158"></a>
+<span class="sourceLineNo">159</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFormat(String p_format)<a name="line.159"></a>
<span class="sourceLineNo">160</span> {<a name="line.160"></a>
-<span class="sourceLineNo">161</span> (getImplData()).setBcv(p_bcv);<a name="line.161"></a>
+<span class="sourceLineNo">161</span> (getImplData()).setFormat(p_format);<a name="line.161"></a>
<span class="sourceLineNo">162</span> return this;<a name="line.162"></a>
<span class="sourceLineNo">163</span> }<a name="line.163"></a>
<span class="sourceLineNo">164</span> <a name="line.164"></a>
-<span class="sourceLineNo">165</span> protected String format;<a name="line.165"></a>
-<span class="sourceLineNo">166</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFormat(String p_format)<a name="line.166"></a>
+<span class="sourceLineNo">165</span> protected String filter;<a name="line.165"></a>
+<span class="sourceLineNo">166</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFilter(String p_filter)<a name="line.166"></a>
<span class="sourceLineNo">167</span> {<a name="line.167"></a>
-<span class="sourceLineNo">168</span> (getImplData()).setFormat(p_format);<a name="line.168"></a>
+<span class="sourceLineNo">168</span> (getImplData()).setFilter(p_filter);<a name="line.168"></a>
<span class="sourceLineNo">169</span> return this;<a name="line.169"></a>
<span class="sourceLineNo">170</span> }<a name="line.170"></a>
<span class="sourceLineNo">171</span> <a name="line.171"></a>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.Intf.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.Intf.html b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.Intf.html
index 70efd17..5ee360d 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.Intf.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.Intf.html
@@ -33,9 +33,9 @@
<span class="sourceLineNo">025</span> requiredArguments = {<a name="line.25"></a>
<span class="sourceLineNo">026</span> @org.jamon.annotations.Argument(name = "regionServer", type = "HRegionServer")},<a name="line.26"></a>
<span class="sourceLineNo">027</span> optionalArguments = {<a name="line.27"></a>
-<span class="sourceLineNo">028</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.28"></a>
-<span class="sourceLineNo">029</span> @org.jamon.annotations.Argument(name = "bcv", type = "String"),<a name="line.29"></a>
-<span class="sourceLineNo">030</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.30"></a>
+<span class="sourceLineNo">028</span> @org.jamon.annotations.Argument(name = "bcv", type = "String"),<a name="line.28"></a>
+<span class="sourceLineNo">029</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.29"></a>
+<span class="sourceLineNo">030</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.30"></a>
<span class="sourceLineNo">031</span> @org.jamon.annotations.Argument(name = "bcn", type = "String")})<a name="line.31"></a>
<span class="sourceLineNo">032</span>public class RSStatusTmpl<a name="line.32"></a>
<span class="sourceLineNo">033</span> extends org.jamon.AbstractTemplateProxy<a name="line.33"></a>
@@ -77,57 +77,57 @@
<span class="sourceLineNo">069</span> return m_regionServer;<a name="line.69"></a>
<span class="sourceLineNo">070</span> }<a name="line.70"></a>
<span class="sourceLineNo">071</span> private HRegionServer m_regionServer;<a name="line.71"></a>
-<span class="sourceLineNo">072</span> // 21, 1<a name="line.72"></a>
-<span class="sourceLineNo">073</span> public void setFilter(String filter)<a name="line.73"></a>
+<span class="sourceLineNo">072</span> // 24, 1<a name="line.72"></a>
+<span class="sourceLineNo">073</span> public void setBcv(String bcv)<a name="line.73"></a>
<span class="sourceLineNo">074</span> {<a name="line.74"></a>
-<span class="sourceLineNo">075</span> // 21, 1<a name="line.75"></a>
-<span class="sourceLineNo">076</span> m_filter = filter;<a name="line.76"></a>
-<span class="sourceLineNo">077</span> m_filter__IsNotDefault = true;<a name="line.77"></a>
+<span class="sourceLineNo">075</span> // 24, 1<a name="line.75"></a>
+<span class="sourceLineNo">076</span> m_bcv = bcv;<a name="line.76"></a>
+<span class="sourceLineNo">077</span> m_bcv__IsNotDefault = true;<a name="line.77"></a>
<span class="sourceLineNo">078</span> }<a name="line.78"></a>
-<span class="sourceLineNo">079</span> public String getFilter()<a name="line.79"></a>
+<span class="sourceLineNo">079</span> public String getBcv()<a name="line.79"></a>
<span class="sourceLineNo">080</span> {<a name="line.80"></a>
-<span class="sourceLineNo">081</span> return m_filter;<a name="line.81"></a>
+<span class="sourceLineNo">081</span> return m_bcv;<a name="line.81"></a>
<span class="sourceLineNo">082</span> }<a name="line.82"></a>
-<span class="sourceLineNo">083</span> private String m_filter;<a name="line.83"></a>
-<span class="sourceLineNo">084</span> public boolean getFilter__IsNotDefault()<a name="line.84"></a>
+<span class="sourceLineNo">083</span> private String m_bcv;<a name="line.83"></a>
+<span class="sourceLineNo">084</span> public boolean getBcv__IsNotDefault()<a name="line.84"></a>
<span class="sourceLineNo">085</span> {<a name="line.85"></a>
-<span class="sourceLineNo">086</span> return m_filter__IsNotDefault;<a name="line.86"></a>
+<span class="sourceLineNo">086</span> return m_bcv__IsNotDefault;<a name="line.86"></a>
<span class="sourceLineNo">087</span> }<a name="line.87"></a>
-<span class="sourceLineNo">088</span> private boolean m_filter__IsNotDefault;<a name="line.88"></a>
-<span class="sourceLineNo">089</span> // 24, 1<a name="line.89"></a>
-<span class="sourceLineNo">090</span> public void setBcv(String bcv)<a name="line.90"></a>
+<span class="sourceLineNo">088</span> private boolean m_bcv__IsNotDefault;<a name="line.88"></a>
+<span class="sourceLineNo">089</span> // 22, 1<a name="line.89"></a>
+<span class="sourceLineNo">090</span> public void setFormat(String format)<a name="line.90"></a>
<span class="sourceLineNo">091</span> {<a name="line.91"></a>
-<span class="sourceLineNo">092</span> // 24, 1<a name="line.92"></a>
-<span class="sourceLineNo">093</span> m_bcv = bcv;<a name="line.93"></a>
-<span class="sourceLineNo">094</span> m_bcv__IsNotDefault = true;<a name="line.94"></a>
+<span class="sourceLineNo">092</span> // 22, 1<a name="line.92"></a>
+<span class="sourceLineNo">093</span> m_format = format;<a name="line.93"></a>
+<span class="sourceLineNo">094</span> m_format__IsNotDefault = true;<a name="line.94"></a>
<span class="sourceLineNo">095</span> }<a name="line.95"></a>
-<span class="sourceLineNo">096</span> public String getBcv()<a name="line.96"></a>
+<span class="sourceLineNo">096</span> public String getFormat()<a name="line.96"></a>
<span class="sourceLineNo">097</span> {<a name="line.97"></a>
-<span class="sourceLineNo">098</span> return m_bcv;<a name="line.98"></a>
+<span class="sourceLineNo">098</span> return m_format;<a name="line.98"></a>
<span class="sourceLineNo">099</span> }<a name="line.99"></a>
-<span class="sourceLineNo">100</span> private String m_bcv;<a name="line.100"></a>
-<span class="sourceLineNo">101</span> public boolean getBcv__IsNotDefault()<a name="line.101"></a>
+<span class="sourceLineNo">100</span> private String m_format;<a name="line.100"></a>
+<span class="sourceLineNo">101</span> public boolean getFormat__IsNotDefault()<a name="line.101"></a>
<span class="sourceLineNo">102</span> {<a name="line.102"></a>
-<span class="sourceLineNo">103</span> return m_bcv__IsNotDefault;<a name="line.103"></a>
+<span class="sourceLineNo">103</span> return m_format__IsNotDefault;<a name="line.103"></a>
<span class="sourceLineNo">104</span> }<a name="line.104"></a>
-<span class="sourceLineNo">105</span> private boolean m_bcv__IsNotDefault;<a name="line.105"></a>
-<span class="sourceLineNo">106</span> // 22, 1<a name="line.106"></a>
-<span class="sourceLineNo">107</span> public void setFormat(String format)<a name="line.107"></a>
+<span class="sourceLineNo">105</span> private boolean m_format__IsNotDefault;<a name="line.105"></a>
+<span class="sourceLineNo">106</span> // 21, 1<a name="line.106"></a>
+<span class="sourceLineNo">107</span> public void setFilter(String filter)<a name="line.107"></a>
<span class="sourceLineNo">108</span> {<a name="line.108"></a>
-<span class="sourceLineNo">109</span> // 22, 1<a name="line.109"></a>
-<span class="sourceLineNo">110</span> m_format = format;<a name="line.110"></a>
-<span class="sourceLineNo">111</span> m_format__IsNotDefault = true;<a name="line.111"></a>
+<span class="sourceLineNo">109</span> // 21, 1<a name="line.109"></a>
+<span class="sourceLineNo">110</span> m_filter = filter;<a name="line.110"></a>
+<span class="sourceLineNo">111</span> m_filter__IsNotDefault = true;<a name="line.111"></a>
<span class="sourceLineNo">112</span> }<a name="line.112"></a>
-<span class="sourceLineNo">113</span> public String getFormat()<a name="line.113"></a>
+<span class="sourceLineNo">113</span> public String getFilter()<a name="line.113"></a>
<span class="sourceLineNo">114</span> {<a name="line.114"></a>
-<span class="sourceLineNo">115</span> return m_format;<a name="line.115"></a>
+<span class="sourceLineNo">115</span> return m_filter;<a name="line.115"></a>
<span class="sourceLineNo">116</span> }<a name="line.116"></a>
-<span class="sourceLineNo">117</span> private String m_format;<a name="line.117"></a>
-<span class="sourceLineNo">118</span> public boolean getFormat__IsNotDefault()<a name="line.118"></a>
+<span class="sourceLineNo">117</span> private String m_filter;<a name="line.117"></a>
+<span class="sourceLineNo">118</span> public boolean getFilter__IsNotDefault()<a name="line.118"></a>
<span class="sourceLineNo">119</span> {<a name="line.119"></a>
-<span class="sourceLineNo">120</span> return m_format__IsNotDefault;<a name="line.120"></a>
+<span class="sourceLineNo">120</span> return m_filter__IsNotDefault;<a name="line.120"></a>
<span class="sourceLineNo">121</span> }<a name="line.121"></a>
-<span class="sourceLineNo">122</span> private boolean m_format__IsNotDefault;<a name="line.122"></a>
+<span class="sourceLineNo">122</span> private boolean m_filter__IsNotDefault;<a name="line.122"></a>
<span class="sourceLineNo">123</span> // 23, 1<a name="line.123"></a>
<span class="sourceLineNo">124</span> public void setBcn(String bcn)<a name="line.124"></a>
<span class="sourceLineNo">125</span> {<a name="line.125"></a>
@@ -156,24 +156,24 @@
<span class="sourceLineNo">148</span> return (ImplData) super.getImplData();<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> protected String filter;<a name="line.151"></a>
-<span class="sourceLineNo">152</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFilter(String p_filter)<a name="line.152"></a>
+<span class="sourceLineNo">151</span> protected String bcv;<a name="line.151"></a>
+<span class="sourceLineNo">152</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setBcv(String p_bcv)<a name="line.152"></a>
<span class="sourceLineNo">153</span> {<a name="line.153"></a>
-<span class="sourceLineNo">154</span> (getImplData()).setFilter(p_filter);<a name="line.154"></a>
+<span class="sourceLineNo">154</span> (getImplData()).setBcv(p_bcv);<a name="line.154"></a>
<span class="sourceLineNo">155</span> return this;<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> protected String bcv;<a name="line.158"></a>
-<span class="sourceLineNo">159</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setBcv(String p_bcv)<a name="line.159"></a>
+<span class="sourceLineNo">158</span> protected String format;<a name="line.158"></a>
+<span class="sourceLineNo">159</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFormat(String p_format)<a name="line.159"></a>
<span class="sourceLineNo">160</span> {<a name="line.160"></a>
-<span class="sourceLineNo">161</span> (getImplData()).setBcv(p_bcv);<a name="line.161"></a>
+<span class="sourceLineNo">161</span> (getImplData()).setFormat(p_format);<a name="line.161"></a>
<span class="sourceLineNo">162</span> return this;<a name="line.162"></a>
<span class="sourceLineNo">163</span> }<a name="line.163"></a>
<span class="sourceLineNo">164</span> <a name="line.164"></a>
-<span class="sourceLineNo">165</span> protected String format;<a name="line.165"></a>
-<span class="sourceLineNo">166</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFormat(String p_format)<a name="line.166"></a>
+<span class="sourceLineNo">165</span> protected String filter;<a name="line.165"></a>
+<span class="sourceLineNo">166</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFilter(String p_filter)<a name="line.166"></a>
<span class="sourceLineNo">167</span> {<a name="line.167"></a>
-<span class="sourceLineNo">168</span> (getImplData()).setFormat(p_format);<a name="line.168"></a>
+<span class="sourceLineNo">168</span> (getImplData()).setFilter(p_filter);<a name="line.168"></a>
<span class="sourceLineNo">169</span> return this;<a name="line.169"></a>
<span class="sourceLineNo">170</span> }<a name="line.170"></a>
<span class="sourceLineNo">171</span> <a name="line.171"></a>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html
index 70efd17..5ee360d 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html
@@ -33,9 +33,9 @@
<span class="sourceLineNo">025</span> requiredArguments = {<a name="line.25"></a>
<span class="sourceLineNo">026</span> @org.jamon.annotations.Argument(name = "regionServer", type = "HRegionServer")},<a name="line.26"></a>
<span class="sourceLineNo">027</span> optionalArguments = {<a name="line.27"></a>
-<span class="sourceLineNo">028</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.28"></a>
-<span class="sourceLineNo">029</span> @org.jamon.annotations.Argument(name = "bcv", type = "String"),<a name="line.29"></a>
-<span class="sourceLineNo">030</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.30"></a>
+<span class="sourceLineNo">028</span> @org.jamon.annotations.Argument(name = "bcv", type = "String"),<a name="line.28"></a>
+<span class="sourceLineNo">029</span> @org.jamon.annotations.Argument(name = "format", type = "String"),<a name="line.29"></a>
+<span class="sourceLineNo">030</span> @org.jamon.annotations.Argument(name = "filter", type = "String"),<a name="line.30"></a>
<span class="sourceLineNo">031</span> @org.jamon.annotations.Argument(name = "bcn", type = "String")})<a name="line.31"></a>
<span class="sourceLineNo">032</span>public class RSStatusTmpl<a name="line.32"></a>
<span class="sourceLineNo">033</span> extends org.jamon.AbstractTemplateProxy<a name="line.33"></a>
@@ -77,57 +77,57 @@
<span class="sourceLineNo">069</span> return m_regionServer;<a name="line.69"></a>
<span class="sourceLineNo">070</span> }<a name="line.70"></a>
<span class="sourceLineNo">071</span> private HRegionServer m_regionServer;<a name="line.71"></a>
-<span class="sourceLineNo">072</span> // 21, 1<a name="line.72"></a>
-<span class="sourceLineNo">073</span> public void setFilter(String filter)<a name="line.73"></a>
+<span class="sourceLineNo">072</span> // 24, 1<a name="line.72"></a>
+<span class="sourceLineNo">073</span> public void setBcv(String bcv)<a name="line.73"></a>
<span class="sourceLineNo">074</span> {<a name="line.74"></a>
-<span class="sourceLineNo">075</span> // 21, 1<a name="line.75"></a>
-<span class="sourceLineNo">076</span> m_filter = filter;<a name="line.76"></a>
-<span class="sourceLineNo">077</span> m_filter__IsNotDefault = true;<a name="line.77"></a>
+<span class="sourceLineNo">075</span> // 24, 1<a name="line.75"></a>
+<span class="sourceLineNo">076</span> m_bcv = bcv;<a name="line.76"></a>
+<span class="sourceLineNo">077</span> m_bcv__IsNotDefault = true;<a name="line.77"></a>
<span class="sourceLineNo">078</span> }<a name="line.78"></a>
-<span class="sourceLineNo">079</span> public String getFilter()<a name="line.79"></a>
+<span class="sourceLineNo">079</span> public String getBcv()<a name="line.79"></a>
<span class="sourceLineNo">080</span> {<a name="line.80"></a>
-<span class="sourceLineNo">081</span> return m_filter;<a name="line.81"></a>
+<span class="sourceLineNo">081</span> return m_bcv;<a name="line.81"></a>
<span class="sourceLineNo">082</span> }<a name="line.82"></a>
-<span class="sourceLineNo">083</span> private String m_filter;<a name="line.83"></a>
-<span class="sourceLineNo">084</span> public boolean getFilter__IsNotDefault()<a name="line.84"></a>
+<span class="sourceLineNo">083</span> private String m_bcv;<a name="line.83"></a>
+<span class="sourceLineNo">084</span> public boolean getBcv__IsNotDefault()<a name="line.84"></a>
<span class="sourceLineNo">085</span> {<a name="line.85"></a>
-<span class="sourceLineNo">086</span> return m_filter__IsNotDefault;<a name="line.86"></a>
+<span class="sourceLineNo">086</span> return m_bcv__IsNotDefault;<a name="line.86"></a>
<span class="sourceLineNo">087</span> }<a name="line.87"></a>
-<span class="sourceLineNo">088</span> private boolean m_filter__IsNotDefault;<a name="line.88"></a>
-<span class="sourceLineNo">089</span> // 24, 1<a name="line.89"></a>
-<span class="sourceLineNo">090</span> public void setBcv(String bcv)<a name="line.90"></a>
+<span class="sourceLineNo">088</span> private boolean m_bcv__IsNotDefault;<a name="line.88"></a>
+<span class="sourceLineNo">089</span> // 22, 1<a name="line.89"></a>
+<span class="sourceLineNo">090</span> public void setFormat(String format)<a name="line.90"></a>
<span class="sourceLineNo">091</span> {<a name="line.91"></a>
-<span class="sourceLineNo">092</span> // 24, 1<a name="line.92"></a>
-<span class="sourceLineNo">093</span> m_bcv = bcv;<a name="line.93"></a>
-<span class="sourceLineNo">094</span> m_bcv__IsNotDefault = true;<a name="line.94"></a>
+<span class="sourceLineNo">092</span> // 22, 1<a name="line.92"></a>
+<span class="sourceLineNo">093</span> m_format = format;<a name="line.93"></a>
+<span class="sourceLineNo">094</span> m_format__IsNotDefault = true;<a name="line.94"></a>
<span class="sourceLineNo">095</span> }<a name="line.95"></a>
-<span class="sourceLineNo">096</span> public String getBcv()<a name="line.96"></a>
+<span class="sourceLineNo">096</span> public String getFormat()<a name="line.96"></a>
<span class="sourceLineNo">097</span> {<a name="line.97"></a>
-<span class="sourceLineNo">098</span> return m_bcv;<a name="line.98"></a>
+<span class="sourceLineNo">098</span> return m_format;<a name="line.98"></a>
<span class="sourceLineNo">099</span> }<a name="line.99"></a>
-<span class="sourceLineNo">100</span> private String m_bcv;<a name="line.100"></a>
-<span class="sourceLineNo">101</span> public boolean getBcv__IsNotDefault()<a name="line.101"></a>
+<span class="sourceLineNo">100</span> private String m_format;<a name="line.100"></a>
+<span class="sourceLineNo">101</span> public boolean getFormat__IsNotDefault()<a name="line.101"></a>
<span class="sourceLineNo">102</span> {<a name="line.102"></a>
-<span class="sourceLineNo">103</span> return m_bcv__IsNotDefault;<a name="line.103"></a>
+<span class="sourceLineNo">103</span> return m_format__IsNotDefault;<a name="line.103"></a>
<span class="sourceLineNo">104</span> }<a name="line.104"></a>
-<span class="sourceLineNo">105</span> private boolean m_bcv__IsNotDefault;<a name="line.105"></a>
-<span class="sourceLineNo">106</span> // 22, 1<a name="line.106"></a>
-<span class="sourceLineNo">107</span> public void setFormat(String format)<a name="line.107"></a>
+<span class="sourceLineNo">105</span> private boolean m_format__IsNotDefault;<a name="line.105"></a>
+<span class="sourceLineNo">106</span> // 21, 1<a name="line.106"></a>
+<span class="sourceLineNo">107</span> public void setFilter(String filter)<a name="line.107"></a>
<span class="sourceLineNo">108</span> {<a name="line.108"></a>
-<span class="sourceLineNo">109</span> // 22, 1<a name="line.109"></a>
-<span class="sourceLineNo">110</span> m_format = format;<a name="line.110"></a>
-<span class="sourceLineNo">111</span> m_format__IsNotDefault = true;<a name="line.111"></a>
+<span class="sourceLineNo">109</span> // 21, 1<a name="line.109"></a>
+<span class="sourceLineNo">110</span> m_filter = filter;<a name="line.110"></a>
+<span class="sourceLineNo">111</span> m_filter__IsNotDefault = true;<a name="line.111"></a>
<span class="sourceLineNo">112</span> }<a name="line.112"></a>
-<span class="sourceLineNo">113</span> public String getFormat()<a name="line.113"></a>
+<span class="sourceLineNo">113</span> public String getFilter()<a name="line.113"></a>
<span class="sourceLineNo">114</span> {<a name="line.114"></a>
-<span class="sourceLineNo">115</span> return m_format;<a name="line.115"></a>
+<span class="sourceLineNo">115</span> return m_filter;<a name="line.115"></a>
<span class="sourceLineNo">116</span> }<a name="line.116"></a>
-<span class="sourceLineNo">117</span> private String m_format;<a name="line.117"></a>
-<span class="sourceLineNo">118</span> public boolean getFormat__IsNotDefault()<a name="line.118"></a>
+<span class="sourceLineNo">117</span> private String m_filter;<a name="line.117"></a>
+<span class="sourceLineNo">118</span> public boolean getFilter__IsNotDefault()<a name="line.118"></a>
<span class="sourceLineNo">119</span> {<a name="line.119"></a>
-<span class="sourceLineNo">120</span> return m_format__IsNotDefault;<a name="line.120"></a>
+<span class="sourceLineNo">120</span> return m_filter__IsNotDefault;<a name="line.120"></a>
<span class="sourceLineNo">121</span> }<a name="line.121"></a>
-<span class="sourceLineNo">122</span> private boolean m_format__IsNotDefault;<a name="line.122"></a>
+<span class="sourceLineNo">122</span> private boolean m_filter__IsNotDefault;<a name="line.122"></a>
<span class="sourceLineNo">123</span> // 23, 1<a name="line.123"></a>
<span class="sourceLineNo">124</span> public void setBcn(String bcn)<a name="line.124"></a>
<span class="sourceLineNo">125</span> {<a name="line.125"></a>
@@ -156,24 +156,24 @@
<span class="sourceLineNo">148</span> return (ImplData) super.getImplData();<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> protected String filter;<a name="line.151"></a>
-<span class="sourceLineNo">152</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFilter(String p_filter)<a name="line.152"></a>
+<span class="sourceLineNo">151</span> protected String bcv;<a name="line.151"></a>
+<span class="sourceLineNo">152</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setBcv(String p_bcv)<a name="line.152"></a>
<span class="sourceLineNo">153</span> {<a name="line.153"></a>
-<span class="sourceLineNo">154</span> (getImplData()).setFilter(p_filter);<a name="line.154"></a>
+<span class="sourceLineNo">154</span> (getImplData()).setBcv(p_bcv);<a name="line.154"></a>
<span class="sourceLineNo">155</span> return this;<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> protected String bcv;<a name="line.158"></a>
-<span class="sourceLineNo">159</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setBcv(String p_bcv)<a name="line.159"></a>
+<span class="sourceLineNo">158</span> protected String format;<a name="line.158"></a>
+<span class="sourceLineNo">159</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFormat(String p_format)<a name="line.159"></a>
<span class="sourceLineNo">160</span> {<a name="line.160"></a>
-<span class="sourceLineNo">161</span> (getImplData()).setBcv(p_bcv);<a name="line.161"></a>
+<span class="sourceLineNo">161</span> (getImplData()).setFormat(p_format);<a name="line.161"></a>
<span class="sourceLineNo">162</span> return this;<a name="line.162"></a>
<span class="sourceLineNo">163</span> }<a name="line.163"></a>
<span class="sourceLineNo">164</span> <a name="line.164"></a>
-<span class="sourceLineNo">165</span> protected String format;<a name="line.165"></a>
-<span class="sourceLineNo">166</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFormat(String p_format)<a name="line.166"></a>
+<span class="sourceLineNo">165</span> protected String filter;<a name="line.165"></a>
+<span class="sourceLineNo">166</span> public final org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl setFilter(String p_filter)<a name="line.166"></a>
<span class="sourceLineNo">167</span> {<a name="line.167"></a>
-<span class="sourceLineNo">168</span> (getImplData()).setFormat(p_format);<a name="line.168"></a>
+<span class="sourceLineNo">168</span> (getImplData()).setFilter(p_filter);<a name="line.168"></a>
<span class="sourceLineNo">169</span> return this;<a name="line.169"></a>
<span class="sourceLineNo">170</span> }<a name="line.170"></a>
<span class="sourceLineNo">171</span> <a name="line.171"></a>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html
index 7ab48e4..a23b0fe 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html
@@ -34,23 +34,23 @@
<span class="sourceLineNo">026</span><a name="line.26"></a>
<span class="sourceLineNo">027</span>{<a name="line.27"></a>
<span class="sourceLineNo">028</span> private final HRegionServer regionServer;<a name="line.28"></a>
-<span class="sourceLineNo">029</span> private final String filter;<a name="line.29"></a>
-<span class="sourceLineNo">030</span> private final String bcv;<a name="line.30"></a>
-<span class="sourceLineNo">031</span> private final String format;<a name="line.31"></a>
+<span class="sourceLineNo">029</span> private final String bcv;<a name="line.29"></a>
+<span class="sourceLineNo">030</span> private final String format;<a name="line.30"></a>
+<span class="sourceLineNo">031</span> private final String filter;<a name="line.31"></a>
<span class="sourceLineNo">032</span> private final String bcn;<a name="line.32"></a>
<span class="sourceLineNo">033</span> protected static org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl.ImplData __jamon_setOptionalArguments(org.apache.hadoop.hbase.tmpl.regionserver.RSStatusTmpl.ImplData p_implData)<a name="line.33"></a>
<span class="sourceLineNo">034</span> {<a name="line.34"></a>
-<span class="sourceLineNo">035</span> if(! p_implData.getFilter__IsNotDefault())<a name="line.35"></a>
+<span class="sourceLineNo">035</span> if(! p_implData.getBcv__IsNotDefault())<a name="line.35"></a>
<span class="sourceLineNo">036</span> {<a name="line.36"></a>
-<span class="sourceLineNo">037</span> p_implData.setFilter("general");<a name="line.37"></a>
+<span class="sourceLineNo">037</span> p_implData.setBcv("");<a name="line.37"></a>
<span class="sourceLineNo">038</span> }<a name="line.38"></a>
-<span class="sourceLineNo">039</span> if(! p_implData.getBcv__IsNotDefault())<a name="line.39"></a>
+<span class="sourceLineNo">039</span> if(! p_implData.getFormat__IsNotDefault())<a name="line.39"></a>
<span class="sourceLineNo">040</span> {<a name="line.40"></a>
-<span class="sourceLineNo">041</span> p_implData.setBcv("");<a name="line.41"></a>
+<span class="sourceLineNo">041</span> p_implData.setFormat("html");<a name="line.41"></a>
<span class="sourceLineNo">042</span> }<a name="line.42"></a>
-<span class="sourceLineNo">043</span> if(! p_implData.getFormat__IsNotDefault())<a name="line.43"></a>
+<span class="sourceLineNo">043</span> if(! p_implData.getFilter__IsNotDefault())<a name="line.43"></a>
<span class="sourceLineNo">044</span> {<a name="line.44"></a>
-<span class="sourceLineNo">045</span> p_implData.setFormat("html");<a name="line.45"></a>
+<span class="sourceLineNo">045</span> p_implData.setFilter("general");<a name="line.45"></a>
<span class="sourceLineNo">046</span> }<a name="line.46"></a>
<span class="sourceLineNo">047</span> if(! p_implData.getBcn__IsNotDefault())<a name="line.47"></a>
<span class="sourceLineNo">048</span> {<a name="line.48"></a>
@@ -62,9 +62,9 @@
<span class="sourceLineNo">054</span> {<a name="line.54"></a>
<span class="sourceLineNo">055</span> super(p_templateManager, __jamon_setOptionalArguments(p_implData));<a name="line.55"></a>
<span class="sourceLineNo">056</span> regionServer = p_implData.getRegionServer();<a name="line.56"></a>
-<span class="sourceLineNo">057</span> filter = p_implData.getFilter();<a name="line.57"></a>
-<span class="sourceLineNo">058</span> bcv = p_implData.getBcv();<a name="line.58"></a>
-<span class="sourceLineNo">059</span> format = p_implData.getFormat();<a name="line.59"></a>
+<span class="sourceLineNo">057</span> bcv = p_implData.getBcv();<a name="line.57"></a>
+<span class="sourceLineNo">058</span> format = p_implData.getFormat();<a name="line.58"></a>
+<span class="sourceLineNo">059</span> filter = p_implData.getFilter();<a name="line.59"></a>
<span class="sourceLineNo">060</span> bcn = p_implData.getBcn();<a name="line.60"></a>
<span class="sourceLineNo">061</span> }<a name="line.61"></a>
<span class="sourceLineNo">062</span> <a name="line.62"></a>
[05/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.UnsafeComparer.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.UnsafeComparer.html b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.UnsafeComparer.html
index 3c7d6b4..3dea877 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.UnsafeComparer.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.UnsafeComparer.html
@@ -1583,1089 +1583,1084 @@
<span class="sourceLineNo">1575</span> length1 == length2) {<a name="line.1575"></a>
<span class="sourceLineNo">1576</span> return 0;<a name="line.1576"></a>
<span class="sourceLineNo">1577</span> }<a name="line.1577"></a>
-<span class="sourceLineNo">1578</span> final int minLength = Math.min(length1, length2);<a name="line.1578"></a>
-<span class="sourceLineNo">1579</span> final int minWords = minLength / SIZEOF_LONG;<a name="line.1579"></a>
-<span class="sourceLineNo">1580</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1580"></a>
-<span class="sourceLineNo">1581</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
-<span class="sourceLineNo">1582</span><a name="line.1582"></a>
-<span class="sourceLineNo">1583</span> /*<a name="line.1583"></a>
-<span class="sourceLineNo">1584</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a<a name="line.1584"></a>
-<span class="sourceLineNo">1585</span> * time is no slower than comparing 4 bytes at a time even on 32-bit.<a name="line.1585"></a>
-<span class="sourceLineNo">1586</span> * On the other hand, it is substantially faster on 64-bit.<a name="line.1586"></a>
-<span class="sourceLineNo">1587</span> */<a name="line.1587"></a>
-<span class="sourceLineNo">1588</span> // This is the end offset of long parts.<a name="line.1588"></a>
-<span class="sourceLineNo">1589</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.1589"></a>
-<span class="sourceLineNo">1590</span> for (int i = 0; i < j; i += SIZEOF_LONG) {<a name="line.1590"></a>
-<span class="sourceLineNo">1591</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1591"></a>
-<span class="sourceLineNo">1592</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1592"></a>
-<span class="sourceLineNo">1593</span> long diff = lw ^ rw;<a name="line.1593"></a>
-<span class="sourceLineNo">1594</span> if (diff != 0) {<a name="line.1594"></a>
-<span class="sourceLineNo">1595</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.1595"></a>
-<span class="sourceLineNo">1596</span> }<a name="line.1596"></a>
-<span class="sourceLineNo">1597</span> }<a name="line.1597"></a>
-<span class="sourceLineNo">1598</span> int offset = j;<a name="line.1598"></a>
-<span class="sourceLineNo">1599</span><a name="line.1599"></a>
-<span class="sourceLineNo">1600</span> if (minLength - offset >= SIZEOF_INT) {<a name="line.1600"></a>
-<span class="sourceLineNo">1601</span> int il = theUnsafe.getInt(buffer1, offset1Adj + offset);<a name="line.1601"></a>
-<span class="sourceLineNo">1602</span> int ir = theUnsafe.getInt(buffer2, offset2Adj + offset);<a name="line.1602"></a>
-<span class="sourceLineNo">1603</span> if (il != ir) {<a name="line.1603"></a>
-<span class="sourceLineNo">1604</span> return lessThanUnsignedInt(il, ir) ? -1: 1;<a name="line.1604"></a>
-<span class="sourceLineNo">1605</span> }<a name="line.1605"></a>
-<span class="sourceLineNo">1606</span> offset += SIZEOF_INT;<a name="line.1606"></a>
-<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
-<span class="sourceLineNo">1608</span> if (minLength - offset >= SIZEOF_SHORT) {<a name="line.1608"></a>
-<span class="sourceLineNo">1609</span> short sl = theUnsafe.getShort(buffer1, offset1Adj + offset);<a name="line.1609"></a>
-<span class="sourceLineNo">1610</span> short sr = theUnsafe.getShort(buffer2, offset2Adj + offset);<a name="line.1610"></a>
-<span class="sourceLineNo">1611</span> if (sl != sr) {<a name="line.1611"></a>
-<span class="sourceLineNo">1612</span> return lessThanUnsignedShort(sl, sr) ? -1: 1;<a name="line.1612"></a>
-<span class="sourceLineNo">1613</span> }<a name="line.1613"></a>
-<span class="sourceLineNo">1614</span> offset += SIZEOF_SHORT;<a name="line.1614"></a>
-<span class="sourceLineNo">1615</span> }<a name="line.1615"></a>
-<span class="sourceLineNo">1616</span> if (minLength - offset == 1) {<a name="line.1616"></a>
-<span class="sourceLineNo">1617</span> int a = (buffer1[(int)(offset1 + offset)] & 0xff);<a name="line.1617"></a>
-<span class="sourceLineNo">1618</span> int b = (buffer2[(int)(offset2 + offset)] & 0xff);<a name="line.1618"></a>
-<span class="sourceLineNo">1619</span> if (a != b) {<a name="line.1619"></a>
-<span class="sourceLineNo">1620</span> return a - b;<a name="line.1620"></a>
-<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
-<span class="sourceLineNo">1622</span> }<a name="line.1622"></a>
-<span class="sourceLineNo">1623</span> return length1 - length2;<a name="line.1623"></a>
-<span class="sourceLineNo">1624</span> }<a name="line.1624"></a>
-<span class="sourceLineNo">1625</span> }<a name="line.1625"></a>
-<span class="sourceLineNo">1626</span> }<a name="line.1626"></a>
-<span class="sourceLineNo">1627</span><a name="line.1627"></a>
-<span class="sourceLineNo">1628</span> /**<a name="line.1628"></a>
-<span class="sourceLineNo">1629</span> * @param left left operand<a name="line.1629"></a>
-<span class="sourceLineNo">1630</span> * @param right right operand<a name="line.1630"></a>
-<span class="sourceLineNo">1631</span> * @return True if equal<a name="line.1631"></a>
-<span class="sourceLineNo">1632</span> */<a name="line.1632"></a>
-<span class="sourceLineNo">1633</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1633"></a>
-<span class="sourceLineNo">1634</span> // Could use Arrays.equals?<a name="line.1634"></a>
-<span class="sourceLineNo">1635</span> //noinspection SimplifiableConditionalExpression<a name="line.1635"></a>
-<span class="sourceLineNo">1636</span> if (left == right) return true;<a name="line.1636"></a>
-<span class="sourceLineNo">1637</span> if (left == null || right == null) return false;<a name="line.1637"></a>
-<span class="sourceLineNo">1638</span> if (left.length != right.length) return false;<a name="line.1638"></a>
-<span class="sourceLineNo">1639</span> if (left.length == 0) return true;<a name="line.1639"></a>
+<span class="sourceLineNo">1578</span> final int stride = 8;<a name="line.1578"></a>
+<span class="sourceLineNo">1579</span> final int minLength = Math.min(length1, length2);<a name="line.1579"></a>
+<span class="sourceLineNo">1580</span> int strideLimit = minLength & ~(stride - 1);<a name="line.1580"></a>
+<span class="sourceLineNo">1581</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
+<span class="sourceLineNo">1582</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1582"></a>
+<span class="sourceLineNo">1583</span> int i;<a name="line.1583"></a>
+<span class="sourceLineNo">1584</span><a name="line.1584"></a>
+<span class="sourceLineNo">1585</span> /*<a name="line.1585"></a>
+<span class="sourceLineNo">1586</span> * Compare 8 bytes at a time. Benchmarking on x86 shows a stride of 8 bytes is no slower<a name="line.1586"></a>
+<span class="sourceLineNo">1587</span> * than 4 bytes even on 32-bit. On the other hand, it is substantially faster on 64-bit.<a name="line.1587"></a>
+<span class="sourceLineNo">1588</span> */<a name="line.1588"></a>
+<span class="sourceLineNo">1589</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.1589"></a>
+<span class="sourceLineNo">1590</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1590"></a>
+<span class="sourceLineNo">1591</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1591"></a>
+<span class="sourceLineNo">1592</span> if (lw != rw) {<a name="line.1592"></a>
+<span class="sourceLineNo">1593</span> if(!UnsafeAccess.littleEndian) {<a name="line.1593"></a>
+<span class="sourceLineNo">1594</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.1594"></a>
+<span class="sourceLineNo">1595</span> }<a name="line.1595"></a>
+<span class="sourceLineNo">1596</span><a name="line.1596"></a>
+<span class="sourceLineNo">1597</span> /*<a name="line.1597"></a>
+<span class="sourceLineNo">1598</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.1598"></a>
+<span class="sourceLineNo">1599</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.1599"></a>
+<span class="sourceLineNo">1600</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.1600"></a>
+<span class="sourceLineNo">1601</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.1601"></a>
+<span class="sourceLineNo">1602</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.1602"></a>
+<span class="sourceLineNo">1603</span> * comparator from guava v21<a name="line.1603"></a>
+<span class="sourceLineNo">1604</span> */<a name="line.1604"></a>
+<span class="sourceLineNo">1605</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.1605"></a>
+<span class="sourceLineNo">1606</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.1606"></a>
+<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
+<span class="sourceLineNo">1608</span> }<a name="line.1608"></a>
+<span class="sourceLineNo">1609</span><a name="line.1609"></a>
+<span class="sourceLineNo">1610</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.1610"></a>
+<span class="sourceLineNo">1611</span> for (; i < minLength; i++) {<a name="line.1611"></a>
+<span class="sourceLineNo">1612</span> int a = (buffer1[offset1 + i] & 0xFF);<a name="line.1612"></a>
+<span class="sourceLineNo">1613</span> int b = (buffer2[offset2 + i] & 0xFF);<a name="line.1613"></a>
+<span class="sourceLineNo">1614</span> if (a != b) {<a name="line.1614"></a>
+<span class="sourceLineNo">1615</span> return a - b;<a name="line.1615"></a>
+<span class="sourceLineNo">1616</span> }<a name="line.1616"></a>
+<span class="sourceLineNo">1617</span> }<a name="line.1617"></a>
+<span class="sourceLineNo">1618</span> return length1 - length2;<a name="line.1618"></a>
+<span class="sourceLineNo">1619</span> }<a name="line.1619"></a>
+<span class="sourceLineNo">1620</span> }<a name="line.1620"></a>
+<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
+<span class="sourceLineNo">1622</span><a name="line.1622"></a>
+<span class="sourceLineNo">1623</span> /**<a name="line.1623"></a>
+<span class="sourceLineNo">1624</span> * @param left left operand<a name="line.1624"></a>
+<span class="sourceLineNo">1625</span> * @param right right operand<a name="line.1625"></a>
+<span class="sourceLineNo">1626</span> * @return True if equal<a name="line.1626"></a>
+<span class="sourceLineNo">1627</span> */<a name="line.1627"></a>
+<span class="sourceLineNo">1628</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1628"></a>
+<span class="sourceLineNo">1629</span> // Could use Arrays.equals?<a name="line.1629"></a>
+<span class="sourceLineNo">1630</span> //noinspection SimplifiableConditionalExpression<a name="line.1630"></a>
+<span class="sourceLineNo">1631</span> if (left == right) return true;<a name="line.1631"></a>
+<span class="sourceLineNo">1632</span> if (left == null || right == null) return false;<a name="line.1632"></a>
+<span class="sourceLineNo">1633</span> if (left.length != right.length) return false;<a name="line.1633"></a>
+<span class="sourceLineNo">1634</span> if (left.length == 0) return true;<a name="line.1634"></a>
+<span class="sourceLineNo">1635</span><a name="line.1635"></a>
+<span class="sourceLineNo">1636</span> // Since we're often comparing adjacent sorted data,<a name="line.1636"></a>
+<span class="sourceLineNo">1637</span> // it's usual to have equal arrays except for the very last byte<a name="line.1637"></a>
+<span class="sourceLineNo">1638</span> // so check that first<a name="line.1638"></a>
+<span class="sourceLineNo">1639</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1639"></a>
<span class="sourceLineNo">1640</span><a name="line.1640"></a>
-<span class="sourceLineNo">1641</span> // Since we're often comparing adjacent sorted data,<a name="line.1641"></a>
-<span class="sourceLineNo">1642</span> // it's usual to have equal arrays except for the very last byte<a name="line.1642"></a>
-<span class="sourceLineNo">1643</span> // so check that first<a name="line.1643"></a>
-<span class="sourceLineNo">1644</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1644"></a>
-<span class="sourceLineNo">1645</span><a name="line.1645"></a>
-<span class="sourceLineNo">1646</span> return compareTo(left, right) == 0;<a name="line.1646"></a>
-<span class="sourceLineNo">1647</span> }<a name="line.1647"></a>
-<span class="sourceLineNo">1648</span><a name="line.1648"></a>
-<span class="sourceLineNo">1649</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1649"></a>
-<span class="sourceLineNo">1650</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1650"></a>
-<span class="sourceLineNo">1651</span> // short circuit case<a name="line.1651"></a>
-<span class="sourceLineNo">1652</span> if (left == right &&<a name="line.1652"></a>
-<span class="sourceLineNo">1653</span> leftOffset == rightOffset &&<a name="line.1653"></a>
-<span class="sourceLineNo">1654</span> leftLen == rightLen) {<a name="line.1654"></a>
-<span class="sourceLineNo">1655</span> return true;<a name="line.1655"></a>
-<span class="sourceLineNo">1656</span> }<a name="line.1656"></a>
-<span class="sourceLineNo">1657</span> // different lengths fast check<a name="line.1657"></a>
-<span class="sourceLineNo">1658</span> if (leftLen != rightLen) {<a name="line.1658"></a>
-<span class="sourceLineNo">1659</span> return false;<a name="line.1659"></a>
-<span class="sourceLineNo">1660</span> }<a name="line.1660"></a>
-<span class="sourceLineNo">1661</span> if (leftLen == 0) {<a name="line.1661"></a>
-<span class="sourceLineNo">1662</span> return true;<a name="line.1662"></a>
-<span class="sourceLineNo">1663</span> }<a name="line.1663"></a>
+<span class="sourceLineNo">1641</span> return compareTo(left, right) == 0;<a name="line.1641"></a>
+<span class="sourceLineNo">1642</span> }<a name="line.1642"></a>
+<span class="sourceLineNo">1643</span><a name="line.1643"></a>
+<span class="sourceLineNo">1644</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1644"></a>
+<span class="sourceLineNo">1645</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1645"></a>
+<span class="sourceLineNo">1646</span> // short circuit case<a name="line.1646"></a>
+<span class="sourceLineNo">1647</span> if (left == right &&<a name="line.1647"></a>
+<span class="sourceLineNo">1648</span> leftOffset == rightOffset &&<a name="line.1648"></a>
+<span class="sourceLineNo">1649</span> leftLen == rightLen) {<a name="line.1649"></a>
+<span class="sourceLineNo">1650</span> return true;<a name="line.1650"></a>
+<span class="sourceLineNo">1651</span> }<a name="line.1651"></a>
+<span class="sourceLineNo">1652</span> // different lengths fast check<a name="line.1652"></a>
+<span class="sourceLineNo">1653</span> if (leftLen != rightLen) {<a name="line.1653"></a>
+<span class="sourceLineNo">1654</span> return false;<a name="line.1654"></a>
+<span class="sourceLineNo">1655</span> }<a name="line.1655"></a>
+<span class="sourceLineNo">1656</span> if (leftLen == 0) {<a name="line.1656"></a>
+<span class="sourceLineNo">1657</span> return true;<a name="line.1657"></a>
+<span class="sourceLineNo">1658</span> }<a name="line.1658"></a>
+<span class="sourceLineNo">1659</span><a name="line.1659"></a>
+<span class="sourceLineNo">1660</span> // Since we're often comparing adjacent sorted data,<a name="line.1660"></a>
+<span class="sourceLineNo">1661</span> // it's usual to have equal arrays except for the very last byte<a name="line.1661"></a>
+<span class="sourceLineNo">1662</span> // so check that first<a name="line.1662"></a>
+<span class="sourceLineNo">1663</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1663"></a>
<span class="sourceLineNo">1664</span><a name="line.1664"></a>
-<span class="sourceLineNo">1665</span> // Since we're often comparing adjacent sorted data,<a name="line.1665"></a>
-<span class="sourceLineNo">1666</span> // it's usual to have equal arrays except for the very last byte<a name="line.1666"></a>
-<span class="sourceLineNo">1667</span> // so check that first<a name="line.1667"></a>
-<span class="sourceLineNo">1668</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1668"></a>
+<span class="sourceLineNo">1665</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1665"></a>
+<span class="sourceLineNo">1666</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1666"></a>
+<span class="sourceLineNo">1667</span> }<a name="line.1667"></a>
+<span class="sourceLineNo">1668</span><a name="line.1668"></a>
<span class="sourceLineNo">1669</span><a name="line.1669"></a>
-<span class="sourceLineNo">1670</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1670"></a>
-<span class="sourceLineNo">1671</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1671"></a>
-<span class="sourceLineNo">1672</span> }<a name="line.1672"></a>
-<span class="sourceLineNo">1673</span><a name="line.1673"></a>
-<span class="sourceLineNo">1674</span><a name="line.1674"></a>
-<span class="sourceLineNo">1675</span> /**<a name="line.1675"></a>
-<span class="sourceLineNo">1676</span> * @param a left operand<a name="line.1676"></a>
-<span class="sourceLineNo">1677</span> * @param buf right operand<a name="line.1677"></a>
-<span class="sourceLineNo">1678</span> * @return True if equal<a name="line.1678"></a>
-<span class="sourceLineNo">1679</span> */<a name="line.1679"></a>
-<span class="sourceLineNo">1680</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1680"></a>
-<span class="sourceLineNo">1681</span> if (a == null) return buf == null;<a name="line.1681"></a>
-<span class="sourceLineNo">1682</span> if (buf == null) return false;<a name="line.1682"></a>
-<span class="sourceLineNo">1683</span> if (a.length != buf.remaining()) return false;<a name="line.1683"></a>
-<span class="sourceLineNo">1684</span><a name="line.1684"></a>
-<span class="sourceLineNo">1685</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1685"></a>
-<span class="sourceLineNo">1686</span> ByteBuffer b = buf.duplicate();<a name="line.1686"></a>
-<span class="sourceLineNo">1687</span> for (byte anA : a) {<a name="line.1687"></a>
-<span class="sourceLineNo">1688</span> if (anA != b.get()) {<a name="line.1688"></a>
-<span class="sourceLineNo">1689</span> return false;<a name="line.1689"></a>
-<span class="sourceLineNo">1690</span> }<a name="line.1690"></a>
-<span class="sourceLineNo">1691</span> }<a name="line.1691"></a>
-<span class="sourceLineNo">1692</span> return true;<a name="line.1692"></a>
-<span class="sourceLineNo">1693</span> }<a name="line.1693"></a>
-<span class="sourceLineNo">1694</span><a name="line.1694"></a>
-<span class="sourceLineNo">1695</span><a name="line.1695"></a>
-<span class="sourceLineNo">1696</span> /**<a name="line.1696"></a>
-<span class="sourceLineNo">1697</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1697"></a>
-<span class="sourceLineNo">1698</span> * array on the left.<a name="line.1698"></a>
-<span class="sourceLineNo">1699</span> */<a name="line.1699"></a>
-<span class="sourceLineNo">1700</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1700"></a>
-<span class="sourceLineNo">1701</span> return bytes != null && prefix != null &&<a name="line.1701"></a>
-<span class="sourceLineNo">1702</span> bytes.length >= prefix.length &&<a name="line.1702"></a>
-<span class="sourceLineNo">1703</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1703"></a>
-<span class="sourceLineNo">1704</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1704"></a>
-<span class="sourceLineNo">1705</span> }<a name="line.1705"></a>
-<span class="sourceLineNo">1706</span><a name="line.1706"></a>
-<span class="sourceLineNo">1707</span> /**<a name="line.1707"></a>
-<span class="sourceLineNo">1708</span> * @param b bytes to hash<a name="line.1708"></a>
-<span class="sourceLineNo">1709</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1709"></a>
-<span class="sourceLineNo">1710</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1710"></a>
-<span class="sourceLineNo">1711</span> * use calculating hash code.<a name="line.1711"></a>
-<span class="sourceLineNo">1712</span> */<a name="line.1712"></a>
-<span class="sourceLineNo">1713</span> public static int hashCode(final byte [] b) {<a name="line.1713"></a>
-<span class="sourceLineNo">1714</span> return hashCode(b, b.length);<a name="line.1714"></a>
-<span class="sourceLineNo">1715</span> }<a name="line.1715"></a>
-<span class="sourceLineNo">1716</span><a name="line.1716"></a>
-<span class="sourceLineNo">1717</span> /**<a name="line.1717"></a>
-<span class="sourceLineNo">1718</span> * @param b value<a name="line.1718"></a>
-<span class="sourceLineNo">1719</span> * @param length length of the value<a name="line.1719"></a>
-<span class="sourceLineNo">1720</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1720"></a>
-<span class="sourceLineNo">1721</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1721"></a>
-<span class="sourceLineNo">1722</span> * use calculating hash code.<a name="line.1722"></a>
-<span class="sourceLineNo">1723</span> */<a name="line.1723"></a>
-<span class="sourceLineNo">1724</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1724"></a>
-<span class="sourceLineNo">1725</span> return WritableComparator.hashBytes(b, length);<a name="line.1725"></a>
-<span class="sourceLineNo">1726</span> }<a name="line.1726"></a>
-<span class="sourceLineNo">1727</span><a name="line.1727"></a>
-<span class="sourceLineNo">1728</span> /**<a name="line.1728"></a>
-<span class="sourceLineNo">1729</span> * @param b bytes to hash<a name="line.1729"></a>
-<span class="sourceLineNo">1730</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1730"></a>
-<span class="sourceLineNo">1731</span> * Maps.<a name="line.1731"></a>
-<span class="sourceLineNo">1732</span> */<a name="line.1732"></a>
-<span class="sourceLineNo">1733</span> public static Integer mapKey(final byte [] b) {<a name="line.1733"></a>
-<span class="sourceLineNo">1734</span> return hashCode(b);<a name="line.1734"></a>
-<span class="sourceLineNo">1735</span> }<a name="line.1735"></a>
-<span class="sourceLineNo">1736</span><a name="line.1736"></a>
-<span class="sourceLineNo">1737</span> /**<a name="line.1737"></a>
-<span class="sourceLineNo">1738</span> * @param b bytes to hash<a name="line.1738"></a>
-<span class="sourceLineNo">1739</span> * @param length length to hash<a name="line.1739"></a>
-<span class="sourceLineNo">1740</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1740"></a>
-<span class="sourceLineNo">1741</span> * Maps.<a name="line.1741"></a>
-<span class="sourceLineNo">1742</span> */<a name="line.1742"></a>
-<span class="sourceLineNo">1743</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1743"></a>
-<span class="sourceLineNo">1744</span> return hashCode(b, length);<a name="line.1744"></a>
-<span class="sourceLineNo">1745</span> }<a name="line.1745"></a>
-<span class="sourceLineNo">1746</span><a name="line.1746"></a>
-<span class="sourceLineNo">1747</span> /**<a name="line.1747"></a>
-<span class="sourceLineNo">1748</span> * @param a lower half<a name="line.1748"></a>
-<span class="sourceLineNo">1749</span> * @param b upper half<a name="line.1749"></a>
-<span class="sourceLineNo">1750</span> * @return New array that has a in lower half and b in upper half.<a name="line.1750"></a>
-<span class="sourceLineNo">1751</span> */<a name="line.1751"></a>
-<span class="sourceLineNo">1752</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1752"></a>
-<span class="sourceLineNo">1753</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1753"></a>
-<span class="sourceLineNo">1754</span> }<a name="line.1754"></a>
-<span class="sourceLineNo">1755</span><a name="line.1755"></a>
-<span class="sourceLineNo">1756</span> /**<a name="line.1756"></a>
-<span class="sourceLineNo">1757</span> * @param a first third<a name="line.1757"></a>
-<span class="sourceLineNo">1758</span> * @param b second third<a name="line.1758"></a>
-<span class="sourceLineNo">1759</span> * @param c third third<a name="line.1759"></a>
-<span class="sourceLineNo">1760</span> * @return New array made from a, b and c<a name="line.1760"></a>
-<span class="sourceLineNo">1761</span> */<a name="line.1761"></a>
-<span class="sourceLineNo">1762</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1762"></a>
-<span class="sourceLineNo">1763</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1763"></a>
-<span class="sourceLineNo">1764</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1764"></a>
-<span class="sourceLineNo">1765</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1765"></a>
-<span class="sourceLineNo">1766</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1766"></a>
-<span class="sourceLineNo">1767</span> return result;<a name="line.1767"></a>
-<span class="sourceLineNo">1768</span> }<a name="line.1768"></a>
-<span class="sourceLineNo">1769</span><a name="line.1769"></a>
-<span class="sourceLineNo">1770</span> /**<a name="line.1770"></a>
-<span class="sourceLineNo">1771</span> * @param arrays all the arrays to concatenate together.<a name="line.1771"></a>
-<span class="sourceLineNo">1772</span> * @return New array made from the concatenation of the given arrays.<a name="line.1772"></a>
-<span class="sourceLineNo">1773</span> */<a name="line.1773"></a>
-<span class="sourceLineNo">1774</span> public static byte [] add(final byte [][] arrays) {<a name="line.1774"></a>
-<span class="sourceLineNo">1775</span> int length = 0;<a name="line.1775"></a>
+<span class="sourceLineNo">1670</span> /**<a name="line.1670"></a>
+<span class="sourceLineNo">1671</span> * @param a left operand<a name="line.1671"></a>
+<span class="sourceLineNo">1672</span> * @param buf right operand<a name="line.1672"></a>
+<span class="sourceLineNo">1673</span> * @return True if equal<a name="line.1673"></a>
+<span class="sourceLineNo">1674</span> */<a name="line.1674"></a>
+<span class="sourceLineNo">1675</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1675"></a>
+<span class="sourceLineNo">1676</span> if (a == null) return buf == null;<a name="line.1676"></a>
+<span class="sourceLineNo">1677</span> if (buf == null) return false;<a name="line.1677"></a>
+<span class="sourceLineNo">1678</span> if (a.length != buf.remaining()) return false;<a name="line.1678"></a>
+<span class="sourceLineNo">1679</span><a name="line.1679"></a>
+<span class="sourceLineNo">1680</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1680"></a>
+<span class="sourceLineNo">1681</span> ByteBuffer b = buf.duplicate();<a name="line.1681"></a>
+<span class="sourceLineNo">1682</span> for (byte anA : a) {<a name="line.1682"></a>
+<span class="sourceLineNo">1683</span> if (anA != b.get()) {<a name="line.1683"></a>
+<span class="sourceLineNo">1684</span> return false;<a name="line.1684"></a>
+<span class="sourceLineNo">1685</span> }<a name="line.1685"></a>
+<span class="sourceLineNo">1686</span> }<a name="line.1686"></a>
+<span class="sourceLineNo">1687</span> return true;<a name="line.1687"></a>
+<span class="sourceLineNo">1688</span> }<a name="line.1688"></a>
+<span class="sourceLineNo">1689</span><a name="line.1689"></a>
+<span class="sourceLineNo">1690</span><a name="line.1690"></a>
+<span class="sourceLineNo">1691</span> /**<a name="line.1691"></a>
+<span class="sourceLineNo">1692</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1692"></a>
+<span class="sourceLineNo">1693</span> * array on the left.<a name="line.1693"></a>
+<span class="sourceLineNo">1694</span> */<a name="line.1694"></a>
+<span class="sourceLineNo">1695</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1695"></a>
+<span class="sourceLineNo">1696</span> return bytes != null && prefix != null &&<a name="line.1696"></a>
+<span class="sourceLineNo">1697</span> bytes.length >= prefix.length &&<a name="line.1697"></a>
+<span class="sourceLineNo">1698</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1698"></a>
+<span class="sourceLineNo">1699</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1699"></a>
+<span class="sourceLineNo">1700</span> }<a name="line.1700"></a>
+<span class="sourceLineNo">1701</span><a name="line.1701"></a>
+<span class="sourceLineNo">1702</span> /**<a name="line.1702"></a>
+<span class="sourceLineNo">1703</span> * @param b bytes to hash<a name="line.1703"></a>
+<span class="sourceLineNo">1704</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1704"></a>
+<span class="sourceLineNo">1705</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1705"></a>
+<span class="sourceLineNo">1706</span> * use calculating hash code.<a name="line.1706"></a>
+<span class="sourceLineNo">1707</span> */<a name="line.1707"></a>
+<span class="sourceLineNo">1708</span> public static int hashCode(final byte [] b) {<a name="line.1708"></a>
+<span class="sourceLineNo">1709</span> return hashCode(b, b.length);<a name="line.1709"></a>
+<span class="sourceLineNo">1710</span> }<a name="line.1710"></a>
+<span class="sourceLineNo">1711</span><a name="line.1711"></a>
+<span class="sourceLineNo">1712</span> /**<a name="line.1712"></a>
+<span class="sourceLineNo">1713</span> * @param b value<a name="line.1713"></a>
+<span class="sourceLineNo">1714</span> * @param length length of the value<a name="line.1714"></a>
+<span class="sourceLineNo">1715</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1715"></a>
+<span class="sourceLineNo">1716</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1716"></a>
+<span class="sourceLineNo">1717</span> * use calculating hash code.<a name="line.1717"></a>
+<span class="sourceLineNo">1718</span> */<a name="line.1718"></a>
+<span class="sourceLineNo">1719</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1719"></a>
+<span class="sourceLineNo">1720</span> return WritableComparator.hashBytes(b, length);<a name="line.1720"></a>
+<span class="sourceLineNo">1721</span> }<a name="line.1721"></a>
+<span class="sourceLineNo">1722</span><a name="line.1722"></a>
+<span class="sourceLineNo">1723</span> /**<a name="line.1723"></a>
+<span class="sourceLineNo">1724</span> * @param b bytes to hash<a name="line.1724"></a>
+<span class="sourceLineNo">1725</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1725"></a>
+<span class="sourceLineNo">1726</span> * Maps.<a name="line.1726"></a>
+<span class="sourceLineNo">1727</span> */<a name="line.1727"></a>
+<span class="sourceLineNo">1728</span> public static Integer mapKey(final byte [] b) {<a name="line.1728"></a>
+<span class="sourceLineNo">1729</span> return hashCode(b);<a name="line.1729"></a>
+<span class="sourceLineNo">1730</span> }<a name="line.1730"></a>
+<span class="sourceLineNo">1731</span><a name="line.1731"></a>
+<span class="sourceLineNo">1732</span> /**<a name="line.1732"></a>
+<span class="sourceLineNo">1733</span> * @param b bytes to hash<a name="line.1733"></a>
+<span class="sourceLineNo">1734</span> * @param length length to hash<a name="line.1734"></a>
+<span class="sourceLineNo">1735</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1735"></a>
+<span class="sourceLineNo">1736</span> * Maps.<a name="line.1736"></a>
+<span class="sourceLineNo">1737</span> */<a name="line.1737"></a>
+<span class="sourceLineNo">1738</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1738"></a>
+<span class="sourceLineNo">1739</span> return hashCode(b, length);<a name="line.1739"></a>
+<span class="sourceLineNo">1740</span> }<a name="line.1740"></a>
+<span class="sourceLineNo">1741</span><a name="line.1741"></a>
+<span class="sourceLineNo">1742</span> /**<a name="line.1742"></a>
+<span class="sourceLineNo">1743</span> * @param a lower half<a name="line.1743"></a>
+<span class="sourceLineNo">1744</span> * @param b upper half<a name="line.1744"></a>
+<span class="sourceLineNo">1745</span> * @return New array that has a in lower half and b in upper half.<a name="line.1745"></a>
+<span class="sourceLineNo">1746</span> */<a name="line.1746"></a>
+<span class="sourceLineNo">1747</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1747"></a>
+<span class="sourceLineNo">1748</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1748"></a>
+<span class="sourceLineNo">1749</span> }<a name="line.1749"></a>
+<span class="sourceLineNo">1750</span><a name="line.1750"></a>
+<span class="sourceLineNo">1751</span> /**<a name="line.1751"></a>
+<span class="sourceLineNo">1752</span> * @param a first third<a name="line.1752"></a>
+<span class="sourceLineNo">1753</span> * @param b second third<a name="line.1753"></a>
+<span class="sourceLineNo">1754</span> * @param c third third<a name="line.1754"></a>
+<span class="sourceLineNo">1755</span> * @return New array made from a, b and c<a name="line.1755"></a>
+<span class="sourceLineNo">1756</span> */<a name="line.1756"></a>
+<span class="sourceLineNo">1757</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1757"></a>
+<span class="sourceLineNo">1758</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1758"></a>
+<span class="sourceLineNo">1759</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1759"></a>
+<span class="sourceLineNo">1760</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1760"></a>
+<span class="sourceLineNo">1761</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1761"></a>
+<span class="sourceLineNo">1762</span> return result;<a name="line.1762"></a>
+<span class="sourceLineNo">1763</span> }<a name="line.1763"></a>
+<span class="sourceLineNo">1764</span><a name="line.1764"></a>
+<span class="sourceLineNo">1765</span> /**<a name="line.1765"></a>
+<span class="sourceLineNo">1766</span> * @param arrays all the arrays to concatenate together.<a name="line.1766"></a>
+<span class="sourceLineNo">1767</span> * @return New array made from the concatenation of the given arrays.<a name="line.1767"></a>
+<span class="sourceLineNo">1768</span> */<a name="line.1768"></a>
+<span class="sourceLineNo">1769</span> public static byte [] add(final byte [][] arrays) {<a name="line.1769"></a>
+<span class="sourceLineNo">1770</span> int length = 0;<a name="line.1770"></a>
+<span class="sourceLineNo">1771</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1771"></a>
+<span class="sourceLineNo">1772</span> length += arrays[i].length;<a name="line.1772"></a>
+<span class="sourceLineNo">1773</span> }<a name="line.1773"></a>
+<span class="sourceLineNo">1774</span> byte [] result = new byte[length];<a name="line.1774"></a>
+<span class="sourceLineNo">1775</span> int index = 0;<a name="line.1775"></a>
<span class="sourceLineNo">1776</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1776"></a>
-<span class="sourceLineNo">1777</span> length += arrays[i].length;<a name="line.1777"></a>
-<span class="sourceLineNo">1778</span> }<a name="line.1778"></a>
-<span class="sourceLineNo">1779</span> byte [] result = new byte[length];<a name="line.1779"></a>
-<span class="sourceLineNo">1780</span> int index = 0;<a name="line.1780"></a>
-<span class="sourceLineNo">1781</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1781"></a>
-<span class="sourceLineNo">1782</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1782"></a>
-<span class="sourceLineNo">1783</span> index += arrays[i].length;<a name="line.1783"></a>
-<span class="sourceLineNo">1784</span> }<a name="line.1784"></a>
-<span class="sourceLineNo">1785</span> return result;<a name="line.1785"></a>
-<span class="sourceLineNo">1786</span> }<a name="line.1786"></a>
-<span class="sourceLineNo">1787</span><a name="line.1787"></a>
-<span class="sourceLineNo">1788</span> /**<a name="line.1788"></a>
-<span class="sourceLineNo">1789</span> * @param a array<a name="line.1789"></a>
-<span class="sourceLineNo">1790</span> * @param length amount of bytes to grab<a name="line.1790"></a>
-<span class="sourceLineNo">1791</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1791"></a>
-<span class="sourceLineNo">1792</span> */<a name="line.1792"></a>
-<span class="sourceLineNo">1793</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1793"></a>
-<span class="sourceLineNo">1794</span> if (a.length < length) {<a name="line.1794"></a>
-<span class="sourceLineNo">1795</span> return null;<a name="line.1795"></a>
-<span class="sourceLineNo">1796</span> }<a name="line.1796"></a>
-<span class="sourceLineNo">1797</span> byte [] result = new byte[length];<a name="line.1797"></a>
-<span class="sourceLineNo">1798</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1798"></a>
-<span class="sourceLineNo">1799</span> return result;<a name="line.1799"></a>
-<span class="sourceLineNo">1800</span> }<a name="line.1800"></a>
-<span class="sourceLineNo">1801</span><a name="line.1801"></a>
-<span class="sourceLineNo">1802</span> /**<a name="line.1802"></a>
-<span class="sourceLineNo">1803</span> * @param a array<a name="line.1803"></a>
-<span class="sourceLineNo">1804</span> * @param length amount of bytes to snarf<a name="line.1804"></a>
-<span class="sourceLineNo">1805</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1805"></a>
-<span class="sourceLineNo">1806</span> */<a name="line.1806"></a>
-<span class="sourceLineNo">1807</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1807"></a>
-<span class="sourceLineNo">1808</span> if (a.length < length) {<a name="line.1808"></a>
-<span class="sourceLineNo">1809</span> return null;<a name="line.1809"></a>
-<span class="sourceLineNo">1810</span> }<a name="line.1810"></a>
-<span class="sourceLineNo">1811</span> byte [] result = new byte[length];<a name="line.1811"></a>
-<span class="sourceLineNo">1812</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1812"></a>
-<span class="sourceLineNo">1813</span> return result;<a name="line.1813"></a>
-<span class="sourceLineNo">1814</span> }<a name="line.1814"></a>
-<span class="sourceLineNo">1815</span><a name="line.1815"></a>
-<span class="sourceLineNo">1816</span> /**<a name="line.1816"></a>
-<span class="sourceLineNo">1817</span> * @param a array<a name="line.1817"></a>
-<span class="sourceLineNo">1818</span> * @param length new array size<a name="line.1818"></a>
-<span class="sourceLineNo">1819</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1819"></a>
-<span class="sourceLineNo">1820</span> */<a name="line.1820"></a>
-<span class="sourceLineNo">1821</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1821"></a>
-<span class="sourceLineNo">1822</span> byte [] padding = new byte[length];<a name="line.1822"></a>
-<span class="sourceLineNo">1823</span> for (int i = 0; i < length; i++) {<a name="line.1823"></a>
-<span class="sourceLineNo">1824</span> padding[i] = 0;<a name="line.1824"></a>
-<span class="sourceLineNo">1825</span> }<a name="line.1825"></a>
-<span class="sourceLineNo">1826</span> return add(padding,a);<a name="line.1826"></a>
-<span class="sourceLineNo">1827</span> }<a name="line.1827"></a>
-<span class="sourceLineNo">1828</span><a name="line.1828"></a>
-<span class="sourceLineNo">1829</span> /**<a name="line.1829"></a>
-<span class="sourceLineNo">1830</span> * @param a array<a name="line.1830"></a>
-<span class="sourceLineNo">1831</span> * @param length new array size<a name="line.1831"></a>
-<span class="sourceLineNo">1832</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1832"></a>
-<span class="sourceLineNo">1833</span> */<a name="line.1833"></a>
-<span class="sourceLineNo">1834</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1834"></a>
-<span class="sourceLineNo">1835</span> byte [] padding = new byte[length];<a name="line.1835"></a>
-<span class="sourceLineNo">1836</span> for (int i = 0; i < length; i++) {<a name="line.1836"></a>
-<span class="sourceLineNo">1837</span> padding[i] = 0;<a name="line.1837"></a>
-<span class="sourceLineNo">1838</span> }<a name="line.1838"></a>
-<span class="sourceLineNo">1839</span> return add(a,padding);<a name="line.1839"></a>
-<span class="sourceLineNo">1840</span> }<a name="line.1840"></a>
-<span class="sourceLineNo">1841</span><a name="line.1841"></a>
-<span class="sourceLineNo">1842</span> /**<a name="line.1842"></a>
-<span class="sourceLineNo">1843</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1843"></a>
-<span class="sourceLineNo">1844</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1844"></a>
-<span class="sourceLineNo">1845</span> * @param a Beginning of range<a name="line.1845"></a>
-<span class="sourceLineNo">1846</span> * @param b End of range<a name="line.1846"></a>
-<span class="sourceLineNo">1847</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1847"></a>
-<span class="sourceLineNo">1848</span> * the range in two; i.e. one split.<a name="line.1848"></a>
-<span class="sourceLineNo">1849</span> * @return Array of dividing values<a name="line.1849"></a>
-<span class="sourceLineNo">1850</span> */<a name="line.1850"></a>
-<span class="sourceLineNo">1851</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1851"></a>
-<span class="sourceLineNo">1852</span> return split(a, b, false, num);<a name="line.1852"></a>
-<span class="sourceLineNo">1853</span> }<a name="line.1853"></a>
-<span class="sourceLineNo">1854</span><a name="line.1854"></a>
-<span class="sourceLineNo">1855</span> /**<a name="line.1855"></a>
-<span class="sourceLineNo">1856</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1856"></a>
-<span class="sourceLineNo">1857</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1857"></a>
-<span class="sourceLineNo">1858</span> * @param a Beginning of range<a name="line.1858"></a>
-<span class="sourceLineNo">1859</span> * @param b End of range<a name="line.1859"></a>
-<span class="sourceLineNo">1860</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1860"></a>
-<span class="sourceLineNo">1861</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1861"></a>
-<span class="sourceLineNo">1862</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1862"></a>
-<span class="sourceLineNo">1863</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1863"></a>
-<span class="sourceLineNo">1864</span> * the range in two; i.e. one split.<a name="line.1864"></a>
-<span class="sourceLineNo">1865</span> * @return Array of dividing values<a name="line.1865"></a>
-<span class="sourceLineNo">1866</span> */<a name="line.1866"></a>
-<span class="sourceLineNo">1867</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1867"></a>
-<span class="sourceLineNo">1868</span> boolean inclusive, final int num) {<a name="line.1868"></a>
-<span class="sourceLineNo">1869</span> byte[][] ret = new byte[num + 2][];<a name="line.1869"></a>
-<span class="sourceLineNo">1870</span> int i = 0;<a name="line.1870"></a>
-<span class="sourceLineNo">1871</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1871"></a>
-<span class="sourceLineNo">1872</span> if (iter == null)<a name="line.1872"></a>
-<span class="sourceLineNo">1873</span> return null;<a name="line.1873"></a>
-<span class="sourceLineNo">1874</span> for (byte[] elem : iter) {<a name="line.1874"></a>
-<span class="sourceLineNo">1875</span> ret[i++] = elem;<a name="line.1875"></a>
-<span class="sourceLineNo">1876</span> }<a name="line.1876"></a>
-<span class="sourceLineNo">1877</span> return ret;<a name="line.1877"></a>
-<span class="sourceLineNo">1878</span> }<a name="line.1878"></a>
-<span class="sourceLineNo">1879</span><a name="line.1879"></a>
-<span class="sourceLineNo">1880</span> /**<a name="line.1880"></a>
-<span class="sourceLineNo">1881</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1881"></a>
-<span class="sourceLineNo">1882</span> */<a name="line.1882"></a>
-<span class="sourceLineNo">1883</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1883"></a>
-<span class="sourceLineNo">1884</span> final byte[] b, final int num)<a name="line.1884"></a>
-<span class="sourceLineNo">1885</span> {<a name="line.1885"></a>
-<span class="sourceLineNo">1886</span> return iterateOnSplits(a, b, false, num);<a name="line.1886"></a>
-<span class="sourceLineNo">1887</span> }<a name="line.1887"></a>
-<span class="sourceLineNo">1888</span><a name="line.1888"></a>
-<span class="sourceLineNo">1889</span> /**<a name="line.1889"></a>
-<span class="sourceLineNo">1890</span> * Iterate over keys within the passed range.<a name="line.1890"></a>
-<span class="sourceLineNo">1891</span> */<a name="line.1891"></a>
-<span class="sourceLineNo">1892</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1892"></a>
-<span class="sourceLineNo">1893</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1893"></a>
-<span class="sourceLineNo">1894</span> {<a name="line.1894"></a>
-<span class="sourceLineNo">1895</span> byte [] aPadded;<a name="line.1895"></a>
-<span class="sourceLineNo">1896</span> byte [] bPadded;<a name="line.1896"></a>
-<span class="sourceLineNo">1897</span> if (a.length < b.length) {<a name="line.1897"></a>
-<span class="sourceLineNo">1898</span> aPadded = padTail(a, b.length - a.length);<a name="line.1898"></a>
-<span class="sourceLineNo">1899</span> bPadded = b;<a name="line.1899"></a>
-<span class="sourceLineNo">1900</span> } else if (b.length < a.length) {<a name="line.1900"></a>
-<span class="sourceLineNo">1901</span> aPadded = a;<a name="line.1901"></a>
-<span class="sourceLineNo">1902</span> bPadded = padTail(b, a.length - b.length);<a name="line.1902"></a>
-<span class="sourceLineNo">1903</span> } else {<a name="line.1903"></a>
-<span class="sourceLineNo">1904</span> aPadded = a;<a name="line.1904"></a>
-<span class="sourceLineNo">1905</span> bPadded = b;<a name="line.1905"></a>
-<span class="sourceLineNo">1906</span> }<a name="line.1906"></a>
-<span class="sourceLineNo">1907</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1907"></a>
-<span class="sourceLineNo">1908</span> throw new IllegalArgumentException("b <= a");<a name="line.1908"></a>
-<span class="sourceLineNo">1909</span> }<a name="line.1909"></a>
-<span class="sourceLineNo">1910</span> if (num <= 0) {<a name="line.1910"></a>
-<span class="sourceLineNo">1911</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1911"></a>
-<span class="sourceLineNo">1912</span> }<a name="line.1912"></a>
-<span class="sourceLineNo">1913</span> byte [] prependHeader = {1, 0};<a name="line.1913"></a>
-<span class="sourceLineNo">1914</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1914"></a>
-<span class="sourceLineNo">1915</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1915"></a>
-<span class="sourceLineNo">1916</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1916"></a>
-<span class="sourceLineNo">1917</span> if (inclusive) {<a name="line.1917"></a>
-<span class="sourceLineNo">1918</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1918"></a>
-<span class="sourceLineNo">1919</span> }<a name="line.1919"></a>
-<span class="sourceLineNo">1920</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1920"></a>
-<span class="sourceLineNo">1921</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1921"></a>
-<span class="sourceLineNo">1922</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1922"></a>
-<span class="sourceLineNo">1923</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1923"></a>
-<span class="sourceLineNo">1924</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1924"></a>
-<span class="sourceLineNo">1925</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1925"></a>
-<span class="sourceLineNo">1926</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1926"></a>
-<span class="sourceLineNo">1927</span> }<a name="line.1927"></a>
-<span class="sourceLineNo">1928</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1928"></a>
-<span class="sourceLineNo">1929</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1929"></a>
-<span class="sourceLineNo">1930</span> }<a name="line.1930"></a>
-<span class="sourceLineNo">1931</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1931"></a>
-<span class="sourceLineNo">1932</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1932"></a>
-<span class="sourceLineNo">1933</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1933"></a>
-<span class="sourceLineNo">1934</span> }<a name="line.1934"></a>
-<span class="sourceLineNo">1935</span> final BigInteger intervalBI;<a name="line.1935"></a>
-<span class="sourceLineNo">1936</span> try {<a name="line.1936"></a>
-<span class="sourceLineNo">1937</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1937"></a>
-<span class="sourceLineNo">1938</span> } catch(Exception e) {<a name="line.1938"></a>
-<span class="sourceLineNo">1939</span> LOG.error("Exception caught during division", e);<a name="line.1939"></a>
-<span class="sourceLineNo">1940</span> return null;<a name="line.1940"></a>
-<span class="sourceLineNo">1941</span> }<a name="line.1941"></a>
-<span class="sourceLineNo">1942</span><a name="line.1942"></a>
-<span class="sourceLineNo">1943</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1943"></a>
-<span class="sourceLineNo">1944</span> private int i = -1;<a name="line.1944"></a>
+<span class="sourceLineNo">1777</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1777"></a>
+<span class="sourceLineNo">1778</span> index += arrays[i].length;<a name="line.1778"></a>
+<span class="sourceLineNo">1779</span> }<a name="line.1779"></a>
+<span class="sourceLineNo">1780</span> return result;<a name="line.1780"></a>
+<span class="sourceLineNo">1781</span> }<a name="line.1781"></a>
+<span class="sourceLineNo">1782</span><a name="line.1782"></a>
+<span class="sourceLineNo">1783</span> /**<a name="line.1783"></a>
+<span class="sourceLineNo">1784</span> * @param a array<a name="line.1784"></a>
+<span class="sourceLineNo">1785</span> * @param length amount of bytes to grab<a name="line.1785"></a>
+<span class="sourceLineNo">1786</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1786"></a>
+<span class="sourceLineNo">1787</span> */<a name="line.1787"></a>
+<span class="sourceLineNo">1788</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1788"></a>
+<span class="sourceLineNo">1789</span> if (a.length < length) {<a name="line.1789"></a>
+<span class="sourceLineNo">1790</span> return null;<a name="line.1790"></a>
+<span class="sourceLineNo">1791</span> }<a name="line.1791"></a>
+<span class="sourceLineNo">1792</span> byte [] result = new byte[length];<a name="line.1792"></a>
+<span class="sourceLineNo">1793</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1793"></a>
+<span class="sourceLineNo">1794</span> return result;<a name="line.1794"></a>
+<span class="sourceLineNo">1795</span> }<a name="line.1795"></a>
+<span class="sourceLineNo">1796</span><a name="line.1796"></a>
+<span class="sourceLineNo">1797</span> /**<a name="line.1797"></a>
+<span class="sourceLineNo">1798</span> * @param a array<a name="line.1798"></a>
+<span class="sourceLineNo">1799</span> * @param length amount of bytes to snarf<a name="line.1799"></a>
+<span class="sourceLineNo">1800</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1800"></a>
+<span class="sourceLineNo">1801</span> */<a name="line.1801"></a>
+<span class="sourceLineNo">1802</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1802"></a>
+<span class="sourceLineNo">1803</span> if (a.length < length) {<a name="line.1803"></a>
+<span class="sourceLineNo">1804</span> return null;<a name="line.1804"></a>
+<span class="sourceLineNo">1805</span> }<a name="line.1805"></a>
+<span class="sourceLineNo">1806</span> byte [] result = new byte[length];<a name="line.1806"></a>
+<span class="sourceLineNo">1807</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1807"></a>
+<span class="sourceLineNo">1808</span> return result;<a name="line.1808"></a>
+<span class="sourceLineNo">1809</span> }<a name="line.1809"></a>
+<span class="sourceLineNo">1810</span><a name="line.1810"></a>
+<span class="sourceLineNo">1811</span> /**<a name="line.1811"></a>
+<span class="sourceLineNo">1812</span> * @param a array<a name="line.1812"></a>
+<span class="sourceLineNo">1813</span> * @param length new array size<a name="line.1813"></a>
+<span class="sourceLineNo">1814</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1814"></a>
+<span class="sourceLineNo">1815</span> */<a name="line.1815"></a>
+<span class="sourceLineNo">1816</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1816"></a>
+<span class="sourceLineNo">1817</span> byte [] padding = new byte[length];<a name="line.1817"></a>
+<span class="sourceLineNo">1818</span> for (int i = 0; i < length; i++) {<a name="line.1818"></a>
+<span class="sourceLineNo">1819</span> padding[i] = 0;<a name="line.1819"></a>
+<span class="sourceLineNo">1820</span> }<a name="line.1820"></a>
+<span class="sourceLineNo">1821</span> return add(padding,a);<a name="line.1821"></a>
+<span class="sourceLineNo">1822</span> }<a name="line.1822"></a>
+<span class="sourceLineNo">1823</span><a name="line.1823"></a>
+<span class="sourceLineNo">1824</span> /**<a name="line.1824"></a>
+<span class="sourceLineNo">1825</span> * @param a array<a name="line.1825"></a>
+<span class="sourceLineNo">1826</span> * @param length new array size<a name="line.1826"></a>
+<span class="sourceLineNo">1827</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1827"></a>
+<span class="sourceLineNo">1828</span> */<a name="line.1828"></a>
+<span class="sourceLineNo">1829</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1829"></a>
+<span class="sourceLineNo">1830</span> byte [] padding = new byte[length];<a name="line.1830"></a>
+<span class="sourceLineNo">1831</span> for (int i = 0; i < length; i++) {<a name="line.1831"></a>
+<span class="sourceLineNo">1832</span> padding[i] = 0;<a name="line.1832"></a>
+<span class="sourceLineNo">1833</span> }<a name="line.1833"></a>
+<span class="sourceLineNo">1834</span> return add(a,padding);<a name="line.1834"></a>
+<span class="sourceLineNo">1835</span> }<a name="line.1835"></a>
+<span class="sourceLineNo">1836</span><a name="line.1836"></a>
+<span class="sourceLineNo">1837</span> /**<a name="line.1837"></a>
+<span class="sourceLineNo">1838</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1838"></a>
+<span class="sourceLineNo">1839</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1839"></a>
+<span class="sourceLineNo">1840</span> * @param a Beginning of range<a name="line.1840"></a>
+<span class="sourceLineNo">1841</span> * @param b End of range<a name="line.1841"></a>
+<span class="sourceLineNo">1842</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1842"></a>
+<span class="sourceLineNo">1843</span> * the range in two; i.e. one split.<a name="line.1843"></a>
+<span class="sourceLineNo">1844</span> * @return Array of dividing values<a name="line.1844"></a>
+<span class="sourceLineNo">1845</span> */<a name="line.1845"></a>
+<span class="sourceLineNo">1846</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1846"></a>
+<span class="sourceLineNo">1847</span> return split(a, b, false, num);<a name="line.1847"></a>
+<span class="sourceLineNo">1848</span> }<a name="line.1848"></a>
+<span class="sourceLineNo">1849</span><a name="line.1849"></a>
+<span class="sourceLineNo">1850</span> /**<a name="line.1850"></a>
+<span class="sourceLineNo">1851</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1851"></a>
+<span class="sourceLineNo">1852</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1852"></a>
+<span class="sourceLineNo">1853</span> * @param a Beginning of range<a name="line.1853"></a>
+<span class="sourceLineNo">1854</span> * @param b End of range<a name="line.1854"></a>
+<span class="sourceLineNo">1855</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1855"></a>
+<span class="sourceLineNo">1856</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1856"></a>
+<span class="sourceLineNo">1857</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1857"></a>
+<span class="sourceLineNo">1858</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1858"></a>
+<span class="sourceLineNo">1859</span> * the range in two; i.e. one split.<a name="line.1859"></a>
+<span class="sourceLineNo">1860</span> * @return Array of dividing values<a name="line.1860"></a>
+<span class="sourceLineNo">1861</span> */<a name="line.1861"></a>
+<span class="sourceLineNo">1862</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1862"></a>
+<span class="sourceLineNo">1863</span> boolean inclusive, final int num) {<a name="line.1863"></a>
+<span class="sourceLineNo">1864</span> byte[][] ret = new byte[num + 2][];<a name="line.1864"></a>
+<span class="sourceLineNo">1865</span> int i = 0;<a name="line.1865"></a>
+<span class="sourceLineNo">1866</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1866"></a>
+<span class="sourceLineNo">1867</span> if (iter == null)<a name="line.1867"></a>
+<span class="sourceLineNo">1868</span> return null;<a name="line.1868"></a>
+<span class="sourceLineNo">1869</span> for (byte[] elem : iter) {<a name="line.1869"></a>
+<span class="sourceLineNo">1870</span> ret[i++] = elem;<a name="line.1870"></a>
+<span class="sourceLineNo">1871</span> }<a name="line.1871"></a>
+<span class="sourceLineNo">1872</span> return ret;<a name="line.1872"></a>
+<span class="sourceLineNo">1873</span> }<a name="line.1873"></a>
+<span class="sourceLineNo">1874</span><a name="line.1874"></a>
+<span class="sourceLineNo">1875</span> /**<a name="line.1875"></a>
+<span class="sourceLineNo">1876</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1876"></a>
+<span class="sourceLineNo">1877</span> */<a name="line.1877"></a>
+<span class="sourceLineNo">1878</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1878"></a>
+<span class="sourceLineNo">1879</span> final byte[] b, final int num)<a name="line.1879"></a>
+<span class="sourceLineNo">1880</span> {<a name="line.1880"></a>
+<span class="sourceLineNo">1881</span> return iterateOnSplits(a, b, false, num);<a name="line.1881"></a>
+<span class="sourceLineNo">1882</span> }<a name="line.1882"></a>
+<span class="sourceLineNo">1883</span><a name="line.1883"></a>
+<span class="sourceLineNo">1884</span> /**<a name="line.1884"></a>
+<span class="sourceLineNo">1885</span> * Iterate over keys within the passed range.<a name="line.1885"></a>
+<span class="sourceLineNo">1886</span> */<a name="line.1886"></a>
+<span class="sourceLineNo">1887</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1887"></a>
+<span class="sourceLineNo">1888</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1888"></a>
+<span class="sourceLineNo">1889</span> {<a name="line.1889"></a>
+<span class="sourceLineNo">1890</span> byte [] aPadded;<a name="line.1890"></a>
+<span class="sourceLineNo">1891</span> byte [] bPadded;<a name="line.1891"></a>
+<span class="sourceLineNo">1892</span> if (a.length < b.length) {<a name="line.1892"></a>
+<span class="sourceLineNo">1893</span> aPadded = padTail(a, b.length - a.length);<a name="line.1893"></a>
+<span class="sourceLineNo">1894</span> bPadded = b;<a name="line.1894"></a>
+<span class="sourceLineNo">1895</span> } else if (b.length < a.length) {<a name="line.1895"></a>
+<span class="sourceLineNo">1896</span> aPadded = a;<a name="line.1896"></a>
+<span class="sourceLineNo">1897</span> bPadded = padTail(b, a.length - b.length);<a name="line.1897"></a>
+<span class="sourceLineNo">1898</span> } else {<a name="line.1898"></a>
+<span class="sourceLineNo">1899</span> aPadded = a;<a name="line.1899"></a>
+<span class="sourceLineNo">1900</span> bPadded = b;<a name="line.1900"></a>
+<span class="sourceLineNo">1901</span> }<a name="line.1901"></a>
+<span class="sourceLineNo">1902</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1902"></a>
+<span class="sourceLineNo">1903</span> throw new IllegalArgumentException("b <= a");<a name="line.1903"></a>
+<span class="sourceLineNo">1904</span> }<a name="line.1904"></a>
+<span class="sourceLineNo">1905</span> if (num <= 0) {<a name="line.1905"></a>
+<span class="sourceLineNo">1906</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1906"></a>
+<span class="sourceLineNo">1907</span> }<a name="line.1907"></a>
+<span class="sourceLineNo">1908</span> byte [] prependHeader = {1, 0};<a name="line.1908"></a>
+<span class="sourceLineNo">1909</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1909"></a>
+<span class="sourceLineNo">1910</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1910"></a>
+<span class="sourceLineNo">1911</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1911"></a>
+<span class="sourceLineNo">1912</span> if (inclusive) {<a name="line.1912"></a>
+<span class="sourceLineNo">1913</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1913"></a>
+<span class="sourceLineNo">1914</span> }<a name="line.1914"></a>
+<span class="sourceLineNo">1915</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1915"></a>
+<span class="sourceLineNo">1916</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1916"></a>
+<span class="sourceLineNo">1917</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1917"></a>
+<span class="sourceLineNo">1918</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1918"></a>
+<span class="sourceLineNo">1919</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1919"></a>
+<span class="sourceLineNo">1920</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1920"></a>
+<span class="sourceLineNo">1921</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1921"></a>
+<span class="sourceLineNo">1922</span> }<a name="line.1922"></a>
+<span class="sourceLineNo">1923</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1923"></a>
+<span class="sourceLineNo">1924</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1924"></a>
+<span class="sourceLineNo">1925</span> }<a name="line.1925"></a>
+<span class="sourceLineNo">1926</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1926"></a>
+<span class="sourceLineNo">1927</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1927"></a>
+<span class="sourceLineNo">1928</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1928"></a>
+<span class="sourceLineNo">1929</span> }<a name="line.1929"></a>
+<span class="sourceLineNo">1930</span> final BigInteger intervalBI;<a name="line.1930"></a>
+<span class="sourceLineNo">1931</span> try {<a name="line.1931"></a>
+<span class="sourceLineNo">1932</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1932"></a>
+<span class="sourceLineNo">1933</span> } catch(Exception e) {<a name="line.1933"></a>
+<span class="sourceLineNo">1934</span> LOG.error("Exception caught during division", e);<a name="line.1934"></a>
+<span class="sourceLineNo">1935</span> return null;<a name="line.1935"></a>
+<span class="sourceLineNo">1936</span> }<a name="line.1936"></a>
+<span class="sourceLineNo">1937</span><a name="line.1937"></a>
+<span class="sourceLineNo">1938</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1938"></a>
+<span class="sourceLineNo">1939</span> private int i = -1;<a name="line.1939"></a>
+<span class="sourceLineNo">1940</span><a name="line.1940"></a>
+<span class="sourceLineNo">1941</span> @Override<a name="line.1941"></a>
+<span class="sourceLineNo">1942</span> public boolean hasNext() {<a name="line.1942"></a>
+<span class="sourceLineNo">1943</span> return i < num+1;<a name="line.1943"></a>
+<span class="sourceLineNo">1944</span> }<a name="line.1944"></a>
<span class="sourceLineNo">1945</span><a name="line.1945"></a>
<span class="sourceLineNo">1946</span> @Override<a name="line.1946"></a>
-<span class="sourceLineNo">1947</span> public boolean hasNext() {<a name="line.1947"></a>
-<span class="sourceLineNo">1948</span> return i < num+1;<a name="line.1948"></a>
-<span class="sourceLineNo">1949</span> }<a name="line.1949"></a>
-<span class="sourceLineNo">1950</span><a name="line.1950"></a>
-<span class="sourceLineNo">1951</span> @Override<a name="line.1951"></a>
-<span class="sourceLineNo">1952</span> public byte[] next() {<a name="line.1952"></a>
-<span class="sourceLineNo">1953</span> i++;<a name="line.1953"></a>
-<span class="sourceLineNo">1954</span> if (i == 0) return a;<a name="line.1954"></a>
-<span class="sourceLineNo">1955</span> if (i == num + 1) return b;<a name="line.1955"></a>
-<span class="sourceLineNo">1956</span><a name="line.1956"></a>
-<span class="sourceLineNo">1957</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1957"></a>
-<span class="sourceLineNo">1958</span> byte [] padded = curBI.toByteArray();<a name="line.1958"></a>
-<span class="sourceLineNo">1959</span> if (padded[1] == 0)<a name="line.1959"></a>
-<span class="sourceLineNo">1960</span> padded = tail(padded, padded.length - 2);<a name="line.1960"></a>
-<span class="sourceLineNo">1961</span> else<a name="line.1961"></a>
-<span class="sourceLineNo">1962</span> padded = tail(padded, padded.length - 1);<a name="line.1962"></a>
-<span class="sourceLineNo">1963</span> return padded;<a name="line.1963"></a>
+<span class="sourceLineNo">1947</span> public byte[] next() {<a name="line.1947"></a>
+<span class="sourceLineNo">1948</span> i++;<a name="line.1948"></a>
+<span class="sourceLineNo">1949</span> if (i == 0) return a;<a name="line.1949"></a>
+<span class="sourceLineNo">1950</span> if (i == num + 1) return b;<a name="line.1950"></a>
+<span class="sourceLineNo">1951</span><a name="line.1951"></a>
+<span class="sourceLineNo">1952</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1952"></a>
+<span class="sourceLineNo">1953</span> byte [] padded = curBI.toByteArray();<a name="line.1953"></a>
+<span class="sourceLineNo">1954</span> if (padded[1] == 0)<a name="line.1954"></a>
+<span class="sourceLineNo">1955</span> padded = tail(padded, padded.length - 2);<a name="line.1955"></a>
+<span class="sourceLineNo">1956</span> else<a name="line.1956"></a>
+<span class="sourceLineNo">1957</span> padded = tail(padded, padded.length - 1);<a name="line.1957"></a>
+<span class="sourceLineNo">1958</span> return padded;<a name="line.1958"></a>
+<span class="sourceLineNo">1959</span> }<a name="line.1959"></a>
+<span class="sourceLineNo">1960</span><a name="line.1960"></a>
+<span class="sourceLineNo">1961</span> @Override<a name="line.1961"></a>
+<span class="sourceLineNo">1962</span> public void remove() {<a name="line.1962"></a>
+<span class="sourceLineNo">1963</span> throw new UnsupportedOperationException();<a name="line.1963"></a>
<span class="sourceLineNo">1964</span> }<a name="line.1964"></a>
<span class="sourceLineNo">1965</span><a name="line.1965"></a>
-<span class="sourceLineNo">1966</span> @Override<a name="line.1966"></a>
-<span class="sourceLineNo">1967</span> public void remove() {<a name="line.1967"></a>
-<span class="sourceLineNo">1968</span> throw new UnsupportedOperationException();<a name="line.1968"></a>
-<span class="sourceLineNo">1969</span> }<a name="line.1969"></a>
-<span class="sourceLineNo">1970</span><a name="line.1970"></a>
-<span class="sourceLineNo">1971</span> };<a name="line.1971"></a>
-<span class="sourceLineNo">1972</span><a name="line.1972"></a>
-<span class="sourceLineNo">1973</span> return new Iterable<byte[]>() {<a name="line.1973"></a>
-<span class="sourceLineNo">1974</span> @Override<a name="line.1974"></a>
-<span class="sourceLineNo">1975</span> public Iterator<byte[]> iterator() {<a name="line.1975"></a>
-<span class="sourceLineNo">1976</span> return iterator;<a name="line.1976"></a>
-<span class="sourceLineNo">1977</span> }<a name="line.1977"></a>
-<span class="sourceLineNo">1978</span> };<a name="line.1978"></a>
-<span class="sourceLineNo">1979</span> }<a name="line.1979"></a>
-<span class="sourceLineNo">1980</span><a name="line.1980"></a>
-<span class="sourceLineNo">1981</span> /**<a name="line.1981"></a>
-<span class="sourceLineNo">1982</span> * @param bytes array to hash<a name="line.1982"></a>
-<span class="sourceLineNo">1983</span> * @param offset offset to start from<a name="line.1983"></a>
-<span class="sourceLineNo">1984</span> * @param length length to hash<a name="line.1984"></a>
-<span class="sourceLineNo">1985</span> * */<a name="line.1985"></a>
-<span class="sourceLineNo">1986</span> public static int hashCode(byte[] bytes, int offset, int length) {<a name="line.1986"></a>
-<span class="sourceLineNo">1987</span> int hash = 1;<a name="line.1987"></a>
-<span class="sourceLineNo">1988</span> for (int i = offset; i < offset + length; i++)<a name="line.1988"></a>
-<span class="sourceLineNo">1989</span> hash = (31 * hash) + (int) bytes[i];<a name="line.1989"></a>
-<span class="sourceLineNo">1990</span> return hash;<a name="line.1990"></a>
-<span class="sourceLineNo">1991</span> }<a name="line.1991"></a>
-<span class="sourceLineNo">1992</span><a name="line.1992"></a>
-<span class="sourceLineNo">1993</span> /**<a name="line.1993"></a>
-<span class="sourceLineNo">1994</span> * @param t operands<a name="line.1994"></a>
-<span class="sourceLineNo">1995</span> * @return Array of byte arrays made from passed array of Text<a name="line.1995"></a>
-<span class="sourceLineNo">1996</span> */<a name="line.1996"></a>
-<span class="sourceLineNo">1997</span> public static byte [][] toByteArrays(final String [] t) {<a name="line.1997"></a>
-<span class="sourceLineNo">1998</span> byte [][] result = new byte[t.length][];<a name="line.1998"></a>
-<span class="sourceLineNo">1999</span> for (int i = 0; i < t.length; i++) {<a name="line.1999"></a>
-<span class="sourceLineNo">2000</span> result[i] = Bytes.toBytes(t[i]);<a name="line.2000"></a>
-<span class="sourceLineNo">2001</span> }<a name="line.2001"></a>
-<span class="sourceLineNo">2002</span> return result;<a name="line.2002"></a>
-<span class="sourceLineNo">2003</span> }<a name="line.2003"></a>
-<span class="sourceLineNo">2004</span><a name="line.2004"></a>
-<span class="sourceLineNo">2005</span> /**<a name="line.2005"></a>
-<span class="sourceLineNo">2006</span> * @param t operands<a name="line.2006"></a>
-<span class="sourceLineNo">2007</span> * @return Array of binary byte arrays made from passed array of binary strings<a name="line.2007"></a>
-<span class="sourceLineNo">2008</span> */<a name="line.2008"></a>
-<span class="sourceLineNo">2009</span> public static byte[][] toBinaryByteArrays(final String[] t) {<a name="line.2009"></a>
-<span class="sourceLineNo">2010</span> byte[][] result = new byte[t.length][];<a name="line.2010"></a>
-<span class="sourceLineNo">2011</span> for (int i = 0; i < t.length; i++) {<a name="line.2011"></a>
-<span class="sourceLineNo">2012</span> result[i] = Bytes.toBytesBinary(t[i]);<a name="line.2012"></a>
-<span class="sourceLineNo">2013</span> }<a name="line.2013"></a>
-<span class="sourceLineNo">2014</span> return result;<a name="line.2014"></a>
-<span class="sourceLineNo">2015</span> }<a name="line.2015"></a>
-<span class="sourceLineNo">2016</span><a name="line.2016"></a>
-<span class="sourceLineNo">2017</span> /**<a name="line.2017"></a>
-<span class="sourceLineNo">2018</span> * @param column operand<a name="line.2018"></a>
-<span class="sourceLineNo">2019</span> * @return A byte array of a byte array where first and only entry is<a name="line.2019"></a>
-<span class="sourceLineNo">2020</span> * <code>column</code><a name="line.2020"></a>
-<span class="sourceLineNo">2021</span> */<a name="line.2021"></a>
-<span class="sourceLineNo">2022</span> public static byte [][] toByteArrays(final String column) {<a name="line.2022"></a>
-<span class="sourceLineNo">2023</span> return toByteArrays(toBytes(column));<a name="line.2023"></a>
-<span class="sourceLineNo">2024</span> }<a name="line.2024"></a>
-<span class="sourceLineNo">2025</span><a name="line.2025"></a>
-<span class="sourceLineNo">2026</span> /**<a name="line.2026"></a>
-<span class="sourceLineNo">2027</span> * @param column operand<a name="line.2027"></a>
-<span class="sourceLineNo">2028</span> * @return A byte array of a byte array where first and only entry is<a name="line.2028"></a>
-<span class="sourceLineNo">2029</span> * <code>column</code><a name="line.2029"></a>
-<span class="sourceLineNo">2030</span> */<a name="line.2030"></a>
-<span class="sourceLineNo">2031</span> public static byte [][] toByteArrays(final byte [] column) {<a name="line.2031"></a>
-<span class="sourceLineNo">2032</span> byte [][] result = new byte[1][];<a name="line.2032"></a>
-<span class="sourceLineNo">2033</span> result[0] = column;<a name="line.2033"></a>
-<span class="sourceLineNo">2034</span> return result;<a name="line.2034"></a>
-<span class="sourceLineNo">2035</span> }<a name="line.2035"></a>
-<span class="sourceLineNo">2036</span><a name="line.2036"></a>
-<span class="sourceLineNo">2037</span> /**<a name="line.2037"></a>
-<span class="sourceLineNo">2038</span> * Binary search for keys in indexes.<a name="line.2038"></a>
-<span class="sourceLineNo">2039</span> *<a name="line.2039"></a>
-<span class="sourceLineNo">2040</span> * @param arr array of byte arrays to search for<a name="line.2040"></a>
-<span class="sourceLineNo">2041</span> * @param key the key you want to find<a name="line.2041"></a>
-<span class="sourceLineNo">2042</span> * @param offset the offset in the key you want to find<a name="line.2042"></a>
-<span class="sourceLineNo">2043</span> * @param length the length of the key<a name="line.2043"></a>
-<span class="sourceLineNo">2044</span> * @param comparator a comparator to compare.<a name="line.2044"></a>
-<span class="sourceLineNo">2045</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2045"></a>
-<span class="sourceLineNo">2046</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2046"></a>
-<span class="sourceLineNo">2047</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2047"></a>
-<span class="sourceLineNo">2048</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2048"></a>
-<span class="sourceLineNo">2049</span> * means that this function can return 2N + 1 different values<a name="line.2049"></a>
-<span class="sourceLineNo">2050</span> * ranging from -(N + 1) to N - 1.<a name="line.2050"></a>
-<span class="sourceLineNo">2051</span> * @deprecated {@link Bytes#binarySearch(byte[][], byte[], int, int)}<a name="line.2051"></a>
-<span class="sourceLineNo">2052</span> */<a name="line.2052"></a>
-<span class="sourceLineNo">2053</span> @Deprecated<a name="line.2053"></a>
-<span class="sourceLineNo">2054</span> public static int binarySearch(byte [][]arr, byte []key, int offset,<a name="line.2054"></a>
-<span class="sourceLineNo">2055</span> int length, RawComparator<?> comparator) {<a name="line.2055"></a>
-<span class="sourceLineNo">2056</span> return binarySearch(arr, key, offset, length);<a name="line.2056"></a>
-<span class="sourceLineNo">2057</span> }<a name="line.2057"></a>
-<span class="sourceLineNo">2058</span><a name="line.2058"></a>
-<span class="sourceLineNo">2059</span> /**<a name="line.2059"></a>
-<span class="sourceLineNo">2060</span> * Binary search for keys in indexes using Bytes.BYTES_RAWCOMPARATOR.<a name="line.2060"></a>
-<span class="sourceLineNo">2061</span> *<a name="line.2061"></a>
-<span class="sourceLineNo">2062</span> * @param arr array of byte arrays to search for<a name="line.2062"></a>
-<span class="sourceLineNo">2063</span> * @param key the key you want to find<a name="line.2063"></a>
-<span class="sourceLineNo">2064</span> * @param offset the offset in the key you want to find<a name="line.2064"></a>
-<span class="sourceLineNo">2065</span> * @param length the length of the key<a name="line.2065"></a>
-<span class="sourceLineNo">2066</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2066"></a>
-<span class="sourceLineNo">2067</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2067"></a>
-<span class="sourceLineNo">2068</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2068"></a>
-<span class="sourceLineNo">2069</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2069"></a>
-<span class="sourceLineNo">2070</span> * means that this function can return 2N + 1 different values<a name="line.2070"></a>
-<span class="sourceLineNo">2071</span> * ranging from -(N + 1) to N - 1.<a name="line.2071"></a>
-<span class="sourceLineNo">2072</span> */<a name="line.2072"></a>
-<span class="sourceLineNo">2073</span> public static int binarySearch(byte[][] arr, byte[] key, int offset, int length) {<a name="line.2073"></a>
-<span class="sourceLineNo">2074</span> int low = 0;<a name="line.2074"></a>
-<span class="sourceLineNo">2075</span> int high = arr.length - 1;<a name="line.2075"></a>
-<span class="sourceLineNo">2076</span><a name="line.2076"></a>
-<span class="sourceLineNo">2077</span> while (low <= high) {<a name="line.2077"></a>
-<span class="sourceLineNo">2078</span> int mid = (low + high) >>> 1;<a name="line.2078"></a>
-<span class="sourceLineNo">2079</span> // we have to compare in this order, because the comparator order<a name="line.2079"></a>
-<span class="sourceLineNo">2080</span> // has special logic when the 'left side' is a special key.<a name="line.2080"></a>
-<span class="sourceLineNo">2081</span> int cmp = Bytes.BYTES_RAWCOMPARATOR<a name="line.2081"></a>
-<span class="sourceLineNo">2082</span> .compare(key, offset, length, arr[mid], 0, arr[mid].length);<a name="line.2082"></a>
-<span class="sourceLineNo">2083</span> // key lives above the midpoint<a name="line.2083"></a>
-<span class="sourceLineNo">2084</span> if (cmp > 0)<a name="line.2084"></a>
-<span class="sourceLineNo">2085</span> low = mid + 1;<a name="line.2085"></a>
-<span class="sourceLineNo">2086</span> // key lives below the midpoint<a name="line.2086"></a>
-<span class="sourceLineNo">2087</span> else if (cmp < 0)<a name="line.2087"></a>
-<span class="sourceLineNo">2088</span> high = mid - 1;<a name="line.2088"></a>
-<span class="sourceLineNo">2089</span> // BAM. how often does this really happen?<a name="line.2089"></a>
-<span class="sourceLineNo">2090</span> else<a name="line.2090"></a>
-<span class="sourceLineNo">2091</span> return mid;<a name="line.2091"></a>
-<span class="sourceLineNo">2092</span> }<a name="line.2092"></a>
-<span class="sourceLineNo">2093</span> return -(low + 1);<a name="line.2093"></a>
-<span class="sourceLineNo">2094</span> }<a name="line.2094"></a>
-<span class="sourceLineNo">2095</span><a name="line.2095"></a>
-<span class="sourceLineNo">2096</span> /**<a name="line.2096"></a>
-<span class="sourceLineNo">2097</span> * Binary search for keys in indexes.<a name="line.2097"></a>
-<span class="sourceLineNo">2098</span> *<a name="line.2098"></a>
-<span class="sourceLineNo">2099</span> * @param arr array of byte arrays to search for<a name="line.2099"></a>
-<span class="sourceLineNo">2100</span> * @param key the key you want to find<a name="line.2100"></a>
-<span class="sourceLineNo">2101</span> * @param comparator a comparator to compare.<a name="line.2101"></a>
-<span class="sourceLineNo">2102</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2102"></a>
-<span class="sourceLineNo">2103</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2103"></a>
-<span class="sourceLineNo">2104</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2104"></a>
-<span class="sourceLineNo">2105</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2105"></a>
-<span class="sourceLineNo">2106</span> * means that this function can return 2N + 1 different values<a name="line.2106"></a>
-<span class="sourceLineNo">2107</span> * ranging from -(N + 1) to N - 1.<a name="line.2107"></a>
-<span class="sourceLineNo">2108</span> * @return the index of the block<a name="line.2108"></a>
-<span class="sourceLineNo">2109</span> * @deprecated Use {@link Bytes#binarySearch(Cell[], Cell, CellComparator)}<a name="line.2109"></a>
-<span class="sourceLineNo">2110</span> */<a name="line.2110"></a>
-<span class="sourceLineNo">2111</span> @Deprecated<a name="line.2111"></a>
-<span class="sourceLineNo">2112</span> public static int binarySearch(byte[][] arr, Cell key, RawComparator<Cell> comparator) {<a name="line.2112"></a>
-<span class="sourceLineNo">2113</span> int low = 0;<a name="line.2113"></a>
-<span class="sourceLineNo">2114</span> int high = arr.length - 1;<a name="line.2114"></a>
-<span class="sourceLineNo">2115</span> KeyValue.KeyOnlyKeyValue r = new KeyValue.KeyOnlyKeyValue();<a name="line.2115"></a>
-<span cl
<TRUNCATED>
[06/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.PureJavaComparer.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.PureJavaComparer.html b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.PureJavaComparer.html
index 3c7d6b4..3dea877 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.PureJavaComparer.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.LexicographicalComparerHolder.PureJavaComparer.html
@@ -1583,1089 +1583,1084 @@
<span class="sourceLineNo">1575</span> length1 == length2) {<a name="line.1575"></a>
<span class="sourceLineNo">1576</span> return 0;<a name="line.1576"></a>
<span class="sourceLineNo">1577</span> }<a name="line.1577"></a>
-<span class="sourceLineNo">1578</span> final int minLength = Math.min(length1, length2);<a name="line.1578"></a>
-<span class="sourceLineNo">1579</span> final int minWords = minLength / SIZEOF_LONG;<a name="line.1579"></a>
-<span class="sourceLineNo">1580</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1580"></a>
-<span class="sourceLineNo">1581</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
-<span class="sourceLineNo">1582</span><a name="line.1582"></a>
-<span class="sourceLineNo">1583</span> /*<a name="line.1583"></a>
-<span class="sourceLineNo">1584</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a<a name="line.1584"></a>
-<span class="sourceLineNo">1585</span> * time is no slower than comparing 4 bytes at a time even on 32-bit.<a name="line.1585"></a>
-<span class="sourceLineNo">1586</span> * On the other hand, it is substantially faster on 64-bit.<a name="line.1586"></a>
-<span class="sourceLineNo">1587</span> */<a name="line.1587"></a>
-<span class="sourceLineNo">1588</span> // This is the end offset of long parts.<a name="line.1588"></a>
-<span class="sourceLineNo">1589</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.1589"></a>
-<span class="sourceLineNo">1590</span> for (int i = 0; i < j; i += SIZEOF_LONG) {<a name="line.1590"></a>
-<span class="sourceLineNo">1591</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1591"></a>
-<span class="sourceLineNo">1592</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1592"></a>
-<span class="sourceLineNo">1593</span> long diff = lw ^ rw;<a name="line.1593"></a>
-<span class="sourceLineNo">1594</span> if (diff != 0) {<a name="line.1594"></a>
-<span class="sourceLineNo">1595</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.1595"></a>
-<span class="sourceLineNo">1596</span> }<a name="line.1596"></a>
-<span class="sourceLineNo">1597</span> }<a name="line.1597"></a>
-<span class="sourceLineNo">1598</span> int offset = j;<a name="line.1598"></a>
-<span class="sourceLineNo">1599</span><a name="line.1599"></a>
-<span class="sourceLineNo">1600</span> if (minLength - offset >= SIZEOF_INT) {<a name="line.1600"></a>
-<span class="sourceLineNo">1601</span> int il = theUnsafe.getInt(buffer1, offset1Adj + offset);<a name="line.1601"></a>
-<span class="sourceLineNo">1602</span> int ir = theUnsafe.getInt(buffer2, offset2Adj + offset);<a name="line.1602"></a>
-<span class="sourceLineNo">1603</span> if (il != ir) {<a name="line.1603"></a>
-<span class="sourceLineNo">1604</span> return lessThanUnsignedInt(il, ir) ? -1: 1;<a name="line.1604"></a>
-<span class="sourceLineNo">1605</span> }<a name="line.1605"></a>
-<span class="sourceLineNo">1606</span> offset += SIZEOF_INT;<a name="line.1606"></a>
-<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
-<span class="sourceLineNo">1608</span> if (minLength - offset >= SIZEOF_SHORT) {<a name="line.1608"></a>
-<span class="sourceLineNo">1609</span> short sl = theUnsafe.getShort(buffer1, offset1Adj + offset);<a name="line.1609"></a>
-<span class="sourceLineNo">1610</span> short sr = theUnsafe.getShort(buffer2, offset2Adj + offset);<a name="line.1610"></a>
-<span class="sourceLineNo">1611</span> if (sl != sr) {<a name="line.1611"></a>
-<span class="sourceLineNo">1612</span> return lessThanUnsignedShort(sl, sr) ? -1: 1;<a name="line.1612"></a>
-<span class="sourceLineNo">1613</span> }<a name="line.1613"></a>
-<span class="sourceLineNo">1614</span> offset += SIZEOF_SHORT;<a name="line.1614"></a>
-<span class="sourceLineNo">1615</span> }<a name="line.1615"></a>
-<span class="sourceLineNo">1616</span> if (minLength - offset == 1) {<a name="line.1616"></a>
-<span class="sourceLineNo">1617</span> int a = (buffer1[(int)(offset1 + offset)] & 0xff);<a name="line.1617"></a>
-<span class="sourceLineNo">1618</span> int b = (buffer2[(int)(offset2 + offset)] & 0xff);<a name="line.1618"></a>
-<span class="sourceLineNo">1619</span> if (a != b) {<a name="line.1619"></a>
-<span class="sourceLineNo">1620</span> return a - b;<a name="line.1620"></a>
-<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
-<span class="sourceLineNo">1622</span> }<a name="line.1622"></a>
-<span class="sourceLineNo">1623</span> return length1 - length2;<a name="line.1623"></a>
-<span class="sourceLineNo">1624</span> }<a name="line.1624"></a>
-<span class="sourceLineNo">1625</span> }<a name="line.1625"></a>
-<span class="sourceLineNo">1626</span> }<a name="line.1626"></a>
-<span class="sourceLineNo">1627</span><a name="line.1627"></a>
-<span class="sourceLineNo">1628</span> /**<a name="line.1628"></a>
-<span class="sourceLineNo">1629</span> * @param left left operand<a name="line.1629"></a>
-<span class="sourceLineNo">1630</span> * @param right right operand<a name="line.1630"></a>
-<span class="sourceLineNo">1631</span> * @return True if equal<a name="line.1631"></a>
-<span class="sourceLineNo">1632</span> */<a name="line.1632"></a>
-<span class="sourceLineNo">1633</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1633"></a>
-<span class="sourceLineNo">1634</span> // Could use Arrays.equals?<a name="line.1634"></a>
-<span class="sourceLineNo">1635</span> //noinspection SimplifiableConditionalExpression<a name="line.1635"></a>
-<span class="sourceLineNo">1636</span> if (left == right) return true;<a name="line.1636"></a>
-<span class="sourceLineNo">1637</span> if (left == null || right == null) return false;<a name="line.1637"></a>
-<span class="sourceLineNo">1638</span> if (left.length != right.length) return false;<a name="line.1638"></a>
-<span class="sourceLineNo">1639</span> if (left.length == 0) return true;<a name="line.1639"></a>
+<span class="sourceLineNo">1578</span> final int stride = 8;<a name="line.1578"></a>
+<span class="sourceLineNo">1579</span> final int minLength = Math.min(length1, length2);<a name="line.1579"></a>
+<span class="sourceLineNo">1580</span> int strideLimit = minLength & ~(stride - 1);<a name="line.1580"></a>
+<span class="sourceLineNo">1581</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
+<span class="sourceLineNo">1582</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1582"></a>
+<span class="sourceLineNo">1583</span> int i;<a name="line.1583"></a>
+<span class="sourceLineNo">1584</span><a name="line.1584"></a>
+<span class="sourceLineNo">1585</span> /*<a name="line.1585"></a>
+<span class="sourceLineNo">1586</span> * Compare 8 bytes at a time. Benchmarking on x86 shows a stride of 8 bytes is no slower<a name="line.1586"></a>
+<span class="sourceLineNo">1587</span> * than 4 bytes even on 32-bit. On the other hand, it is substantially faster on 64-bit.<a name="line.1587"></a>
+<span class="sourceLineNo">1588</span> */<a name="line.1588"></a>
+<span class="sourceLineNo">1589</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.1589"></a>
+<span class="sourceLineNo">1590</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1590"></a>
+<span class="sourceLineNo">1591</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1591"></a>
+<span class="sourceLineNo">1592</span> if (lw != rw) {<a name="line.1592"></a>
+<span class="sourceLineNo">1593</span> if(!UnsafeAccess.littleEndian) {<a name="line.1593"></a>
+<span class="sourceLineNo">1594</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.1594"></a>
+<span class="sourceLineNo">1595</span> }<a name="line.1595"></a>
+<span class="sourceLineNo">1596</span><a name="line.1596"></a>
+<span class="sourceLineNo">1597</span> /*<a name="line.1597"></a>
+<span class="sourceLineNo">1598</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.1598"></a>
+<span class="sourceLineNo">1599</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.1599"></a>
+<span class="sourceLineNo">1600</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.1600"></a>
+<span class="sourceLineNo">1601</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.1601"></a>
+<span class="sourceLineNo">1602</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.1602"></a>
+<span class="sourceLineNo">1603</span> * comparator from guava v21<a name="line.1603"></a>
+<span class="sourceLineNo">1604</span> */<a name="line.1604"></a>
+<span class="sourceLineNo">1605</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.1605"></a>
+<span class="sourceLineNo">1606</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.1606"></a>
+<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
+<span class="sourceLineNo">1608</span> }<a name="line.1608"></a>
+<span class="sourceLineNo">1609</span><a name="line.1609"></a>
+<span class="sourceLineNo">1610</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.1610"></a>
+<span class="sourceLineNo">1611</span> for (; i < minLength; i++) {<a name="line.1611"></a>
+<span class="sourceLineNo">1612</span> int a = (buffer1[offset1 + i] & 0xFF);<a name="line.1612"></a>
+<span class="sourceLineNo">1613</span> int b = (buffer2[offset2 + i] & 0xFF);<a name="line.1613"></a>
+<span class="sourceLineNo">1614</span> if (a != b) {<a name="line.1614"></a>
+<span class="sourceLineNo">1615</span> return a - b;<a name="line.1615"></a>
+<span class="sourceLineNo">1616</span> }<a name="line.1616"></a>
+<span class="sourceLineNo">1617</span> }<a name="line.1617"></a>
+<span class="sourceLineNo">1618</span> return length1 - length2;<a name="line.1618"></a>
+<span class="sourceLineNo">1619</span> }<a name="line.1619"></a>
+<span class="sourceLineNo">1620</span> }<a name="line.1620"></a>
+<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
+<span class="sourceLineNo">1622</span><a name="line.1622"></a>
+<span class="sourceLineNo">1623</span> /**<a name="line.1623"></a>
+<span class="sourceLineNo">1624</span> * @param left left operand<a name="line.1624"></a>
+<span class="sourceLineNo">1625</span> * @param right right operand<a name="line.1625"></a>
+<span class="sourceLineNo">1626</span> * @return True if equal<a name="line.1626"></a>
+<span class="sourceLineNo">1627</span> */<a name="line.1627"></a>
+<span class="sourceLineNo">1628</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1628"></a>
+<span class="sourceLineNo">1629</span> // Could use Arrays.equals?<a name="line.1629"></a>
+<span class="sourceLineNo">1630</span> //noinspection SimplifiableConditionalExpression<a name="line.1630"></a>
+<span class="sourceLineNo">1631</span> if (left == right) return true;<a name="line.1631"></a>
+<span class="sourceLineNo">1632</span> if (left == null || right == null) return false;<a name="line.1632"></a>
+<span class="sourceLineNo">1633</span> if (left.length != right.length) return false;<a name="line.1633"></a>
+<span class="sourceLineNo">1634</span> if (left.length == 0) return true;<a name="line.1634"></a>
+<span class="sourceLineNo">1635</span><a name="line.1635"></a>
+<span class="sourceLineNo">1636</span> // Since we're often comparing adjacent sorted data,<a name="line.1636"></a>
+<span class="sourceLineNo">1637</span> // it's usual to have equal arrays except for the very last byte<a name="line.1637"></a>
+<span class="sourceLineNo">1638</span> // so check that first<a name="line.1638"></a>
+<span class="sourceLineNo">1639</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1639"></a>
<span class="sourceLineNo">1640</span><a name="line.1640"></a>
-<span class="sourceLineNo">1641</span> // Since we're often comparing adjacent sorted data,<a name="line.1641"></a>
-<span class="sourceLineNo">1642</span> // it's usual to have equal arrays except for the very last byte<a name="line.1642"></a>
-<span class="sourceLineNo">1643</span> // so check that first<a name="line.1643"></a>
-<span class="sourceLineNo">1644</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1644"></a>
-<span class="sourceLineNo">1645</span><a name="line.1645"></a>
-<span class="sourceLineNo">1646</span> return compareTo(left, right) == 0;<a name="line.1646"></a>
-<span class="sourceLineNo">1647</span> }<a name="line.1647"></a>
-<span class="sourceLineNo">1648</span><a name="line.1648"></a>
-<span class="sourceLineNo">1649</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1649"></a>
-<span class="sourceLineNo">1650</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1650"></a>
-<span class="sourceLineNo">1651</span> // short circuit case<a name="line.1651"></a>
-<span class="sourceLineNo">1652</span> if (left == right &&<a name="line.1652"></a>
-<span class="sourceLineNo">1653</span> leftOffset == rightOffset &&<a name="line.1653"></a>
-<span class="sourceLineNo">1654</span> leftLen == rightLen) {<a name="line.1654"></a>
-<span class="sourceLineNo">1655</span> return true;<a name="line.1655"></a>
-<span class="sourceLineNo">1656</span> }<a name="line.1656"></a>
-<span class="sourceLineNo">1657</span> // different lengths fast check<a name="line.1657"></a>
-<span class="sourceLineNo">1658</span> if (leftLen != rightLen) {<a name="line.1658"></a>
-<span class="sourceLineNo">1659</span> return false;<a name="line.1659"></a>
-<span class="sourceLineNo">1660</span> }<a name="line.1660"></a>
-<span class="sourceLineNo">1661</span> if (leftLen == 0) {<a name="line.1661"></a>
-<span class="sourceLineNo">1662</span> return true;<a name="line.1662"></a>
-<span class="sourceLineNo">1663</span> }<a name="line.1663"></a>
+<span class="sourceLineNo">1641</span> return compareTo(left, right) == 0;<a name="line.1641"></a>
+<span class="sourceLineNo">1642</span> }<a name="line.1642"></a>
+<span class="sourceLineNo">1643</span><a name="line.1643"></a>
+<span class="sourceLineNo">1644</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1644"></a>
+<span class="sourceLineNo">1645</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1645"></a>
+<span class="sourceLineNo">1646</span> // short circuit case<a name="line.1646"></a>
+<span class="sourceLineNo">1647</span> if (left == right &&<a name="line.1647"></a>
+<span class="sourceLineNo">1648</span> leftOffset == rightOffset &&<a name="line.1648"></a>
+<span class="sourceLineNo">1649</span> leftLen == rightLen) {<a name="line.1649"></a>
+<span class="sourceLineNo">1650</span> return true;<a name="line.1650"></a>
+<span class="sourceLineNo">1651</span> }<a name="line.1651"></a>
+<span class="sourceLineNo">1652</span> // different lengths fast check<a name="line.1652"></a>
+<span class="sourceLineNo">1653</span> if (leftLen != rightLen) {<a name="line.1653"></a>
+<span class="sourceLineNo">1654</span> return false;<a name="line.1654"></a>
+<span class="sourceLineNo">1655</span> }<a name="line.1655"></a>
+<span class="sourceLineNo">1656</span> if (leftLen == 0) {<a name="line.1656"></a>
+<span class="sourceLineNo">1657</span> return true;<a name="line.1657"></a>
+<span class="sourceLineNo">1658</span> }<a name="line.1658"></a>
+<span class="sourceLineNo">1659</span><a name="line.1659"></a>
+<span class="sourceLineNo">1660</span> // Since we're often comparing adjacent sorted data,<a name="line.1660"></a>
+<span class="sourceLineNo">1661</span> // it's usual to have equal arrays except for the very last byte<a name="line.1661"></a>
+<span class="sourceLineNo">1662</span> // so check that first<a name="line.1662"></a>
+<span class="sourceLineNo">1663</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1663"></a>
<span class="sourceLineNo">1664</span><a name="line.1664"></a>
-<span class="sourceLineNo">1665</span> // Since we're often comparing adjacent sorted data,<a name="line.1665"></a>
-<span class="sourceLineNo">1666</span> // it's usual to have equal arrays except for the very last byte<a name="line.1666"></a>
-<span class="sourceLineNo">1667</span> // so check that first<a name="line.1667"></a>
-<span class="sourceLineNo">1668</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1668"></a>
+<span class="sourceLineNo">1665</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1665"></a>
+<span class="sourceLineNo">1666</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1666"></a>
+<span class="sourceLineNo">1667</span> }<a name="line.1667"></a>
+<span class="sourceLineNo">1668</span><a name="line.1668"></a>
<span class="sourceLineNo">1669</span><a name="line.1669"></a>
-<span class="sourceLineNo">1670</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1670"></a>
-<span class="sourceLineNo">1671</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1671"></a>
-<span class="sourceLineNo">1672</span> }<a name="line.1672"></a>
-<span class="sourceLineNo">1673</span><a name="line.1673"></a>
-<span class="sourceLineNo">1674</span><a name="line.1674"></a>
-<span class="sourceLineNo">1675</span> /**<a name="line.1675"></a>
-<span class="sourceLineNo">1676</span> * @param a left operand<a name="line.1676"></a>
-<span class="sourceLineNo">1677</span> * @param buf right operand<a name="line.1677"></a>
-<span class="sourceLineNo">1678</span> * @return True if equal<a name="line.1678"></a>
-<span class="sourceLineNo">1679</span> */<a name="line.1679"></a>
-<span class="sourceLineNo">1680</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1680"></a>
-<span class="sourceLineNo">1681</span> if (a == null) return buf == null;<a name="line.1681"></a>
-<span class="sourceLineNo">1682</span> if (buf == null) return false;<a name="line.1682"></a>
-<span class="sourceLineNo">1683</span> if (a.length != buf.remaining()) return false;<a name="line.1683"></a>
-<span class="sourceLineNo">1684</span><a name="line.1684"></a>
-<span class="sourceLineNo">1685</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1685"></a>
-<span class="sourceLineNo">1686</span> ByteBuffer b = buf.duplicate();<a name="line.1686"></a>
-<span class="sourceLineNo">1687</span> for (byte anA : a) {<a name="line.1687"></a>
-<span class="sourceLineNo">1688</span> if (anA != b.get()) {<a name="line.1688"></a>
-<span class="sourceLineNo">1689</span> return false;<a name="line.1689"></a>
-<span class="sourceLineNo">1690</span> }<a name="line.1690"></a>
-<span class="sourceLineNo">1691</span> }<a name="line.1691"></a>
-<span class="sourceLineNo">1692</span> return true;<a name="line.1692"></a>
-<span class="sourceLineNo">1693</span> }<a name="line.1693"></a>
-<span class="sourceLineNo">1694</span><a name="line.1694"></a>
-<span class="sourceLineNo">1695</span><a name="line.1695"></a>
-<span class="sourceLineNo">1696</span> /**<a name="line.1696"></a>
-<span class="sourceLineNo">1697</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1697"></a>
-<span class="sourceLineNo">1698</span> * array on the left.<a name="line.1698"></a>
-<span class="sourceLineNo">1699</span> */<a name="line.1699"></a>
-<span class="sourceLineNo">1700</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1700"></a>
-<span class="sourceLineNo">1701</span> return bytes != null && prefix != null &&<a name="line.1701"></a>
-<span class="sourceLineNo">1702</span> bytes.length >= prefix.length &&<a name="line.1702"></a>
-<span class="sourceLineNo">1703</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1703"></a>
-<span class="sourceLineNo">1704</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1704"></a>
-<span class="sourceLineNo">1705</span> }<a name="line.1705"></a>
-<span class="sourceLineNo">1706</span><a name="line.1706"></a>
-<span class="sourceLineNo">1707</span> /**<a name="line.1707"></a>
-<span class="sourceLineNo">1708</span> * @param b bytes to hash<a name="line.1708"></a>
-<span class="sourceLineNo">1709</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1709"></a>
-<span class="sourceLineNo">1710</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1710"></a>
-<span class="sourceLineNo">1711</span> * use calculating hash code.<a name="line.1711"></a>
-<span class="sourceLineNo">1712</span> */<a name="line.1712"></a>
-<span class="sourceLineNo">1713</span> public static int hashCode(final byte [] b) {<a name="line.1713"></a>
-<span class="sourceLineNo">1714</span> return hashCode(b, b.length);<a name="line.1714"></a>
-<span class="sourceLineNo">1715</span> }<a name="line.1715"></a>
-<span class="sourceLineNo">1716</span><a name="line.1716"></a>
-<span class="sourceLineNo">1717</span> /**<a name="line.1717"></a>
-<span class="sourceLineNo">1718</span> * @param b value<a name="line.1718"></a>
-<span class="sourceLineNo">1719</span> * @param length length of the value<a name="line.1719"></a>
-<span class="sourceLineNo">1720</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1720"></a>
-<span class="sourceLineNo">1721</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1721"></a>
-<span class="sourceLineNo">1722</span> * use calculating hash code.<a name="line.1722"></a>
-<span class="sourceLineNo">1723</span> */<a name="line.1723"></a>
-<span class="sourceLineNo">1724</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1724"></a>
-<span class="sourceLineNo">1725</span> return WritableComparator.hashBytes(b, length);<a name="line.1725"></a>
-<span class="sourceLineNo">1726</span> }<a name="line.1726"></a>
-<span class="sourceLineNo">1727</span><a name="line.1727"></a>
-<span class="sourceLineNo">1728</span> /**<a name="line.1728"></a>
-<span class="sourceLineNo">1729</span> * @param b bytes to hash<a name="line.1729"></a>
-<span class="sourceLineNo">1730</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1730"></a>
-<span class="sourceLineNo">1731</span> * Maps.<a name="line.1731"></a>
-<span class="sourceLineNo">1732</span> */<a name="line.1732"></a>
-<span class="sourceLineNo">1733</span> public static Integer mapKey(final byte [] b) {<a name="line.1733"></a>
-<span class="sourceLineNo">1734</span> return hashCode(b);<a name="line.1734"></a>
-<span class="sourceLineNo">1735</span> }<a name="line.1735"></a>
-<span class="sourceLineNo">1736</span><a name="line.1736"></a>
-<span class="sourceLineNo">1737</span> /**<a name="line.1737"></a>
-<span class="sourceLineNo">1738</span> * @param b bytes to hash<a name="line.1738"></a>
-<span class="sourceLineNo">1739</span> * @param length length to hash<a name="line.1739"></a>
-<span class="sourceLineNo">1740</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1740"></a>
-<span class="sourceLineNo">1741</span> * Maps.<a name="line.1741"></a>
-<span class="sourceLineNo">1742</span> */<a name="line.1742"></a>
-<span class="sourceLineNo">1743</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1743"></a>
-<span class="sourceLineNo">1744</span> return hashCode(b, length);<a name="line.1744"></a>
-<span class="sourceLineNo">1745</span> }<a name="line.1745"></a>
-<span class="sourceLineNo">1746</span><a name="line.1746"></a>
-<span class="sourceLineNo">1747</span> /**<a name="line.1747"></a>
-<span class="sourceLineNo">1748</span> * @param a lower half<a name="line.1748"></a>
-<span class="sourceLineNo">1749</span> * @param b upper half<a name="line.1749"></a>
-<span class="sourceLineNo">1750</span> * @return New array that has a in lower half and b in upper half.<a name="line.1750"></a>
-<span class="sourceLineNo">1751</span> */<a name="line.1751"></a>
-<span class="sourceLineNo">1752</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1752"></a>
-<span class="sourceLineNo">1753</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1753"></a>
-<span class="sourceLineNo">1754</span> }<a name="line.1754"></a>
-<span class="sourceLineNo">1755</span><a name="line.1755"></a>
-<span class="sourceLineNo">1756</span> /**<a name="line.1756"></a>
-<span class="sourceLineNo">1757</span> * @param a first third<a name="line.1757"></a>
-<span class="sourceLineNo">1758</span> * @param b second third<a name="line.1758"></a>
-<span class="sourceLineNo">1759</span> * @param c third third<a name="line.1759"></a>
-<span class="sourceLineNo">1760</span> * @return New array made from a, b and c<a name="line.1760"></a>
-<span class="sourceLineNo">1761</span> */<a name="line.1761"></a>
-<span class="sourceLineNo">1762</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1762"></a>
-<span class="sourceLineNo">1763</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1763"></a>
-<span class="sourceLineNo">1764</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1764"></a>
-<span class="sourceLineNo">1765</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1765"></a>
-<span class="sourceLineNo">1766</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1766"></a>
-<span class="sourceLineNo">1767</span> return result;<a name="line.1767"></a>
-<span class="sourceLineNo">1768</span> }<a name="line.1768"></a>
-<span class="sourceLineNo">1769</span><a name="line.1769"></a>
-<span class="sourceLineNo">1770</span> /**<a name="line.1770"></a>
-<span class="sourceLineNo">1771</span> * @param arrays all the arrays to concatenate together.<a name="line.1771"></a>
-<span class="sourceLineNo">1772</span> * @return New array made from the concatenation of the given arrays.<a name="line.1772"></a>
-<span class="sourceLineNo">1773</span> */<a name="line.1773"></a>
-<span class="sourceLineNo">1774</span> public static byte [] add(final byte [][] arrays) {<a name="line.1774"></a>
-<span class="sourceLineNo">1775</span> int length = 0;<a name="line.1775"></a>
+<span class="sourceLineNo">1670</span> /**<a name="line.1670"></a>
+<span class="sourceLineNo">1671</span> * @param a left operand<a name="line.1671"></a>
+<span class="sourceLineNo">1672</span> * @param buf right operand<a name="line.1672"></a>
+<span class="sourceLineNo">1673</span> * @return True if equal<a name="line.1673"></a>
+<span class="sourceLineNo">1674</span> */<a name="line.1674"></a>
+<span class="sourceLineNo">1675</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1675"></a>
+<span class="sourceLineNo">1676</span> if (a == null) return buf == null;<a name="line.1676"></a>
+<span class="sourceLineNo">1677</span> if (buf == null) return false;<a name="line.1677"></a>
+<span class="sourceLineNo">1678</span> if (a.length != buf.remaining()) return false;<a name="line.1678"></a>
+<span class="sourceLineNo">1679</span><a name="line.1679"></a>
+<span class="sourceLineNo">1680</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1680"></a>
+<span class="sourceLineNo">1681</span> ByteBuffer b = buf.duplicate();<a name="line.1681"></a>
+<span class="sourceLineNo">1682</span> for (byte anA : a) {<a name="line.1682"></a>
+<span class="sourceLineNo">1683</span> if (anA != b.get()) {<a name="line.1683"></a>
+<span class="sourceLineNo">1684</span> return false;<a name="line.1684"></a>
+<span class="sourceLineNo">1685</span> }<a name="line.1685"></a>
+<span class="sourceLineNo">1686</span> }<a name="line.1686"></a>
+<span class="sourceLineNo">1687</span> return true;<a name="line.1687"></a>
+<span class="sourceLineNo">1688</span> }<a name="line.1688"></a>
+<span class="sourceLineNo">1689</span><a name="line.1689"></a>
+<span class="sourceLineNo">1690</span><a name="line.1690"></a>
+<span class="sourceLineNo">1691</span> /**<a name="line.1691"></a>
+<span class="sourceLineNo">1692</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1692"></a>
+<span class="sourceLineNo">1693</span> * array on the left.<a name="line.1693"></a>
+<span class="sourceLineNo">1694</span> */<a name="line.1694"></a>
+<span class="sourceLineNo">1695</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1695"></a>
+<span class="sourceLineNo">1696</span> return bytes != null && prefix != null &&<a name="line.1696"></a>
+<span class="sourceLineNo">1697</span> bytes.length >= prefix.length &&<a name="line.1697"></a>
+<span class="sourceLineNo">1698</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1698"></a>
+<span class="sourceLineNo">1699</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1699"></a>
+<span class="sourceLineNo">1700</span> }<a name="line.1700"></a>
+<span class="sourceLineNo">1701</span><a name="line.1701"></a>
+<span class="sourceLineNo">1702</span> /**<a name="line.1702"></a>
+<span class="sourceLineNo">1703</span> * @param b bytes to hash<a name="line.1703"></a>
+<span class="sourceLineNo">1704</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1704"></a>
+<span class="sourceLineNo">1705</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1705"></a>
+<span class="sourceLineNo">1706</span> * use calculating hash code.<a name="line.1706"></a>
+<span class="sourceLineNo">1707</span> */<a name="line.1707"></a>
+<span class="sourceLineNo">1708</span> public static int hashCode(final byte [] b) {<a name="line.1708"></a>
+<span class="sourceLineNo">1709</span> return hashCode(b, b.length);<a name="line.1709"></a>
+<span class="sourceLineNo">1710</span> }<a name="line.1710"></a>
+<span class="sourceLineNo">1711</span><a name="line.1711"></a>
+<span class="sourceLineNo">1712</span> /**<a name="line.1712"></a>
+<span class="sourceLineNo">1713</span> * @param b value<a name="line.1713"></a>
+<span class="sourceLineNo">1714</span> * @param length length of the value<a name="line.1714"></a>
+<span class="sourceLineNo">1715</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1715"></a>
+<span class="sourceLineNo">1716</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1716"></a>
+<span class="sourceLineNo">1717</span> * use calculating hash code.<a name="line.1717"></a>
+<span class="sourceLineNo">1718</span> */<a name="line.1718"></a>
+<span class="sourceLineNo">1719</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1719"></a>
+<span class="sourceLineNo">1720</span> return WritableComparator.hashBytes(b, length);<a name="line.1720"></a>
+<span class="sourceLineNo">1721</span> }<a name="line.1721"></a>
+<span class="sourceLineNo">1722</span><a name="line.1722"></a>
+<span class="sourceLineNo">1723</span> /**<a name="line.1723"></a>
+<span class="sourceLineNo">1724</span> * @param b bytes to hash<a name="line.1724"></a>
+<span class="sourceLineNo">1725</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1725"></a>
+<span class="sourceLineNo">1726</span> * Maps.<a name="line.1726"></a>
+<span class="sourceLineNo">1727</span> */<a name="line.1727"></a>
+<span class="sourceLineNo">1728</span> public static Integer mapKey(final byte [] b) {<a name="line.1728"></a>
+<span class="sourceLineNo">1729</span> return hashCode(b);<a name="line.1729"></a>
+<span class="sourceLineNo">1730</span> }<a name="line.1730"></a>
+<span class="sourceLineNo">1731</span><a name="line.1731"></a>
+<span class="sourceLineNo">1732</span> /**<a name="line.1732"></a>
+<span class="sourceLineNo">1733</span> * @param b bytes to hash<a name="line.1733"></a>
+<span class="sourceLineNo">1734</span> * @param length length to hash<a name="line.1734"></a>
+<span class="sourceLineNo">1735</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1735"></a>
+<span class="sourceLineNo">1736</span> * Maps.<a name="line.1736"></a>
+<span class="sourceLineNo">1737</span> */<a name="line.1737"></a>
+<span class="sourceLineNo">1738</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1738"></a>
+<span class="sourceLineNo">1739</span> return hashCode(b, length);<a name="line.1739"></a>
+<span class="sourceLineNo">1740</span> }<a name="line.1740"></a>
+<span class="sourceLineNo">1741</span><a name="line.1741"></a>
+<span class="sourceLineNo">1742</span> /**<a name="line.1742"></a>
+<span class="sourceLineNo">1743</span> * @param a lower half<a name="line.1743"></a>
+<span class="sourceLineNo">1744</span> * @param b upper half<a name="line.1744"></a>
+<span class="sourceLineNo">1745</span> * @return New array that has a in lower half and b in upper half.<a name="line.1745"></a>
+<span class="sourceLineNo">1746</span> */<a name="line.1746"></a>
+<span class="sourceLineNo">1747</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1747"></a>
+<span class="sourceLineNo">1748</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1748"></a>
+<span class="sourceLineNo">1749</span> }<a name="line.1749"></a>
+<span class="sourceLineNo">1750</span><a name="line.1750"></a>
+<span class="sourceLineNo">1751</span> /**<a name="line.1751"></a>
+<span class="sourceLineNo">1752</span> * @param a first third<a name="line.1752"></a>
+<span class="sourceLineNo">1753</span> * @param b second third<a name="line.1753"></a>
+<span class="sourceLineNo">1754</span> * @param c third third<a name="line.1754"></a>
+<span class="sourceLineNo">1755</span> * @return New array made from a, b and c<a name="line.1755"></a>
+<span class="sourceLineNo">1756</span> */<a name="line.1756"></a>
+<span class="sourceLineNo">1757</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1757"></a>
+<span class="sourceLineNo">1758</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1758"></a>
+<span class="sourceLineNo">1759</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1759"></a>
+<span class="sourceLineNo">1760</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1760"></a>
+<span class="sourceLineNo">1761</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1761"></a>
+<span class="sourceLineNo">1762</span> return result;<a name="line.1762"></a>
+<span class="sourceLineNo">1763</span> }<a name="line.1763"></a>
+<span class="sourceLineNo">1764</span><a name="line.1764"></a>
+<span class="sourceLineNo">1765</span> /**<a name="line.1765"></a>
+<span class="sourceLineNo">1766</span> * @param arrays all the arrays to concatenate together.<a name="line.1766"></a>
+<span class="sourceLineNo">1767</span> * @return New array made from the concatenation of the given arrays.<a name="line.1767"></a>
+<span class="sourceLineNo">1768</span> */<a name="line.1768"></a>
+<span class="sourceLineNo">1769</span> public static byte [] add(final byte [][] arrays) {<a name="line.1769"></a>
+<span class="sourceLineNo">1770</span> int length = 0;<a name="line.1770"></a>
+<span class="sourceLineNo">1771</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1771"></a>
+<span class="sourceLineNo">1772</span> length += arrays[i].length;<a name="line.1772"></a>
+<span class="sourceLineNo">1773</span> }<a name="line.1773"></a>
+<span class="sourceLineNo">1774</span> byte [] result = new byte[length];<a name="line.1774"></a>
+<span class="sourceLineNo">1775</span> int index = 0;<a name="line.1775"></a>
<span class="sourceLineNo">1776</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1776"></a>
-<span class="sourceLineNo">1777</span> length += arrays[i].length;<a name="line.1777"></a>
-<span class="sourceLineNo">1778</span> }<a name="line.1778"></a>
-<span class="sourceLineNo">1779</span> byte [] result = new byte[length];<a name="line.1779"></a>
-<span class="sourceLineNo">1780</span> int index = 0;<a name="line.1780"></a>
-<span class="sourceLineNo">1781</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1781"></a>
-<span class="sourceLineNo">1782</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1782"></a>
-<span class="sourceLineNo">1783</span> index += arrays[i].length;<a name="line.1783"></a>
-<span class="sourceLineNo">1784</span> }<a name="line.1784"></a>
-<span class="sourceLineNo">1785</span> return result;<a name="line.1785"></a>
-<span class="sourceLineNo">1786</span> }<a name="line.1786"></a>
-<span class="sourceLineNo">1787</span><a name="line.1787"></a>
-<span class="sourceLineNo">1788</span> /**<a name="line.1788"></a>
-<span class="sourceLineNo">1789</span> * @param a array<a name="line.1789"></a>
-<span class="sourceLineNo">1790</span> * @param length amount of bytes to grab<a name="line.1790"></a>
-<span class="sourceLineNo">1791</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1791"></a>
-<span class="sourceLineNo">1792</span> */<a name="line.1792"></a>
-<span class="sourceLineNo">1793</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1793"></a>
-<span class="sourceLineNo">1794</span> if (a.length < length) {<a name="line.1794"></a>
-<span class="sourceLineNo">1795</span> return null;<a name="line.1795"></a>
-<span class="sourceLineNo">1796</span> }<a name="line.1796"></a>
-<span class="sourceLineNo">1797</span> byte [] result = new byte[length];<a name="line.1797"></a>
-<span class="sourceLineNo">1798</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1798"></a>
-<span class="sourceLineNo">1799</span> return result;<a name="line.1799"></a>
-<span class="sourceLineNo">1800</span> }<a name="line.1800"></a>
-<span class="sourceLineNo">1801</span><a name="line.1801"></a>
-<span class="sourceLineNo">1802</span> /**<a name="line.1802"></a>
-<span class="sourceLineNo">1803</span> * @param a array<a name="line.1803"></a>
-<span class="sourceLineNo">1804</span> * @param length amount of bytes to snarf<a name="line.1804"></a>
-<span class="sourceLineNo">1805</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1805"></a>
-<span class="sourceLineNo">1806</span> */<a name="line.1806"></a>
-<span class="sourceLineNo">1807</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1807"></a>
-<span class="sourceLineNo">1808</span> if (a.length < length) {<a name="line.1808"></a>
-<span class="sourceLineNo">1809</span> return null;<a name="line.1809"></a>
-<span class="sourceLineNo">1810</span> }<a name="line.1810"></a>
-<span class="sourceLineNo">1811</span> byte [] result = new byte[length];<a name="line.1811"></a>
-<span class="sourceLineNo">1812</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1812"></a>
-<span class="sourceLineNo">1813</span> return result;<a name="line.1813"></a>
-<span class="sourceLineNo">1814</span> }<a name="line.1814"></a>
-<span class="sourceLineNo">1815</span><a name="line.1815"></a>
-<span class="sourceLineNo">1816</span> /**<a name="line.1816"></a>
-<span class="sourceLineNo">1817</span> * @param a array<a name="line.1817"></a>
-<span class="sourceLineNo">1818</span> * @param length new array size<a name="line.1818"></a>
-<span class="sourceLineNo">1819</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1819"></a>
-<span class="sourceLineNo">1820</span> */<a name="line.1820"></a>
-<span class="sourceLineNo">1821</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1821"></a>
-<span class="sourceLineNo">1822</span> byte [] padding = new byte[length];<a name="line.1822"></a>
-<span class="sourceLineNo">1823</span> for (int i = 0; i < length; i++) {<a name="line.1823"></a>
-<span class="sourceLineNo">1824</span> padding[i] = 0;<a name="line.1824"></a>
-<span class="sourceLineNo">1825</span> }<a name="line.1825"></a>
-<span class="sourceLineNo">1826</span> return add(padding,a);<a name="line.1826"></a>
-<span class="sourceLineNo">1827</span> }<a name="line.1827"></a>
-<span class="sourceLineNo">1828</span><a name="line.1828"></a>
-<span class="sourceLineNo">1829</span> /**<a name="line.1829"></a>
-<span class="sourceLineNo">1830</span> * @param a array<a name="line.1830"></a>
-<span class="sourceLineNo">1831</span> * @param length new array size<a name="line.1831"></a>
-<span class="sourceLineNo">1832</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1832"></a>
-<span class="sourceLineNo">1833</span> */<a name="line.1833"></a>
-<span class="sourceLineNo">1834</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1834"></a>
-<span class="sourceLineNo">1835</span> byte [] padding = new byte[length];<a name="line.1835"></a>
-<span class="sourceLineNo">1836</span> for (int i = 0; i < length; i++) {<a name="line.1836"></a>
-<span class="sourceLineNo">1837</span> padding[i] = 0;<a name="line.1837"></a>
-<span class="sourceLineNo">1838</span> }<a name="line.1838"></a>
-<span class="sourceLineNo">1839</span> return add(a,padding);<a name="line.1839"></a>
-<span class="sourceLineNo">1840</span> }<a name="line.1840"></a>
-<span class="sourceLineNo">1841</span><a name="line.1841"></a>
-<span class="sourceLineNo">1842</span> /**<a name="line.1842"></a>
-<span class="sourceLineNo">1843</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1843"></a>
-<span class="sourceLineNo">1844</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1844"></a>
-<span class="sourceLineNo">1845</span> * @param a Beginning of range<a name="line.1845"></a>
-<span class="sourceLineNo">1846</span> * @param b End of range<a name="line.1846"></a>
-<span class="sourceLineNo">1847</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1847"></a>
-<span class="sourceLineNo">1848</span> * the range in two; i.e. one split.<a name="line.1848"></a>
-<span class="sourceLineNo">1849</span> * @return Array of dividing values<a name="line.1849"></a>
-<span class="sourceLineNo">1850</span> */<a name="line.1850"></a>
-<span class="sourceLineNo">1851</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1851"></a>
-<span class="sourceLineNo">1852</span> return split(a, b, false, num);<a name="line.1852"></a>
-<span class="sourceLineNo">1853</span> }<a name="line.1853"></a>
-<span class="sourceLineNo">1854</span><a name="line.1854"></a>
-<span class="sourceLineNo">1855</span> /**<a name="line.1855"></a>
-<span class="sourceLineNo">1856</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1856"></a>
-<span class="sourceLineNo">1857</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1857"></a>
-<span class="sourceLineNo">1858</span> * @param a Beginning of range<a name="line.1858"></a>
-<span class="sourceLineNo">1859</span> * @param b End of range<a name="line.1859"></a>
-<span class="sourceLineNo">1860</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1860"></a>
-<span class="sourceLineNo">1861</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1861"></a>
-<span class="sourceLineNo">1862</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1862"></a>
-<span class="sourceLineNo">1863</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1863"></a>
-<span class="sourceLineNo">1864</span> * the range in two; i.e. one split.<a name="line.1864"></a>
-<span class="sourceLineNo">1865</span> * @return Array of dividing values<a name="line.1865"></a>
-<span class="sourceLineNo">1866</span> */<a name="line.1866"></a>
-<span class="sourceLineNo">1867</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1867"></a>
-<span class="sourceLineNo">1868</span> boolean inclusive, final int num) {<a name="line.1868"></a>
-<span class="sourceLineNo">1869</span> byte[][] ret = new byte[num + 2][];<a name="line.1869"></a>
-<span class="sourceLineNo">1870</span> int i = 0;<a name="line.1870"></a>
-<span class="sourceLineNo">1871</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1871"></a>
-<span class="sourceLineNo">1872</span> if (iter == null)<a name="line.1872"></a>
-<span class="sourceLineNo">1873</span> return null;<a name="line.1873"></a>
-<span class="sourceLineNo">1874</span> for (byte[] elem : iter) {<a name="line.1874"></a>
-<span class="sourceLineNo">1875</span> ret[i++] = elem;<a name="line.1875"></a>
-<span class="sourceLineNo">1876</span> }<a name="line.1876"></a>
-<span class="sourceLineNo">1877</span> return ret;<a name="line.1877"></a>
-<span class="sourceLineNo">1878</span> }<a name="line.1878"></a>
-<span class="sourceLineNo">1879</span><a name="line.1879"></a>
-<span class="sourceLineNo">1880</span> /**<a name="line.1880"></a>
-<span class="sourceLineNo">1881</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1881"></a>
-<span class="sourceLineNo">1882</span> */<a name="line.1882"></a>
-<span class="sourceLineNo">1883</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1883"></a>
-<span class="sourceLineNo">1884</span> final byte[] b, final int num)<a name="line.1884"></a>
-<span class="sourceLineNo">1885</span> {<a name="line.1885"></a>
-<span class="sourceLineNo">1886</span> return iterateOnSplits(a, b, false, num);<a name="line.1886"></a>
-<span class="sourceLineNo">1887</span> }<a name="line.1887"></a>
-<span class="sourceLineNo">1888</span><a name="line.1888"></a>
-<span class="sourceLineNo">1889</span> /**<a name="line.1889"></a>
-<span class="sourceLineNo">1890</span> * Iterate over keys within the passed range.<a name="line.1890"></a>
-<span class="sourceLineNo">1891</span> */<a name="line.1891"></a>
-<span class="sourceLineNo">1892</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1892"></a>
-<span class="sourceLineNo">1893</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1893"></a>
-<span class="sourceLineNo">1894</span> {<a name="line.1894"></a>
-<span class="sourceLineNo">1895</span> byte [] aPadded;<a name="line.1895"></a>
-<span class="sourceLineNo">1896</span> byte [] bPadded;<a name="line.1896"></a>
-<span class="sourceLineNo">1897</span> if (a.length < b.length) {<a name="line.1897"></a>
-<span class="sourceLineNo">1898</span> aPadded = padTail(a, b.length - a.length);<a name="line.1898"></a>
-<span class="sourceLineNo">1899</span> bPadded = b;<a name="line.1899"></a>
-<span class="sourceLineNo">1900</span> } else if (b.length < a.length) {<a name="line.1900"></a>
-<span class="sourceLineNo">1901</span> aPadded = a;<a name="line.1901"></a>
-<span class="sourceLineNo">1902</span> bPadded = padTail(b, a.length - b.length);<a name="line.1902"></a>
-<span class="sourceLineNo">1903</span> } else {<a name="line.1903"></a>
-<span class="sourceLineNo">1904</span> aPadded = a;<a name="line.1904"></a>
-<span class="sourceLineNo">1905</span> bPadded = b;<a name="line.1905"></a>
-<span class="sourceLineNo">1906</span> }<a name="line.1906"></a>
-<span class="sourceLineNo">1907</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1907"></a>
-<span class="sourceLineNo">1908</span> throw new IllegalArgumentException("b <= a");<a name="line.1908"></a>
-<span class="sourceLineNo">1909</span> }<a name="line.1909"></a>
-<span class="sourceLineNo">1910</span> if (num <= 0) {<a name="line.1910"></a>
-<span class="sourceLineNo">1911</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1911"></a>
-<span class="sourceLineNo">1912</span> }<a name="line.1912"></a>
-<span class="sourceLineNo">1913</span> byte [] prependHeader = {1, 0};<a name="line.1913"></a>
-<span class="sourceLineNo">1914</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1914"></a>
-<span class="sourceLineNo">1915</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1915"></a>
-<span class="sourceLineNo">1916</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1916"></a>
-<span class="sourceLineNo">1917</span> if (inclusive) {<a name="line.1917"></a>
-<span class="sourceLineNo">1918</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1918"></a>
-<span class="sourceLineNo">1919</span> }<a name="line.1919"></a>
-<span class="sourceLineNo">1920</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1920"></a>
-<span class="sourceLineNo">1921</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1921"></a>
-<span class="sourceLineNo">1922</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1922"></a>
-<span class="sourceLineNo">1923</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1923"></a>
-<span class="sourceLineNo">1924</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1924"></a>
-<span class="sourceLineNo">1925</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1925"></a>
-<span class="sourceLineNo">1926</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1926"></a>
-<span class="sourceLineNo">1927</span> }<a name="line.1927"></a>
-<span class="sourceLineNo">1928</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1928"></a>
-<span class="sourceLineNo">1929</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1929"></a>
-<span class="sourceLineNo">1930</span> }<a name="line.1930"></a>
-<span class="sourceLineNo">1931</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1931"></a>
-<span class="sourceLineNo">1932</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1932"></a>
-<span class="sourceLineNo">1933</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1933"></a>
-<span class="sourceLineNo">1934</span> }<a name="line.1934"></a>
-<span class="sourceLineNo">1935</span> final BigInteger intervalBI;<a name="line.1935"></a>
-<span class="sourceLineNo">1936</span> try {<a name="line.1936"></a>
-<span class="sourceLineNo">1937</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1937"></a>
-<span class="sourceLineNo">1938</span> } catch(Exception e) {<a name="line.1938"></a>
-<span class="sourceLineNo">1939</span> LOG.error("Exception caught during division", e);<a name="line.1939"></a>
-<span class="sourceLineNo">1940</span> return null;<a name="line.1940"></a>
-<span class="sourceLineNo">1941</span> }<a name="line.1941"></a>
-<span class="sourceLineNo">1942</span><a name="line.1942"></a>
-<span class="sourceLineNo">1943</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1943"></a>
-<span class="sourceLineNo">1944</span> private int i = -1;<a name="line.1944"></a>
+<span class="sourceLineNo">1777</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1777"></a>
+<span class="sourceLineNo">1778</span> index += arrays[i].length;<a name="line.1778"></a>
+<span class="sourceLineNo">1779</span> }<a name="line.1779"></a>
+<span class="sourceLineNo">1780</span> return result;<a name="line.1780"></a>
+<span class="sourceLineNo">1781</span> }<a name="line.1781"></a>
+<span class="sourceLineNo">1782</span><a name="line.1782"></a>
+<span class="sourceLineNo">1783</span> /**<a name="line.1783"></a>
+<span class="sourceLineNo">1784</span> * @param a array<a name="line.1784"></a>
+<span class="sourceLineNo">1785</span> * @param length amount of bytes to grab<a name="line.1785"></a>
+<span class="sourceLineNo">1786</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1786"></a>
+<span class="sourceLineNo">1787</span> */<a name="line.1787"></a>
+<span class="sourceLineNo">1788</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1788"></a>
+<span class="sourceLineNo">1789</span> if (a.length < length) {<a name="line.1789"></a>
+<span class="sourceLineNo">1790</span> return null;<a name="line.1790"></a>
+<span class="sourceLineNo">1791</span> }<a name="line.1791"></a>
+<span class="sourceLineNo">1792</span> byte [] result = new byte[length];<a name="line.1792"></a>
+<span class="sourceLineNo">1793</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1793"></a>
+<span class="sourceLineNo">1794</span> return result;<a name="line.1794"></a>
+<span class="sourceLineNo">1795</span> }<a name="line.1795"></a>
+<span class="sourceLineNo">1796</span><a name="line.1796"></a>
+<span class="sourceLineNo">1797</span> /**<a name="line.1797"></a>
+<span class="sourceLineNo">1798</span> * @param a array<a name="line.1798"></a>
+<span class="sourceLineNo">1799</span> * @param length amount of bytes to snarf<a name="line.1799"></a>
+<span class="sourceLineNo">1800</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1800"></a>
+<span class="sourceLineNo">1801</span> */<a name="line.1801"></a>
+<span class="sourceLineNo">1802</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1802"></a>
+<span class="sourceLineNo">1803</span> if (a.length < length) {<a name="line.1803"></a>
+<span class="sourceLineNo">1804</span> return null;<a name="line.1804"></a>
+<span class="sourceLineNo">1805</span> }<a name="line.1805"></a>
+<span class="sourceLineNo">1806</span> byte [] result = new byte[length];<a name="line.1806"></a>
+<span class="sourceLineNo">1807</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1807"></a>
+<span class="sourceLineNo">1808</span> return result;<a name="line.1808"></a>
+<span class="sourceLineNo">1809</span> }<a name="line.1809"></a>
+<span class="sourceLineNo">1810</span><a name="line.1810"></a>
+<span class="sourceLineNo">1811</span> /**<a name="line.1811"></a>
+<span class="sourceLineNo">1812</span> * @param a array<a name="line.1812"></a>
+<span class="sourceLineNo">1813</span> * @param length new array size<a name="line.1813"></a>
+<span class="sourceLineNo">1814</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1814"></a>
+<span class="sourceLineNo">1815</span> */<a name="line.1815"></a>
+<span class="sourceLineNo">1816</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1816"></a>
+<span class="sourceLineNo">1817</span> byte [] padding = new byte[length];<a name="line.1817"></a>
+<span class="sourceLineNo">1818</span> for (int i = 0; i < length; i++) {<a name="line.1818"></a>
+<span class="sourceLineNo">1819</span> padding[i] = 0;<a name="line.1819"></a>
+<span class="sourceLineNo">1820</span> }<a name="line.1820"></a>
+<span class="sourceLineNo">1821</span> return add(padding,a);<a name="line.1821"></a>
+<span class="sourceLineNo">1822</span> }<a name="line.1822"></a>
+<span class="sourceLineNo">1823</span><a name="line.1823"></a>
+<span class="sourceLineNo">1824</span> /**<a name="line.1824"></a>
+<span class="sourceLineNo">1825</span> * @param a array<a name="line.1825"></a>
+<span class="sourceLineNo">1826</span> * @param length new array size<a name="line.1826"></a>
+<span class="sourceLineNo">1827</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1827"></a>
+<span class="sourceLineNo">1828</span> */<a name="line.1828"></a>
+<span class="sourceLineNo">1829</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1829"></a>
+<span class="sourceLineNo">1830</span> byte [] padding = new byte[length];<a name="line.1830"></a>
+<span class="sourceLineNo">1831</span> for (int i = 0; i < length; i++) {<a name="line.1831"></a>
+<span class="sourceLineNo">1832</span> padding[i] = 0;<a name="line.1832"></a>
+<span class="sourceLineNo">1833</span> }<a name="line.1833"></a>
+<span class="sourceLineNo">1834</span> return add(a,padding);<a name="line.1834"></a>
+<span class="sourceLineNo">1835</span> }<a name="line.1835"></a>
+<span class="sourceLineNo">1836</span><a name="line.1836"></a>
+<span class="sourceLineNo">1837</span> /**<a name="line.1837"></a>
+<span class="sourceLineNo">1838</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1838"></a>
+<span class="sourceLineNo">1839</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1839"></a>
+<span class="sourceLineNo">1840</span> * @param a Beginning of range<a name="line.1840"></a>
+<span class="sourceLineNo">1841</span> * @param b End of range<a name="line.1841"></a>
+<span class="sourceLineNo">1842</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1842"></a>
+<span class="sourceLineNo">1843</span> * the range in two; i.e. one split.<a name="line.1843"></a>
+<span class="sourceLineNo">1844</span> * @return Array of dividing values<a name="line.1844"></a>
+<span class="sourceLineNo">1845</span> */<a name="line.1845"></a>
+<span class="sourceLineNo">1846</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1846"></a>
+<span class="sourceLineNo">1847</span> return split(a, b, false, num);<a name="line.1847"></a>
+<span class="sourceLineNo">1848</span> }<a name="line.1848"></a>
+<span class="sourceLineNo">1849</span><a name="line.1849"></a>
+<span class="sourceLineNo">1850</span> /**<a name="line.1850"></a>
+<span class="sourceLineNo">1851</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1851"></a>
+<span class="sourceLineNo">1852</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1852"></a>
+<span class="sourceLineNo">1853</span> * @param a Beginning of range<a name="line.1853"></a>
+<span class="sourceLineNo">1854</span> * @param b End of range<a name="line.1854"></a>
+<span class="sourceLineNo">1855</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1855"></a>
+<span class="sourceLineNo">1856</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1856"></a>
+<span class="sourceLineNo">1857</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1857"></a>
+<span class="sourceLineNo">1858</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1858"></a>
+<span class="sourceLineNo">1859</span> * the range in two; i.e. one split.<a name="line.1859"></a>
+<span class="sourceLineNo">1860</span> * @return Array of dividing values<a name="line.1860"></a>
+<span class="sourceLineNo">1861</span> */<a name="line.1861"></a>
+<span class="sourceLineNo">1862</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1862"></a>
+<span class="sourceLineNo">1863</span> boolean inclusive, final int num) {<a name="line.1863"></a>
+<span class="sourceLineNo">1864</span> byte[][] ret = new byte[num + 2][];<a name="line.1864"></a>
+<span class="sourceLineNo">1865</span> int i = 0;<a name="line.1865"></a>
+<span class="sourceLineNo">1866</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1866"></a>
+<span class="sourceLineNo">1867</span> if (iter == null)<a name="line.1867"></a>
+<span class="sourceLineNo">1868</span> return null;<a name="line.1868"></a>
+<span class="sourceLineNo">1869</span> for (byte[] elem : iter) {<a name="line.1869"></a>
+<span class="sourceLineNo">1870</span> ret[i++] = elem;<a name="line.1870"></a>
+<span class="sourceLineNo">1871</span> }<a name="line.1871"></a>
+<span class="sourceLineNo">1872</span> return ret;<a name="line.1872"></a>
+<span class="sourceLineNo">1873</span> }<a name="line.1873"></a>
+<span class="sourceLineNo">1874</span><a name="line.1874"></a>
+<span class="sourceLineNo">1875</span> /**<a name="line.1875"></a>
+<span class="sourceLineNo">1876</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1876"></a>
+<span class="sourceLineNo">1877</span> */<a name="line.1877"></a>
+<span class="sourceLineNo">1878</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1878"></a>
+<span class="sourceLineNo">1879</span> final byte[] b, final int num)<a name="line.1879"></a>
+<span class="sourceLineNo">1880</span> {<a name="line.1880"></a>
+<span class="sourceLineNo">1881</span> return iterateOnSplits(a, b, false, num);<a name="line.1881"></a>
+<span class="sourceLineNo">1882</span> }<a name="line.1882"></a>
+<span class="sourceLineNo">1883</span><a name="line.1883"></a>
+<span class="sourceLineNo">1884</span> /**<a name="line.1884"></a>
+<span class="sourceLineNo">1885</span> * Iterate over keys within the passed range.<a name="line.1885"></a>
+<span class="sourceLineNo">1886</span> */<a name="line.1886"></a>
+<span class="sourceLineNo">1887</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1887"></a>
+<span class="sourceLineNo">1888</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1888"></a>
+<span class="sourceLineNo">1889</span> {<a name="line.1889"></a>
+<span class="sourceLineNo">1890</span> byte [] aPadded;<a name="line.1890"></a>
+<span class="sourceLineNo">1891</span> byte [] bPadded;<a name="line.1891"></a>
+<span class="sourceLineNo">1892</span> if (a.length < b.length) {<a name="line.1892"></a>
+<span class="sourceLineNo">1893</span> aPadded = padTail(a, b.length - a.length);<a name="line.1893"></a>
+<span class="sourceLineNo">1894</span> bPadded = b;<a name="line.1894"></a>
+<span class="sourceLineNo">1895</span> } else if (b.length < a.length) {<a name="line.1895"></a>
+<span class="sourceLineNo">1896</span> aPadded = a;<a name="line.1896"></a>
+<span class="sourceLineNo">1897</span> bPadded = padTail(b, a.length - b.length);<a name="line.1897"></a>
+<span class="sourceLineNo">1898</span> } else {<a name="line.1898"></a>
+<span class="sourceLineNo">1899</span> aPadded = a;<a name="line.1899"></a>
+<span class="sourceLineNo">1900</span> bPadded = b;<a name="line.1900"></a>
+<span class="sourceLineNo">1901</span> }<a name="line.1901"></a>
+<span class="sourceLineNo">1902</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1902"></a>
+<span class="sourceLineNo">1903</span> throw new IllegalArgumentException("b <= a");<a name="line.1903"></a>
+<span class="sourceLineNo">1904</span> }<a name="line.1904"></a>
+<span class="sourceLineNo">1905</span> if (num <= 0) {<a name="line.1905"></a>
+<span class="sourceLineNo">1906</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1906"></a>
+<span class="sourceLineNo">1907</span> }<a name="line.1907"></a>
+<span class="sourceLineNo">1908</span> byte [] prependHeader = {1, 0};<a name="line.1908"></a>
+<span class="sourceLineNo">1909</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1909"></a>
+<span class="sourceLineNo">1910</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1910"></a>
+<span class="sourceLineNo">1911</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1911"></a>
+<span class="sourceLineNo">1912</span> if (inclusive) {<a name="line.1912"></a>
+<span class="sourceLineNo">1913</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1913"></a>
+<span class="sourceLineNo">1914</span> }<a name="line.1914"></a>
+<span class="sourceLineNo">1915</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1915"></a>
+<span class="sourceLineNo">1916</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1916"></a>
+<span class="sourceLineNo">1917</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1917"></a>
+<span class="sourceLineNo">1918</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1918"></a>
+<span class="sourceLineNo">1919</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1919"></a>
+<span class="sourceLineNo">1920</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1920"></a>
+<span class="sourceLineNo">1921</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1921"></a>
+<span class="sourceLineNo">1922</span> }<a name="line.1922"></a>
+<span class="sourceLineNo">1923</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1923"></a>
+<span class="sourceLineNo">1924</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1924"></a>
+<span class="sourceLineNo">1925</span> }<a name="line.1925"></a>
+<span class="sourceLineNo">1926</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1926"></a>
+<span class="sourceLineNo">1927</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1927"></a>
+<span class="sourceLineNo">1928</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1928"></a>
+<span class="sourceLineNo">1929</span> }<a name="line.1929"></a>
+<span class="sourceLineNo">1930</span> final BigInteger intervalBI;<a name="line.1930"></a>
+<span class="sourceLineNo">1931</span> try {<a name="line.1931"></a>
+<span class="sourceLineNo">1932</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1932"></a>
+<span class="sourceLineNo">1933</span> } catch(Exception e) {<a name="line.1933"></a>
+<span class="sourceLineNo">1934</span> LOG.error("Exception caught during division", e);<a name="line.1934"></a>
+<span class="sourceLineNo">1935</span> return null;<a name="line.1935"></a>
+<span class="sourceLineNo">1936</span> }<a name="line.1936"></a>
+<span class="sourceLineNo">1937</span><a name="line.1937"></a>
+<span class="sourceLineNo">1938</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1938"></a>
+<span class="sourceLineNo">1939</span> private int i = -1;<a name="line.1939"></a>
+<span class="sourceLineNo">1940</span><a name="line.1940"></a>
+<span class="sourceLineNo">1941</span> @Override<a name="line.1941"></a>
+<span class="sourceLineNo">1942</span> public boolean hasNext() {<a name="line.1942"></a>
+<span class="sourceLineNo">1943</span> return i < num+1;<a name="line.1943"></a>
+<span class="sourceLineNo">1944</span> }<a name="line.1944"></a>
<span class="sourceLineNo">1945</span><a name="line.1945"></a>
<span class="sourceLineNo">1946</span> @Override<a name="line.1946"></a>
-<span class="sourceLineNo">1947</span> public boolean hasNext() {<a name="line.1947"></a>
-<span class="sourceLineNo">1948</span> return i < num+1;<a name="line.1948"></a>
-<span class="sourceLineNo">1949</span> }<a name="line.1949"></a>
-<span class="sourceLineNo">1950</span><a name="line.1950"></a>
-<span class="sourceLineNo">1951</span> @Override<a name="line.1951"></a>
-<span class="sourceLineNo">1952</span> public byte[] next() {<a name="line.1952"></a>
-<span class="sourceLineNo">1953</span> i++;<a name="line.1953"></a>
-<span class="sourceLineNo">1954</span> if (i == 0) return a;<a name="line.1954"></a>
-<span class="sourceLineNo">1955</span> if (i == num + 1) return b;<a name="line.1955"></a>
-<span class="sourceLineNo">1956</span><a name="line.1956"></a>
-<span class="sourceLineNo">1957</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1957"></a>
-<span class="sourceLineNo">1958</span> byte [] padded = curBI.toByteArray();<a name="line.1958"></a>
-<span class="sourceLineNo">1959</span> if (padded[1] == 0)<a name="line.1959"></a>
-<span class="sourceLineNo">1960</span> padded = tail(padded, padded.length - 2);<a name="line.1960"></a>
-<span class="sourceLineNo">1961</span> else<a name="line.1961"></a>
-<span class="sourceLineNo">1962</span> padded = tail(padded, padded.length - 1);<a name="line.1962"></a>
-<span class="sourceLineNo">1963</span> return padded;<a name="line.1963"></a>
+<span class="sourceLineNo">1947</span> public byte[] next() {<a name="line.1947"></a>
+<span class="sourceLineNo">1948</span> i++;<a name="line.1948"></a>
+<span class="sourceLineNo">1949</span> if (i == 0) return a;<a name="line.1949"></a>
+<span class="sourceLineNo">1950</span> if (i == num + 1) return b;<a name="line.1950"></a>
+<span class="sourceLineNo">1951</span><a name="line.1951"></a>
+<span class="sourceLineNo">1952</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1952"></a>
+<span class="sourceLineNo">1953</span> byte [] padded = curBI.toByteArray();<a name="line.1953"></a>
+<span class="sourceLineNo">1954</span> if (padded[1] == 0)<a name="line.1954"></a>
+<span class="sourceLineNo">1955</span> padded = tail(padded, padded.length - 2);<a name="line.1955"></a>
+<span class="sourceLineNo">1956</span> else<a name="line.1956"></a>
+<span class="sourceLineNo">1957</span> padded = tail(padded, padded.length - 1);<a name="line.1957"></a>
+<span class="sourceLineNo">1958</span> return padded;<a name="line.1958"></a>
+<span class="sourceLineNo">1959</span> }<a name="line.1959"></a>
+<span class="sourceLineNo">1960</span><a name="line.1960"></a>
+<span class="sourceLineNo">1961</span> @Override<a name="line.1961"></a>
+<span class="sourceLineNo">1962</span> public void remove() {<a name="line.1962"></a>
+<span class="sourceLineNo">1963</span> throw new UnsupportedOperationException();<a name="line.1963"></a>
<span class="sourceLineNo">1964</span> }<a name="line.1964"></a>
<span class="sourceLineNo">1965</span><a name="line.1965"></a>
-<span class="sourceLineNo">1966</span> @Override<a name="line.1966"></a>
-<span class="sourceLineNo">1967</span> public void remove() {<a name="line.1967"></a>
-<span class="sourceLineNo">1968</span> throw new UnsupportedOperationException();<a name="line.1968"></a>
-<span class="sourceLineNo">1969</span> }<a name="line.1969"></a>
-<span class="sourceLineNo">1970</span><a name="line.1970"></a>
-<span class="sourceLineNo">1971</span> };<a name="line.1971"></a>
-<span class="sourceLineNo">1972</span><a name="line.1972"></a>
-<span class="sourceLineNo">1973</span> return new Iterable<byte[]>() {<a name="line.1973"></a>
-<span class="sourceLineNo">1974</span> @Override<a name="line.1974"></a>
-<span class="sourceLineNo">1975</span> public Iterator<byte[]> iterator() {<a name="line.1975"></a>
-<span class="sourceLineNo">1976</span> return iterator;<a name="line.1976"></a>
-<span class="sourceLineNo">1977</span> }<a name="line.1977"></a>
-<span class="sourceLineNo">1978</span> };<a name="line.1978"></a>
-<span class="sourceLineNo">1979</span> }<a name="line.1979"></a>
-<span class="sourceLineNo">1980</span><a name="line.1980"></a>
-<span class="sourceLineNo">1981</span> /**<a name="line.1981"></a>
-<span class="sourceLineNo">1982</span> * @param bytes array to hash<a name="line.1982"></a>
-<span class="sourceLineNo">1983</span> * @param offset offset to start from<a name="line.1983"></a>
-<span class="sourceLineNo">1984</span> * @param length length to hash<a name="line.1984"></a>
-<span class="sourceLineNo">1985</span> * */<a name="line.1985"></a>
-<span class="sourceLineNo">1986</span> public static int hashCode(byte[] bytes, int offset, int length) {<a name="line.1986"></a>
-<span class="sourceLineNo">1987</span> int hash = 1;<a name="line.1987"></a>
-<span class="sourceLineNo">1988</span> for (int i = offset; i < offset + length; i++)<a name="line.1988"></a>
-<span class="sourceLineNo">1989</span> hash = (31 * hash) + (int) bytes[i];<a name="line.1989"></a>
-<span class="sourceLineNo">1990</span> return hash;<a name="line.1990"></a>
-<span class="sourceLineNo">1991</span> }<a name="line.1991"></a>
-<span class="sourceLineNo">1992</span><a name="line.1992"></a>
-<span class="sourceLineNo">1993</span> /**<a name="line.1993"></a>
-<span class="sourceLineNo">1994</span> * @param t operands<a name="line.1994"></a>
-<span class="sourceLineNo">1995</span> * @return Array of byte arrays made from passed array of Text<a name="line.1995"></a>
-<span class="sourceLineNo">1996</span> */<a name="line.1996"></a>
-<span class="sourceLineNo">1997</span> public static byte [][] toByteArrays(final String [] t) {<a name="line.1997"></a>
-<span class="sourceLineNo">1998</span> byte [][] result = new byte[t.length][];<a name="line.1998"></a>
-<span class="sourceLineNo">1999</span> for (int i = 0; i < t.length; i++) {<a name="line.1999"></a>
-<span class="sourceLineNo">2000</span> result[i] = Bytes.toBytes(t[i]);<a name="line.2000"></a>
-<span class="sourceLineNo">2001</span> }<a name="line.2001"></a>
-<span class="sourceLineNo">2002</span> return result;<a name="line.2002"></a>
-<span class="sourceLineNo">2003</span> }<a name="line.2003"></a>
-<span class="sourceLineNo">2004</span><a name="line.2004"></a>
-<span class="sourceLineNo">2005</span> /**<a name="line.2005"></a>
-<span class="sourceLineNo">2006</span> * @param t operands<a name="line.2006"></a>
-<span class="sourceLineNo">2007</span> * @return Array of binary byte arrays made from passed array of binary strings<a name="line.2007"></a>
-<span class="sourceLineNo">2008</span> */<a name="line.2008"></a>
-<span class="sourceLineNo">2009</span> public static byte[][] toBinaryByteArrays(final String[] t) {<a name="line.2009"></a>
-<span class="sourceLineNo">2010</span> byte[][] result = new byte[t.length][];<a name="line.2010"></a>
-<span class="sourceLineNo">2011</span> for (int i = 0; i < t.length; i++) {<a name="line.2011"></a>
-<span class="sourceLineNo">2012</span> result[i] = Bytes.toBytesBinary(t[i]);<a name="line.2012"></a>
-<span class="sourceLineNo">2013</span> }<a name="line.2013"></a>
-<span class="sourceLineNo">2014</span> return result;<a name="line.2014"></a>
-<span class="sourceLineNo">2015</span> }<a name="line.2015"></a>
-<span class="sourceLineNo">2016</span><a name="line.2016"></a>
-<span class="sourceLineNo">2017</span> /**<a name="line.2017"></a>
-<span class="sourceLineNo">2018</span> * @param column operand<a name="line.2018"></a>
-<span class="sourceLineNo">2019</span> * @return A byte array of a byte array where first and only entry is<a name="line.2019"></a>
-<span class="sourceLineNo">2020</span> * <code>column</code><a name="line.2020"></a>
-<span class="sourceLineNo">2021</span> */<a name="line.2021"></a>
-<span class="sourceLineNo">2022</span> public static byte [][] toByteArrays(final String column) {<a name="line.2022"></a>
-<span class="sourceLineNo">2023</span> return toByteArrays(toBytes(column));<a name="line.2023"></a>
-<span class="sourceLineNo">2024</span> }<a name="line.2024"></a>
-<span class="sourceLineNo">2025</span><a name="line.2025"></a>
-<span class="sourceLineNo">2026</span> /**<a name="line.2026"></a>
-<span class="sourceLineNo">2027</span> * @param column operand<a name="line.2027"></a>
-<span class="sourceLineNo">2028</span> * @return A byte array of a byte array where first and only entry is<a name="line.2028"></a>
-<span class="sourceLineNo">2029</span> * <code>column</code><a name="line.2029"></a>
-<span class="sourceLineNo">2030</span> */<a name="line.2030"></a>
-<span class="sourceLineNo">2031</span> public static byte [][] toByteArrays(final byte [] column) {<a name="line.2031"></a>
-<span class="sourceLineNo">2032</span> byte [][] result = new byte[1][];<a name="line.2032"></a>
-<span class="sourceLineNo">2033</span> result[0] = column;<a name="line.2033"></a>
-<span class="sourceLineNo">2034</span> return result;<a name="line.2034"></a>
-<span class="sourceLineNo">2035</span> }<a name="line.2035"></a>
-<span class="sourceLineNo">2036</span><a name="line.2036"></a>
-<span class="sourceLineNo">2037</span> /**<a name="line.2037"></a>
-<span class="sourceLineNo">2038</span> * Binary search for keys in indexes.<a name="line.2038"></a>
-<span class="sourceLineNo">2039</span> *<a name="line.2039"></a>
-<span class="sourceLineNo">2040</span> * @param arr array of byte arrays to search for<a name="line.2040"></a>
-<span class="sourceLineNo">2041</span> * @param key the key you want to find<a name="line.2041"></a>
-<span class="sourceLineNo">2042</span> * @param offset the offset in the key you want to find<a name="line.2042"></a>
-<span class="sourceLineNo">2043</span> * @param length the length of the key<a name="line.2043"></a>
-<span class="sourceLineNo">2044</span> * @param comparator a comparator to compare.<a name="line.2044"></a>
-<span class="sourceLineNo">2045</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2045"></a>
-<span class="sourceLineNo">2046</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2046"></a>
-<span class="sourceLineNo">2047</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2047"></a>
-<span class="sourceLineNo">2048</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2048"></a>
-<span class="sourceLineNo">2049</span> * means that this function can return 2N + 1 different values<a name="line.2049"></a>
-<span class="sourceLineNo">2050</span> * ranging from -(N + 1) to N - 1.<a name="line.2050"></a>
-<span class="sourceLineNo">2051</span> * @deprecated {@link Bytes#binarySearch(byte[][], byte[], int, int)}<a name="line.2051"></a>
-<span class="sourceLineNo">2052</span> */<a name="line.2052"></a>
-<span class="sourceLineNo">2053</span> @Deprecated<a name="line.2053"></a>
-<span class="sourceLineNo">2054</span> public static int binarySearch(byte [][]arr, byte []key, int offset,<a name="line.2054"></a>
-<span class="sourceLineNo">2055</span> int length, RawComparator<?> comparator) {<a name="line.2055"></a>
-<span class="sourceLineNo">2056</span> return binarySearch(arr, key, offset, length);<a name="line.2056"></a>
-<span class="sourceLineNo">2057</span> }<a name="line.2057"></a>
-<span class="sourceLineNo">2058</span><a name="line.2058"></a>
-<span class="sourceLineNo">2059</span> /**<a name="line.2059"></a>
-<span class="sourceLineNo">2060</span> * Binary search for keys in indexes using Bytes.BYTES_RAWCOMPARATOR.<a name="line.2060"></a>
-<span class="sourceLineNo">2061</span> *<a name="line.2061"></a>
-<span class="sourceLineNo">2062</span> * @param arr array of byte arrays to search for<a name="line.2062"></a>
-<span class="sourceLineNo">2063</span> * @param key the key you want to find<a name="line.2063"></a>
-<span class="sourceLineNo">2064</span> * @param offset the offset in the key you want to find<a name="line.2064"></a>
-<span class="sourceLineNo">2065</span> * @param length the length of the key<a name="line.2065"></a>
-<span class="sourceLineNo">2066</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2066"></a>
-<span class="sourceLineNo">2067</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2067"></a>
-<span class="sourceLineNo">2068</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2068"></a>
-<span class="sourceLineNo">2069</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2069"></a>
-<span class="sourceLineNo">2070</span> * means that this function can return 2N + 1 different values<a name="line.2070"></a>
-<span class="sourceLineNo">2071</span> * ranging from -(N + 1) to N - 1.<a name="line.2071"></a>
-<span class="sourceLineNo">2072</span> */<a name="line.2072"></a>
-<span class="sourceLineNo">2073</span> public static int binarySearch(byte[][] arr, byte[] key, int offset, int length) {<a name="line.2073"></a>
-<span class="sourceLineNo">2074</span> int low = 0;<a name="line.2074"></a>
-<span class="sourceLineNo">2075</span> int high = arr.length - 1;<a name="line.2075"></a>
-<span class="sourceLineNo">2076</span><a name="line.2076"></a>
-<span class="sourceLineNo">2077</span> while (low <= high) {<a name="line.2077"></a>
-<span class="sourceLineNo">2078</span> int mid = (low + high) >>> 1;<a name="line.2078"></a>
-<span class="sourceLineNo">2079</span> // we have to compare in this order, because the comparator order<a name="line.2079"></a>
-<span class="sourceLineNo">2080</span> // has special logic when the 'left side' is a special key.<a name="line.2080"></a>
-<span class="sourceLineNo">2081</span> int cmp = Bytes.BYTES_RAWCOMPARATOR<a name="line.2081"></a>
-<span class="sourceLineNo">2082</span> .compare(key, offset, length, arr[mid], 0, arr[mid].length);<a name="line.2082"></a>
-<span class="sourceLineNo">2083</span> // key lives above the midpoint<a name="line.2083"></a>
-<span class="sourceLineNo">2084</span> if (cmp > 0)<a name="line.2084"></a>
-<span class="sourceLineNo">2085</span> low = mid + 1;<a name="line.2085"></a>
-<span class="sourceLineNo">2086</span> // key lives below the midpoint<a name="line.2086"></a>
-<span class="sourceLineNo">2087</span> else if (cmp < 0)<a name="line.2087"></a>
-<span class="sourceLineNo">2088</span> high = mid - 1;<a name="line.2088"></a>
-<span class="sourceLineNo">2089</span> // BAM. how often does this really happen?<a name="line.2089"></a>
-<span class="sourceLineNo">2090</span> else<a name="line.2090"></a>
-<span class="sourceLineNo">2091</span> return mid;<a name="line.2091"></a>
-<span class="sourceLineNo">2092</span> }<a name="line.2092"></a>
-<span class="sourceLineNo">2093</span> return -(low + 1);<a name="line.2093"></a>
-<span class="sourceLineNo">2094</span> }<a name="line.2094"></a>
-<span class="sourceLineNo">2095</span><a name="line.2095"></a>
-<span class="sourceLineNo">2096</span> /**<a name="line.2096"></a>
-<span class="sourceLineNo">2097</span> * Binary search for keys in indexes.<a name="line.2097"></a>
-<span class="sourceLineNo">2098</span> *<a name="line.2098"></a>
-<span class="sourceLineNo">2099</span> * @param arr array of byte arrays to search for<a name="line.2099"></a>
-<span class="sourceLineNo">2100</span> * @param key the key you want to find<a name="line.2100"></a>
-<span class="sourceLineNo">2101</span> * @param comparator a comparator to compare.<a name="line.2101"></a>
-<span class="sourceLineNo">2102</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2102"></a>
-<span class="sourceLineNo">2103</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2103"></a>
-<span class="sourceLineNo">2104</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2104"></a>
-<span class="sourceLineNo">2105</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2105"></a>
-<span class="sourceLineNo">2106</span> * means that this function can return 2N + 1 different values<a name="line.2106"></a>
-<span class="sourceLineNo">2107</span> * ranging from -(N + 1) to N - 1.<a name="line.2107"></a>
-<span class="sourceLineNo">2108</span> * @return the index of the block<a name="line.2108"></a>
-<span class="sourceLineNo">2109</span> * @deprecated Use {@link Bytes#binarySearch(Cell[], Cell, CellComparator)}<a name="line.2109"></a>
-<span class="sourceLineNo">2110</span> */<a name="line.2110"></a>
-<span class="sourceLineNo">2111</span> @Deprecated<a name="line.2111"></a>
-<span class="sourceLineNo">2112</span> public static int binarySearch(byte[][] arr, Cell key, RawComparator<Cell> comparator) {<a name="line.2112"></a>
-<span class="sourceLineNo">2113</span> int low = 0;<a name="line.2113"></a>
-<span class="sourceLineNo">2114</span> int high = arr.length - 1;<a name="line.2114"></a>
-<span class="sourceLineNo">2115</span> KeyValue.KeyOnlyKeyValue r = new KeyValue.KeyOnlyKeyValue();<a name="line.2115"></a>
<TRUNCATED>
[07/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.Comparer.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.Comparer.html b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.Comparer.html
index 3c7d6b4..3dea877 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.Comparer.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.Comparer.html
@@ -1583,1089 +1583,1084 @@
<span class="sourceLineNo">1575</span> length1 == length2) {<a name="line.1575"></a>
<span class="sourceLineNo">1576</span> return 0;<a name="line.1576"></a>
<span class="sourceLineNo">1577</span> }<a name="line.1577"></a>
-<span class="sourceLineNo">1578</span> final int minLength = Math.min(length1, length2);<a name="line.1578"></a>
-<span class="sourceLineNo">1579</span> final int minWords = minLength / SIZEOF_LONG;<a name="line.1579"></a>
-<span class="sourceLineNo">1580</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1580"></a>
-<span class="sourceLineNo">1581</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
-<span class="sourceLineNo">1582</span><a name="line.1582"></a>
-<span class="sourceLineNo">1583</span> /*<a name="line.1583"></a>
-<span class="sourceLineNo">1584</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a<a name="line.1584"></a>
-<span class="sourceLineNo">1585</span> * time is no slower than comparing 4 bytes at a time even on 32-bit.<a name="line.1585"></a>
-<span class="sourceLineNo">1586</span> * On the other hand, it is substantially faster on 64-bit.<a name="line.1586"></a>
-<span class="sourceLineNo">1587</span> */<a name="line.1587"></a>
-<span class="sourceLineNo">1588</span> // This is the end offset of long parts.<a name="line.1588"></a>
-<span class="sourceLineNo">1589</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.1589"></a>
-<span class="sourceLineNo">1590</span> for (int i = 0; i < j; i += SIZEOF_LONG) {<a name="line.1590"></a>
-<span class="sourceLineNo">1591</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1591"></a>
-<span class="sourceLineNo">1592</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1592"></a>
-<span class="sourceLineNo">1593</span> long diff = lw ^ rw;<a name="line.1593"></a>
-<span class="sourceLineNo">1594</span> if (diff != 0) {<a name="line.1594"></a>
-<span class="sourceLineNo">1595</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.1595"></a>
-<span class="sourceLineNo">1596</span> }<a name="line.1596"></a>
-<span class="sourceLineNo">1597</span> }<a name="line.1597"></a>
-<span class="sourceLineNo">1598</span> int offset = j;<a name="line.1598"></a>
-<span class="sourceLineNo">1599</span><a name="line.1599"></a>
-<span class="sourceLineNo">1600</span> if (minLength - offset >= SIZEOF_INT) {<a name="line.1600"></a>
-<span class="sourceLineNo">1601</span> int il = theUnsafe.getInt(buffer1, offset1Adj + offset);<a name="line.1601"></a>
-<span class="sourceLineNo">1602</span> int ir = theUnsafe.getInt(buffer2, offset2Adj + offset);<a name="line.1602"></a>
-<span class="sourceLineNo">1603</span> if (il != ir) {<a name="line.1603"></a>
-<span class="sourceLineNo">1604</span> return lessThanUnsignedInt(il, ir) ? -1: 1;<a name="line.1604"></a>
-<span class="sourceLineNo">1605</span> }<a name="line.1605"></a>
-<span class="sourceLineNo">1606</span> offset += SIZEOF_INT;<a name="line.1606"></a>
-<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
-<span class="sourceLineNo">1608</span> if (minLength - offset >= SIZEOF_SHORT) {<a name="line.1608"></a>
-<span class="sourceLineNo">1609</span> short sl = theUnsafe.getShort(buffer1, offset1Adj + offset);<a name="line.1609"></a>
-<span class="sourceLineNo">1610</span> short sr = theUnsafe.getShort(buffer2, offset2Adj + offset);<a name="line.1610"></a>
-<span class="sourceLineNo">1611</span> if (sl != sr) {<a name="line.1611"></a>
-<span class="sourceLineNo">1612</span> return lessThanUnsignedShort(sl, sr) ? -1: 1;<a name="line.1612"></a>
-<span class="sourceLineNo">1613</span> }<a name="line.1613"></a>
-<span class="sourceLineNo">1614</span> offset += SIZEOF_SHORT;<a name="line.1614"></a>
-<span class="sourceLineNo">1615</span> }<a name="line.1615"></a>
-<span class="sourceLineNo">1616</span> if (minLength - offset == 1) {<a name="line.1616"></a>
-<span class="sourceLineNo">1617</span> int a = (buffer1[(int)(offset1 + offset)] & 0xff);<a name="line.1617"></a>
-<span class="sourceLineNo">1618</span> int b = (buffer2[(int)(offset2 + offset)] & 0xff);<a name="line.1618"></a>
-<span class="sourceLineNo">1619</span> if (a != b) {<a name="line.1619"></a>
-<span class="sourceLineNo">1620</span> return a - b;<a name="line.1620"></a>
-<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
-<span class="sourceLineNo">1622</span> }<a name="line.1622"></a>
-<span class="sourceLineNo">1623</span> return length1 - length2;<a name="line.1623"></a>
-<span class="sourceLineNo">1624</span> }<a name="line.1624"></a>
-<span class="sourceLineNo">1625</span> }<a name="line.1625"></a>
-<span class="sourceLineNo">1626</span> }<a name="line.1626"></a>
-<span class="sourceLineNo">1627</span><a name="line.1627"></a>
-<span class="sourceLineNo">1628</span> /**<a name="line.1628"></a>
-<span class="sourceLineNo">1629</span> * @param left left operand<a name="line.1629"></a>
-<span class="sourceLineNo">1630</span> * @param right right operand<a name="line.1630"></a>
-<span class="sourceLineNo">1631</span> * @return True if equal<a name="line.1631"></a>
-<span class="sourceLineNo">1632</span> */<a name="line.1632"></a>
-<span class="sourceLineNo">1633</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1633"></a>
-<span class="sourceLineNo">1634</span> // Could use Arrays.equals?<a name="line.1634"></a>
-<span class="sourceLineNo">1635</span> //noinspection SimplifiableConditionalExpression<a name="line.1635"></a>
-<span class="sourceLineNo">1636</span> if (left == right) return true;<a name="line.1636"></a>
-<span class="sourceLineNo">1637</span> if (left == null || right == null) return false;<a name="line.1637"></a>
-<span class="sourceLineNo">1638</span> if (left.length != right.length) return false;<a name="line.1638"></a>
-<span class="sourceLineNo">1639</span> if (left.length == 0) return true;<a name="line.1639"></a>
+<span class="sourceLineNo">1578</span> final int stride = 8;<a name="line.1578"></a>
+<span class="sourceLineNo">1579</span> final int minLength = Math.min(length1, length2);<a name="line.1579"></a>
+<span class="sourceLineNo">1580</span> int strideLimit = minLength & ~(stride - 1);<a name="line.1580"></a>
+<span class="sourceLineNo">1581</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
+<span class="sourceLineNo">1582</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1582"></a>
+<span class="sourceLineNo">1583</span> int i;<a name="line.1583"></a>
+<span class="sourceLineNo">1584</span><a name="line.1584"></a>
+<span class="sourceLineNo">1585</span> /*<a name="line.1585"></a>
+<span class="sourceLineNo">1586</span> * Compare 8 bytes at a time. Benchmarking on x86 shows a stride of 8 bytes is no slower<a name="line.1586"></a>
+<span class="sourceLineNo">1587</span> * than 4 bytes even on 32-bit. On the other hand, it is substantially faster on 64-bit.<a name="line.1587"></a>
+<span class="sourceLineNo">1588</span> */<a name="line.1588"></a>
+<span class="sourceLineNo">1589</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.1589"></a>
+<span class="sourceLineNo">1590</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1590"></a>
+<span class="sourceLineNo">1591</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1591"></a>
+<span class="sourceLineNo">1592</span> if (lw != rw) {<a name="line.1592"></a>
+<span class="sourceLineNo">1593</span> if(!UnsafeAccess.littleEndian) {<a name="line.1593"></a>
+<span class="sourceLineNo">1594</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.1594"></a>
+<span class="sourceLineNo">1595</span> }<a name="line.1595"></a>
+<span class="sourceLineNo">1596</span><a name="line.1596"></a>
+<span class="sourceLineNo">1597</span> /*<a name="line.1597"></a>
+<span class="sourceLineNo">1598</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.1598"></a>
+<span class="sourceLineNo">1599</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.1599"></a>
+<span class="sourceLineNo">1600</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.1600"></a>
+<span class="sourceLineNo">1601</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.1601"></a>
+<span class="sourceLineNo">1602</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.1602"></a>
+<span class="sourceLineNo">1603</span> * comparator from guava v21<a name="line.1603"></a>
+<span class="sourceLineNo">1604</span> */<a name="line.1604"></a>
+<span class="sourceLineNo">1605</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.1605"></a>
+<span class="sourceLineNo">1606</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.1606"></a>
+<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
+<span class="sourceLineNo">1608</span> }<a name="line.1608"></a>
+<span class="sourceLineNo">1609</span><a name="line.1609"></a>
+<span class="sourceLineNo">1610</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.1610"></a>
+<span class="sourceLineNo">1611</span> for (; i < minLength; i++) {<a name="line.1611"></a>
+<span class="sourceLineNo">1612</span> int a = (buffer1[offset1 + i] & 0xFF);<a name="line.1612"></a>
+<span class="sourceLineNo">1613</span> int b = (buffer2[offset2 + i] & 0xFF);<a name="line.1613"></a>
+<span class="sourceLineNo">1614</span> if (a != b) {<a name="line.1614"></a>
+<span class="sourceLineNo">1615</span> return a - b;<a name="line.1615"></a>
+<span class="sourceLineNo">1616</span> }<a name="line.1616"></a>
+<span class="sourceLineNo">1617</span> }<a name="line.1617"></a>
+<span class="sourceLineNo">1618</span> return length1 - length2;<a name="line.1618"></a>
+<span class="sourceLineNo">1619</span> }<a name="line.1619"></a>
+<span class="sourceLineNo">1620</span> }<a name="line.1620"></a>
+<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
+<span class="sourceLineNo">1622</span><a name="line.1622"></a>
+<span class="sourceLineNo">1623</span> /**<a name="line.1623"></a>
+<span class="sourceLineNo">1624</span> * @param left left operand<a name="line.1624"></a>
+<span class="sourceLineNo">1625</span> * @param right right operand<a name="line.1625"></a>
+<span class="sourceLineNo">1626</span> * @return True if equal<a name="line.1626"></a>
+<span class="sourceLineNo">1627</span> */<a name="line.1627"></a>
+<span class="sourceLineNo">1628</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1628"></a>
+<span class="sourceLineNo">1629</span> // Could use Arrays.equals?<a name="line.1629"></a>
+<span class="sourceLineNo">1630</span> //noinspection SimplifiableConditionalExpression<a name="line.1630"></a>
+<span class="sourceLineNo">1631</span> if (left == right) return true;<a name="line.1631"></a>
+<span class="sourceLineNo">1632</span> if (left == null || right == null) return false;<a name="line.1632"></a>
+<span class="sourceLineNo">1633</span> if (left.length != right.length) return false;<a name="line.1633"></a>
+<span class="sourceLineNo">1634</span> if (left.length == 0) return true;<a name="line.1634"></a>
+<span class="sourceLineNo">1635</span><a name="line.1635"></a>
+<span class="sourceLineNo">1636</span> // Since we're often comparing adjacent sorted data,<a name="line.1636"></a>
+<span class="sourceLineNo">1637</span> // it's usual to have equal arrays except for the very last byte<a name="line.1637"></a>
+<span class="sourceLineNo">1638</span> // so check that first<a name="line.1638"></a>
+<span class="sourceLineNo">1639</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1639"></a>
<span class="sourceLineNo">1640</span><a name="line.1640"></a>
-<span class="sourceLineNo">1641</span> // Since we're often comparing adjacent sorted data,<a name="line.1641"></a>
-<span class="sourceLineNo">1642</span> // it's usual to have equal arrays except for the very last byte<a name="line.1642"></a>
-<span class="sourceLineNo">1643</span> // so check that first<a name="line.1643"></a>
-<span class="sourceLineNo">1644</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1644"></a>
-<span class="sourceLineNo">1645</span><a name="line.1645"></a>
-<span class="sourceLineNo">1646</span> return compareTo(left, right) == 0;<a name="line.1646"></a>
-<span class="sourceLineNo">1647</span> }<a name="line.1647"></a>
-<span class="sourceLineNo">1648</span><a name="line.1648"></a>
-<span class="sourceLineNo">1649</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1649"></a>
-<span class="sourceLineNo">1650</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1650"></a>
-<span class="sourceLineNo">1651</span> // short circuit case<a name="line.1651"></a>
-<span class="sourceLineNo">1652</span> if (left == right &&<a name="line.1652"></a>
-<span class="sourceLineNo">1653</span> leftOffset == rightOffset &&<a name="line.1653"></a>
-<span class="sourceLineNo">1654</span> leftLen == rightLen) {<a name="line.1654"></a>
-<span class="sourceLineNo">1655</span> return true;<a name="line.1655"></a>
-<span class="sourceLineNo">1656</span> }<a name="line.1656"></a>
-<span class="sourceLineNo">1657</span> // different lengths fast check<a name="line.1657"></a>
-<span class="sourceLineNo">1658</span> if (leftLen != rightLen) {<a name="line.1658"></a>
-<span class="sourceLineNo">1659</span> return false;<a name="line.1659"></a>
-<span class="sourceLineNo">1660</span> }<a name="line.1660"></a>
-<span class="sourceLineNo">1661</span> if (leftLen == 0) {<a name="line.1661"></a>
-<span class="sourceLineNo">1662</span> return true;<a name="line.1662"></a>
-<span class="sourceLineNo">1663</span> }<a name="line.1663"></a>
+<span class="sourceLineNo">1641</span> return compareTo(left, right) == 0;<a name="line.1641"></a>
+<span class="sourceLineNo">1642</span> }<a name="line.1642"></a>
+<span class="sourceLineNo">1643</span><a name="line.1643"></a>
+<span class="sourceLineNo">1644</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1644"></a>
+<span class="sourceLineNo">1645</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1645"></a>
+<span class="sourceLineNo">1646</span> // short circuit case<a name="line.1646"></a>
+<span class="sourceLineNo">1647</span> if (left == right &&<a name="line.1647"></a>
+<span class="sourceLineNo">1648</span> leftOffset == rightOffset &&<a name="line.1648"></a>
+<span class="sourceLineNo">1649</span> leftLen == rightLen) {<a name="line.1649"></a>
+<span class="sourceLineNo">1650</span> return true;<a name="line.1650"></a>
+<span class="sourceLineNo">1651</span> }<a name="line.1651"></a>
+<span class="sourceLineNo">1652</span> // different lengths fast check<a name="line.1652"></a>
+<span class="sourceLineNo">1653</span> if (leftLen != rightLen) {<a name="line.1653"></a>
+<span class="sourceLineNo">1654</span> return false;<a name="line.1654"></a>
+<span class="sourceLineNo">1655</span> }<a name="line.1655"></a>
+<span class="sourceLineNo">1656</span> if (leftLen == 0) {<a name="line.1656"></a>
+<span class="sourceLineNo">1657</span> return true;<a name="line.1657"></a>
+<span class="sourceLineNo">1658</span> }<a name="line.1658"></a>
+<span class="sourceLineNo">1659</span><a name="line.1659"></a>
+<span class="sourceLineNo">1660</span> // Since we're often comparing adjacent sorted data,<a name="line.1660"></a>
+<span class="sourceLineNo">1661</span> // it's usual to have equal arrays except for the very last byte<a name="line.1661"></a>
+<span class="sourceLineNo">1662</span> // so check that first<a name="line.1662"></a>
+<span class="sourceLineNo">1663</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1663"></a>
<span class="sourceLineNo">1664</span><a name="line.1664"></a>
-<span class="sourceLineNo">1665</span> // Since we're often comparing adjacent sorted data,<a name="line.1665"></a>
-<span class="sourceLineNo">1666</span> // it's usual to have equal arrays except for the very last byte<a name="line.1666"></a>
-<span class="sourceLineNo">1667</span> // so check that first<a name="line.1667"></a>
-<span class="sourceLineNo">1668</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1668"></a>
+<span class="sourceLineNo">1665</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1665"></a>
+<span class="sourceLineNo">1666</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1666"></a>
+<span class="sourceLineNo">1667</span> }<a name="line.1667"></a>
+<span class="sourceLineNo">1668</span><a name="line.1668"></a>
<span class="sourceLineNo">1669</span><a name="line.1669"></a>
-<span class="sourceLineNo">1670</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1670"></a>
-<span class="sourceLineNo">1671</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1671"></a>
-<span class="sourceLineNo">1672</span> }<a name="line.1672"></a>
-<span class="sourceLineNo">1673</span><a name="line.1673"></a>
-<span class="sourceLineNo">1674</span><a name="line.1674"></a>
-<span class="sourceLineNo">1675</span> /**<a name="line.1675"></a>
-<span class="sourceLineNo">1676</span> * @param a left operand<a name="line.1676"></a>
-<span class="sourceLineNo">1677</span> * @param buf right operand<a name="line.1677"></a>
-<span class="sourceLineNo">1678</span> * @return True if equal<a name="line.1678"></a>
-<span class="sourceLineNo">1679</span> */<a name="line.1679"></a>
-<span class="sourceLineNo">1680</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1680"></a>
-<span class="sourceLineNo">1681</span> if (a == null) return buf == null;<a name="line.1681"></a>
-<span class="sourceLineNo">1682</span> if (buf == null) return false;<a name="line.1682"></a>
-<span class="sourceLineNo">1683</span> if (a.length != buf.remaining()) return false;<a name="line.1683"></a>
-<span class="sourceLineNo">1684</span><a name="line.1684"></a>
-<span class="sourceLineNo">1685</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1685"></a>
-<span class="sourceLineNo">1686</span> ByteBuffer b = buf.duplicate();<a name="line.1686"></a>
-<span class="sourceLineNo">1687</span> for (byte anA : a) {<a name="line.1687"></a>
-<span class="sourceLineNo">1688</span> if (anA != b.get()) {<a name="line.1688"></a>
-<span class="sourceLineNo">1689</span> return false;<a name="line.1689"></a>
-<span class="sourceLineNo">1690</span> }<a name="line.1690"></a>
-<span class="sourceLineNo">1691</span> }<a name="line.1691"></a>
-<span class="sourceLineNo">1692</span> return true;<a name="line.1692"></a>
-<span class="sourceLineNo">1693</span> }<a name="line.1693"></a>
-<span class="sourceLineNo">1694</span><a name="line.1694"></a>
-<span class="sourceLineNo">1695</span><a name="line.1695"></a>
-<span class="sourceLineNo">1696</span> /**<a name="line.1696"></a>
-<span class="sourceLineNo">1697</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1697"></a>
-<span class="sourceLineNo">1698</span> * array on the left.<a name="line.1698"></a>
-<span class="sourceLineNo">1699</span> */<a name="line.1699"></a>
-<span class="sourceLineNo">1700</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1700"></a>
-<span class="sourceLineNo">1701</span> return bytes != null && prefix != null &&<a name="line.1701"></a>
-<span class="sourceLineNo">1702</span> bytes.length >= prefix.length &&<a name="line.1702"></a>
-<span class="sourceLineNo">1703</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1703"></a>
-<span class="sourceLineNo">1704</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1704"></a>
-<span class="sourceLineNo">1705</span> }<a name="line.1705"></a>
-<span class="sourceLineNo">1706</span><a name="line.1706"></a>
-<span class="sourceLineNo">1707</span> /**<a name="line.1707"></a>
-<span class="sourceLineNo">1708</span> * @param b bytes to hash<a name="line.1708"></a>
-<span class="sourceLineNo">1709</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1709"></a>
-<span class="sourceLineNo">1710</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1710"></a>
-<span class="sourceLineNo">1711</span> * use calculating hash code.<a name="line.1711"></a>
-<span class="sourceLineNo">1712</span> */<a name="line.1712"></a>
-<span class="sourceLineNo">1713</span> public static int hashCode(final byte [] b) {<a name="line.1713"></a>
-<span class="sourceLineNo">1714</span> return hashCode(b, b.length);<a name="line.1714"></a>
-<span class="sourceLineNo">1715</span> }<a name="line.1715"></a>
-<span class="sourceLineNo">1716</span><a name="line.1716"></a>
-<span class="sourceLineNo">1717</span> /**<a name="line.1717"></a>
-<span class="sourceLineNo">1718</span> * @param b value<a name="line.1718"></a>
-<span class="sourceLineNo">1719</span> * @param length length of the value<a name="line.1719"></a>
-<span class="sourceLineNo">1720</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1720"></a>
-<span class="sourceLineNo">1721</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1721"></a>
-<span class="sourceLineNo">1722</span> * use calculating hash code.<a name="line.1722"></a>
-<span class="sourceLineNo">1723</span> */<a name="line.1723"></a>
-<span class="sourceLineNo">1724</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1724"></a>
-<span class="sourceLineNo">1725</span> return WritableComparator.hashBytes(b, length);<a name="line.1725"></a>
-<span class="sourceLineNo">1726</span> }<a name="line.1726"></a>
-<span class="sourceLineNo">1727</span><a name="line.1727"></a>
-<span class="sourceLineNo">1728</span> /**<a name="line.1728"></a>
-<span class="sourceLineNo">1729</span> * @param b bytes to hash<a name="line.1729"></a>
-<span class="sourceLineNo">1730</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1730"></a>
-<span class="sourceLineNo">1731</span> * Maps.<a name="line.1731"></a>
-<span class="sourceLineNo">1732</span> */<a name="line.1732"></a>
-<span class="sourceLineNo">1733</span> public static Integer mapKey(final byte [] b) {<a name="line.1733"></a>
-<span class="sourceLineNo">1734</span> return hashCode(b);<a name="line.1734"></a>
-<span class="sourceLineNo">1735</span> }<a name="line.1735"></a>
-<span class="sourceLineNo">1736</span><a name="line.1736"></a>
-<span class="sourceLineNo">1737</span> /**<a name="line.1737"></a>
-<span class="sourceLineNo">1738</span> * @param b bytes to hash<a name="line.1738"></a>
-<span class="sourceLineNo">1739</span> * @param length length to hash<a name="line.1739"></a>
-<span class="sourceLineNo">1740</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1740"></a>
-<span class="sourceLineNo">1741</span> * Maps.<a name="line.1741"></a>
-<span class="sourceLineNo">1742</span> */<a name="line.1742"></a>
-<span class="sourceLineNo">1743</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1743"></a>
-<span class="sourceLineNo">1744</span> return hashCode(b, length);<a name="line.1744"></a>
-<span class="sourceLineNo">1745</span> }<a name="line.1745"></a>
-<span class="sourceLineNo">1746</span><a name="line.1746"></a>
-<span class="sourceLineNo">1747</span> /**<a name="line.1747"></a>
-<span class="sourceLineNo">1748</span> * @param a lower half<a name="line.1748"></a>
-<span class="sourceLineNo">1749</span> * @param b upper half<a name="line.1749"></a>
-<span class="sourceLineNo">1750</span> * @return New array that has a in lower half and b in upper half.<a name="line.1750"></a>
-<span class="sourceLineNo">1751</span> */<a name="line.1751"></a>
-<span class="sourceLineNo">1752</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1752"></a>
-<span class="sourceLineNo">1753</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1753"></a>
-<span class="sourceLineNo">1754</span> }<a name="line.1754"></a>
-<span class="sourceLineNo">1755</span><a name="line.1755"></a>
-<span class="sourceLineNo">1756</span> /**<a name="line.1756"></a>
-<span class="sourceLineNo">1757</span> * @param a first third<a name="line.1757"></a>
-<span class="sourceLineNo">1758</span> * @param b second third<a name="line.1758"></a>
-<span class="sourceLineNo">1759</span> * @param c third third<a name="line.1759"></a>
-<span class="sourceLineNo">1760</span> * @return New array made from a, b and c<a name="line.1760"></a>
-<span class="sourceLineNo">1761</span> */<a name="line.1761"></a>
-<span class="sourceLineNo">1762</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1762"></a>
-<span class="sourceLineNo">1763</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1763"></a>
-<span class="sourceLineNo">1764</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1764"></a>
-<span class="sourceLineNo">1765</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1765"></a>
-<span class="sourceLineNo">1766</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1766"></a>
-<span class="sourceLineNo">1767</span> return result;<a name="line.1767"></a>
-<span class="sourceLineNo">1768</span> }<a name="line.1768"></a>
-<span class="sourceLineNo">1769</span><a name="line.1769"></a>
-<span class="sourceLineNo">1770</span> /**<a name="line.1770"></a>
-<span class="sourceLineNo">1771</span> * @param arrays all the arrays to concatenate together.<a name="line.1771"></a>
-<span class="sourceLineNo">1772</span> * @return New array made from the concatenation of the given arrays.<a name="line.1772"></a>
-<span class="sourceLineNo">1773</span> */<a name="line.1773"></a>
-<span class="sourceLineNo">1774</span> public static byte [] add(final byte [][] arrays) {<a name="line.1774"></a>
-<span class="sourceLineNo">1775</span> int length = 0;<a name="line.1775"></a>
+<span class="sourceLineNo">1670</span> /**<a name="line.1670"></a>
+<span class="sourceLineNo">1671</span> * @param a left operand<a name="line.1671"></a>
+<span class="sourceLineNo">1672</span> * @param buf right operand<a name="line.1672"></a>
+<span class="sourceLineNo">1673</span> * @return True if equal<a name="line.1673"></a>
+<span class="sourceLineNo">1674</span> */<a name="line.1674"></a>
+<span class="sourceLineNo">1675</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1675"></a>
+<span class="sourceLineNo">1676</span> if (a == null) return buf == null;<a name="line.1676"></a>
+<span class="sourceLineNo">1677</span> if (buf == null) return false;<a name="line.1677"></a>
+<span class="sourceLineNo">1678</span> if (a.length != buf.remaining()) return false;<a name="line.1678"></a>
+<span class="sourceLineNo">1679</span><a name="line.1679"></a>
+<span class="sourceLineNo">1680</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1680"></a>
+<span class="sourceLineNo">1681</span> ByteBuffer b = buf.duplicate();<a name="line.1681"></a>
+<span class="sourceLineNo">1682</span> for (byte anA : a) {<a name="line.1682"></a>
+<span class="sourceLineNo">1683</span> if (anA != b.get()) {<a name="line.1683"></a>
+<span class="sourceLineNo">1684</span> return false;<a name="line.1684"></a>
+<span class="sourceLineNo">1685</span> }<a name="line.1685"></a>
+<span class="sourceLineNo">1686</span> }<a name="line.1686"></a>
+<span class="sourceLineNo">1687</span> return true;<a name="line.1687"></a>
+<span class="sourceLineNo">1688</span> }<a name="line.1688"></a>
+<span class="sourceLineNo">1689</span><a name="line.1689"></a>
+<span class="sourceLineNo">1690</span><a name="line.1690"></a>
+<span class="sourceLineNo">1691</span> /**<a name="line.1691"></a>
+<span class="sourceLineNo">1692</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1692"></a>
+<span class="sourceLineNo">1693</span> * array on the left.<a name="line.1693"></a>
+<span class="sourceLineNo">1694</span> */<a name="line.1694"></a>
+<span class="sourceLineNo">1695</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1695"></a>
+<span class="sourceLineNo">1696</span> return bytes != null && prefix != null &&<a name="line.1696"></a>
+<span class="sourceLineNo">1697</span> bytes.length >= prefix.length &&<a name="line.1697"></a>
+<span class="sourceLineNo">1698</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1698"></a>
+<span class="sourceLineNo">1699</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1699"></a>
+<span class="sourceLineNo">1700</span> }<a name="line.1700"></a>
+<span class="sourceLineNo">1701</span><a name="line.1701"></a>
+<span class="sourceLineNo">1702</span> /**<a name="line.1702"></a>
+<span class="sourceLineNo">1703</span> * @param b bytes to hash<a name="line.1703"></a>
+<span class="sourceLineNo">1704</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1704"></a>
+<span class="sourceLineNo">1705</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1705"></a>
+<span class="sourceLineNo">1706</span> * use calculating hash code.<a name="line.1706"></a>
+<span class="sourceLineNo">1707</span> */<a name="line.1707"></a>
+<span class="sourceLineNo">1708</span> public static int hashCode(final byte [] b) {<a name="line.1708"></a>
+<span class="sourceLineNo">1709</span> return hashCode(b, b.length);<a name="line.1709"></a>
+<span class="sourceLineNo">1710</span> }<a name="line.1710"></a>
+<span class="sourceLineNo">1711</span><a name="line.1711"></a>
+<span class="sourceLineNo">1712</span> /**<a name="line.1712"></a>
+<span class="sourceLineNo">1713</span> * @param b value<a name="line.1713"></a>
+<span class="sourceLineNo">1714</span> * @param length length of the value<a name="line.1714"></a>
+<span class="sourceLineNo">1715</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1715"></a>
+<span class="sourceLineNo">1716</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1716"></a>
+<span class="sourceLineNo">1717</span> * use calculating hash code.<a name="line.1717"></a>
+<span class="sourceLineNo">1718</span> */<a name="line.1718"></a>
+<span class="sourceLineNo">1719</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1719"></a>
+<span class="sourceLineNo">1720</span> return WritableComparator.hashBytes(b, length);<a name="line.1720"></a>
+<span class="sourceLineNo">1721</span> }<a name="line.1721"></a>
+<span class="sourceLineNo">1722</span><a name="line.1722"></a>
+<span class="sourceLineNo">1723</span> /**<a name="line.1723"></a>
+<span class="sourceLineNo">1724</span> * @param b bytes to hash<a name="line.1724"></a>
+<span class="sourceLineNo">1725</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1725"></a>
+<span class="sourceLineNo">1726</span> * Maps.<a name="line.1726"></a>
+<span class="sourceLineNo">1727</span> */<a name="line.1727"></a>
+<span class="sourceLineNo">1728</span> public static Integer mapKey(final byte [] b) {<a name="line.1728"></a>
+<span class="sourceLineNo">1729</span> return hashCode(b);<a name="line.1729"></a>
+<span class="sourceLineNo">1730</span> }<a name="line.1730"></a>
+<span class="sourceLineNo">1731</span><a name="line.1731"></a>
+<span class="sourceLineNo">1732</span> /**<a name="line.1732"></a>
+<span class="sourceLineNo">1733</span> * @param b bytes to hash<a name="line.1733"></a>
+<span class="sourceLineNo">1734</span> * @param length length to hash<a name="line.1734"></a>
+<span class="sourceLineNo">1735</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1735"></a>
+<span class="sourceLineNo">1736</span> * Maps.<a name="line.1736"></a>
+<span class="sourceLineNo">1737</span> */<a name="line.1737"></a>
+<span class="sourceLineNo">1738</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1738"></a>
+<span class="sourceLineNo">1739</span> return hashCode(b, length);<a name="line.1739"></a>
+<span class="sourceLineNo">1740</span> }<a name="line.1740"></a>
+<span class="sourceLineNo">1741</span><a name="line.1741"></a>
+<span class="sourceLineNo">1742</span> /**<a name="line.1742"></a>
+<span class="sourceLineNo">1743</span> * @param a lower half<a name="line.1743"></a>
+<span class="sourceLineNo">1744</span> * @param b upper half<a name="line.1744"></a>
+<span class="sourceLineNo">1745</span> * @return New array that has a in lower half and b in upper half.<a name="line.1745"></a>
+<span class="sourceLineNo">1746</span> */<a name="line.1746"></a>
+<span class="sourceLineNo">1747</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1747"></a>
+<span class="sourceLineNo">1748</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1748"></a>
+<span class="sourceLineNo">1749</span> }<a name="line.1749"></a>
+<span class="sourceLineNo">1750</span><a name="line.1750"></a>
+<span class="sourceLineNo">1751</span> /**<a name="line.1751"></a>
+<span class="sourceLineNo">1752</span> * @param a first third<a name="line.1752"></a>
+<span class="sourceLineNo">1753</span> * @param b second third<a name="line.1753"></a>
+<span class="sourceLineNo">1754</span> * @param c third third<a name="line.1754"></a>
+<span class="sourceLineNo">1755</span> * @return New array made from a, b and c<a name="line.1755"></a>
+<span class="sourceLineNo">1756</span> */<a name="line.1756"></a>
+<span class="sourceLineNo">1757</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1757"></a>
+<span class="sourceLineNo">1758</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1758"></a>
+<span class="sourceLineNo">1759</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1759"></a>
+<span class="sourceLineNo">1760</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1760"></a>
+<span class="sourceLineNo">1761</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1761"></a>
+<span class="sourceLineNo">1762</span> return result;<a name="line.1762"></a>
+<span class="sourceLineNo">1763</span> }<a name="line.1763"></a>
+<span class="sourceLineNo">1764</span><a name="line.1764"></a>
+<span class="sourceLineNo">1765</span> /**<a name="line.1765"></a>
+<span class="sourceLineNo">1766</span> * @param arrays all the arrays to concatenate together.<a name="line.1766"></a>
+<span class="sourceLineNo">1767</span> * @return New array made from the concatenation of the given arrays.<a name="line.1767"></a>
+<span class="sourceLineNo">1768</span> */<a name="line.1768"></a>
+<span class="sourceLineNo">1769</span> public static byte [] add(final byte [][] arrays) {<a name="line.1769"></a>
+<span class="sourceLineNo">1770</span> int length = 0;<a name="line.1770"></a>
+<span class="sourceLineNo">1771</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1771"></a>
+<span class="sourceLineNo">1772</span> length += arrays[i].length;<a name="line.1772"></a>
+<span class="sourceLineNo">1773</span> }<a name="line.1773"></a>
+<span class="sourceLineNo">1774</span> byte [] result = new byte[length];<a name="line.1774"></a>
+<span class="sourceLineNo">1775</span> int index = 0;<a name="line.1775"></a>
<span class="sourceLineNo">1776</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1776"></a>
-<span class="sourceLineNo">1777</span> length += arrays[i].length;<a name="line.1777"></a>
-<span class="sourceLineNo">1778</span> }<a name="line.1778"></a>
-<span class="sourceLineNo">1779</span> byte [] result = new byte[length];<a name="line.1779"></a>
-<span class="sourceLineNo">1780</span> int index = 0;<a name="line.1780"></a>
-<span class="sourceLineNo">1781</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1781"></a>
-<span class="sourceLineNo">1782</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1782"></a>
-<span class="sourceLineNo">1783</span> index += arrays[i].length;<a name="line.1783"></a>
-<span class="sourceLineNo">1784</span> }<a name="line.1784"></a>
-<span class="sourceLineNo">1785</span> return result;<a name="line.1785"></a>
-<span class="sourceLineNo">1786</span> }<a name="line.1786"></a>
-<span class="sourceLineNo">1787</span><a name="line.1787"></a>
-<span class="sourceLineNo">1788</span> /**<a name="line.1788"></a>
-<span class="sourceLineNo">1789</span> * @param a array<a name="line.1789"></a>
-<span class="sourceLineNo">1790</span> * @param length amount of bytes to grab<a name="line.1790"></a>
-<span class="sourceLineNo">1791</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1791"></a>
-<span class="sourceLineNo">1792</span> */<a name="line.1792"></a>
-<span class="sourceLineNo">1793</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1793"></a>
-<span class="sourceLineNo">1794</span> if (a.length < length) {<a name="line.1794"></a>
-<span class="sourceLineNo">1795</span> return null;<a name="line.1795"></a>
-<span class="sourceLineNo">1796</span> }<a name="line.1796"></a>
-<span class="sourceLineNo">1797</span> byte [] result = new byte[length];<a name="line.1797"></a>
-<span class="sourceLineNo">1798</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1798"></a>
-<span class="sourceLineNo">1799</span> return result;<a name="line.1799"></a>
-<span class="sourceLineNo">1800</span> }<a name="line.1800"></a>
-<span class="sourceLineNo">1801</span><a name="line.1801"></a>
-<span class="sourceLineNo">1802</span> /**<a name="line.1802"></a>
-<span class="sourceLineNo">1803</span> * @param a array<a name="line.1803"></a>
-<span class="sourceLineNo">1804</span> * @param length amount of bytes to snarf<a name="line.1804"></a>
-<span class="sourceLineNo">1805</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1805"></a>
-<span class="sourceLineNo">1806</span> */<a name="line.1806"></a>
-<span class="sourceLineNo">1807</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1807"></a>
-<span class="sourceLineNo">1808</span> if (a.length < length) {<a name="line.1808"></a>
-<span class="sourceLineNo">1809</span> return null;<a name="line.1809"></a>
-<span class="sourceLineNo">1810</span> }<a name="line.1810"></a>
-<span class="sourceLineNo">1811</span> byte [] result = new byte[length];<a name="line.1811"></a>
-<span class="sourceLineNo">1812</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1812"></a>
-<span class="sourceLineNo">1813</span> return result;<a name="line.1813"></a>
-<span class="sourceLineNo">1814</span> }<a name="line.1814"></a>
-<span class="sourceLineNo">1815</span><a name="line.1815"></a>
-<span class="sourceLineNo">1816</span> /**<a name="line.1816"></a>
-<span class="sourceLineNo">1817</span> * @param a array<a name="line.1817"></a>
-<span class="sourceLineNo">1818</span> * @param length new array size<a name="line.1818"></a>
-<span class="sourceLineNo">1819</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1819"></a>
-<span class="sourceLineNo">1820</span> */<a name="line.1820"></a>
-<span class="sourceLineNo">1821</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1821"></a>
-<span class="sourceLineNo">1822</span> byte [] padding = new byte[length];<a name="line.1822"></a>
-<span class="sourceLineNo">1823</span> for (int i = 0; i < length; i++) {<a name="line.1823"></a>
-<span class="sourceLineNo">1824</span> padding[i] = 0;<a name="line.1824"></a>
-<span class="sourceLineNo">1825</span> }<a name="line.1825"></a>
-<span class="sourceLineNo">1826</span> return add(padding,a);<a name="line.1826"></a>
-<span class="sourceLineNo">1827</span> }<a name="line.1827"></a>
-<span class="sourceLineNo">1828</span><a name="line.1828"></a>
-<span class="sourceLineNo">1829</span> /**<a name="line.1829"></a>
-<span class="sourceLineNo">1830</span> * @param a array<a name="line.1830"></a>
-<span class="sourceLineNo">1831</span> * @param length new array size<a name="line.1831"></a>
-<span class="sourceLineNo">1832</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1832"></a>
-<span class="sourceLineNo">1833</span> */<a name="line.1833"></a>
-<span class="sourceLineNo">1834</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1834"></a>
-<span class="sourceLineNo">1835</span> byte [] padding = new byte[length];<a name="line.1835"></a>
-<span class="sourceLineNo">1836</span> for (int i = 0; i < length; i++) {<a name="line.1836"></a>
-<span class="sourceLineNo">1837</span> padding[i] = 0;<a name="line.1837"></a>
-<span class="sourceLineNo">1838</span> }<a name="line.1838"></a>
-<span class="sourceLineNo">1839</span> return add(a,padding);<a name="line.1839"></a>
-<span class="sourceLineNo">1840</span> }<a name="line.1840"></a>
-<span class="sourceLineNo">1841</span><a name="line.1841"></a>
-<span class="sourceLineNo">1842</span> /**<a name="line.1842"></a>
-<span class="sourceLineNo">1843</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1843"></a>
-<span class="sourceLineNo">1844</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1844"></a>
-<span class="sourceLineNo">1845</span> * @param a Beginning of range<a name="line.1845"></a>
-<span class="sourceLineNo">1846</span> * @param b End of range<a name="line.1846"></a>
-<span class="sourceLineNo">1847</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1847"></a>
-<span class="sourceLineNo">1848</span> * the range in two; i.e. one split.<a name="line.1848"></a>
-<span class="sourceLineNo">1849</span> * @return Array of dividing values<a name="line.1849"></a>
-<span class="sourceLineNo">1850</span> */<a name="line.1850"></a>
-<span class="sourceLineNo">1851</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1851"></a>
-<span class="sourceLineNo">1852</span> return split(a, b, false, num);<a name="line.1852"></a>
-<span class="sourceLineNo">1853</span> }<a name="line.1853"></a>
-<span class="sourceLineNo">1854</span><a name="line.1854"></a>
-<span class="sourceLineNo">1855</span> /**<a name="line.1855"></a>
-<span class="sourceLineNo">1856</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1856"></a>
-<span class="sourceLineNo">1857</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1857"></a>
-<span class="sourceLineNo">1858</span> * @param a Beginning of range<a name="line.1858"></a>
-<span class="sourceLineNo">1859</span> * @param b End of range<a name="line.1859"></a>
-<span class="sourceLineNo">1860</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1860"></a>
-<span class="sourceLineNo">1861</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1861"></a>
-<span class="sourceLineNo">1862</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1862"></a>
-<span class="sourceLineNo">1863</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1863"></a>
-<span class="sourceLineNo">1864</span> * the range in two; i.e. one split.<a name="line.1864"></a>
-<span class="sourceLineNo">1865</span> * @return Array of dividing values<a name="line.1865"></a>
-<span class="sourceLineNo">1866</span> */<a name="line.1866"></a>
-<span class="sourceLineNo">1867</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1867"></a>
-<span class="sourceLineNo">1868</span> boolean inclusive, final int num) {<a name="line.1868"></a>
-<span class="sourceLineNo">1869</span> byte[][] ret = new byte[num + 2][];<a name="line.1869"></a>
-<span class="sourceLineNo">1870</span> int i = 0;<a name="line.1870"></a>
-<span class="sourceLineNo">1871</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1871"></a>
-<span class="sourceLineNo">1872</span> if (iter == null)<a name="line.1872"></a>
-<span class="sourceLineNo">1873</span> return null;<a name="line.1873"></a>
-<span class="sourceLineNo">1874</span> for (byte[] elem : iter) {<a name="line.1874"></a>
-<span class="sourceLineNo">1875</span> ret[i++] = elem;<a name="line.1875"></a>
-<span class="sourceLineNo">1876</span> }<a name="line.1876"></a>
-<span class="sourceLineNo">1877</span> return ret;<a name="line.1877"></a>
-<span class="sourceLineNo">1878</span> }<a name="line.1878"></a>
-<span class="sourceLineNo">1879</span><a name="line.1879"></a>
-<span class="sourceLineNo">1880</span> /**<a name="line.1880"></a>
-<span class="sourceLineNo">1881</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1881"></a>
-<span class="sourceLineNo">1882</span> */<a name="line.1882"></a>
-<span class="sourceLineNo">1883</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1883"></a>
-<span class="sourceLineNo">1884</span> final byte[] b, final int num)<a name="line.1884"></a>
-<span class="sourceLineNo">1885</span> {<a name="line.1885"></a>
-<span class="sourceLineNo">1886</span> return iterateOnSplits(a, b, false, num);<a name="line.1886"></a>
-<span class="sourceLineNo">1887</span> }<a name="line.1887"></a>
-<span class="sourceLineNo">1888</span><a name="line.1888"></a>
-<span class="sourceLineNo">1889</span> /**<a name="line.1889"></a>
-<span class="sourceLineNo">1890</span> * Iterate over keys within the passed range.<a name="line.1890"></a>
-<span class="sourceLineNo">1891</span> */<a name="line.1891"></a>
-<span class="sourceLineNo">1892</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1892"></a>
-<span class="sourceLineNo">1893</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1893"></a>
-<span class="sourceLineNo">1894</span> {<a name="line.1894"></a>
-<span class="sourceLineNo">1895</span> byte [] aPadded;<a name="line.1895"></a>
-<span class="sourceLineNo">1896</span> byte [] bPadded;<a name="line.1896"></a>
-<span class="sourceLineNo">1897</span> if (a.length < b.length) {<a name="line.1897"></a>
-<span class="sourceLineNo">1898</span> aPadded = padTail(a, b.length - a.length);<a name="line.1898"></a>
-<span class="sourceLineNo">1899</span> bPadded = b;<a name="line.1899"></a>
-<span class="sourceLineNo">1900</span> } else if (b.length < a.length) {<a name="line.1900"></a>
-<span class="sourceLineNo">1901</span> aPadded = a;<a name="line.1901"></a>
-<span class="sourceLineNo">1902</span> bPadded = padTail(b, a.length - b.length);<a name="line.1902"></a>
-<span class="sourceLineNo">1903</span> } else {<a name="line.1903"></a>
-<span class="sourceLineNo">1904</span> aPadded = a;<a name="line.1904"></a>
-<span class="sourceLineNo">1905</span> bPadded = b;<a name="line.1905"></a>
-<span class="sourceLineNo">1906</span> }<a name="line.1906"></a>
-<span class="sourceLineNo">1907</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1907"></a>
-<span class="sourceLineNo">1908</span> throw new IllegalArgumentException("b <= a");<a name="line.1908"></a>
-<span class="sourceLineNo">1909</span> }<a name="line.1909"></a>
-<span class="sourceLineNo">1910</span> if (num <= 0) {<a name="line.1910"></a>
-<span class="sourceLineNo">1911</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1911"></a>
-<span class="sourceLineNo">1912</span> }<a name="line.1912"></a>
-<span class="sourceLineNo">1913</span> byte [] prependHeader = {1, 0};<a name="line.1913"></a>
-<span class="sourceLineNo">1914</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1914"></a>
-<span class="sourceLineNo">1915</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1915"></a>
-<span class="sourceLineNo">1916</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1916"></a>
-<span class="sourceLineNo">1917</span> if (inclusive) {<a name="line.1917"></a>
-<span class="sourceLineNo">1918</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1918"></a>
-<span class="sourceLineNo">1919</span> }<a name="line.1919"></a>
-<span class="sourceLineNo">1920</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1920"></a>
-<span class="sourceLineNo">1921</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1921"></a>
-<span class="sourceLineNo">1922</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1922"></a>
-<span class="sourceLineNo">1923</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1923"></a>
-<span class="sourceLineNo">1924</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1924"></a>
-<span class="sourceLineNo">1925</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1925"></a>
-<span class="sourceLineNo">1926</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1926"></a>
-<span class="sourceLineNo">1927</span> }<a name="line.1927"></a>
-<span class="sourceLineNo">1928</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1928"></a>
-<span class="sourceLineNo">1929</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1929"></a>
-<span class="sourceLineNo">1930</span> }<a name="line.1930"></a>
-<span class="sourceLineNo">1931</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1931"></a>
-<span class="sourceLineNo">1932</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1932"></a>
-<span class="sourceLineNo">1933</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1933"></a>
-<span class="sourceLineNo">1934</span> }<a name="line.1934"></a>
-<span class="sourceLineNo">1935</span> final BigInteger intervalBI;<a name="line.1935"></a>
-<span class="sourceLineNo">1936</span> try {<a name="line.1936"></a>
-<span class="sourceLineNo">1937</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1937"></a>
-<span class="sourceLineNo">1938</span> } catch(Exception e) {<a name="line.1938"></a>
-<span class="sourceLineNo">1939</span> LOG.error("Exception caught during division", e);<a name="line.1939"></a>
-<span class="sourceLineNo">1940</span> return null;<a name="line.1940"></a>
-<span class="sourceLineNo">1941</span> }<a name="line.1941"></a>
-<span class="sourceLineNo">1942</span><a name="line.1942"></a>
-<span class="sourceLineNo">1943</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1943"></a>
-<span class="sourceLineNo">1944</span> private int i = -1;<a name="line.1944"></a>
+<span class="sourceLineNo">1777</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1777"></a>
+<span class="sourceLineNo">1778</span> index += arrays[i].length;<a name="line.1778"></a>
+<span class="sourceLineNo">1779</span> }<a name="line.1779"></a>
+<span class="sourceLineNo">1780</span> return result;<a name="line.1780"></a>
+<span class="sourceLineNo">1781</span> }<a name="line.1781"></a>
+<span class="sourceLineNo">1782</span><a name="line.1782"></a>
+<span class="sourceLineNo">1783</span> /**<a name="line.1783"></a>
+<span class="sourceLineNo">1784</span> * @param a array<a name="line.1784"></a>
+<span class="sourceLineNo">1785</span> * @param length amount of bytes to grab<a name="line.1785"></a>
+<span class="sourceLineNo">1786</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1786"></a>
+<span class="sourceLineNo">1787</span> */<a name="line.1787"></a>
+<span class="sourceLineNo">1788</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1788"></a>
+<span class="sourceLineNo">1789</span> if (a.length < length) {<a name="line.1789"></a>
+<span class="sourceLineNo">1790</span> return null;<a name="line.1790"></a>
+<span class="sourceLineNo">1791</span> }<a name="line.1791"></a>
+<span class="sourceLineNo">1792</span> byte [] result = new byte[length];<a name="line.1792"></a>
+<span class="sourceLineNo">1793</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1793"></a>
+<span class="sourceLineNo">1794</span> return result;<a name="line.1794"></a>
+<span class="sourceLineNo">1795</span> }<a name="line.1795"></a>
+<span class="sourceLineNo">1796</span><a name="line.1796"></a>
+<span class="sourceLineNo">1797</span> /**<a name="line.1797"></a>
+<span class="sourceLineNo">1798</span> * @param a array<a name="line.1798"></a>
+<span class="sourceLineNo">1799</span> * @param length amount of bytes to snarf<a name="line.1799"></a>
+<span class="sourceLineNo">1800</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1800"></a>
+<span class="sourceLineNo">1801</span> */<a name="line.1801"></a>
+<span class="sourceLineNo">1802</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1802"></a>
+<span class="sourceLineNo">1803</span> if (a.length < length) {<a name="line.1803"></a>
+<span class="sourceLineNo">1804</span> return null;<a name="line.1804"></a>
+<span class="sourceLineNo">1805</span> }<a name="line.1805"></a>
+<span class="sourceLineNo">1806</span> byte [] result = new byte[length];<a name="line.1806"></a>
+<span class="sourceLineNo">1807</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1807"></a>
+<span class="sourceLineNo">1808</span> return result;<a name="line.1808"></a>
+<span class="sourceLineNo">1809</span> }<a name="line.1809"></a>
+<span class="sourceLineNo">1810</span><a name="line.1810"></a>
+<span class="sourceLineNo">1811</span> /**<a name="line.1811"></a>
+<span class="sourceLineNo">1812</span> * @param a array<a name="line.1812"></a>
+<span class="sourceLineNo">1813</span> * @param length new array size<a name="line.1813"></a>
+<span class="sourceLineNo">1814</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1814"></a>
+<span class="sourceLineNo">1815</span> */<a name="line.1815"></a>
+<span class="sourceLineNo">1816</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1816"></a>
+<span class="sourceLineNo">1817</span> byte [] padding = new byte[length];<a name="line.1817"></a>
+<span class="sourceLineNo">1818</span> for (int i = 0; i < length; i++) {<a name="line.1818"></a>
+<span class="sourceLineNo">1819</span> padding[i] = 0;<a name="line.1819"></a>
+<span class="sourceLineNo">1820</span> }<a name="line.1820"></a>
+<span class="sourceLineNo">1821</span> return add(padding,a);<a name="line.1821"></a>
+<span class="sourceLineNo">1822</span> }<a name="line.1822"></a>
+<span class="sourceLineNo">1823</span><a name="line.1823"></a>
+<span class="sourceLineNo">1824</span> /**<a name="line.1824"></a>
+<span class="sourceLineNo">1825</span> * @param a array<a name="line.1825"></a>
+<span class="sourceLineNo">1826</span> * @param length new array size<a name="line.1826"></a>
+<span class="sourceLineNo">1827</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1827"></a>
+<span class="sourceLineNo">1828</span> */<a name="line.1828"></a>
+<span class="sourceLineNo">1829</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1829"></a>
+<span class="sourceLineNo">1830</span> byte [] padding = new byte[length];<a name="line.1830"></a>
+<span class="sourceLineNo">1831</span> for (int i = 0; i < length; i++) {<a name="line.1831"></a>
+<span class="sourceLineNo">1832</span> padding[i] = 0;<a name="line.1832"></a>
+<span class="sourceLineNo">1833</span> }<a name="line.1833"></a>
+<span class="sourceLineNo">1834</span> return add(a,padding);<a name="line.1834"></a>
+<span class="sourceLineNo">1835</span> }<a name="line.1835"></a>
+<span class="sourceLineNo">1836</span><a name="line.1836"></a>
+<span class="sourceLineNo">1837</span> /**<a name="line.1837"></a>
+<span class="sourceLineNo">1838</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1838"></a>
+<span class="sourceLineNo">1839</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1839"></a>
+<span class="sourceLineNo">1840</span> * @param a Beginning of range<a name="line.1840"></a>
+<span class="sourceLineNo">1841</span> * @param b End of range<a name="line.1841"></a>
+<span class="sourceLineNo">1842</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1842"></a>
+<span class="sourceLineNo">1843</span> * the range in two; i.e. one split.<a name="line.1843"></a>
+<span class="sourceLineNo">1844</span> * @return Array of dividing values<a name="line.1844"></a>
+<span class="sourceLineNo">1845</span> */<a name="line.1845"></a>
+<span class="sourceLineNo">1846</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1846"></a>
+<span class="sourceLineNo">1847</span> return split(a, b, false, num);<a name="line.1847"></a>
+<span class="sourceLineNo">1848</span> }<a name="line.1848"></a>
+<span class="sourceLineNo">1849</span><a name="line.1849"></a>
+<span class="sourceLineNo">1850</span> /**<a name="line.1850"></a>
+<span class="sourceLineNo">1851</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1851"></a>
+<span class="sourceLineNo">1852</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1852"></a>
+<span class="sourceLineNo">1853</span> * @param a Beginning of range<a name="line.1853"></a>
+<span class="sourceLineNo">1854</span> * @param b End of range<a name="line.1854"></a>
+<span class="sourceLineNo">1855</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1855"></a>
+<span class="sourceLineNo">1856</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1856"></a>
+<span class="sourceLineNo">1857</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1857"></a>
+<span class="sourceLineNo">1858</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1858"></a>
+<span class="sourceLineNo">1859</span> * the range in two; i.e. one split.<a name="line.1859"></a>
+<span class="sourceLineNo">1860</span> * @return Array of dividing values<a name="line.1860"></a>
+<span class="sourceLineNo">1861</span> */<a name="line.1861"></a>
+<span class="sourceLineNo">1862</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1862"></a>
+<span class="sourceLineNo">1863</span> boolean inclusive, final int num) {<a name="line.1863"></a>
+<span class="sourceLineNo">1864</span> byte[][] ret = new byte[num + 2][];<a name="line.1864"></a>
+<span class="sourceLineNo">1865</span> int i = 0;<a name="line.1865"></a>
+<span class="sourceLineNo">1866</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1866"></a>
+<span class="sourceLineNo">1867</span> if (iter == null)<a name="line.1867"></a>
+<span class="sourceLineNo">1868</span> return null;<a name="line.1868"></a>
+<span class="sourceLineNo">1869</span> for (byte[] elem : iter) {<a name="line.1869"></a>
+<span class="sourceLineNo">1870</span> ret[i++] = elem;<a name="line.1870"></a>
+<span class="sourceLineNo">1871</span> }<a name="line.1871"></a>
+<span class="sourceLineNo">1872</span> return ret;<a name="line.1872"></a>
+<span class="sourceLineNo">1873</span> }<a name="line.1873"></a>
+<span class="sourceLineNo">1874</span><a name="line.1874"></a>
+<span class="sourceLineNo">1875</span> /**<a name="line.1875"></a>
+<span class="sourceLineNo">1876</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1876"></a>
+<span class="sourceLineNo">1877</span> */<a name="line.1877"></a>
+<span class="sourceLineNo">1878</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1878"></a>
+<span class="sourceLineNo">1879</span> final byte[] b, final int num)<a name="line.1879"></a>
+<span class="sourceLineNo">1880</span> {<a name="line.1880"></a>
+<span class="sourceLineNo">1881</span> return iterateOnSplits(a, b, false, num);<a name="line.1881"></a>
+<span class="sourceLineNo">1882</span> }<a name="line.1882"></a>
+<span class="sourceLineNo">1883</span><a name="line.1883"></a>
+<span class="sourceLineNo">1884</span> /**<a name="line.1884"></a>
+<span class="sourceLineNo">1885</span> * Iterate over keys within the passed range.<a name="line.1885"></a>
+<span class="sourceLineNo">1886</span> */<a name="line.1886"></a>
+<span class="sourceLineNo">1887</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1887"></a>
+<span class="sourceLineNo">1888</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1888"></a>
+<span class="sourceLineNo">1889</span> {<a name="line.1889"></a>
+<span class="sourceLineNo">1890</span> byte [] aPadded;<a name="line.1890"></a>
+<span class="sourceLineNo">1891</span> byte [] bPadded;<a name="line.1891"></a>
+<span class="sourceLineNo">1892</span> if (a.length < b.length) {<a name="line.1892"></a>
+<span class="sourceLineNo">1893</span> aPadded = padTail(a, b.length - a.length);<a name="line.1893"></a>
+<span class="sourceLineNo">1894</span> bPadded = b;<a name="line.1894"></a>
+<span class="sourceLineNo">1895</span> } else if (b.length < a.length) {<a name="line.1895"></a>
+<span class="sourceLineNo">1896</span> aPadded = a;<a name="line.1896"></a>
+<span class="sourceLineNo">1897</span> bPadded = padTail(b, a.length - b.length);<a name="line.1897"></a>
+<span class="sourceLineNo">1898</span> } else {<a name="line.1898"></a>
+<span class="sourceLineNo">1899</span> aPadded = a;<a name="line.1899"></a>
+<span class="sourceLineNo">1900</span> bPadded = b;<a name="line.1900"></a>
+<span class="sourceLineNo">1901</span> }<a name="line.1901"></a>
+<span class="sourceLineNo">1902</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1902"></a>
+<span class="sourceLineNo">1903</span> throw new IllegalArgumentException("b <= a");<a name="line.1903"></a>
+<span class="sourceLineNo">1904</span> }<a name="line.1904"></a>
+<span class="sourceLineNo">1905</span> if (num <= 0) {<a name="line.1905"></a>
+<span class="sourceLineNo">1906</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1906"></a>
+<span class="sourceLineNo">1907</span> }<a name="line.1907"></a>
+<span class="sourceLineNo">1908</span> byte [] prependHeader = {1, 0};<a name="line.1908"></a>
+<span class="sourceLineNo">1909</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1909"></a>
+<span class="sourceLineNo">1910</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1910"></a>
+<span class="sourceLineNo">1911</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1911"></a>
+<span class="sourceLineNo">1912</span> if (inclusive) {<a name="line.1912"></a>
+<span class="sourceLineNo">1913</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1913"></a>
+<span class="sourceLineNo">1914</span> }<a name="line.1914"></a>
+<span class="sourceLineNo">1915</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1915"></a>
+<span class="sourceLineNo">1916</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1916"></a>
+<span class="sourceLineNo">1917</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1917"></a>
+<span class="sourceLineNo">1918</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1918"></a>
+<span class="sourceLineNo">1919</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1919"></a>
+<span class="sourceLineNo">1920</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1920"></a>
+<span class="sourceLineNo">1921</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1921"></a>
+<span class="sourceLineNo">1922</span> }<a name="line.1922"></a>
+<span class="sourceLineNo">1923</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1923"></a>
+<span class="sourceLineNo">1924</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1924"></a>
+<span class="sourceLineNo">1925</span> }<a name="line.1925"></a>
+<span class="sourceLineNo">1926</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1926"></a>
+<span class="sourceLineNo">1927</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1927"></a>
+<span class="sourceLineNo">1928</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1928"></a>
+<span class="sourceLineNo">1929</span> }<a name="line.1929"></a>
+<span class="sourceLineNo">1930</span> final BigInteger intervalBI;<a name="line.1930"></a>
+<span class="sourceLineNo">1931</span> try {<a name="line.1931"></a>
+<span class="sourceLineNo">1932</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1932"></a>
+<span class="sourceLineNo">1933</span> } catch(Exception e) {<a name="line.1933"></a>
+<span class="sourceLineNo">1934</span> LOG.error("Exception caught during division", e);<a name="line.1934"></a>
+<span class="sourceLineNo">1935</span> return null;<a name="line.1935"></a>
+<span class="sourceLineNo">1936</span> }<a name="line.1936"></a>
+<span class="sourceLineNo">1937</span><a name="line.1937"></a>
+<span class="sourceLineNo">1938</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1938"></a>
+<span class="sourceLineNo">1939</span> private int i = -1;<a name="line.1939"></a>
+<span class="sourceLineNo">1940</span><a name="line.1940"></a>
+<span class="sourceLineNo">1941</span> @Override<a name="line.1941"></a>
+<span class="sourceLineNo">1942</span> public boolean hasNext() {<a name="line.1942"></a>
+<span class="sourceLineNo">1943</span> return i < num+1;<a name="line.1943"></a>
+<span class="sourceLineNo">1944</span> }<a name="line.1944"></a>
<span class="sourceLineNo">1945</span><a name="line.1945"></a>
<span class="sourceLineNo">1946</span> @Override<a name="line.1946"></a>
-<span class="sourceLineNo">1947</span> public boolean hasNext() {<a name="line.1947"></a>
-<span class="sourceLineNo">1948</span> return i < num+1;<a name="line.1948"></a>
-<span class="sourceLineNo">1949</span> }<a name="line.1949"></a>
-<span class="sourceLineNo">1950</span><a name="line.1950"></a>
-<span class="sourceLineNo">1951</span> @Override<a name="line.1951"></a>
-<span class="sourceLineNo">1952</span> public byte[] next() {<a name="line.1952"></a>
-<span class="sourceLineNo">1953</span> i++;<a name="line.1953"></a>
-<span class="sourceLineNo">1954</span> if (i == 0) return a;<a name="line.1954"></a>
-<span class="sourceLineNo">1955</span> if (i == num + 1) return b;<a name="line.1955"></a>
-<span class="sourceLineNo">1956</span><a name="line.1956"></a>
-<span class="sourceLineNo">1957</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1957"></a>
-<span class="sourceLineNo">1958</span> byte [] padded = curBI.toByteArray();<a name="line.1958"></a>
-<span class="sourceLineNo">1959</span> if (padded[1] == 0)<a name="line.1959"></a>
-<span class="sourceLineNo">1960</span> padded = tail(padded, padded.length - 2);<a name="line.1960"></a>
-<span class="sourceLineNo">1961</span> else<a name="line.1961"></a>
-<span class="sourceLineNo">1962</span> padded = tail(padded, padded.length - 1);<a name="line.1962"></a>
-<span class="sourceLineNo">1963</span> return padded;<a name="line.1963"></a>
+<span class="sourceLineNo">1947</span> public byte[] next() {<a name="line.1947"></a>
+<span class="sourceLineNo">1948</span> i++;<a name="line.1948"></a>
+<span class="sourceLineNo">1949</span> if (i == 0) return a;<a name="line.1949"></a>
+<span class="sourceLineNo">1950</span> if (i == num + 1) return b;<a name="line.1950"></a>
+<span class="sourceLineNo">1951</span><a name="line.1951"></a>
+<span class="sourceLineNo">1952</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1952"></a>
+<span class="sourceLineNo">1953</span> byte [] padded = curBI.toByteArray();<a name="line.1953"></a>
+<span class="sourceLineNo">1954</span> if (padded[1] == 0)<a name="line.1954"></a>
+<span class="sourceLineNo">1955</span> padded = tail(padded, padded.length - 2);<a name="line.1955"></a>
+<span class="sourceLineNo">1956</span> else<a name="line.1956"></a>
+<span class="sourceLineNo">1957</span> padded = tail(padded, padded.length - 1);<a name="line.1957"></a>
+<span class="sourceLineNo">1958</span> return padded;<a name="line.1958"></a>
+<span class="sourceLineNo">1959</span> }<a name="line.1959"></a>
+<span class="sourceLineNo">1960</span><a name="line.1960"></a>
+<span class="sourceLineNo">1961</span> @Override<a name="line.1961"></a>
+<span class="sourceLineNo">1962</span> public void remove() {<a name="line.1962"></a>
+<span class="sourceLineNo">1963</span> throw new UnsupportedOperationException();<a name="line.1963"></a>
<span class="sourceLineNo">1964</span> }<a name="line.1964"></a>
<span class="sourceLineNo">1965</span><a name="line.1965"></a>
-<span class="sourceLineNo">1966</span> @Override<a name="line.1966"></a>
-<span class="sourceLineNo">1967</span> public void remove() {<a name="line.1967"></a>
-<span class="sourceLineNo">1968</span> throw new UnsupportedOperationException();<a name="line.1968"></a>
-<span class="sourceLineNo">1969</span> }<a name="line.1969"></a>
-<span class="sourceLineNo">1970</span><a name="line.1970"></a>
-<span class="sourceLineNo">1971</span> };<a name="line.1971"></a>
-<span class="sourceLineNo">1972</span><a name="line.1972"></a>
-<span class="sourceLineNo">1973</span> return new Iterable<byte[]>() {<a name="line.1973"></a>
-<span class="sourceLineNo">1974</span> @Override<a name="line.1974"></a>
-<span class="sourceLineNo">1975</span> public Iterator<byte[]> iterator() {<a name="line.1975"></a>
-<span class="sourceLineNo">1976</span> return iterator;<a name="line.1976"></a>
-<span class="sourceLineNo">1977</span> }<a name="line.1977"></a>
-<span class="sourceLineNo">1978</span> };<a name="line.1978"></a>
-<span class="sourceLineNo">1979</span> }<a name="line.1979"></a>
-<span class="sourceLineNo">1980</span><a name="line.1980"></a>
-<span class="sourceLineNo">1981</span> /**<a name="line.1981"></a>
-<span class="sourceLineNo">1982</span> * @param bytes array to hash<a name="line.1982"></a>
-<span class="sourceLineNo">1983</span> * @param offset offset to start from<a name="line.1983"></a>
-<span class="sourceLineNo">1984</span> * @param length length to hash<a name="line.1984"></a>
-<span class="sourceLineNo">1985</span> * */<a name="line.1985"></a>
-<span class="sourceLineNo">1986</span> public static int hashCode(byte[] bytes, int offset, int length) {<a name="line.1986"></a>
-<span class="sourceLineNo">1987</span> int hash = 1;<a name="line.1987"></a>
-<span class="sourceLineNo">1988</span> for (int i = offset; i < offset + length; i++)<a name="line.1988"></a>
-<span class="sourceLineNo">1989</span> hash = (31 * hash) + (int) bytes[i];<a name="line.1989"></a>
-<span class="sourceLineNo">1990</span> return hash;<a name="line.1990"></a>
-<span class="sourceLineNo">1991</span> }<a name="line.1991"></a>
-<span class="sourceLineNo">1992</span><a name="line.1992"></a>
-<span class="sourceLineNo">1993</span> /**<a name="line.1993"></a>
-<span class="sourceLineNo">1994</span> * @param t operands<a name="line.1994"></a>
-<span class="sourceLineNo">1995</span> * @return Array of byte arrays made from passed array of Text<a name="line.1995"></a>
-<span class="sourceLineNo">1996</span> */<a name="line.1996"></a>
-<span class="sourceLineNo">1997</span> public static byte [][] toByteArrays(final String [] t) {<a name="line.1997"></a>
-<span class="sourceLineNo">1998</span> byte [][] result = new byte[t.length][];<a name="line.1998"></a>
-<span class="sourceLineNo">1999</span> for (int i = 0; i < t.length; i++) {<a name="line.1999"></a>
-<span class="sourceLineNo">2000</span> result[i] = Bytes.toBytes(t[i]);<a name="line.2000"></a>
-<span class="sourceLineNo">2001</span> }<a name="line.2001"></a>
-<span class="sourceLineNo">2002</span> return result;<a name="line.2002"></a>
-<span class="sourceLineNo">2003</span> }<a name="line.2003"></a>
-<span class="sourceLineNo">2004</span><a name="line.2004"></a>
-<span class="sourceLineNo">2005</span> /**<a name="line.2005"></a>
-<span class="sourceLineNo">2006</span> * @param t operands<a name="line.2006"></a>
-<span class="sourceLineNo">2007</span> * @return Array of binary byte arrays made from passed array of binary strings<a name="line.2007"></a>
-<span class="sourceLineNo">2008</span> */<a name="line.2008"></a>
-<span class="sourceLineNo">2009</span> public static byte[][] toBinaryByteArrays(final String[] t) {<a name="line.2009"></a>
-<span class="sourceLineNo">2010</span> byte[][] result = new byte[t.length][];<a name="line.2010"></a>
-<span class="sourceLineNo">2011</span> for (int i = 0; i < t.length; i++) {<a name="line.2011"></a>
-<span class="sourceLineNo">2012</span> result[i] = Bytes.toBytesBinary(t[i]);<a name="line.2012"></a>
-<span class="sourceLineNo">2013</span> }<a name="line.2013"></a>
-<span class="sourceLineNo">2014</span> return result;<a name="line.2014"></a>
-<span class="sourceLineNo">2015</span> }<a name="line.2015"></a>
-<span class="sourceLineNo">2016</span><a name="line.2016"></a>
-<span class="sourceLineNo">2017</span> /**<a name="line.2017"></a>
-<span class="sourceLineNo">2018</span> * @param column operand<a name="line.2018"></a>
-<span class="sourceLineNo">2019</span> * @return A byte array of a byte array where first and only entry is<a name="line.2019"></a>
-<span class="sourceLineNo">2020</span> * <code>column</code><a name="line.2020"></a>
-<span class="sourceLineNo">2021</span> */<a name="line.2021"></a>
-<span class="sourceLineNo">2022</span> public static byte [][] toByteArrays(final String column) {<a name="line.2022"></a>
-<span class="sourceLineNo">2023</span> return toByteArrays(toBytes(column));<a name="line.2023"></a>
-<span class="sourceLineNo">2024</span> }<a name="line.2024"></a>
-<span class="sourceLineNo">2025</span><a name="line.2025"></a>
-<span class="sourceLineNo">2026</span> /**<a name="line.2026"></a>
-<span class="sourceLineNo">2027</span> * @param column operand<a name="line.2027"></a>
-<span class="sourceLineNo">2028</span> * @return A byte array of a byte array where first and only entry is<a name="line.2028"></a>
-<span class="sourceLineNo">2029</span> * <code>column</code><a name="line.2029"></a>
-<span class="sourceLineNo">2030</span> */<a name="line.2030"></a>
-<span class="sourceLineNo">2031</span> public static byte [][] toByteArrays(final byte [] column) {<a name="line.2031"></a>
-<span class="sourceLineNo">2032</span> byte [][] result = new byte[1][];<a name="line.2032"></a>
-<span class="sourceLineNo">2033</span> result[0] = column;<a name="line.2033"></a>
-<span class="sourceLineNo">2034</span> return result;<a name="line.2034"></a>
-<span class="sourceLineNo">2035</span> }<a name="line.2035"></a>
-<span class="sourceLineNo">2036</span><a name="line.2036"></a>
-<span class="sourceLineNo">2037</span> /**<a name="line.2037"></a>
-<span class="sourceLineNo">2038</span> * Binary search for keys in indexes.<a name="line.2038"></a>
-<span class="sourceLineNo">2039</span> *<a name="line.2039"></a>
-<span class="sourceLineNo">2040</span> * @param arr array of byte arrays to search for<a name="line.2040"></a>
-<span class="sourceLineNo">2041</span> * @param key the key you want to find<a name="line.2041"></a>
-<span class="sourceLineNo">2042</span> * @param offset the offset in the key you want to find<a name="line.2042"></a>
-<span class="sourceLineNo">2043</span> * @param length the length of the key<a name="line.2043"></a>
-<span class="sourceLineNo">2044</span> * @param comparator a comparator to compare.<a name="line.2044"></a>
-<span class="sourceLineNo">2045</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2045"></a>
-<span class="sourceLineNo">2046</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2046"></a>
-<span class="sourceLineNo">2047</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2047"></a>
-<span class="sourceLineNo">2048</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2048"></a>
-<span class="sourceLineNo">2049</span> * means that this function can return 2N + 1 different values<a name="line.2049"></a>
-<span class="sourceLineNo">2050</span> * ranging from -(N + 1) to N - 1.<a name="line.2050"></a>
-<span class="sourceLineNo">2051</span> * @deprecated {@link Bytes#binarySearch(byte[][], byte[], int, int)}<a name="line.2051"></a>
-<span class="sourceLineNo">2052</span> */<a name="line.2052"></a>
-<span class="sourceLineNo">2053</span> @Deprecated<a name="line.2053"></a>
-<span class="sourceLineNo">2054</span> public static int binarySearch(byte [][]arr, byte []key, int offset,<a name="line.2054"></a>
-<span class="sourceLineNo">2055</span> int length, RawComparator<?> comparator) {<a name="line.2055"></a>
-<span class="sourceLineNo">2056</span> return binarySearch(arr, key, offset, length);<a name="line.2056"></a>
-<span class="sourceLineNo">2057</span> }<a name="line.2057"></a>
-<span class="sourceLineNo">2058</span><a name="line.2058"></a>
-<span class="sourceLineNo">2059</span> /**<a name="line.2059"></a>
-<span class="sourceLineNo">2060</span> * Binary search for keys in indexes using Bytes.BYTES_RAWCOMPARATOR.<a name="line.2060"></a>
-<span class="sourceLineNo">2061</span> *<a name="line.2061"></a>
-<span class="sourceLineNo">2062</span> * @param arr array of byte arrays to search for<a name="line.2062"></a>
-<span class="sourceLineNo">2063</span> * @param key the key you want to find<a name="line.2063"></a>
-<span class="sourceLineNo">2064</span> * @param offset the offset in the key you want to find<a name="line.2064"></a>
-<span class="sourceLineNo">2065</span> * @param length the length of the key<a name="line.2065"></a>
-<span class="sourceLineNo">2066</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2066"></a>
-<span class="sourceLineNo">2067</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2067"></a>
-<span class="sourceLineNo">2068</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2068"></a>
-<span class="sourceLineNo">2069</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2069"></a>
-<span class="sourceLineNo">2070</span> * means that this function can return 2N + 1 different values<a name="line.2070"></a>
-<span class="sourceLineNo">2071</span> * ranging from -(N + 1) to N - 1.<a name="line.2071"></a>
-<span class="sourceLineNo">2072</span> */<a name="line.2072"></a>
-<span class="sourceLineNo">2073</span> public static int binarySearch(byte[][] arr, byte[] key, int offset, int length) {<a name="line.2073"></a>
-<span class="sourceLineNo">2074</span> int low = 0;<a name="line.2074"></a>
-<span class="sourceLineNo">2075</span> int high = arr.length - 1;<a name="line.2075"></a>
-<span class="sourceLineNo">2076</span><a name="line.2076"></a>
-<span class="sourceLineNo">2077</span> while (low <= high) {<a name="line.2077"></a>
-<span class="sourceLineNo">2078</span> int mid = (low + high) >>> 1;<a name="line.2078"></a>
-<span class="sourceLineNo">2079</span> // we have to compare in this order, because the comparator order<a name="line.2079"></a>
-<span class="sourceLineNo">2080</span> // has special logic when the 'left side' is a special key.<a name="line.2080"></a>
-<span class="sourceLineNo">2081</span> int cmp = Bytes.BYTES_RAWCOMPARATOR<a name="line.2081"></a>
-<span class="sourceLineNo">2082</span> .compare(key, offset, length, arr[mid], 0, arr[mid].length);<a name="line.2082"></a>
-<span class="sourceLineNo">2083</span> // key lives above the midpoint<a name="line.2083"></a>
-<span class="sourceLineNo">2084</span> if (cmp > 0)<a name="line.2084"></a>
-<span class="sourceLineNo">2085</span> low = mid + 1;<a name="line.2085"></a>
-<span class="sourceLineNo">2086</span> // key lives below the midpoint<a name="line.2086"></a>
-<span class="sourceLineNo">2087</span> else if (cmp < 0)<a name="line.2087"></a>
-<span class="sourceLineNo">2088</span> high = mid - 1;<a name="line.2088"></a>
-<span class="sourceLineNo">2089</span> // BAM. how often does this really happen?<a name="line.2089"></a>
-<span class="sourceLineNo">2090</span> else<a name="line.2090"></a>
-<span class="sourceLineNo">2091</span> return mid;<a name="line.2091"></a>
-<span class="sourceLineNo">2092</span> }<a name="line.2092"></a>
-<span class="sourceLineNo">2093</span> return -(low + 1);<a name="line.2093"></a>
-<span class="sourceLineNo">2094</span> }<a name="line.2094"></a>
-<span class="sourceLineNo">2095</span><a name="line.2095"></a>
-<span class="sourceLineNo">2096</span> /**<a name="line.2096"></a>
-<span class="sourceLineNo">2097</span> * Binary search for keys in indexes.<a name="line.2097"></a>
-<span class="sourceLineNo">2098</span> *<a name="line.2098"></a>
-<span class="sourceLineNo">2099</span> * @param arr array of byte arrays to search for<a name="line.2099"></a>
-<span class="sourceLineNo">2100</span> * @param key the key you want to find<a name="line.2100"></a>
-<span class="sourceLineNo">2101</span> * @param comparator a comparator to compare.<a name="line.2101"></a>
-<span class="sourceLineNo">2102</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2102"></a>
-<span class="sourceLineNo">2103</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2103"></a>
-<span class="sourceLineNo">2104</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2104"></a>
-<span class="sourceLineNo">2105</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2105"></a>
-<span class="sourceLineNo">2106</span> * means that this function can return 2N + 1 different values<a name="line.2106"></a>
-<span class="sourceLineNo">2107</span> * ranging from -(N + 1) to N - 1.<a name="line.2107"></a>
-<span class="sourceLineNo">2108</span> * @return the index of the block<a name="line.2108"></a>
-<span class="sourceLineNo">2109</span> * @deprecated Use {@link Bytes#binarySearch(Cell[], Cell, CellComparator)}<a name="line.2109"></a>
-<span class="sourceLineNo">2110</span> */<a name="line.2110"></a>
-<span class="sourceLineNo">2111</span> @Deprecated<a name="line.2111"></a>
-<span class="sourceLineNo">2112</span> public static int binarySearch(byte[][] arr, Cell key, RawComparator<Cell> comparator) {<a name="line.2112"></a>
-<span class="sourceLineNo">2113</span> int low = 0;<a name="line.2113"></a>
-<span class="sourceLineNo">2114</span> int high = arr.length - 1;<a name="line.2114"></a>
-<span class="sourceLineNo">2115</span> KeyValue.KeyOnlyKeyValue r = new KeyValue.KeyOnlyKeyValue();<a name="line.2115"></a>
-<span class="sourceLineNo">2116</span> while (low <= high) {<a name="line.2116"></a>
-<span class="sourceLineNo">2117</span> int mid = (low+high) >>> 1;<a name="line.21
<TRUNCATED>
[13/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/checkstyle.rss
----------------------------------------------------------------------
diff --git a/checkstyle.rss b/checkstyle.rss
index 1d3659b..1c0e514 100644
--- a/checkstyle.rss
+++ b/checkstyle.rss
@@ -26,7 +26,7 @@ under the License.
<copyright>©2007 - 2017 The Apache Software Foundation</copyright>
<item>
<title>File: 2155,
- Errors: 14362,
+ Errors: 14361,
Warnings: 0,
Infos: 0
</title>
@@ -25325,7 +25325,7 @@ under the License.
0
</td>
<td>
- 86
+ 85
</td>
</tr>
<tr>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/constant-values.html
----------------------------------------------------------------------
diff --git a/devapidocs/constant-values.html b/devapidocs/constant-values.html
index 685dd1c..0bc28de 100644
--- a/devapidocs/constant-values.html
+++ b/devapidocs/constant-values.html
@@ -3787,21 +3787,21 @@
<!-- -->
</a><code>public static final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a></code></td>
<td><code><a href="org/apache/hadoop/hbase/Version.html#date">date</a></code></td>
-<td class="colLast"><code>"Thu Apr 27 17:44:54 UTC 2017"</code></td>
+<td class="colLast"><code>"Thu Apr 27 22:33:25 UTC 2017"</code></td>
</tr>
<tr class="rowColor">
<td class="colFirst"><a name="org.apache.hadoop.hbase.Version.revision">
<!-- -->
</a><code>public static final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a></code></td>
<td><code><a href="org/apache/hadoop/hbase/Version.html#revision">revision</a></code></td>
-<td class="colLast"><code>"880db3eee4f1908854f4ac9f778758213eaab20a"</code></td>
+<td class="colLast"><code>"b81e00f5eabe8d99fd77d74f60e3754add8205da"</code></td>
</tr>
<tr class="altColor">
<td class="colFirst"><a name="org.apache.hadoop.hbase.Version.srcChecksum">
<!-- -->
</a><code>public static final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a></code></td>
<td><code><a href="org/apache/hadoop/hbase/Version.html#srcChecksum">srcChecksum</a></code></td>
-<td class="colLast"><code>"2f7a0c4b7f219141434feed0dbc30e54"</code></td>
+<td class="colLast"><code>"f5899e22d243da9cc32fb736a2ec9230"</code></td>
</tr>
<tr class="rowColor">
<td class="colFirst"><a name="org.apache.hadoop.hbase.Version.url">
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html
----------------------------------------------------------------------
diff --git a/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html b/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html
index d687652..97fb5c6 100644
--- a/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html
+++ b/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html
@@ -393,130 +393,130 @@ extends org.jamon.AbstractTemplateProxy.ImplData</pre>
<pre>private <a href="../../../../../../org/apache/hadoop/hbase/master/HMaster.html" title="class in org.apache.hadoop.hbase.master">HMaster</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.112">m_master</a></pre>
</li>
</ul>
-<a name="m_filter">
+<a name="m_servers">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_filter</h4>
-<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.124">m_filter</a></pre>
+<h4>m_servers</h4>
+<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.124">m_servers</a></pre>
</li>
</ul>
-<a name="m_filter__IsNotDefault">
+<a name="m_servers__IsNotDefault">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_filter__IsNotDefault</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.129">m_filter__IsNotDefault</a></pre>
+<h4>m_servers__IsNotDefault</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.129">m_servers__IsNotDefault</a></pre>
</li>
</ul>
-<a name="m_catalogJanitorEnabled">
+<a name="m_deadServers">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_catalogJanitorEnabled</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.141">m_catalogJanitorEnabled</a></pre>
+<h4>m_deadServers</h4>
+<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.141">m_deadServers</a></pre>
</li>
</ul>
-<a name="m_catalogJanitorEnabled__IsNotDefault">
+<a name="m_deadServers__IsNotDefault">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_catalogJanitorEnabled__IsNotDefault</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.146">m_catalogJanitorEnabled__IsNotDefault</a></pre>
+<h4>m_deadServers__IsNotDefault</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.146">m_deadServers__IsNotDefault</a></pre>
</li>
</ul>
-<a name="m_metaLocation">
+<a name="m_format">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_metaLocation</h4>
-<pre>private <a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.158">m_metaLocation</a></pre>
+<h4>m_format</h4>
+<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.158">m_format</a></pre>
</li>
</ul>
-<a name="m_metaLocation__IsNotDefault">
+<a name="m_format__IsNotDefault">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_metaLocation__IsNotDefault</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.163">m_metaLocation__IsNotDefault</a></pre>
+<h4>m_format__IsNotDefault</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.163">m_format__IsNotDefault</a></pre>
</li>
</ul>
-<a name="m_assignmentManager">
+<a name="m_catalogJanitorEnabled">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_assignmentManager</h4>
-<pre>private <a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.175">m_assignmentManager</a></pre>
+<h4>m_catalogJanitorEnabled</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.175">m_catalogJanitorEnabled</a></pre>
</li>
</ul>
-<a name="m_assignmentManager__IsNotDefault">
+<a name="m_catalogJanitorEnabled__IsNotDefault">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_assignmentManager__IsNotDefault</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.180">m_assignmentManager__IsNotDefault</a></pre>
+<h4>m_catalogJanitorEnabled__IsNotDefault</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.180">m_catalogJanitorEnabled__IsNotDefault</a></pre>
</li>
</ul>
-<a name="m_frags">
+<a name="m_metaLocation">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_frags</h4>
-<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.192">m_frags</a></pre>
+<h4>m_metaLocation</h4>
+<pre>private <a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.192">m_metaLocation</a></pre>
</li>
</ul>
-<a name="m_frags__IsNotDefault">
+<a name="m_metaLocation__IsNotDefault">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_frags__IsNotDefault</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.197">m_frags__IsNotDefault</a></pre>
+<h4>m_metaLocation__IsNotDefault</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.197">m_metaLocation__IsNotDefault</a></pre>
</li>
</ul>
-<a name="m_deadServers">
+<a name="m_assignmentManager">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_deadServers</h4>
-<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.209">m_deadServers</a></pre>
+<h4>m_assignmentManager</h4>
+<pre>private <a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.209">m_assignmentManager</a></pre>
</li>
</ul>
-<a name="m_deadServers__IsNotDefault">
+<a name="m_assignmentManager__IsNotDefault">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_deadServers__IsNotDefault</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.214">m_deadServers__IsNotDefault</a></pre>
+<h4>m_assignmentManager__IsNotDefault</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.214">m_assignmentManager__IsNotDefault</a></pre>
</li>
</ul>
-<a name="m_format">
+<a name="m_filter">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_format</h4>
-<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.226">m_format</a></pre>
+<h4>m_filter</h4>
+<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.226">m_filter</a></pre>
</li>
</ul>
-<a name="m_format__IsNotDefault">
+<a name="m_filter__IsNotDefault">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_format__IsNotDefault</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.231">m_format__IsNotDefault</a></pre>
+<h4>m_filter__IsNotDefault</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.231">m_filter__IsNotDefault</a></pre>
</li>
</ul>
<a name="m_serverManager">
@@ -537,22 +537,22 @@ extends org.jamon.AbstractTemplateProxy.ImplData</pre>
<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.248">m_serverManager__IsNotDefault</a></pre>
</li>
</ul>
-<a name="m_servers">
+<a name="m_frags">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_servers</h4>
-<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.260">m_servers</a></pre>
+<h4>m_frags</h4>
+<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.260">m_frags</a></pre>
</li>
</ul>
-<a name="m_servers__IsNotDefault">
+<a name="m_frags__IsNotDefault">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
-<h4>m_servers__IsNotDefault</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.265">m_servers__IsNotDefault</a></pre>
+<h4>m_frags__IsNotDefault</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.265">m_frags__IsNotDefault</a></pre>
</li>
</ul>
</li>
@@ -598,193 +598,193 @@ extends org.jamon.AbstractTemplateProxy.ImplData</pre>
<pre>public <a href="../../../../../../org/apache/hadoop/hbase/master/HMaster.html" title="class in org.apache.hadoop.hbase.master">HMaster</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.108">getMaster</a>()</pre>
</li>
</ul>
-<a name="setFilter-java.lang.String-">
+<a name="setServers-java.util.List-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setFilter</h4>
-<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.114">setFilter</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> filter)</pre>
+<h4>setServers</h4>
+<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.114">setServers</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> servers)</pre>
</li>
</ul>
-<a name="getFilter--">
+<a name="getServers--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getFilter</h4>
-<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.120">getFilter</a>()</pre>
+<h4>getServers</h4>
+<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.120">getServers</a>()</pre>
</li>
</ul>
-<a name="getFilter__IsNotDefault--">
+<a name="getServers__IsNotDefault--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getFilter__IsNotDefault</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.125">getFilter__IsNotDefault</a>()</pre>
+<h4>getServers__IsNotDefault</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.125">getServers__IsNotDefault</a>()</pre>
</li>
</ul>
-<a name="setCatalogJanitorEnabled-boolean-">
+<a name="setDeadServers-java.util.Set-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setCatalogJanitorEnabled</h4>
-<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.131">setCatalogJanitorEnabled</a>(boolean catalogJanitorEnabled)</pre>
+<h4>setDeadServers</h4>
+<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.131">setDeadServers</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> deadServers)</pre>
</li>
</ul>
-<a name="getCatalogJanitorEnabled--">
+<a name="getDeadServers--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getCatalogJanitorEnabled</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.137">getCatalogJanitorEnabled</a>()</pre>
+<h4>getDeadServers</h4>
+<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.137">getDeadServers</a>()</pre>
</li>
</ul>
-<a name="getCatalogJanitorEnabled__IsNotDefault--">
+<a name="getDeadServers__IsNotDefault--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getCatalogJanitorEnabled__IsNotDefault</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.142">getCatalogJanitorEnabled__IsNotDefault</a>()</pre>
+<h4>getDeadServers__IsNotDefault</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.142">getDeadServers__IsNotDefault</a>()</pre>
</li>
</ul>
-<a name="setMetaLocation-org.apache.hadoop.hbase.ServerName-">
+<a name="setFormat-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setMetaLocation</h4>
-<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.148">setMetaLocation</a>(<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> metaLocation)</pre>
+<h4>setFormat</h4>
+<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.148">setFormat</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> format)</pre>
</li>
</ul>
-<a name="getMetaLocation--">
+<a name="getFormat--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getMetaLocation</h4>
-<pre>public <a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.154">getMetaLocation</a>()</pre>
+<h4>getFormat</h4>
+<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.154">getFormat</a>()</pre>
</li>
</ul>
-<a name="getMetaLocation__IsNotDefault--">
+<a name="getFormat__IsNotDefault--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getMetaLocation__IsNotDefault</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.159">getMetaLocation__IsNotDefault</a>()</pre>
+<h4>getFormat__IsNotDefault</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.159">getFormat__IsNotDefault</a>()</pre>
</li>
</ul>
-<a name="setAssignmentManager-org.apache.hadoop.hbase.master.AssignmentManager-">
+<a name="setCatalogJanitorEnabled-boolean-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setAssignmentManager</h4>
-<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.165">setAssignmentManager</a>(<a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> assignmentManager)</pre>
+<h4>setCatalogJanitorEnabled</h4>
+<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.165">setCatalogJanitorEnabled</a>(boolean catalogJanitorEnabled)</pre>
</li>
</ul>
-<a name="getAssignmentManager--">
+<a name="getCatalogJanitorEnabled--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getAssignmentManager</h4>
-<pre>public <a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.171">getAssignmentManager</a>()</pre>
+<h4>getCatalogJanitorEnabled</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.171">getCatalogJanitorEnabled</a>()</pre>
</li>
</ul>
-<a name="getAssignmentManager__IsNotDefault--">
+<a name="getCatalogJanitorEnabled__IsNotDefault--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getAssignmentManager__IsNotDefault</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.176">getAssignmentManager__IsNotDefault</a>()</pre>
+<h4>getCatalogJanitorEnabled__IsNotDefault</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.176">getCatalogJanitorEnabled__IsNotDefault</a>()</pre>
</li>
</ul>
-<a name="setFrags-java.util.Map-">
+<a name="setMetaLocation-org.apache.hadoop.hbase.ServerName-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setFrags</h4>
-<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.182">setFrags</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> frags)</pre>
+<h4>setMetaLocation</h4>
+<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.182">setMetaLocation</a>(<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> metaLocation)</pre>
</li>
</ul>
-<a name="getFrags--">
+<a name="getMetaLocation--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getFrags</h4>
-<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.188">getFrags</a>()</pre>
+<h4>getMetaLocation</h4>
+<pre>public <a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.188">getMetaLocation</a>()</pre>
</li>
</ul>
-<a name="getFrags__IsNotDefault--">
+<a name="getMetaLocation__IsNotDefault--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getFrags__IsNotDefault</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.193">getFrags__IsNotDefault</a>()</pre>
+<h4>getMetaLocation__IsNotDefault</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.193">getMetaLocation__IsNotDefault</a>()</pre>
</li>
</ul>
-<a name="setDeadServers-java.util.Set-">
+<a name="setAssignmentManager-org.apache.hadoop.hbase.master.AssignmentManager-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setDeadServers</h4>
-<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.199">setDeadServers</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> deadServers)</pre>
+<h4>setAssignmentManager</h4>
+<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.199">setAssignmentManager</a>(<a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> assignmentManager)</pre>
</li>
</ul>
-<a name="getDeadServers--">
+<a name="getAssignmentManager--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getDeadServers</h4>
-<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.205">getDeadServers</a>()</pre>
+<h4>getAssignmentManager</h4>
+<pre>public <a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.205">getAssignmentManager</a>()</pre>
</li>
</ul>
-<a name="getDeadServers__IsNotDefault--">
+<a name="getAssignmentManager__IsNotDefault--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getDeadServers__IsNotDefault</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.210">getDeadServers__IsNotDefault</a>()</pre>
+<h4>getAssignmentManager__IsNotDefault</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.210">getAssignmentManager__IsNotDefault</a>()</pre>
</li>
</ul>
-<a name="setFormat-java.lang.String-">
+<a name="setFilter-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setFormat</h4>
-<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.216">setFormat</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> format)</pre>
+<h4>setFilter</h4>
+<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.216">setFilter</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> filter)</pre>
</li>
</ul>
-<a name="getFormat--">
+<a name="getFilter--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getFormat</h4>
-<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.222">getFormat</a>()</pre>
+<h4>getFilter</h4>
+<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.222">getFilter</a>()</pre>
</li>
</ul>
-<a name="getFormat__IsNotDefault--">
+<a name="getFilter__IsNotDefault--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getFormat__IsNotDefault</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.227">getFormat__IsNotDefault</a>()</pre>
+<h4>getFilter__IsNotDefault</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.227">getFilter__IsNotDefault</a>()</pre>
</li>
</ul>
<a name="setServerManager-org.apache.hadoop.hbase.master.ServerManager-">
@@ -814,31 +814,31 @@ extends org.jamon.AbstractTemplateProxy.ImplData</pre>
<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.244">getServerManager__IsNotDefault</a>()</pre>
</li>
</ul>
-<a name="setServers-java.util.List-">
+<a name="setFrags-java.util.Map-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setServers</h4>
-<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.250">setServers</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> servers)</pre>
+<h4>setFrags</h4>
+<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.250">setFrags</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> frags)</pre>
</li>
</ul>
-<a name="getServers--">
+<a name="getFrags--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getServers</h4>
-<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.256">getServers</a>()</pre>
+<h4>getFrags</h4>
+<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.256">getFrags</a>()</pre>
</li>
</ul>
-<a name="getServers__IsNotDefault--">
+<a name="getFrags__IsNotDefault--">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
-<h4>getServers__IsNotDefault</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.261">getServers__IsNotDefault</a>()</pre>
+<h4>getFrags__IsNotDefault</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.ImplData.html#line.261">getFrags__IsNotDefault</a>()</pre>
</li>
</ul>
</li>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html
----------------------------------------------------------------------
diff --git a/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html b/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html
index 0d534ce..f663e0d 100644
--- a/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html
+++ b/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html
@@ -337,67 +337,67 @@ extends org.jamon.AbstractTemplateProxy</pre>
<!-- -->
</a>
<h3>Field Detail</h3>
-<a name="filter">
+<a name="servers">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>filter</h4>
-<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.277">filter</a></pre>
+<h4>servers</h4>
+<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.277">servers</a></pre>
</li>
</ul>
-<a name="catalogJanitorEnabled">
+<a name="deadServers">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>catalogJanitorEnabled</h4>
-<pre>protected boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.284">catalogJanitorEnabled</a></pre>
+<h4>deadServers</h4>
+<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.284">deadServers</a></pre>
</li>
</ul>
-<a name="metaLocation">
+<a name="format">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>metaLocation</h4>
-<pre>protected <a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.291">metaLocation</a></pre>
+<h4>format</h4>
+<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.291">format</a></pre>
</li>
</ul>
-<a name="assignmentManager">
+<a name="catalogJanitorEnabled">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>assignmentManager</h4>
-<pre>protected <a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.298">assignmentManager</a></pre>
+<h4>catalogJanitorEnabled</h4>
+<pre>protected boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.298">catalogJanitorEnabled</a></pre>
</li>
</ul>
-<a name="frags">
+<a name="metaLocation">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>frags</h4>
-<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.305">frags</a></pre>
+<h4>metaLocation</h4>
+<pre>protected <a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.305">metaLocation</a></pre>
</li>
</ul>
-<a name="deadServers">
+<a name="assignmentManager">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>deadServers</h4>
-<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.312">deadServers</a></pre>
+<h4>assignmentManager</h4>
+<pre>protected <a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.312">assignmentManager</a></pre>
</li>
</ul>
-<a name="format">
+<a name="filter">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>format</h4>
-<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.319">format</a></pre>
+<h4>filter</h4>
+<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.319">filter</a></pre>
</li>
</ul>
<a name="serverManager">
@@ -409,13 +409,13 @@ extends org.jamon.AbstractTemplateProxy</pre>
<pre>protected <a href="../../../../../../org/apache/hadoop/hbase/master/ServerManager.html" title="class in org.apache.hadoop.hbase.master">ServerManager</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.326">serverManager</a></pre>
</li>
</ul>
-<a name="servers">
+<a name="frags">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
-<h4>servers</h4>
-<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.333">servers</a></pre>
+<h4>frags</h4>
+<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.333">frags</a></pre>
</li>
</ul>
</li>
@@ -487,67 +487,67 @@ extends org.jamon.AbstractTemplateProxy</pre>
</dl>
</li>
</ul>
-<a name="setFilter-java.lang.String-">
+<a name="setServers-java.util.List-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setFilter</h4>
-<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.278">setFilter</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> p_filter)</pre>
+<h4>setServers</h4>
+<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.278">setServers</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> p_servers)</pre>
</li>
</ul>
-<a name="setCatalogJanitorEnabled-boolean-">
+<a name="setDeadServers-java.util.Set-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setCatalogJanitorEnabled</h4>
-<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.285">setCatalogJanitorEnabled</a>(boolean p_catalogJanitorEnabled)</pre>
+<h4>setDeadServers</h4>
+<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.285">setDeadServers</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> p_deadServers)</pre>
</li>
</ul>
-<a name="setMetaLocation-org.apache.hadoop.hbase.ServerName-">
+<a name="setFormat-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setMetaLocation</h4>
-<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.292">setMetaLocation</a>(<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> p_metaLocation)</pre>
+<h4>setFormat</h4>
+<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.292">setFormat</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> p_format)</pre>
</li>
</ul>
-<a name="setAssignmentManager-org.apache.hadoop.hbase.master.AssignmentManager-">
+<a name="setCatalogJanitorEnabled-boolean-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setAssignmentManager</h4>
-<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.299">setAssignmentManager</a>(<a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> p_assignmentManager)</pre>
+<h4>setCatalogJanitorEnabled</h4>
+<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.299">setCatalogJanitorEnabled</a>(boolean p_catalogJanitorEnabled)</pre>
</li>
</ul>
-<a name="setFrags-java.util.Map-">
+<a name="setMetaLocation-org.apache.hadoop.hbase.ServerName-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setFrags</h4>
-<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.306">setFrags</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> p_frags)</pre>
+<h4>setMetaLocation</h4>
+<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.306">setMetaLocation</a>(<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> p_metaLocation)</pre>
</li>
</ul>
-<a name="setDeadServers-java.util.Set-">
+<a name="setAssignmentManager-org.apache.hadoop.hbase.master.AssignmentManager-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setDeadServers</h4>
-<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.313">setDeadServers</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> p_deadServers)</pre>
+<h4>setAssignmentManager</h4>
+<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.313">setAssignmentManager</a>(<a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> p_assignmentManager)</pre>
</li>
</ul>
-<a name="setFormat-java.lang.String-">
+<a name="setFilter-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setFormat</h4>
-<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.320">setFormat</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> p_format)</pre>
+<h4>setFilter</h4>
+<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.320">setFilter</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> p_filter)</pre>
</li>
</ul>
<a name="setServerManager-org.apache.hadoop.hbase.master.ServerManager-">
@@ -559,13 +559,13 @@ extends org.jamon.AbstractTemplateProxy</pre>
<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.327">setServerManager</a>(<a href="../../../../../../org/apache/hadoop/hbase/master/ServerManager.html" title="class in org.apache.hadoop.hbase.master">ServerManager</a> p_serverManager)</pre>
</li>
</ul>
-<a name="setServers-java.util.List-">
+<a name="setFrags-java.util.Map-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setServers</h4>
-<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.334">setServers</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> p_servers)</pre>
+<h4>setFrags</h4>
+<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.master">MasterStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmpl.html#line.334">setFrags</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> p_frags)</pre>
</li>
</ul>
<a name="constructImpl-java.lang.Class-">
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html
----------------------------------------------------------------------
diff --git a/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html b/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html
index ff4f974..08a7227 100644
--- a/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html
+++ b/devapidocs/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html
@@ -278,67 +278,67 @@ implements <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/Master
<pre>private final <a href="../../../../../../org/apache/hadoop/hbase/master/HMaster.html" title="class in org.apache.hadoop.hbase.master">HMaster</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.64">master</a></pre>
</li>
</ul>
-<a name="filter">
+<a name="servers">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>filter</h4>
-<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.65">filter</a></pre>
+<h4>servers</h4>
+<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.65">servers</a></pre>
</li>
</ul>
-<a name="catalogJanitorEnabled">
+<a name="deadServers">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>catalogJanitorEnabled</h4>
-<pre>private final boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.66">catalogJanitorEnabled</a></pre>
+<h4>deadServers</h4>
+<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.66">deadServers</a></pre>
</li>
</ul>
-<a name="metaLocation">
+<a name="format">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>metaLocation</h4>
-<pre>private final <a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.67">metaLocation</a></pre>
+<h4>format</h4>
+<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.67">format</a></pre>
</li>
</ul>
-<a name="assignmentManager">
+<a name="catalogJanitorEnabled">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>assignmentManager</h4>
-<pre>private final <a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.68">assignmentManager</a></pre>
+<h4>catalogJanitorEnabled</h4>
+<pre>private final boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.68">catalogJanitorEnabled</a></pre>
</li>
</ul>
-<a name="frags">
+<a name="metaLocation">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>frags</h4>
-<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.69">frags</a></pre>
+<h4>metaLocation</h4>
+<pre>private final <a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.69">metaLocation</a></pre>
</li>
</ul>
-<a name="deadServers">
+<a name="assignmentManager">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>deadServers</h4>
-<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Set.html?is-external=true" title="class or interface in java.util">Set</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.70">deadServers</a></pre>
+<h4>assignmentManager</h4>
+<pre>private final <a href="../../../../../../org/apache/hadoop/hbase/master/AssignmentManager.html" title="class in org.apache.hadoop.hbase.master">AssignmentManager</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.70">assignmentManager</a></pre>
</li>
</ul>
-<a name="format">
+<a name="filter">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>format</h4>
-<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.71">format</a></pre>
+<h4>filter</h4>
+<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.71">filter</a></pre>
</li>
</ul>
<a name="serverManager">
@@ -350,13 +350,13 @@ implements <a href="../../../../../../org/apache/hadoop/hbase/tmpl/master/Master
<pre>private final <a href="../../../../../../org/apache/hadoop/hbase/master/ServerManager.html" title="class in org.apache.hadoop.hbase.master">ServerManager</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.72">serverManager</a></pre>
</li>
</ul>
-<a name="servers">
+<a name="frags">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
-<h4>servers</h4>
-<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../../../../org/apache/hadoop/hbase/ServerName.html" title="class in org.apache.hadoop.hbase">ServerName</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.73">servers</a></pre>
+<h4>frags</h4>
+<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util">Map</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>,<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a>> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/master/MasterStatusTmplImpl.html#line.73">frags</a></pre>
</li>
</ul>
</li>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html
----------------------------------------------------------------------
diff --git a/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html b/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html
index 302cfb3..e1c03e7 100644
--- a/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html
+++ b/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html
@@ -293,58 +293,58 @@ extends org.jamon.AbstractTemplateProxy.ImplData</pre>
<pre>private <a href="../../../../../../org/apache/hadoop/hbase/regionserver/HRegionServer.html" title="class in org.apache.hadoop.hbase.regionserver">HRegionServer</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.71">m_regionServer</a></pre>
</li>
</ul>
-<a name="m_filter">
+<a name="m_bcv">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_filter</h4>
-<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.83">m_filter</a></pre>
+<h4>m_bcv</h4>
+<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.83">m_bcv</a></pre>
</li>
</ul>
-<a name="m_filter__IsNotDefault">
+<a name="m_bcv__IsNotDefault">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_filter__IsNotDefault</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.88">m_filter__IsNotDefault</a></pre>
+<h4>m_bcv__IsNotDefault</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.88">m_bcv__IsNotDefault</a></pre>
</li>
</ul>
-<a name="m_bcv">
+<a name="m_format">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_bcv</h4>
-<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.100">m_bcv</a></pre>
+<h4>m_format</h4>
+<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.100">m_format</a></pre>
</li>
</ul>
-<a name="m_bcv__IsNotDefault">
+<a name="m_format__IsNotDefault">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_bcv__IsNotDefault</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.105">m_bcv__IsNotDefault</a></pre>
+<h4>m_format__IsNotDefault</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.105">m_format__IsNotDefault</a></pre>
</li>
</ul>
-<a name="m_format">
+<a name="m_filter">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_format</h4>
-<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.117">m_format</a></pre>
+<h4>m_filter</h4>
+<pre>private <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.117">m_filter</a></pre>
</li>
</ul>
-<a name="m_format__IsNotDefault">
+<a name="m_filter__IsNotDefault">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>m_format__IsNotDefault</h4>
-<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.122">m_format__IsNotDefault</a></pre>
+<h4>m_filter__IsNotDefault</h4>
+<pre>private boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.122">m_filter__IsNotDefault</a></pre>
</li>
</ul>
<a name="m_bcn">
@@ -408,85 +408,85 @@ extends org.jamon.AbstractTemplateProxy.ImplData</pre>
<pre>public <a href="../../../../../../org/apache/hadoop/hbase/regionserver/HRegionServer.html" title="class in org.apache.hadoop.hbase.regionserver">HRegionServer</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.67">getRegionServer</a>()</pre>
</li>
</ul>
-<a name="setFilter-java.lang.String-">
+<a name="setBcv-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setFilter</h4>
-<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.73">setFilter</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> filter)</pre>
+<h4>setBcv</h4>
+<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.73">setBcv</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> bcv)</pre>
</li>
</ul>
-<a name="getFilter--">
+<a name="getBcv--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getFilter</h4>
-<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.79">getFilter</a>()</pre>
+<h4>getBcv</h4>
+<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.79">getBcv</a>()</pre>
</li>
</ul>
-<a name="getFilter__IsNotDefault--">
+<a name="getBcv__IsNotDefault--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getFilter__IsNotDefault</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.84">getFilter__IsNotDefault</a>()</pre>
+<h4>getBcv__IsNotDefault</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.84">getBcv__IsNotDefault</a>()</pre>
</li>
</ul>
-<a name="setBcv-java.lang.String-">
+<a name="setFormat-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setBcv</h4>
-<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.90">setBcv</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> bcv)</pre>
+<h4>setFormat</h4>
+<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.90">setFormat</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> format)</pre>
</li>
</ul>
-<a name="getBcv--">
+<a name="getFormat--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getBcv</h4>
-<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.96">getBcv</a>()</pre>
+<h4>getFormat</h4>
+<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.96">getFormat</a>()</pre>
</li>
</ul>
-<a name="getBcv__IsNotDefault--">
+<a name="getFormat__IsNotDefault--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getBcv__IsNotDefault</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.101">getBcv__IsNotDefault</a>()</pre>
+<h4>getFormat__IsNotDefault</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.101">getFormat__IsNotDefault</a>()</pre>
</li>
</ul>
-<a name="setFormat-java.lang.String-">
+<a name="setFilter-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setFormat</h4>
-<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.107">setFormat</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> format)</pre>
+<h4>setFilter</h4>
+<pre>public void <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.107">setFilter</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> filter)</pre>
</li>
</ul>
-<a name="getFormat--">
+<a name="getFilter--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getFormat</h4>
-<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.113">getFormat</a>()</pre>
+<h4>getFilter</h4>
+<pre>public <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.113">getFilter</a>()</pre>
</li>
</ul>
-<a name="getFormat__IsNotDefault--">
+<a name="getFilter__IsNotDefault--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>getFormat__IsNotDefault</h4>
-<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.118">getFormat__IsNotDefault</a>()</pre>
+<h4>getFilter__IsNotDefault</h4>
+<pre>public boolean <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.ImplData.html#line.118">getFilter__IsNotDefault</a>()</pre>
</li>
</ul>
<a name="setBcn-java.lang.String-">
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html
----------------------------------------------------------------------
diff --git a/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html b/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html
index b0a9e9e..e923d58 100644
--- a/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html
+++ b/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html
@@ -297,31 +297,31 @@ extends org.jamon.AbstractTemplateProxy</pre>
<!-- -->
</a>
<h3>Field Detail</h3>
-<a name="filter">
+<a name="bcv">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>filter</h4>
-<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.151">filter</a></pre>
+<h4>bcv</h4>
+<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.151">bcv</a></pre>
</li>
</ul>
-<a name="bcv">
+<a name="format">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>bcv</h4>
-<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.158">bcv</a></pre>
+<h4>format</h4>
+<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.158">format</a></pre>
</li>
</ul>
-<a name="format">
+<a name="filter">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>format</h4>
-<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.165">format</a></pre>
+<h4>filter</h4>
+<pre>protected <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.165">filter</a></pre>
</li>
</ul>
<a name="bcn">
@@ -402,31 +402,31 @@ extends org.jamon.AbstractTemplateProxy</pre>
</dl>
</li>
</ul>
-<a name="setFilter-java.lang.String-">
+<a name="setBcv-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setFilter</h4>
-<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.regionserver">RSStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.152">setFilter</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> p_filter)</pre>
+<h4>setBcv</h4>
+<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.regionserver">RSStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.152">setBcv</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> p_bcv)</pre>
</li>
</ul>
-<a name="setBcv-java.lang.String-">
+<a name="setFormat-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setBcv</h4>
-<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.regionserver">RSStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.159">setBcv</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> p_bcv)</pre>
+<h4>setFormat</h4>
+<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.regionserver">RSStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.159">setFormat</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> p_format)</pre>
</li>
</ul>
-<a name="setFormat-java.lang.String-">
+<a name="setFilter-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>setFormat</h4>
-<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.regionserver">RSStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.166">setFormat</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> p_format)</pre>
+<h4>setFilter</h4>
+<pre>public final <a href="../../../../../../org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html" title="class in org.apache.hadoop.hbase.tmpl.regionserver">RSStatusTmpl</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmpl.html#line.166">setFilter</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> p_filter)</pre>
</li>
</ul>
<a name="setBcn-java.lang.String-">
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html
----------------------------------------------------------------------
diff --git a/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html b/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html
index f56b0c1..e4ea8fb 100644
--- a/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html
+++ b/devapidocs/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html
@@ -238,31 +238,31 @@ implements <a href="../../../../../../org/apache/hadoop/hbase/tmpl/regionserver/
<pre>private final <a href="../../../../../../org/apache/hadoop/hbase/regionserver/HRegionServer.html" title="class in org.apache.hadoop.hbase.regionserver">HRegionServer</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html#line.28">regionServer</a></pre>
</li>
</ul>
-<a name="filter">
+<a name="bcv">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>filter</h4>
-<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html#line.29">filter</a></pre>
+<h4>bcv</h4>
+<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html#line.29">bcv</a></pre>
</li>
</ul>
-<a name="bcv">
+<a name="format">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>bcv</h4>
-<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html#line.30">bcv</a></pre>
+<h4>format</h4>
+<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html#line.30">format</a></pre>
</li>
</ul>
-<a name="format">
+<a name="filter">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
-<h4>format</h4>
-<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html#line.31">format</a></pre>
+<h4>filter</h4>
+<pre>private final <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../../src-html/org/apache/hadoop/hbase/tmpl/regionserver/RSStatusTmplImpl.html#line.31">filter</a></pre>
</li>
</ul>
<a name="bcn">
[15/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.html
----------------------------------------------------------------------
diff --git a/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.html b/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.html
index 3c7d6b4..3dea877 100644
--- a/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.html
+++ b/apidocs/src-html/org/apache/hadoop/hbase/util/Bytes.html
@@ -1583,1089 +1583,1084 @@
<span class="sourceLineNo">1575</span> length1 == length2) {<a name="line.1575"></a>
<span class="sourceLineNo">1576</span> return 0;<a name="line.1576"></a>
<span class="sourceLineNo">1577</span> }<a name="line.1577"></a>
-<span class="sourceLineNo">1578</span> final int minLength = Math.min(length1, length2);<a name="line.1578"></a>
-<span class="sourceLineNo">1579</span> final int minWords = minLength / SIZEOF_LONG;<a name="line.1579"></a>
-<span class="sourceLineNo">1580</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1580"></a>
-<span class="sourceLineNo">1581</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
-<span class="sourceLineNo">1582</span><a name="line.1582"></a>
-<span class="sourceLineNo">1583</span> /*<a name="line.1583"></a>
-<span class="sourceLineNo">1584</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a<a name="line.1584"></a>
-<span class="sourceLineNo">1585</span> * time is no slower than comparing 4 bytes at a time even on 32-bit.<a name="line.1585"></a>
-<span class="sourceLineNo">1586</span> * On the other hand, it is substantially faster on 64-bit.<a name="line.1586"></a>
-<span class="sourceLineNo">1587</span> */<a name="line.1587"></a>
-<span class="sourceLineNo">1588</span> // This is the end offset of long parts.<a name="line.1588"></a>
-<span class="sourceLineNo">1589</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.1589"></a>
-<span class="sourceLineNo">1590</span> for (int i = 0; i < j; i += SIZEOF_LONG) {<a name="line.1590"></a>
-<span class="sourceLineNo">1591</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1591"></a>
-<span class="sourceLineNo">1592</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1592"></a>
-<span class="sourceLineNo">1593</span> long diff = lw ^ rw;<a name="line.1593"></a>
-<span class="sourceLineNo">1594</span> if (diff != 0) {<a name="line.1594"></a>
-<span class="sourceLineNo">1595</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.1595"></a>
-<span class="sourceLineNo">1596</span> }<a name="line.1596"></a>
-<span class="sourceLineNo">1597</span> }<a name="line.1597"></a>
-<span class="sourceLineNo">1598</span> int offset = j;<a name="line.1598"></a>
-<span class="sourceLineNo">1599</span><a name="line.1599"></a>
-<span class="sourceLineNo">1600</span> if (minLength - offset >= SIZEOF_INT) {<a name="line.1600"></a>
-<span class="sourceLineNo">1601</span> int il = theUnsafe.getInt(buffer1, offset1Adj + offset);<a name="line.1601"></a>
-<span class="sourceLineNo">1602</span> int ir = theUnsafe.getInt(buffer2, offset2Adj + offset);<a name="line.1602"></a>
-<span class="sourceLineNo">1603</span> if (il != ir) {<a name="line.1603"></a>
-<span class="sourceLineNo">1604</span> return lessThanUnsignedInt(il, ir) ? -1: 1;<a name="line.1604"></a>
-<span class="sourceLineNo">1605</span> }<a name="line.1605"></a>
-<span class="sourceLineNo">1606</span> offset += SIZEOF_INT;<a name="line.1606"></a>
-<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
-<span class="sourceLineNo">1608</span> if (minLength - offset >= SIZEOF_SHORT) {<a name="line.1608"></a>
-<span class="sourceLineNo">1609</span> short sl = theUnsafe.getShort(buffer1, offset1Adj + offset);<a name="line.1609"></a>
-<span class="sourceLineNo">1610</span> short sr = theUnsafe.getShort(buffer2, offset2Adj + offset);<a name="line.1610"></a>
-<span class="sourceLineNo">1611</span> if (sl != sr) {<a name="line.1611"></a>
-<span class="sourceLineNo">1612</span> return lessThanUnsignedShort(sl, sr) ? -1: 1;<a name="line.1612"></a>
-<span class="sourceLineNo">1613</span> }<a name="line.1613"></a>
-<span class="sourceLineNo">1614</span> offset += SIZEOF_SHORT;<a name="line.1614"></a>
-<span class="sourceLineNo">1615</span> }<a name="line.1615"></a>
-<span class="sourceLineNo">1616</span> if (minLength - offset == 1) {<a name="line.1616"></a>
-<span class="sourceLineNo">1617</span> int a = (buffer1[(int)(offset1 + offset)] & 0xff);<a name="line.1617"></a>
-<span class="sourceLineNo">1618</span> int b = (buffer2[(int)(offset2 + offset)] & 0xff);<a name="line.1618"></a>
-<span class="sourceLineNo">1619</span> if (a != b) {<a name="line.1619"></a>
-<span class="sourceLineNo">1620</span> return a - b;<a name="line.1620"></a>
-<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
-<span class="sourceLineNo">1622</span> }<a name="line.1622"></a>
-<span class="sourceLineNo">1623</span> return length1 - length2;<a name="line.1623"></a>
-<span class="sourceLineNo">1624</span> }<a name="line.1624"></a>
-<span class="sourceLineNo">1625</span> }<a name="line.1625"></a>
-<span class="sourceLineNo">1626</span> }<a name="line.1626"></a>
-<span class="sourceLineNo">1627</span><a name="line.1627"></a>
-<span class="sourceLineNo">1628</span> /**<a name="line.1628"></a>
-<span class="sourceLineNo">1629</span> * @param left left operand<a name="line.1629"></a>
-<span class="sourceLineNo">1630</span> * @param right right operand<a name="line.1630"></a>
-<span class="sourceLineNo">1631</span> * @return True if equal<a name="line.1631"></a>
-<span class="sourceLineNo">1632</span> */<a name="line.1632"></a>
-<span class="sourceLineNo">1633</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1633"></a>
-<span class="sourceLineNo">1634</span> // Could use Arrays.equals?<a name="line.1634"></a>
-<span class="sourceLineNo">1635</span> //noinspection SimplifiableConditionalExpression<a name="line.1635"></a>
-<span class="sourceLineNo">1636</span> if (left == right) return true;<a name="line.1636"></a>
-<span class="sourceLineNo">1637</span> if (left == null || right == null) return false;<a name="line.1637"></a>
-<span class="sourceLineNo">1638</span> if (left.length != right.length) return false;<a name="line.1638"></a>
-<span class="sourceLineNo">1639</span> if (left.length == 0) return true;<a name="line.1639"></a>
+<span class="sourceLineNo">1578</span> final int stride = 8;<a name="line.1578"></a>
+<span class="sourceLineNo">1579</span> final int minLength = Math.min(length1, length2);<a name="line.1579"></a>
+<span class="sourceLineNo">1580</span> int strideLimit = minLength & ~(stride - 1);<a name="line.1580"></a>
+<span class="sourceLineNo">1581</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
+<span class="sourceLineNo">1582</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1582"></a>
+<span class="sourceLineNo">1583</span> int i;<a name="line.1583"></a>
+<span class="sourceLineNo">1584</span><a name="line.1584"></a>
+<span class="sourceLineNo">1585</span> /*<a name="line.1585"></a>
+<span class="sourceLineNo">1586</span> * Compare 8 bytes at a time. Benchmarking on x86 shows a stride of 8 bytes is no slower<a name="line.1586"></a>
+<span class="sourceLineNo">1587</span> * than 4 bytes even on 32-bit. On the other hand, it is substantially faster on 64-bit.<a name="line.1587"></a>
+<span class="sourceLineNo">1588</span> */<a name="line.1588"></a>
+<span class="sourceLineNo">1589</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.1589"></a>
+<span class="sourceLineNo">1590</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1590"></a>
+<span class="sourceLineNo">1591</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1591"></a>
+<span class="sourceLineNo">1592</span> if (lw != rw) {<a name="line.1592"></a>
+<span class="sourceLineNo">1593</span> if(!UnsafeAccess.littleEndian) {<a name="line.1593"></a>
+<span class="sourceLineNo">1594</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.1594"></a>
+<span class="sourceLineNo">1595</span> }<a name="line.1595"></a>
+<span class="sourceLineNo">1596</span><a name="line.1596"></a>
+<span class="sourceLineNo">1597</span> /*<a name="line.1597"></a>
+<span class="sourceLineNo">1598</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.1598"></a>
+<span class="sourceLineNo">1599</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.1599"></a>
+<span class="sourceLineNo">1600</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.1600"></a>
+<span class="sourceLineNo">1601</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.1601"></a>
+<span class="sourceLineNo">1602</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.1602"></a>
+<span class="sourceLineNo">1603</span> * comparator from guava v21<a name="line.1603"></a>
+<span class="sourceLineNo">1604</span> */<a name="line.1604"></a>
+<span class="sourceLineNo">1605</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.1605"></a>
+<span class="sourceLineNo">1606</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.1606"></a>
+<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
+<span class="sourceLineNo">1608</span> }<a name="line.1608"></a>
+<span class="sourceLineNo">1609</span><a name="line.1609"></a>
+<span class="sourceLineNo">1610</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.1610"></a>
+<span class="sourceLineNo">1611</span> for (; i < minLength; i++) {<a name="line.1611"></a>
+<span class="sourceLineNo">1612</span> int a = (buffer1[offset1 + i] & 0xFF);<a name="line.1612"></a>
+<span class="sourceLineNo">1613</span> int b = (buffer2[offset2 + i] & 0xFF);<a name="line.1613"></a>
+<span class="sourceLineNo">1614</span> if (a != b) {<a name="line.1614"></a>
+<span class="sourceLineNo">1615</span> return a - b;<a name="line.1615"></a>
+<span class="sourceLineNo">1616</span> }<a name="line.1616"></a>
+<span class="sourceLineNo">1617</span> }<a name="line.1617"></a>
+<span class="sourceLineNo">1618</span> return length1 - length2;<a name="line.1618"></a>
+<span class="sourceLineNo">1619</span> }<a name="line.1619"></a>
+<span class="sourceLineNo">1620</span> }<a name="line.1620"></a>
+<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
+<span class="sourceLineNo">1622</span><a name="line.1622"></a>
+<span class="sourceLineNo">1623</span> /**<a name="line.1623"></a>
+<span class="sourceLineNo">1624</span> * @param left left operand<a name="line.1624"></a>
+<span class="sourceLineNo">1625</span> * @param right right operand<a name="line.1625"></a>
+<span class="sourceLineNo">1626</span> * @return True if equal<a name="line.1626"></a>
+<span class="sourceLineNo">1627</span> */<a name="line.1627"></a>
+<span class="sourceLineNo">1628</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1628"></a>
+<span class="sourceLineNo">1629</span> // Could use Arrays.equals?<a name="line.1629"></a>
+<span class="sourceLineNo">1630</span> //noinspection SimplifiableConditionalExpression<a name="line.1630"></a>
+<span class="sourceLineNo">1631</span> if (left == right) return true;<a name="line.1631"></a>
+<span class="sourceLineNo">1632</span> if (left == null || right == null) return false;<a name="line.1632"></a>
+<span class="sourceLineNo">1633</span> if (left.length != right.length) return false;<a name="line.1633"></a>
+<span class="sourceLineNo">1634</span> if (left.length == 0) return true;<a name="line.1634"></a>
+<span class="sourceLineNo">1635</span><a name="line.1635"></a>
+<span class="sourceLineNo">1636</span> // Since we're often comparing adjacent sorted data,<a name="line.1636"></a>
+<span class="sourceLineNo">1637</span> // it's usual to have equal arrays except for the very last byte<a name="line.1637"></a>
+<span class="sourceLineNo">1638</span> // so check that first<a name="line.1638"></a>
+<span class="sourceLineNo">1639</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1639"></a>
<span class="sourceLineNo">1640</span><a name="line.1640"></a>
-<span class="sourceLineNo">1641</span> // Since we're often comparing adjacent sorted data,<a name="line.1641"></a>
-<span class="sourceLineNo">1642</span> // it's usual to have equal arrays except for the very last byte<a name="line.1642"></a>
-<span class="sourceLineNo">1643</span> // so check that first<a name="line.1643"></a>
-<span class="sourceLineNo">1644</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1644"></a>
-<span class="sourceLineNo">1645</span><a name="line.1645"></a>
-<span class="sourceLineNo">1646</span> return compareTo(left, right) == 0;<a name="line.1646"></a>
-<span class="sourceLineNo">1647</span> }<a name="line.1647"></a>
-<span class="sourceLineNo">1648</span><a name="line.1648"></a>
-<span class="sourceLineNo">1649</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1649"></a>
-<span class="sourceLineNo">1650</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1650"></a>
-<span class="sourceLineNo">1651</span> // short circuit case<a name="line.1651"></a>
-<span class="sourceLineNo">1652</span> if (left == right &&<a name="line.1652"></a>
-<span class="sourceLineNo">1653</span> leftOffset == rightOffset &&<a name="line.1653"></a>
-<span class="sourceLineNo">1654</span> leftLen == rightLen) {<a name="line.1654"></a>
-<span class="sourceLineNo">1655</span> return true;<a name="line.1655"></a>
-<span class="sourceLineNo">1656</span> }<a name="line.1656"></a>
-<span class="sourceLineNo">1657</span> // different lengths fast check<a name="line.1657"></a>
-<span class="sourceLineNo">1658</span> if (leftLen != rightLen) {<a name="line.1658"></a>
-<span class="sourceLineNo">1659</span> return false;<a name="line.1659"></a>
-<span class="sourceLineNo">1660</span> }<a name="line.1660"></a>
-<span class="sourceLineNo">1661</span> if (leftLen == 0) {<a name="line.1661"></a>
-<span class="sourceLineNo">1662</span> return true;<a name="line.1662"></a>
-<span class="sourceLineNo">1663</span> }<a name="line.1663"></a>
+<span class="sourceLineNo">1641</span> return compareTo(left, right) == 0;<a name="line.1641"></a>
+<span class="sourceLineNo">1642</span> }<a name="line.1642"></a>
+<span class="sourceLineNo">1643</span><a name="line.1643"></a>
+<span class="sourceLineNo">1644</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1644"></a>
+<span class="sourceLineNo">1645</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1645"></a>
+<span class="sourceLineNo">1646</span> // short circuit case<a name="line.1646"></a>
+<span class="sourceLineNo">1647</span> if (left == right &&<a name="line.1647"></a>
+<span class="sourceLineNo">1648</span> leftOffset == rightOffset &&<a name="line.1648"></a>
+<span class="sourceLineNo">1649</span> leftLen == rightLen) {<a name="line.1649"></a>
+<span class="sourceLineNo">1650</span> return true;<a name="line.1650"></a>
+<span class="sourceLineNo">1651</span> }<a name="line.1651"></a>
+<span class="sourceLineNo">1652</span> // different lengths fast check<a name="line.1652"></a>
+<span class="sourceLineNo">1653</span> if (leftLen != rightLen) {<a name="line.1653"></a>
+<span class="sourceLineNo">1654</span> return false;<a name="line.1654"></a>
+<span class="sourceLineNo">1655</span> }<a name="line.1655"></a>
+<span class="sourceLineNo">1656</span> if (leftLen == 0) {<a name="line.1656"></a>
+<span class="sourceLineNo">1657</span> return true;<a name="line.1657"></a>
+<span class="sourceLineNo">1658</span> }<a name="line.1658"></a>
+<span class="sourceLineNo">1659</span><a name="line.1659"></a>
+<span class="sourceLineNo">1660</span> // Since we're often comparing adjacent sorted data,<a name="line.1660"></a>
+<span class="sourceLineNo">1661</span> // it's usual to have equal arrays except for the very last byte<a name="line.1661"></a>
+<span class="sourceLineNo">1662</span> // so check that first<a name="line.1662"></a>
+<span class="sourceLineNo">1663</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1663"></a>
<span class="sourceLineNo">1664</span><a name="line.1664"></a>
-<span class="sourceLineNo">1665</span> // Since we're often comparing adjacent sorted data,<a name="line.1665"></a>
-<span class="sourceLineNo">1666</span> // it's usual to have equal arrays except for the very last byte<a name="line.1666"></a>
-<span class="sourceLineNo">1667</span> // so check that first<a name="line.1667"></a>
-<span class="sourceLineNo">1668</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1668"></a>
+<span class="sourceLineNo">1665</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1665"></a>
+<span class="sourceLineNo">1666</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1666"></a>
+<span class="sourceLineNo">1667</span> }<a name="line.1667"></a>
+<span class="sourceLineNo">1668</span><a name="line.1668"></a>
<span class="sourceLineNo">1669</span><a name="line.1669"></a>
-<span class="sourceLineNo">1670</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1670"></a>
-<span class="sourceLineNo">1671</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1671"></a>
-<span class="sourceLineNo">1672</span> }<a name="line.1672"></a>
-<span class="sourceLineNo">1673</span><a name="line.1673"></a>
-<span class="sourceLineNo">1674</span><a name="line.1674"></a>
-<span class="sourceLineNo">1675</span> /**<a name="line.1675"></a>
-<span class="sourceLineNo">1676</span> * @param a left operand<a name="line.1676"></a>
-<span class="sourceLineNo">1677</span> * @param buf right operand<a name="line.1677"></a>
-<span class="sourceLineNo">1678</span> * @return True if equal<a name="line.1678"></a>
-<span class="sourceLineNo">1679</span> */<a name="line.1679"></a>
-<span class="sourceLineNo">1680</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1680"></a>
-<span class="sourceLineNo">1681</span> if (a == null) return buf == null;<a name="line.1681"></a>
-<span class="sourceLineNo">1682</span> if (buf == null) return false;<a name="line.1682"></a>
-<span class="sourceLineNo">1683</span> if (a.length != buf.remaining()) return false;<a name="line.1683"></a>
-<span class="sourceLineNo">1684</span><a name="line.1684"></a>
-<span class="sourceLineNo">1685</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1685"></a>
-<span class="sourceLineNo">1686</span> ByteBuffer b = buf.duplicate();<a name="line.1686"></a>
-<span class="sourceLineNo">1687</span> for (byte anA : a) {<a name="line.1687"></a>
-<span class="sourceLineNo">1688</span> if (anA != b.get()) {<a name="line.1688"></a>
-<span class="sourceLineNo">1689</span> return false;<a name="line.1689"></a>
-<span class="sourceLineNo">1690</span> }<a name="line.1690"></a>
-<span class="sourceLineNo">1691</span> }<a name="line.1691"></a>
-<span class="sourceLineNo">1692</span> return true;<a name="line.1692"></a>
-<span class="sourceLineNo">1693</span> }<a name="line.1693"></a>
-<span class="sourceLineNo">1694</span><a name="line.1694"></a>
-<span class="sourceLineNo">1695</span><a name="line.1695"></a>
-<span class="sourceLineNo">1696</span> /**<a name="line.1696"></a>
-<span class="sourceLineNo">1697</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1697"></a>
-<span class="sourceLineNo">1698</span> * array on the left.<a name="line.1698"></a>
-<span class="sourceLineNo">1699</span> */<a name="line.1699"></a>
-<span class="sourceLineNo">1700</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1700"></a>
-<span class="sourceLineNo">1701</span> return bytes != null && prefix != null &&<a name="line.1701"></a>
-<span class="sourceLineNo">1702</span> bytes.length >= prefix.length &&<a name="line.1702"></a>
-<span class="sourceLineNo">1703</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1703"></a>
-<span class="sourceLineNo">1704</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1704"></a>
-<span class="sourceLineNo">1705</span> }<a name="line.1705"></a>
-<span class="sourceLineNo">1706</span><a name="line.1706"></a>
-<span class="sourceLineNo">1707</span> /**<a name="line.1707"></a>
-<span class="sourceLineNo">1708</span> * @param b bytes to hash<a name="line.1708"></a>
-<span class="sourceLineNo">1709</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1709"></a>
-<span class="sourceLineNo">1710</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1710"></a>
-<span class="sourceLineNo">1711</span> * use calculating hash code.<a name="line.1711"></a>
-<span class="sourceLineNo">1712</span> */<a name="line.1712"></a>
-<span class="sourceLineNo">1713</span> public static int hashCode(final byte [] b) {<a name="line.1713"></a>
-<span class="sourceLineNo">1714</span> return hashCode(b, b.length);<a name="line.1714"></a>
-<span class="sourceLineNo">1715</span> }<a name="line.1715"></a>
-<span class="sourceLineNo">1716</span><a name="line.1716"></a>
-<span class="sourceLineNo">1717</span> /**<a name="line.1717"></a>
-<span class="sourceLineNo">1718</span> * @param b value<a name="line.1718"></a>
-<span class="sourceLineNo">1719</span> * @param length length of the value<a name="line.1719"></a>
-<span class="sourceLineNo">1720</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1720"></a>
-<span class="sourceLineNo">1721</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1721"></a>
-<span class="sourceLineNo">1722</span> * use calculating hash code.<a name="line.1722"></a>
-<span class="sourceLineNo">1723</span> */<a name="line.1723"></a>
-<span class="sourceLineNo">1724</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1724"></a>
-<span class="sourceLineNo">1725</span> return WritableComparator.hashBytes(b, length);<a name="line.1725"></a>
-<span class="sourceLineNo">1726</span> }<a name="line.1726"></a>
-<span class="sourceLineNo">1727</span><a name="line.1727"></a>
-<span class="sourceLineNo">1728</span> /**<a name="line.1728"></a>
-<span class="sourceLineNo">1729</span> * @param b bytes to hash<a name="line.1729"></a>
-<span class="sourceLineNo">1730</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1730"></a>
-<span class="sourceLineNo">1731</span> * Maps.<a name="line.1731"></a>
-<span class="sourceLineNo">1732</span> */<a name="line.1732"></a>
-<span class="sourceLineNo">1733</span> public static Integer mapKey(final byte [] b) {<a name="line.1733"></a>
-<span class="sourceLineNo">1734</span> return hashCode(b);<a name="line.1734"></a>
-<span class="sourceLineNo">1735</span> }<a name="line.1735"></a>
-<span class="sourceLineNo">1736</span><a name="line.1736"></a>
-<span class="sourceLineNo">1737</span> /**<a name="line.1737"></a>
-<span class="sourceLineNo">1738</span> * @param b bytes to hash<a name="line.1738"></a>
-<span class="sourceLineNo">1739</span> * @param length length to hash<a name="line.1739"></a>
-<span class="sourceLineNo">1740</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1740"></a>
-<span class="sourceLineNo">1741</span> * Maps.<a name="line.1741"></a>
-<span class="sourceLineNo">1742</span> */<a name="line.1742"></a>
-<span class="sourceLineNo">1743</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1743"></a>
-<span class="sourceLineNo">1744</span> return hashCode(b, length);<a name="line.1744"></a>
-<span class="sourceLineNo">1745</span> }<a name="line.1745"></a>
-<span class="sourceLineNo">1746</span><a name="line.1746"></a>
-<span class="sourceLineNo">1747</span> /**<a name="line.1747"></a>
-<span class="sourceLineNo">1748</span> * @param a lower half<a name="line.1748"></a>
-<span class="sourceLineNo">1749</span> * @param b upper half<a name="line.1749"></a>
-<span class="sourceLineNo">1750</span> * @return New array that has a in lower half and b in upper half.<a name="line.1750"></a>
-<span class="sourceLineNo">1751</span> */<a name="line.1751"></a>
-<span class="sourceLineNo">1752</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1752"></a>
-<span class="sourceLineNo">1753</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1753"></a>
-<span class="sourceLineNo">1754</span> }<a name="line.1754"></a>
-<span class="sourceLineNo">1755</span><a name="line.1755"></a>
-<span class="sourceLineNo">1756</span> /**<a name="line.1756"></a>
-<span class="sourceLineNo">1757</span> * @param a first third<a name="line.1757"></a>
-<span class="sourceLineNo">1758</span> * @param b second third<a name="line.1758"></a>
-<span class="sourceLineNo">1759</span> * @param c third third<a name="line.1759"></a>
-<span class="sourceLineNo">1760</span> * @return New array made from a, b and c<a name="line.1760"></a>
-<span class="sourceLineNo">1761</span> */<a name="line.1761"></a>
-<span class="sourceLineNo">1762</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1762"></a>
-<span class="sourceLineNo">1763</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1763"></a>
-<span class="sourceLineNo">1764</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1764"></a>
-<span class="sourceLineNo">1765</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1765"></a>
-<span class="sourceLineNo">1766</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1766"></a>
-<span class="sourceLineNo">1767</span> return result;<a name="line.1767"></a>
-<span class="sourceLineNo">1768</span> }<a name="line.1768"></a>
-<span class="sourceLineNo">1769</span><a name="line.1769"></a>
-<span class="sourceLineNo">1770</span> /**<a name="line.1770"></a>
-<span class="sourceLineNo">1771</span> * @param arrays all the arrays to concatenate together.<a name="line.1771"></a>
-<span class="sourceLineNo">1772</span> * @return New array made from the concatenation of the given arrays.<a name="line.1772"></a>
-<span class="sourceLineNo">1773</span> */<a name="line.1773"></a>
-<span class="sourceLineNo">1774</span> public static byte [] add(final byte [][] arrays) {<a name="line.1774"></a>
-<span class="sourceLineNo">1775</span> int length = 0;<a name="line.1775"></a>
+<span class="sourceLineNo">1670</span> /**<a name="line.1670"></a>
+<span class="sourceLineNo">1671</span> * @param a left operand<a name="line.1671"></a>
+<span class="sourceLineNo">1672</span> * @param buf right operand<a name="line.1672"></a>
+<span class="sourceLineNo">1673</span> * @return True if equal<a name="line.1673"></a>
+<span class="sourceLineNo">1674</span> */<a name="line.1674"></a>
+<span class="sourceLineNo">1675</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1675"></a>
+<span class="sourceLineNo">1676</span> if (a == null) return buf == null;<a name="line.1676"></a>
+<span class="sourceLineNo">1677</span> if (buf == null) return false;<a name="line.1677"></a>
+<span class="sourceLineNo">1678</span> if (a.length != buf.remaining()) return false;<a name="line.1678"></a>
+<span class="sourceLineNo">1679</span><a name="line.1679"></a>
+<span class="sourceLineNo">1680</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1680"></a>
+<span class="sourceLineNo">1681</span> ByteBuffer b = buf.duplicate();<a name="line.1681"></a>
+<span class="sourceLineNo">1682</span> for (byte anA : a) {<a name="line.1682"></a>
+<span class="sourceLineNo">1683</span> if (anA != b.get()) {<a name="line.1683"></a>
+<span class="sourceLineNo">1684</span> return false;<a name="line.1684"></a>
+<span class="sourceLineNo">1685</span> }<a name="line.1685"></a>
+<span class="sourceLineNo">1686</span> }<a name="line.1686"></a>
+<span class="sourceLineNo">1687</span> return true;<a name="line.1687"></a>
+<span class="sourceLineNo">1688</span> }<a name="line.1688"></a>
+<span class="sourceLineNo">1689</span><a name="line.1689"></a>
+<span class="sourceLineNo">1690</span><a name="line.1690"></a>
+<span class="sourceLineNo">1691</span> /**<a name="line.1691"></a>
+<span class="sourceLineNo">1692</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1692"></a>
+<span class="sourceLineNo">1693</span> * array on the left.<a name="line.1693"></a>
+<span class="sourceLineNo">1694</span> */<a name="line.1694"></a>
+<span class="sourceLineNo">1695</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1695"></a>
+<span class="sourceLineNo">1696</span> return bytes != null && prefix != null &&<a name="line.1696"></a>
+<span class="sourceLineNo">1697</span> bytes.length >= prefix.length &&<a name="line.1697"></a>
+<span class="sourceLineNo">1698</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1698"></a>
+<span class="sourceLineNo">1699</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1699"></a>
+<span class="sourceLineNo">1700</span> }<a name="line.1700"></a>
+<span class="sourceLineNo">1701</span><a name="line.1701"></a>
+<span class="sourceLineNo">1702</span> /**<a name="line.1702"></a>
+<span class="sourceLineNo">1703</span> * @param b bytes to hash<a name="line.1703"></a>
+<span class="sourceLineNo">1704</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1704"></a>
+<span class="sourceLineNo">1705</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1705"></a>
+<span class="sourceLineNo">1706</span> * use calculating hash code.<a name="line.1706"></a>
+<span class="sourceLineNo">1707</span> */<a name="line.1707"></a>
+<span class="sourceLineNo">1708</span> public static int hashCode(final byte [] b) {<a name="line.1708"></a>
+<span class="sourceLineNo">1709</span> return hashCode(b, b.length);<a name="line.1709"></a>
+<span class="sourceLineNo">1710</span> }<a name="line.1710"></a>
+<span class="sourceLineNo">1711</span><a name="line.1711"></a>
+<span class="sourceLineNo">1712</span> /**<a name="line.1712"></a>
+<span class="sourceLineNo">1713</span> * @param b value<a name="line.1713"></a>
+<span class="sourceLineNo">1714</span> * @param length length of the value<a name="line.1714"></a>
+<span class="sourceLineNo">1715</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1715"></a>
+<span class="sourceLineNo">1716</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1716"></a>
+<span class="sourceLineNo">1717</span> * use calculating hash code.<a name="line.1717"></a>
+<span class="sourceLineNo">1718</span> */<a name="line.1718"></a>
+<span class="sourceLineNo">1719</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1719"></a>
+<span class="sourceLineNo">1720</span> return WritableComparator.hashBytes(b, length);<a name="line.1720"></a>
+<span class="sourceLineNo">1721</span> }<a name="line.1721"></a>
+<span class="sourceLineNo">1722</span><a name="line.1722"></a>
+<span class="sourceLineNo">1723</span> /**<a name="line.1723"></a>
+<span class="sourceLineNo">1724</span> * @param b bytes to hash<a name="line.1724"></a>
+<span class="sourceLineNo">1725</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1725"></a>
+<span class="sourceLineNo">1726</span> * Maps.<a name="line.1726"></a>
+<span class="sourceLineNo">1727</span> */<a name="line.1727"></a>
+<span class="sourceLineNo">1728</span> public static Integer mapKey(final byte [] b) {<a name="line.1728"></a>
+<span class="sourceLineNo">1729</span> return hashCode(b);<a name="line.1729"></a>
+<span class="sourceLineNo">1730</span> }<a name="line.1730"></a>
+<span class="sourceLineNo">1731</span><a name="line.1731"></a>
+<span class="sourceLineNo">1732</span> /**<a name="line.1732"></a>
+<span class="sourceLineNo">1733</span> * @param b bytes to hash<a name="line.1733"></a>
+<span class="sourceLineNo">1734</span> * @param length length to hash<a name="line.1734"></a>
+<span class="sourceLineNo">1735</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1735"></a>
+<span class="sourceLineNo">1736</span> * Maps.<a name="line.1736"></a>
+<span class="sourceLineNo">1737</span> */<a name="line.1737"></a>
+<span class="sourceLineNo">1738</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1738"></a>
+<span class="sourceLineNo">1739</span> return hashCode(b, length);<a name="line.1739"></a>
+<span class="sourceLineNo">1740</span> }<a name="line.1740"></a>
+<span class="sourceLineNo">1741</span><a name="line.1741"></a>
+<span class="sourceLineNo">1742</span> /**<a name="line.1742"></a>
+<span class="sourceLineNo">1743</span> * @param a lower half<a name="line.1743"></a>
+<span class="sourceLineNo">1744</span> * @param b upper half<a name="line.1744"></a>
+<span class="sourceLineNo">1745</span> * @return New array that has a in lower half and b in upper half.<a name="line.1745"></a>
+<span class="sourceLineNo">1746</span> */<a name="line.1746"></a>
+<span class="sourceLineNo">1747</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1747"></a>
+<span class="sourceLineNo">1748</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1748"></a>
+<span class="sourceLineNo">1749</span> }<a name="line.1749"></a>
+<span class="sourceLineNo">1750</span><a name="line.1750"></a>
+<span class="sourceLineNo">1751</span> /**<a name="line.1751"></a>
+<span class="sourceLineNo">1752</span> * @param a first third<a name="line.1752"></a>
+<span class="sourceLineNo">1753</span> * @param b second third<a name="line.1753"></a>
+<span class="sourceLineNo">1754</span> * @param c third third<a name="line.1754"></a>
+<span class="sourceLineNo">1755</span> * @return New array made from a, b and c<a name="line.1755"></a>
+<span class="sourceLineNo">1756</span> */<a name="line.1756"></a>
+<span class="sourceLineNo">1757</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1757"></a>
+<span class="sourceLineNo">1758</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1758"></a>
+<span class="sourceLineNo">1759</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1759"></a>
+<span class="sourceLineNo">1760</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1760"></a>
+<span class="sourceLineNo">1761</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1761"></a>
+<span class="sourceLineNo">1762</span> return result;<a name="line.1762"></a>
+<span class="sourceLineNo">1763</span> }<a name="line.1763"></a>
+<span class="sourceLineNo">1764</span><a name="line.1764"></a>
+<span class="sourceLineNo">1765</span> /**<a name="line.1765"></a>
+<span class="sourceLineNo">1766</span> * @param arrays all the arrays to concatenate together.<a name="line.1766"></a>
+<span class="sourceLineNo">1767</span> * @return New array made from the concatenation of the given arrays.<a name="line.1767"></a>
+<span class="sourceLineNo">1768</span> */<a name="line.1768"></a>
+<span class="sourceLineNo">1769</span> public static byte [] add(final byte [][] arrays) {<a name="line.1769"></a>
+<span class="sourceLineNo">1770</span> int length = 0;<a name="line.1770"></a>
+<span class="sourceLineNo">1771</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1771"></a>
+<span class="sourceLineNo">1772</span> length += arrays[i].length;<a name="line.1772"></a>
+<span class="sourceLineNo">1773</span> }<a name="line.1773"></a>
+<span class="sourceLineNo">1774</span> byte [] result = new byte[length];<a name="line.1774"></a>
+<span class="sourceLineNo">1775</span> int index = 0;<a name="line.1775"></a>
<span class="sourceLineNo">1776</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1776"></a>
-<span class="sourceLineNo">1777</span> length += arrays[i].length;<a name="line.1777"></a>
-<span class="sourceLineNo">1778</span> }<a name="line.1778"></a>
-<span class="sourceLineNo">1779</span> byte [] result = new byte[length];<a name="line.1779"></a>
-<span class="sourceLineNo">1780</span> int index = 0;<a name="line.1780"></a>
-<span class="sourceLineNo">1781</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1781"></a>
-<span class="sourceLineNo">1782</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1782"></a>
-<span class="sourceLineNo">1783</span> index += arrays[i].length;<a name="line.1783"></a>
-<span class="sourceLineNo">1784</span> }<a name="line.1784"></a>
-<span class="sourceLineNo">1785</span> return result;<a name="line.1785"></a>
-<span class="sourceLineNo">1786</span> }<a name="line.1786"></a>
-<span class="sourceLineNo">1787</span><a name="line.1787"></a>
-<span class="sourceLineNo">1788</span> /**<a name="line.1788"></a>
-<span class="sourceLineNo">1789</span> * @param a array<a name="line.1789"></a>
-<span class="sourceLineNo">1790</span> * @param length amount of bytes to grab<a name="line.1790"></a>
-<span class="sourceLineNo">1791</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1791"></a>
-<span class="sourceLineNo">1792</span> */<a name="line.1792"></a>
-<span class="sourceLineNo">1793</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1793"></a>
-<span class="sourceLineNo">1794</span> if (a.length < length) {<a name="line.1794"></a>
-<span class="sourceLineNo">1795</span> return null;<a name="line.1795"></a>
-<span class="sourceLineNo">1796</span> }<a name="line.1796"></a>
-<span class="sourceLineNo">1797</span> byte [] result = new byte[length];<a name="line.1797"></a>
-<span class="sourceLineNo">1798</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1798"></a>
-<span class="sourceLineNo">1799</span> return result;<a name="line.1799"></a>
-<span class="sourceLineNo">1800</span> }<a name="line.1800"></a>
-<span class="sourceLineNo">1801</span><a name="line.1801"></a>
-<span class="sourceLineNo">1802</span> /**<a name="line.1802"></a>
-<span class="sourceLineNo">1803</span> * @param a array<a name="line.1803"></a>
-<span class="sourceLineNo">1804</span> * @param length amount of bytes to snarf<a name="line.1804"></a>
-<span class="sourceLineNo">1805</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1805"></a>
-<span class="sourceLineNo">1806</span> */<a name="line.1806"></a>
-<span class="sourceLineNo">1807</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1807"></a>
-<span class="sourceLineNo">1808</span> if (a.length < length) {<a name="line.1808"></a>
-<span class="sourceLineNo">1809</span> return null;<a name="line.1809"></a>
-<span class="sourceLineNo">1810</span> }<a name="line.1810"></a>
-<span class="sourceLineNo">1811</span> byte [] result = new byte[length];<a name="line.1811"></a>
-<span class="sourceLineNo">1812</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1812"></a>
-<span class="sourceLineNo">1813</span> return result;<a name="line.1813"></a>
-<span class="sourceLineNo">1814</span> }<a name="line.1814"></a>
-<span class="sourceLineNo">1815</span><a name="line.1815"></a>
-<span class="sourceLineNo">1816</span> /**<a name="line.1816"></a>
-<span class="sourceLineNo">1817</span> * @param a array<a name="line.1817"></a>
-<span class="sourceLineNo">1818</span> * @param length new array size<a name="line.1818"></a>
-<span class="sourceLineNo">1819</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1819"></a>
-<span class="sourceLineNo">1820</span> */<a name="line.1820"></a>
-<span class="sourceLineNo">1821</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1821"></a>
-<span class="sourceLineNo">1822</span> byte [] padding = new byte[length];<a name="line.1822"></a>
-<span class="sourceLineNo">1823</span> for (int i = 0; i < length; i++) {<a name="line.1823"></a>
-<span class="sourceLineNo">1824</span> padding[i] = 0;<a name="line.1824"></a>
-<span class="sourceLineNo">1825</span> }<a name="line.1825"></a>
-<span class="sourceLineNo">1826</span> return add(padding,a);<a name="line.1826"></a>
-<span class="sourceLineNo">1827</span> }<a name="line.1827"></a>
-<span class="sourceLineNo">1828</span><a name="line.1828"></a>
-<span class="sourceLineNo">1829</span> /**<a name="line.1829"></a>
-<span class="sourceLineNo">1830</span> * @param a array<a name="line.1830"></a>
-<span class="sourceLineNo">1831</span> * @param length new array size<a name="line.1831"></a>
-<span class="sourceLineNo">1832</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1832"></a>
-<span class="sourceLineNo">1833</span> */<a name="line.1833"></a>
-<span class="sourceLineNo">1834</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1834"></a>
-<span class="sourceLineNo">1835</span> byte [] padding = new byte[length];<a name="line.1835"></a>
-<span class="sourceLineNo">1836</span> for (int i = 0; i < length; i++) {<a name="line.1836"></a>
-<span class="sourceLineNo">1837</span> padding[i] = 0;<a name="line.1837"></a>
-<span class="sourceLineNo">1838</span> }<a name="line.1838"></a>
-<span class="sourceLineNo">1839</span> return add(a,padding);<a name="line.1839"></a>
-<span class="sourceLineNo">1840</span> }<a name="line.1840"></a>
-<span class="sourceLineNo">1841</span><a name="line.1841"></a>
-<span class="sourceLineNo">1842</span> /**<a name="line.1842"></a>
-<span class="sourceLineNo">1843</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1843"></a>
-<span class="sourceLineNo">1844</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1844"></a>
-<span class="sourceLineNo">1845</span> * @param a Beginning of range<a name="line.1845"></a>
-<span class="sourceLineNo">1846</span> * @param b End of range<a name="line.1846"></a>
-<span class="sourceLineNo">1847</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1847"></a>
-<span class="sourceLineNo">1848</span> * the range in two; i.e. one split.<a name="line.1848"></a>
-<span class="sourceLineNo">1849</span> * @return Array of dividing values<a name="line.1849"></a>
-<span class="sourceLineNo">1850</span> */<a name="line.1850"></a>
-<span class="sourceLineNo">1851</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1851"></a>
-<span class="sourceLineNo">1852</span> return split(a, b, false, num);<a name="line.1852"></a>
-<span class="sourceLineNo">1853</span> }<a name="line.1853"></a>
-<span class="sourceLineNo">1854</span><a name="line.1854"></a>
-<span class="sourceLineNo">1855</span> /**<a name="line.1855"></a>
-<span class="sourceLineNo">1856</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1856"></a>
-<span class="sourceLineNo">1857</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1857"></a>
-<span class="sourceLineNo">1858</span> * @param a Beginning of range<a name="line.1858"></a>
-<span class="sourceLineNo">1859</span> * @param b End of range<a name="line.1859"></a>
-<span class="sourceLineNo">1860</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1860"></a>
-<span class="sourceLineNo">1861</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1861"></a>
-<span class="sourceLineNo">1862</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1862"></a>
-<span class="sourceLineNo">1863</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1863"></a>
-<span class="sourceLineNo">1864</span> * the range in two; i.e. one split.<a name="line.1864"></a>
-<span class="sourceLineNo">1865</span> * @return Array of dividing values<a name="line.1865"></a>
-<span class="sourceLineNo">1866</span> */<a name="line.1866"></a>
-<span class="sourceLineNo">1867</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1867"></a>
-<span class="sourceLineNo">1868</span> boolean inclusive, final int num) {<a name="line.1868"></a>
-<span class="sourceLineNo">1869</span> byte[][] ret = new byte[num + 2][];<a name="line.1869"></a>
-<span class="sourceLineNo">1870</span> int i = 0;<a name="line.1870"></a>
-<span class="sourceLineNo">1871</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1871"></a>
-<span class="sourceLineNo">1872</span> if (iter == null)<a name="line.1872"></a>
-<span class="sourceLineNo">1873</span> return null;<a name="line.1873"></a>
-<span class="sourceLineNo">1874</span> for (byte[] elem : iter) {<a name="line.1874"></a>
-<span class="sourceLineNo">1875</span> ret[i++] = elem;<a name="line.1875"></a>
-<span class="sourceLineNo">1876</span> }<a name="line.1876"></a>
-<span class="sourceLineNo">1877</span> return ret;<a name="line.1877"></a>
-<span class="sourceLineNo">1878</span> }<a name="line.1878"></a>
-<span class="sourceLineNo">1879</span><a name="line.1879"></a>
-<span class="sourceLineNo">1880</span> /**<a name="line.1880"></a>
-<span class="sourceLineNo">1881</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1881"></a>
-<span class="sourceLineNo">1882</span> */<a name="line.1882"></a>
-<span class="sourceLineNo">1883</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1883"></a>
-<span class="sourceLineNo">1884</span> final byte[] b, final int num)<a name="line.1884"></a>
-<span class="sourceLineNo">1885</span> {<a name="line.1885"></a>
-<span class="sourceLineNo">1886</span> return iterateOnSplits(a, b, false, num);<a name="line.1886"></a>
-<span class="sourceLineNo">1887</span> }<a name="line.1887"></a>
-<span class="sourceLineNo">1888</span><a name="line.1888"></a>
-<span class="sourceLineNo">1889</span> /**<a name="line.1889"></a>
-<span class="sourceLineNo">1890</span> * Iterate over keys within the passed range.<a name="line.1890"></a>
-<span class="sourceLineNo">1891</span> */<a name="line.1891"></a>
-<span class="sourceLineNo">1892</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1892"></a>
-<span class="sourceLineNo">1893</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1893"></a>
-<span class="sourceLineNo">1894</span> {<a name="line.1894"></a>
-<span class="sourceLineNo">1895</span> byte [] aPadded;<a name="line.1895"></a>
-<span class="sourceLineNo">1896</span> byte [] bPadded;<a name="line.1896"></a>
-<span class="sourceLineNo">1897</span> if (a.length < b.length) {<a name="line.1897"></a>
-<span class="sourceLineNo">1898</span> aPadded = padTail(a, b.length - a.length);<a name="line.1898"></a>
-<span class="sourceLineNo">1899</span> bPadded = b;<a name="line.1899"></a>
-<span class="sourceLineNo">1900</span> } else if (b.length < a.length) {<a name="line.1900"></a>
-<span class="sourceLineNo">1901</span> aPadded = a;<a name="line.1901"></a>
-<span class="sourceLineNo">1902</span> bPadded = padTail(b, a.length - b.length);<a name="line.1902"></a>
-<span class="sourceLineNo">1903</span> } else {<a name="line.1903"></a>
-<span class="sourceLineNo">1904</span> aPadded = a;<a name="line.1904"></a>
-<span class="sourceLineNo">1905</span> bPadded = b;<a name="line.1905"></a>
-<span class="sourceLineNo">1906</span> }<a name="line.1906"></a>
-<span class="sourceLineNo">1907</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1907"></a>
-<span class="sourceLineNo">1908</span> throw new IllegalArgumentException("b <= a");<a name="line.1908"></a>
-<span class="sourceLineNo">1909</span> }<a name="line.1909"></a>
-<span class="sourceLineNo">1910</span> if (num <= 0) {<a name="line.1910"></a>
-<span class="sourceLineNo">1911</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1911"></a>
-<span class="sourceLineNo">1912</span> }<a name="line.1912"></a>
-<span class="sourceLineNo">1913</span> byte [] prependHeader = {1, 0};<a name="line.1913"></a>
-<span class="sourceLineNo">1914</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1914"></a>
-<span class="sourceLineNo">1915</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1915"></a>
-<span class="sourceLineNo">1916</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1916"></a>
-<span class="sourceLineNo">1917</span> if (inclusive) {<a name="line.1917"></a>
-<span class="sourceLineNo">1918</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1918"></a>
-<span class="sourceLineNo">1919</span> }<a name="line.1919"></a>
-<span class="sourceLineNo">1920</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1920"></a>
-<span class="sourceLineNo">1921</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1921"></a>
-<span class="sourceLineNo">1922</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1922"></a>
-<span class="sourceLineNo">1923</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1923"></a>
-<span class="sourceLineNo">1924</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1924"></a>
-<span class="sourceLineNo">1925</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1925"></a>
-<span class="sourceLineNo">1926</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1926"></a>
-<span class="sourceLineNo">1927</span> }<a name="line.1927"></a>
-<span class="sourceLineNo">1928</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1928"></a>
-<span class="sourceLineNo">1929</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1929"></a>
-<span class="sourceLineNo">1930</span> }<a name="line.1930"></a>
-<span class="sourceLineNo">1931</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1931"></a>
-<span class="sourceLineNo">1932</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1932"></a>
-<span class="sourceLineNo">1933</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1933"></a>
-<span class="sourceLineNo">1934</span> }<a name="line.1934"></a>
-<span class="sourceLineNo">1935</span> final BigInteger intervalBI;<a name="line.1935"></a>
-<span class="sourceLineNo">1936</span> try {<a name="line.1936"></a>
-<span class="sourceLineNo">1937</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1937"></a>
-<span class="sourceLineNo">1938</span> } catch(Exception e) {<a name="line.1938"></a>
-<span class="sourceLineNo">1939</span> LOG.error("Exception caught during division", e);<a name="line.1939"></a>
-<span class="sourceLineNo">1940</span> return null;<a name="line.1940"></a>
-<span class="sourceLineNo">1941</span> }<a name="line.1941"></a>
-<span class="sourceLineNo">1942</span><a name="line.1942"></a>
-<span class="sourceLineNo">1943</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1943"></a>
-<span class="sourceLineNo">1944</span> private int i = -1;<a name="line.1944"></a>
+<span class="sourceLineNo">1777</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1777"></a>
+<span class="sourceLineNo">1778</span> index += arrays[i].length;<a name="line.1778"></a>
+<span class="sourceLineNo">1779</span> }<a name="line.1779"></a>
+<span class="sourceLineNo">1780</span> return result;<a name="line.1780"></a>
+<span class="sourceLineNo">1781</span> }<a name="line.1781"></a>
+<span class="sourceLineNo">1782</span><a name="line.1782"></a>
+<span class="sourceLineNo">1783</span> /**<a name="line.1783"></a>
+<span class="sourceLineNo">1784</span> * @param a array<a name="line.1784"></a>
+<span class="sourceLineNo">1785</span> * @param length amount of bytes to grab<a name="line.1785"></a>
+<span class="sourceLineNo">1786</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1786"></a>
+<span class="sourceLineNo">1787</span> */<a name="line.1787"></a>
+<span class="sourceLineNo">1788</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1788"></a>
+<span class="sourceLineNo">1789</span> if (a.length < length) {<a name="line.1789"></a>
+<span class="sourceLineNo">1790</span> return null;<a name="line.1790"></a>
+<span class="sourceLineNo">1791</span> }<a name="line.1791"></a>
+<span class="sourceLineNo">1792</span> byte [] result = new byte[length];<a name="line.1792"></a>
+<span class="sourceLineNo">1793</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1793"></a>
+<span class="sourceLineNo">1794</span> return result;<a name="line.1794"></a>
+<span class="sourceLineNo">1795</span> }<a name="line.1795"></a>
+<span class="sourceLineNo">1796</span><a name="line.1796"></a>
+<span class="sourceLineNo">1797</span> /**<a name="line.1797"></a>
+<span class="sourceLineNo">1798</span> * @param a array<a name="line.1798"></a>
+<span class="sourceLineNo">1799</span> * @param length amount of bytes to snarf<a name="line.1799"></a>
+<span class="sourceLineNo">1800</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1800"></a>
+<span class="sourceLineNo">1801</span> */<a name="line.1801"></a>
+<span class="sourceLineNo">1802</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1802"></a>
+<span class="sourceLineNo">1803</span> if (a.length < length) {<a name="line.1803"></a>
+<span class="sourceLineNo">1804</span> return null;<a name="line.1804"></a>
+<span class="sourceLineNo">1805</span> }<a name="line.1805"></a>
+<span class="sourceLineNo">1806</span> byte [] result = new byte[length];<a name="line.1806"></a>
+<span class="sourceLineNo">1807</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1807"></a>
+<span class="sourceLineNo">1808</span> return result;<a name="line.1808"></a>
+<span class="sourceLineNo">1809</span> }<a name="line.1809"></a>
+<span class="sourceLineNo">1810</span><a name="line.1810"></a>
+<span class="sourceLineNo">1811</span> /**<a name="line.1811"></a>
+<span class="sourceLineNo">1812</span> * @param a array<a name="line.1812"></a>
+<span class="sourceLineNo">1813</span> * @param length new array size<a name="line.1813"></a>
+<span class="sourceLineNo">1814</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1814"></a>
+<span class="sourceLineNo">1815</span> */<a name="line.1815"></a>
+<span class="sourceLineNo">1816</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1816"></a>
+<span class="sourceLineNo">1817</span> byte [] padding = new byte[length];<a name="line.1817"></a>
+<span class="sourceLineNo">1818</span> for (int i = 0; i < length; i++) {<a name="line.1818"></a>
+<span class="sourceLineNo">1819</span> padding[i] = 0;<a name="line.1819"></a>
+<span class="sourceLineNo">1820</span> }<a name="line.1820"></a>
+<span class="sourceLineNo">1821</span> return add(padding,a);<a name="line.1821"></a>
+<span class="sourceLineNo">1822</span> }<a name="line.1822"></a>
+<span class="sourceLineNo">1823</span><a name="line.1823"></a>
+<span class="sourceLineNo">1824</span> /**<a name="line.1824"></a>
+<span class="sourceLineNo">1825</span> * @param a array<a name="line.1825"></a>
+<span class="sourceLineNo">1826</span> * @param length new array size<a name="line.1826"></a>
+<span class="sourceLineNo">1827</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1827"></a>
+<span class="sourceLineNo">1828</span> */<a name="line.1828"></a>
+<span class="sourceLineNo">1829</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1829"></a>
+<span class="sourceLineNo">1830</span> byte [] padding = new byte[length];<a name="line.1830"></a>
+<span class="sourceLineNo">1831</span> for (int i = 0; i < length; i++) {<a name="line.1831"></a>
+<span class="sourceLineNo">1832</span> padding[i] = 0;<a name="line.1832"></a>
+<span class="sourceLineNo">1833</span> }<a name="line.1833"></a>
+<span class="sourceLineNo">1834</span> return add(a,padding);<a name="line.1834"></a>
+<span class="sourceLineNo">1835</span> }<a name="line.1835"></a>
+<span class="sourceLineNo">1836</span><a name="line.1836"></a>
+<span class="sourceLineNo">1837</span> /**<a name="line.1837"></a>
+<span class="sourceLineNo">1838</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1838"></a>
+<span class="sourceLineNo">1839</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1839"></a>
+<span class="sourceLineNo">1840</span> * @param a Beginning of range<a name="line.1840"></a>
+<span class="sourceLineNo">1841</span> * @param b End of range<a name="line.1841"></a>
+<span class="sourceLineNo">1842</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1842"></a>
+<span class="sourceLineNo">1843</span> * the range in two; i.e. one split.<a name="line.1843"></a>
+<span class="sourceLineNo">1844</span> * @return Array of dividing values<a name="line.1844"></a>
+<span class="sourceLineNo">1845</span> */<a name="line.1845"></a>
+<span class="sourceLineNo">1846</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1846"></a>
+<span class="sourceLineNo">1847</span> return split(a, b, false, num);<a name="line.1847"></a>
+<span class="sourceLineNo">1848</span> }<a name="line.1848"></a>
+<span class="sourceLineNo">1849</span><a name="line.1849"></a>
+<span class="sourceLineNo">1850</span> /**<a name="line.1850"></a>
+<span class="sourceLineNo">1851</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1851"></a>
+<span class="sourceLineNo">1852</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1852"></a>
+<span class="sourceLineNo">1853</span> * @param a Beginning of range<a name="line.1853"></a>
+<span class="sourceLineNo">1854</span> * @param b End of range<a name="line.1854"></a>
+<span class="sourceLineNo">1855</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1855"></a>
+<span class="sourceLineNo">1856</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1856"></a>
+<span class="sourceLineNo">1857</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1857"></a>
+<span class="sourceLineNo">1858</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1858"></a>
+<span class="sourceLineNo">1859</span> * the range in two; i.e. one split.<a name="line.1859"></a>
+<span class="sourceLineNo">1860</span> * @return Array of dividing values<a name="line.1860"></a>
+<span class="sourceLineNo">1861</span> */<a name="line.1861"></a>
+<span class="sourceLineNo">1862</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1862"></a>
+<span class="sourceLineNo">1863</span> boolean inclusive, final int num) {<a name="line.1863"></a>
+<span class="sourceLineNo">1864</span> byte[][] ret = new byte[num + 2][];<a name="line.1864"></a>
+<span class="sourceLineNo">1865</span> int i = 0;<a name="line.1865"></a>
+<span class="sourceLineNo">1866</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1866"></a>
+<span class="sourceLineNo">1867</span> if (iter == null)<a name="line.1867"></a>
+<span class="sourceLineNo">1868</span> return null;<a name="line.1868"></a>
+<span class="sourceLineNo">1869</span> for (byte[] elem : iter) {<a name="line.1869"></a>
+<span class="sourceLineNo">1870</span> ret[i++] = elem;<a name="line.1870"></a>
+<span class="sourceLineNo">1871</span> }<a name="line.1871"></a>
+<span class="sourceLineNo">1872</span> return ret;<a name="line.1872"></a>
+<span class="sourceLineNo">1873</span> }<a name="line.1873"></a>
+<span class="sourceLineNo">1874</span><a name="line.1874"></a>
+<span class="sourceLineNo">1875</span> /**<a name="line.1875"></a>
+<span class="sourceLineNo">1876</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1876"></a>
+<span class="sourceLineNo">1877</span> */<a name="line.1877"></a>
+<span class="sourceLineNo">1878</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1878"></a>
+<span class="sourceLineNo">1879</span> final byte[] b, final int num)<a name="line.1879"></a>
+<span class="sourceLineNo">1880</span> {<a name="line.1880"></a>
+<span class="sourceLineNo">1881</span> return iterateOnSplits(a, b, false, num);<a name="line.1881"></a>
+<span class="sourceLineNo">1882</span> }<a name="line.1882"></a>
+<span class="sourceLineNo">1883</span><a name="line.1883"></a>
+<span class="sourceLineNo">1884</span> /**<a name="line.1884"></a>
+<span class="sourceLineNo">1885</span> * Iterate over keys within the passed range.<a name="line.1885"></a>
+<span class="sourceLineNo">1886</span> */<a name="line.1886"></a>
+<span class="sourceLineNo">1887</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1887"></a>
+<span class="sourceLineNo">1888</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1888"></a>
+<span class="sourceLineNo">1889</span> {<a name="line.1889"></a>
+<span class="sourceLineNo">1890</span> byte [] aPadded;<a name="line.1890"></a>
+<span class="sourceLineNo">1891</span> byte [] bPadded;<a name="line.1891"></a>
+<span class="sourceLineNo">1892</span> if (a.length < b.length) {<a name="line.1892"></a>
+<span class="sourceLineNo">1893</span> aPadded = padTail(a, b.length - a.length);<a name="line.1893"></a>
+<span class="sourceLineNo">1894</span> bPadded = b;<a name="line.1894"></a>
+<span class="sourceLineNo">1895</span> } else if (b.length < a.length) {<a name="line.1895"></a>
+<span class="sourceLineNo">1896</span> aPadded = a;<a name="line.1896"></a>
+<span class="sourceLineNo">1897</span> bPadded = padTail(b, a.length - b.length);<a name="line.1897"></a>
+<span class="sourceLineNo">1898</span> } else {<a name="line.1898"></a>
+<span class="sourceLineNo">1899</span> aPadded = a;<a name="line.1899"></a>
+<span class="sourceLineNo">1900</span> bPadded = b;<a name="line.1900"></a>
+<span class="sourceLineNo">1901</span> }<a name="line.1901"></a>
+<span class="sourceLineNo">1902</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1902"></a>
+<span class="sourceLineNo">1903</span> throw new IllegalArgumentException("b <= a");<a name="line.1903"></a>
+<span class="sourceLineNo">1904</span> }<a name="line.1904"></a>
+<span class="sourceLineNo">1905</span> if (num <= 0) {<a name="line.1905"></a>
+<span class="sourceLineNo">1906</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1906"></a>
+<span class="sourceLineNo">1907</span> }<a name="line.1907"></a>
+<span class="sourceLineNo">1908</span> byte [] prependHeader = {1, 0};<a name="line.1908"></a>
+<span class="sourceLineNo">1909</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1909"></a>
+<span class="sourceLineNo">1910</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1910"></a>
+<span class="sourceLineNo">1911</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1911"></a>
+<span class="sourceLineNo">1912</span> if (inclusive) {<a name="line.1912"></a>
+<span class="sourceLineNo">1913</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1913"></a>
+<span class="sourceLineNo">1914</span> }<a name="line.1914"></a>
+<span class="sourceLineNo">1915</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1915"></a>
+<span class="sourceLineNo">1916</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1916"></a>
+<span class="sourceLineNo">1917</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1917"></a>
+<span class="sourceLineNo">1918</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1918"></a>
+<span class="sourceLineNo">1919</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1919"></a>
+<span class="sourceLineNo">1920</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1920"></a>
+<span class="sourceLineNo">1921</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1921"></a>
+<span class="sourceLineNo">1922</span> }<a name="line.1922"></a>
+<span class="sourceLineNo">1923</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1923"></a>
+<span class="sourceLineNo">1924</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1924"></a>
+<span class="sourceLineNo">1925</span> }<a name="line.1925"></a>
+<span class="sourceLineNo">1926</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1926"></a>
+<span class="sourceLineNo">1927</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1927"></a>
+<span class="sourceLineNo">1928</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1928"></a>
+<span class="sourceLineNo">1929</span> }<a name="line.1929"></a>
+<span class="sourceLineNo">1930</span> final BigInteger intervalBI;<a name="line.1930"></a>
+<span class="sourceLineNo">1931</span> try {<a name="line.1931"></a>
+<span class="sourceLineNo">1932</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1932"></a>
+<span class="sourceLineNo">1933</span> } catch(Exception e) {<a name="line.1933"></a>
+<span class="sourceLineNo">1934</span> LOG.error("Exception caught during division", e);<a name="line.1934"></a>
+<span class="sourceLineNo">1935</span> return null;<a name="line.1935"></a>
+<span class="sourceLineNo">1936</span> }<a name="line.1936"></a>
+<span class="sourceLineNo">1937</span><a name="line.1937"></a>
+<span class="sourceLineNo">1938</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1938"></a>
+<span class="sourceLineNo">1939</span> private int i = -1;<a name="line.1939"></a>
+<span class="sourceLineNo">1940</span><a name="line.1940"></a>
+<span class="sourceLineNo">1941</span> @Override<a name="line.1941"></a>
+<span class="sourceLineNo">1942</span> public boolean hasNext() {<a name="line.1942"></a>
+<span class="sourceLineNo">1943</span> return i < num+1;<a name="line.1943"></a>
+<span class="sourceLineNo">1944</span> }<a name="line.1944"></a>
<span class="sourceLineNo">1945</span><a name="line.1945"></a>
<span class="sourceLineNo">1946</span> @Override<a name="line.1946"></a>
-<span class="sourceLineNo">1947</span> public boolean hasNext() {<a name="line.1947"></a>
-<span class="sourceLineNo">1948</span> return i < num+1;<a name="line.1948"></a>
-<span class="sourceLineNo">1949</span> }<a name="line.1949"></a>
-<span class="sourceLineNo">1950</span><a name="line.1950"></a>
-<span class="sourceLineNo">1951</span> @Override<a name="line.1951"></a>
-<span class="sourceLineNo">1952</span> public byte[] next() {<a name="line.1952"></a>
-<span class="sourceLineNo">1953</span> i++;<a name="line.1953"></a>
-<span class="sourceLineNo">1954</span> if (i == 0) return a;<a name="line.1954"></a>
-<span class="sourceLineNo">1955</span> if (i == num + 1) return b;<a name="line.1955"></a>
-<span class="sourceLineNo">1956</span><a name="line.1956"></a>
-<span class="sourceLineNo">1957</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1957"></a>
-<span class="sourceLineNo">1958</span> byte [] padded = curBI.toByteArray();<a name="line.1958"></a>
-<span class="sourceLineNo">1959</span> if (padded[1] == 0)<a name="line.1959"></a>
-<span class="sourceLineNo">1960</span> padded = tail(padded, padded.length - 2);<a name="line.1960"></a>
-<span class="sourceLineNo">1961</span> else<a name="line.1961"></a>
-<span class="sourceLineNo">1962</span> padded = tail(padded, padded.length - 1);<a name="line.1962"></a>
-<span class="sourceLineNo">1963</span> return padded;<a name="line.1963"></a>
+<span class="sourceLineNo">1947</span> public byte[] next() {<a name="line.1947"></a>
+<span class="sourceLineNo">1948</span> i++;<a name="line.1948"></a>
+<span class="sourceLineNo">1949</span> if (i == 0) return a;<a name="line.1949"></a>
+<span class="sourceLineNo">1950</span> if (i == num + 1) return b;<a name="line.1950"></a>
+<span class="sourceLineNo">1951</span><a name="line.1951"></a>
+<span class="sourceLineNo">1952</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1952"></a>
+<span class="sourceLineNo">1953</span> byte [] padded = curBI.toByteArray();<a name="line.1953"></a>
+<span class="sourceLineNo">1954</span> if (padded[1] == 0)<a name="line.1954"></a>
+<span class="sourceLineNo">1955</span> padded = tail(padded, padded.length - 2);<a name="line.1955"></a>
+<span class="sourceLineNo">1956</span> else<a name="line.1956"></a>
+<span class="sourceLineNo">1957</span> padded = tail(padded, padded.length - 1);<a name="line.1957"></a>
+<span class="sourceLineNo">1958</span> return padded;<a name="line.1958"></a>
+<span class="sourceLineNo">1959</span> }<a name="line.1959"></a>
+<span class="sourceLineNo">1960</span><a name="line.1960"></a>
+<span class="sourceLineNo">1961</span> @Override<a name="line.1961"></a>
+<span class="sourceLineNo">1962</span> public void remove() {<a name="line.1962"></a>
+<span class="sourceLineNo">1963</span> throw new UnsupportedOperationException();<a name="line.1963"></a>
<span class="sourceLineNo">1964</span> }<a name="line.1964"></a>
<span class="sourceLineNo">1965</span><a name="line.1965"></a>
-<span class="sourceLineNo">1966</span> @Override<a name="line.1966"></a>
-<span class="sourceLineNo">1967</span> public void remove() {<a name="line.1967"></a>
-<span class="sourceLineNo">1968</span> throw new UnsupportedOperationException();<a name="line.1968"></a>
-<span class="sourceLineNo">1969</span> }<a name="line.1969"></a>
-<span class="sourceLineNo">1970</span><a name="line.1970"></a>
-<span class="sourceLineNo">1971</span> };<a name="line.1971"></a>
-<span class="sourceLineNo">1972</span><a name="line.1972"></a>
-<span class="sourceLineNo">1973</span> return new Iterable<byte[]>() {<a name="line.1973"></a>
-<span class="sourceLineNo">1974</span> @Override<a name="line.1974"></a>
-<span class="sourceLineNo">1975</span> public Iterator<byte[]> iterator() {<a name="line.1975"></a>
-<span class="sourceLineNo">1976</span> return iterator;<a name="line.1976"></a>
-<span class="sourceLineNo">1977</span> }<a name="line.1977"></a>
-<span class="sourceLineNo">1978</span> };<a name="line.1978"></a>
-<span class="sourceLineNo">1979</span> }<a name="line.1979"></a>
-<span class="sourceLineNo">1980</span><a name="line.1980"></a>
-<span class="sourceLineNo">1981</span> /**<a name="line.1981"></a>
-<span class="sourceLineNo">1982</span> * @param bytes array to hash<a name="line.1982"></a>
-<span class="sourceLineNo">1983</span> * @param offset offset to start from<a name="line.1983"></a>
-<span class="sourceLineNo">1984</span> * @param length length to hash<a name="line.1984"></a>
-<span class="sourceLineNo">1985</span> * */<a name="line.1985"></a>
-<span class="sourceLineNo">1986</span> public static int hashCode(byte[] bytes, int offset, int length) {<a name="line.1986"></a>
-<span class="sourceLineNo">1987</span> int hash = 1;<a name="line.1987"></a>
-<span class="sourceLineNo">1988</span> for (int i = offset; i < offset + length; i++)<a name="line.1988"></a>
-<span class="sourceLineNo">1989</span> hash = (31 * hash) + (int) bytes[i];<a name="line.1989"></a>
-<span class="sourceLineNo">1990</span> return hash;<a name="line.1990"></a>
-<span class="sourceLineNo">1991</span> }<a name="line.1991"></a>
-<span class="sourceLineNo">1992</span><a name="line.1992"></a>
-<span class="sourceLineNo">1993</span> /**<a name="line.1993"></a>
-<span class="sourceLineNo">1994</span> * @param t operands<a name="line.1994"></a>
-<span class="sourceLineNo">1995</span> * @return Array of byte arrays made from passed array of Text<a name="line.1995"></a>
-<span class="sourceLineNo">1996</span> */<a name="line.1996"></a>
-<span class="sourceLineNo">1997</span> public static byte [][] toByteArrays(final String [] t) {<a name="line.1997"></a>
-<span class="sourceLineNo">1998</span> byte [][] result = new byte[t.length][];<a name="line.1998"></a>
-<span class="sourceLineNo">1999</span> for (int i = 0; i < t.length; i++) {<a name="line.1999"></a>
-<span class="sourceLineNo">2000</span> result[i] = Bytes.toBytes(t[i]);<a name="line.2000"></a>
-<span class="sourceLineNo">2001</span> }<a name="line.2001"></a>
-<span class="sourceLineNo">2002</span> return result;<a name="line.2002"></a>
-<span class="sourceLineNo">2003</span> }<a name="line.2003"></a>
-<span class="sourceLineNo">2004</span><a name="line.2004"></a>
-<span class="sourceLineNo">2005</span> /**<a name="line.2005"></a>
-<span class="sourceLineNo">2006</span> * @param t operands<a name="line.2006"></a>
-<span class="sourceLineNo">2007</span> * @return Array of binary byte arrays made from passed array of binary strings<a name="line.2007"></a>
-<span class="sourceLineNo">2008</span> */<a name="line.2008"></a>
-<span class="sourceLineNo">2009</span> public static byte[][] toBinaryByteArrays(final String[] t) {<a name="line.2009"></a>
-<span class="sourceLineNo">2010</span> byte[][] result = new byte[t.length][];<a name="line.2010"></a>
-<span class="sourceLineNo">2011</span> for (int i = 0; i < t.length; i++) {<a name="line.2011"></a>
-<span class="sourceLineNo">2012</span> result[i] = Bytes.toBytesBinary(t[i]);<a name="line.2012"></a>
-<span class="sourceLineNo">2013</span> }<a name="line.2013"></a>
-<span class="sourceLineNo">2014</span> return result;<a name="line.2014"></a>
-<span class="sourceLineNo">2015</span> }<a name="line.2015"></a>
-<span class="sourceLineNo">2016</span><a name="line.2016"></a>
-<span class="sourceLineNo">2017</span> /**<a name="line.2017"></a>
-<span class="sourceLineNo">2018</span> * @param column operand<a name="line.2018"></a>
-<span class="sourceLineNo">2019</span> * @return A byte array of a byte array where first and only entry is<a name="line.2019"></a>
-<span class="sourceLineNo">2020</span> * <code>column</code><a name="line.2020"></a>
-<span class="sourceLineNo">2021</span> */<a name="line.2021"></a>
-<span class="sourceLineNo">2022</span> public static byte [][] toByteArrays(final String column) {<a name="line.2022"></a>
-<span class="sourceLineNo">2023</span> return toByteArrays(toBytes(column));<a name="line.2023"></a>
-<span class="sourceLineNo">2024</span> }<a name="line.2024"></a>
-<span class="sourceLineNo">2025</span><a name="line.2025"></a>
-<span class="sourceLineNo">2026</span> /**<a name="line.2026"></a>
-<span class="sourceLineNo">2027</span> * @param column operand<a name="line.2027"></a>
-<span class="sourceLineNo">2028</span> * @return A byte array of a byte array where first and only entry is<a name="line.2028"></a>
-<span class="sourceLineNo">2029</span> * <code>column</code><a name="line.2029"></a>
-<span class="sourceLineNo">2030</span> */<a name="line.2030"></a>
-<span class="sourceLineNo">2031</span> public static byte [][] toByteArrays(final byte [] column) {<a name="line.2031"></a>
-<span class="sourceLineNo">2032</span> byte [][] result = new byte[1][];<a name="line.2032"></a>
-<span class="sourceLineNo">2033</span> result[0] = column;<a name="line.2033"></a>
-<span class="sourceLineNo">2034</span> return result;<a name="line.2034"></a>
-<span class="sourceLineNo">2035</span> }<a name="line.2035"></a>
-<span class="sourceLineNo">2036</span><a name="line.2036"></a>
-<span class="sourceLineNo">2037</span> /**<a name="line.2037"></a>
-<span class="sourceLineNo">2038</span> * Binary search for keys in indexes.<a name="line.2038"></a>
-<span class="sourceLineNo">2039</span> *<a name="line.2039"></a>
-<span class="sourceLineNo">2040</span> * @param arr array of byte arrays to search for<a name="line.2040"></a>
-<span class="sourceLineNo">2041</span> * @param key the key you want to find<a name="line.2041"></a>
-<span class="sourceLineNo">2042</span> * @param offset the offset in the key you want to find<a name="line.2042"></a>
-<span class="sourceLineNo">2043</span> * @param length the length of the key<a name="line.2043"></a>
-<span class="sourceLineNo">2044</span> * @param comparator a comparator to compare.<a name="line.2044"></a>
-<span class="sourceLineNo">2045</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2045"></a>
-<span class="sourceLineNo">2046</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2046"></a>
-<span class="sourceLineNo">2047</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2047"></a>
-<span class="sourceLineNo">2048</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2048"></a>
-<span class="sourceLineNo">2049</span> * means that this function can return 2N + 1 different values<a name="line.2049"></a>
-<span class="sourceLineNo">2050</span> * ranging from -(N + 1) to N - 1.<a name="line.2050"></a>
-<span class="sourceLineNo">2051</span> * @deprecated {@link Bytes#binarySearch(byte[][], byte[], int, int)}<a name="line.2051"></a>
-<span class="sourceLineNo">2052</span> */<a name="line.2052"></a>
-<span class="sourceLineNo">2053</span> @Deprecated<a name="line.2053"></a>
-<span class="sourceLineNo">2054</span> public static int binarySearch(byte [][]arr, byte []key, int offset,<a name="line.2054"></a>
-<span class="sourceLineNo">2055</span> int length, RawComparator<?> comparator) {<a name="line.2055"></a>
-<span class="sourceLineNo">2056</span> return binarySearch(arr, key, offset, length);<a name="line.2056"></a>
-<span class="sourceLineNo">2057</span> }<a name="line.2057"></a>
-<span class="sourceLineNo">2058</span><a name="line.2058"></a>
-<span class="sourceLineNo">2059</span> /**<a name="line.2059"></a>
-<span class="sourceLineNo">2060</span> * Binary search for keys in indexes using Bytes.BYTES_RAWCOMPARATOR.<a name="line.2060"></a>
-<span class="sourceLineNo">2061</span> *<a name="line.2061"></a>
-<span class="sourceLineNo">2062</span> * @param arr array of byte arrays to search for<a name="line.2062"></a>
-<span class="sourceLineNo">2063</span> * @param key the key you want to find<a name="line.2063"></a>
-<span class="sourceLineNo">2064</span> * @param offset the offset in the key you want to find<a name="line.2064"></a>
-<span class="sourceLineNo">2065</span> * @param length the length of the key<a name="line.2065"></a>
-<span class="sourceLineNo">2066</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2066"></a>
-<span class="sourceLineNo">2067</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2067"></a>
-<span class="sourceLineNo">2068</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2068"></a>
-<span class="sourceLineNo">2069</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2069"></a>
-<span class="sourceLineNo">2070</span> * means that this function can return 2N + 1 different values<a name="line.2070"></a>
-<span class="sourceLineNo">2071</span> * ranging from -(N + 1) to N - 1.<a name="line.2071"></a>
-<span class="sourceLineNo">2072</span> */<a name="line.2072"></a>
-<span class="sourceLineNo">2073</span> public static int binarySearch(byte[][] arr, byte[] key, int offset, int length) {<a name="line.2073"></a>
-<span class="sourceLineNo">2074</span> int low = 0;<a name="line.2074"></a>
-<span class="sourceLineNo">2075</span> int high = arr.length - 1;<a name="line.2075"></a>
-<span class="sourceLineNo">2076</span><a name="line.2076"></a>
-<span class="sourceLineNo">2077</span> while (low <= high) {<a name="line.2077"></a>
-<span class="sourceLineNo">2078</span> int mid = (low + high) >>> 1;<a name="line.2078"></a>
-<span class="sourceLineNo">2079</span> // we have to compare in this order, because the comparator order<a name="line.2079"></a>
-<span class="sourceLineNo">2080</span> // has special logic when the 'left side' is a special key.<a name="line.2080"></a>
-<span class="sourceLineNo">2081</span> int cmp = Bytes.BYTES_RAWCOMPARATOR<a name="line.2081"></a>
-<span class="sourceLineNo">2082</span> .compare(key, offset, length, arr[mid], 0, arr[mid].length);<a name="line.2082"></a>
-<span class="sourceLineNo">2083</span> // key lives above the midpoint<a name="line.2083"></a>
-<span class="sourceLineNo">2084</span> if (cmp > 0)<a name="line.2084"></a>
-<span class="sourceLineNo">2085</span> low = mid + 1;<a name="line.2085"></a>
-<span class="sourceLineNo">2086</span> // key lives below the midpoint<a name="line.2086"></a>
-<span class="sourceLineNo">2087</span> else if (cmp < 0)<a name="line.2087"></a>
-<span class="sourceLineNo">2088</span> high = mid - 1;<a name="line.2088"></a>
-<span class="sourceLineNo">2089</span> // BAM. how often does this really happen?<a name="line.2089"></a>
-<span class="sourceLineNo">2090</span> else<a name="line.2090"></a>
-<span class="sourceLineNo">2091</span> return mid;<a name="line.2091"></a>
-<span class="sourceLineNo">2092</span> }<a name="line.2092"></a>
-<span class="sourceLineNo">2093</span> return -(low + 1);<a name="line.2093"></a>
-<span class="sourceLineNo">2094</span> }<a name="line.2094"></a>
-<span class="sourceLineNo">2095</span><a name="line.2095"></a>
-<span class="sourceLineNo">2096</span> /**<a name="line.2096"></a>
-<span class="sourceLineNo">2097</span> * Binary search for keys in indexes.<a name="line.2097"></a>
-<span class="sourceLineNo">2098</span> *<a name="line.2098"></a>
-<span class="sourceLineNo">2099</span> * @param arr array of byte arrays to search for<a name="line.2099"></a>
-<span class="sourceLineNo">2100</span> * @param key the key you want to find<a name="line.2100"></a>
-<span class="sourceLineNo">2101</span> * @param comparator a comparator to compare.<a name="line.2101"></a>
-<span class="sourceLineNo">2102</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2102"></a>
-<span class="sourceLineNo">2103</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2103"></a>
-<span class="sourceLineNo">2104</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2104"></a>
-<span class="sourceLineNo">2105</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2105"></a>
-<span class="sourceLineNo">2106</span> * means that this function can return 2N + 1 different values<a name="line.2106"></a>
-<span class="sourceLineNo">2107</span> * ranging from -(N + 1) to N - 1.<a name="line.2107"></a>
-<span class="sourceLineNo">2108</span> * @return the index of the block<a name="line.2108"></a>
-<span class="sourceLineNo">2109</span> * @deprecated Use {@link Bytes#binarySearch(Cell[], Cell, CellComparator)}<a name="line.2109"></a>
-<span class="sourceLineNo">2110</span> */<a name="line.2110"></a>
-<span class="sourceLineNo">2111</span> @Deprecated<a name="line.2111"></a>
-<span class="sourceLineNo">2112</span> public static int binarySearch(byte[][] arr, Cell key, RawComparator<Cell> comparator) {<a name="line.2112"></a>
-<span class="sourceLineNo">2113</span> int low = 0;<a name="line.2113"></a>
-<span class="sourceLineNo">2114</span> int high = arr.length - 1;<a name="line.2114"></a>
-<span class="sourceLineNo">2115</span> KeyValue.KeyOnlyKeyValue r = new KeyValue.KeyOnlyKeyValue();<a name="line.2115"></a>
-<span class="sourceLineNo">2116</span> while (low <= high) {<a name="line.2116"></a>
-<span class="sourceLineNo">2117</span> int mid = (low+high) >>> 1;<a name="line.2117"></a>
-<span class="sourceLineNo">2118</span> // we
<TRUNCATED>
[09/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html b/devapidocs/src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html
index 5b83354..a4090da 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html
@@ -709,373 +709,370 @@
<span class="sourceLineNo">701</span> }<a name="line.701"></a>
<span class="sourceLineNo">702</span><a name="line.702"></a>
<span class="sourceLineNo">703</span> static int compareToUnsafe(Object obj1, long o1, int l1, Object obj2, long o2, int l2) {<a name="line.703"></a>
-<span class="sourceLineNo">704</span> final int minLength = Math.min(l1, l2);<a name="line.704"></a>
-<span class="sourceLineNo">705</span> final int minWords = minLength / Bytes.SIZEOF_LONG;<a name="line.705"></a>
-<span class="sourceLineNo">706</span><a name="line.706"></a>
-<span class="sourceLineNo">707</span> /*<a name="line.707"></a>
-<span class="sourceLineNo">708</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a time is no slower than<a name="line.708"></a>
-<span class="sourceLineNo">709</span> * comparing 4 bytes at a time even on 32-bit. On the other hand, it is substantially faster on<a name="line.709"></a>
-<span class="sourceLineNo">710</span> * 64-bit.<a name="line.710"></a>
-<span class="sourceLineNo">711</span> */<a name="line.711"></a>
-<span class="sourceLineNo">712</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.712"></a>
-<span class="sourceLineNo">713</span> for (int i = 0; i < j; i += Bytes.SIZEOF_LONG) {<a name="line.713"></a>
-<span class="sourceLineNo">714</span> long lw = UnsafeAccess.theUnsafe.getLong(obj1, o1 + i);<a name="line.714"></a>
-<span class="sourceLineNo">715</span> long rw = UnsafeAccess.theUnsafe.getLong(obj2, o2 + i);<a name="line.715"></a>
-<span class="sourceLineNo">716</span> long diff = lw ^ rw;<a name="line.716"></a>
-<span class="sourceLineNo">717</span> if (diff != 0) {<a name="line.717"></a>
-<span class="sourceLineNo">718</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.718"></a>
-<span class="sourceLineNo">719</span> }<a name="line.719"></a>
-<span class="sourceLineNo">720</span> }<a name="line.720"></a>
-<span class="sourceLineNo">721</span> int offset = j;<a name="line.721"></a>
-<span class="sourceLineNo">722</span><a name="line.722"></a>
-<span class="sourceLineNo">723</span> if (minLength - offset >= Bytes.SIZEOF_INT) {<a name="line.723"></a>
-<span class="sourceLineNo">724</span> int il = UnsafeAccess.theUnsafe.getInt(obj1, o1 + offset);<a name="line.724"></a>
-<span class="sourceLineNo">725</span> int ir = UnsafeAccess.theUnsafe.getInt(obj2, o2 + offset);<a name="line.725"></a>
-<span class="sourceLineNo">726</span> if (il != ir) {<a name="line.726"></a>
-<span class="sourceLineNo">727</span> return lessThanUnsignedInt(il, ir) ? -1 : 1;<a name="line.727"></a>
-<span class="sourceLineNo">728</span> }<a name="line.728"></a>
-<span class="sourceLineNo">729</span> offset += Bytes.SIZEOF_INT;<a name="line.729"></a>
-<span class="sourceLineNo">730</span> }<a name="line.730"></a>
-<span class="sourceLineNo">731</span> if (minLength - offset >= Bytes.SIZEOF_SHORT) {<a name="line.731"></a>
-<span class="sourceLineNo">732</span> short sl = UnsafeAccess.theUnsafe.getShort(obj1, o1 + offset);<a name="line.732"></a>
-<span class="sourceLineNo">733</span> short sr = UnsafeAccess.theUnsafe.getShort(obj2, o2 + offset);<a name="line.733"></a>
-<span class="sourceLineNo">734</span> if (sl != sr) {<a name="line.734"></a>
-<span class="sourceLineNo">735</span> return lessThanUnsignedShort(sl, sr) ? -1 : 1;<a name="line.735"></a>
-<span class="sourceLineNo">736</span> }<a name="line.736"></a>
-<span class="sourceLineNo">737</span> offset += Bytes.SIZEOF_SHORT;<a name="line.737"></a>
-<span class="sourceLineNo">738</span> }<a name="line.738"></a>
-<span class="sourceLineNo">739</span> if (minLength - offset == 1) {<a name="line.739"></a>
-<span class="sourceLineNo">740</span> int a = (UnsafeAccess.theUnsafe.getByte(obj1, o1 + offset) & 0xff);<a name="line.740"></a>
-<span class="sourceLineNo">741</span> int b = (UnsafeAccess.theUnsafe.getByte(obj2, o2 + offset) & 0xff);<a name="line.741"></a>
-<span class="sourceLineNo">742</span> if (a != b) {<a name="line.742"></a>
-<span class="sourceLineNo">743</span> return a - b;<a name="line.743"></a>
-<span class="sourceLineNo">744</span> }<a name="line.744"></a>
-<span class="sourceLineNo">745</span> }<a name="line.745"></a>
-<span class="sourceLineNo">746</span> return l1 - l2;<a name="line.746"></a>
-<span class="sourceLineNo">747</span> }<a name="line.747"></a>
-<span class="sourceLineNo">748</span><a name="line.748"></a>
-<span class="sourceLineNo">749</span> /*<a name="line.749"></a>
-<span class="sourceLineNo">750</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.750"></a>
-<span class="sourceLineNo">751</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.751"></a>
-<span class="sourceLineNo">752</span> */<a name="line.752"></a>
-<span class="sourceLineNo">753</span> private static boolean lessThanUnsignedLong(long x1, long x2) {<a name="line.753"></a>
-<span class="sourceLineNo">754</span> if (UnsafeAccess.littleEndian) {<a name="line.754"></a>
-<span class="sourceLineNo">755</span> x1 = Long.reverseBytes(x1);<a name="line.755"></a>
-<span class="sourceLineNo">756</span> x2 = Long.reverseBytes(x2);<a name="line.756"></a>
-<span class="sourceLineNo">757</span> }<a name="line.757"></a>
-<span class="sourceLineNo">758</span> return (x1 + Long.MIN_VALUE) < (x2 + Long.MIN_VALUE);<a name="line.758"></a>
-<span class="sourceLineNo">759</span> }<a name="line.759"></a>
-<span class="sourceLineNo">760</span><a name="line.760"></a>
-<span class="sourceLineNo">761</span> /*<a name="line.761"></a>
-<span class="sourceLineNo">762</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.762"></a>
-<span class="sourceLineNo">763</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.763"></a>
-<span class="sourceLineNo">764</span> */<a name="line.764"></a>
-<span class="sourceLineNo">765</span> private static boolean lessThanUnsignedInt(int x1, int x2) {<a name="line.765"></a>
-<span class="sourceLineNo">766</span> if (UnsafeAccess.littleEndian) {<a name="line.766"></a>
-<span class="sourceLineNo">767</span> x1 = Integer.reverseBytes(x1);<a name="line.767"></a>
-<span class="sourceLineNo">768</span> x2 = Integer.reverseBytes(x2);<a name="line.768"></a>
-<span class="sourceLineNo">769</span> }<a name="line.769"></a>
-<span class="sourceLineNo">770</span> return (x1 & 0xffffffffL) < (x2 & 0xffffffffL);<a name="line.770"></a>
-<span class="sourceLineNo">771</span> }<a name="line.771"></a>
-<span class="sourceLineNo">772</span><a name="line.772"></a>
-<span class="sourceLineNo">773</span> /*<a name="line.773"></a>
-<span class="sourceLineNo">774</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.774"></a>
-<span class="sourceLineNo">775</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.775"></a>
-<span class="sourceLineNo">776</span> */<a name="line.776"></a>
-<span class="sourceLineNo">777</span> private static boolean lessThanUnsignedShort(short x1, short x2) {<a name="line.777"></a>
-<span class="sourceLineNo">778</span> if (UnsafeAccess.littleEndian) {<a name="line.778"></a>
-<span class="sourceLineNo">779</span> x1 = Short.reverseBytes(x1);<a name="line.779"></a>
-<span class="sourceLineNo">780</span> x2 = Short.reverseBytes(x2);<a name="line.780"></a>
-<span class="sourceLineNo">781</span> }<a name="line.781"></a>
-<span class="sourceLineNo">782</span> return (x1 & 0xffff) < (x2 & 0xffff);<a name="line.782"></a>
-<span class="sourceLineNo">783</span> }<a name="line.783"></a>
-<span class="sourceLineNo">784</span><a name="line.784"></a>
-<span class="sourceLineNo">785</span> /**<a name="line.785"></a>
-<span class="sourceLineNo">786</span> * Reads a short value at the given buffer's offset.<a name="line.786"></a>
-<span class="sourceLineNo">787</span> * @param buffer<a name="line.787"></a>
-<span class="sourceLineNo">788</span> * @param offset<a name="line.788"></a>
-<span class="sourceLineNo">789</span> * @return short value at offset<a name="line.789"></a>
-<span class="sourceLineNo">790</span> */<a name="line.790"></a>
-<span class="sourceLineNo">791</span> public static short toShort(ByteBuffer buffer, int offset) {<a name="line.791"></a>
-<span class="sourceLineNo">792</span> if (UNSAFE_UNALIGNED) {<a name="line.792"></a>
-<span class="sourceLineNo">793</span> return UnsafeAccess.toShort(buffer, offset);<a name="line.793"></a>
-<span class="sourceLineNo">794</span> } else {<a name="line.794"></a>
-<span class="sourceLineNo">795</span> return buffer.getShort(offset);<a name="line.795"></a>
-<span class="sourceLineNo">796</span> }<a name="line.796"></a>
-<span class="sourceLineNo">797</span> }<a name="line.797"></a>
-<span class="sourceLineNo">798</span><a name="line.798"></a>
-<span class="sourceLineNo">799</span> /**<a name="line.799"></a>
-<span class="sourceLineNo">800</span> * Reads an int value at the given buffer's current position. Also advances the buffer's position<a name="line.800"></a>
-<span class="sourceLineNo">801</span> */<a name="line.801"></a>
-<span class="sourceLineNo">802</span> public static int toInt(ByteBuffer buffer) {<a name="line.802"></a>
-<span class="sourceLineNo">803</span> if (UNSAFE_UNALIGNED) {<a name="line.803"></a>
-<span class="sourceLineNo">804</span> int i = UnsafeAccess.toInt(buffer, buffer.position());<a name="line.804"></a>
-<span class="sourceLineNo">805</span> buffer.position(buffer.position() + Bytes.SIZEOF_INT);<a name="line.805"></a>
-<span class="sourceLineNo">806</span> return i;<a name="line.806"></a>
-<span class="sourceLineNo">807</span> } else {<a name="line.807"></a>
-<span class="sourceLineNo">808</span> return buffer.getInt();<a name="line.808"></a>
-<span class="sourceLineNo">809</span> }<a name="line.809"></a>
-<span class="sourceLineNo">810</span> }<a name="line.810"></a>
-<span class="sourceLineNo">811</span><a name="line.811"></a>
-<span class="sourceLineNo">812</span> /**<a name="line.812"></a>
-<span class="sourceLineNo">813</span> * Reads an int value at the given buffer's offset.<a name="line.813"></a>
-<span class="sourceLineNo">814</span> * @param buffer<a name="line.814"></a>
-<span class="sourceLineNo">815</span> * @param offset<a name="line.815"></a>
-<span class="sourceLineNo">816</span> * @return int value at offset<a name="line.816"></a>
-<span class="sourceLineNo">817</span> */<a name="line.817"></a>
-<span class="sourceLineNo">818</span> public static int toInt(ByteBuffer buffer, int offset) {<a name="line.818"></a>
-<span class="sourceLineNo">819</span> if (UNSAFE_UNALIGNED) {<a name="line.819"></a>
-<span class="sourceLineNo">820</span> return UnsafeAccess.toInt(buffer, offset);<a name="line.820"></a>
-<span class="sourceLineNo">821</span> } else {<a name="line.821"></a>
-<span class="sourceLineNo">822</span> return buffer.getInt(offset);<a name="line.822"></a>
-<span class="sourceLineNo">823</span> }<a name="line.823"></a>
-<span class="sourceLineNo">824</span> }<a name="line.824"></a>
-<span class="sourceLineNo">825</span><a name="line.825"></a>
-<span class="sourceLineNo">826</span> /**<a name="line.826"></a>
-<span class="sourceLineNo">827</span> * Converts a ByteBuffer to an int value<a name="line.827"></a>
-<span class="sourceLineNo">828</span> *<a name="line.828"></a>
-<span class="sourceLineNo">829</span> * @param buf The ByteBuffer<a name="line.829"></a>
-<span class="sourceLineNo">830</span> * @param offset Offset to int value<a name="line.830"></a>
-<span class="sourceLineNo">831</span> * @param length Number of bytes used to store the int value.<a name="line.831"></a>
-<span class="sourceLineNo">832</span> * @return the int value<a name="line.832"></a>
-<span class="sourceLineNo">833</span> * @throws IllegalArgumentException<a name="line.833"></a>
-<span class="sourceLineNo">834</span> * if there's not enough bytes left in the buffer after the given offset<a name="line.834"></a>
-<span class="sourceLineNo">835</span> */<a name="line.835"></a>
-<span class="sourceLineNo">836</span> public static int readAsInt(ByteBuffer buf, int offset, final int length) {<a name="line.836"></a>
-<span class="sourceLineNo">837</span> if (offset + length > buf.limit()) {<a name="line.837"></a>
-<span class="sourceLineNo">838</span> throw new IllegalArgumentException("offset (" + offset + ") + length (" + length<a name="line.838"></a>
-<span class="sourceLineNo">839</span> + ") exceed the" + " limit of the buffer: " + buf.limit());<a name="line.839"></a>
-<span class="sourceLineNo">840</span> }<a name="line.840"></a>
-<span class="sourceLineNo">841</span> int n = 0;<a name="line.841"></a>
-<span class="sourceLineNo">842</span> for(int i = offset; i < (offset + length); i++) {<a name="line.842"></a>
-<span class="sourceLineNo">843</span> n <<= 8;<a name="line.843"></a>
-<span class="sourceLineNo">844</span> n ^= toByte(buf, i) & 0xFF;<a name="line.844"></a>
-<span class="sourceLineNo">845</span> }<a name="line.845"></a>
-<span class="sourceLineNo">846</span> return n;<a name="line.846"></a>
-<span class="sourceLineNo">847</span> }<a name="line.847"></a>
-<span class="sourceLineNo">848</span><a name="line.848"></a>
-<span class="sourceLineNo">849</span> /**<a name="line.849"></a>
-<span class="sourceLineNo">850</span> * Reads a long value at the given buffer's offset.<a name="line.850"></a>
-<span class="sourceLineNo">851</span> * @param buffer<a name="line.851"></a>
-<span class="sourceLineNo">852</span> * @param offset<a name="line.852"></a>
-<span class="sourceLineNo">853</span> * @return long value at offset<a name="line.853"></a>
-<span class="sourceLineNo">854</span> */<a name="line.854"></a>
-<span class="sourceLineNo">855</span> public static long toLong(ByteBuffer buffer, int offset) {<a name="line.855"></a>
-<span class="sourceLineNo">856</span> if (UNSAFE_UNALIGNED) {<a name="line.856"></a>
-<span class="sourceLineNo">857</span> return UnsafeAccess.toLong(buffer, offset);<a name="line.857"></a>
-<span class="sourceLineNo">858</span> } else {<a name="line.858"></a>
-<span class="sourceLineNo">859</span> return buffer.getLong(offset);<a name="line.859"></a>
-<span class="sourceLineNo">860</span> }<a name="line.860"></a>
-<span class="sourceLineNo">861</span> }<a name="line.861"></a>
-<span class="sourceLineNo">862</span><a name="line.862"></a>
-<span class="sourceLineNo">863</span> /**<a name="line.863"></a>
-<span class="sourceLineNo">864</span> * Put an int value out to the given ByteBuffer's current position in big-endian format.<a name="line.864"></a>
-<span class="sourceLineNo">865</span> * This also advances the position in buffer by int size.<a name="line.865"></a>
-<span class="sourceLineNo">866</span> * @param buffer the ByteBuffer to write to<a name="line.866"></a>
-<span class="sourceLineNo">867</span> * @param val int to write out<a name="line.867"></a>
-<span class="sourceLineNo">868</span> */<a name="line.868"></a>
-<span class="sourceLineNo">869</span> public static void putInt(ByteBuffer buffer, int val) {<a name="line.869"></a>
-<span class="sourceLineNo">870</span> if (UNSAFE_UNALIGNED) {<a name="line.870"></a>
-<span class="sourceLineNo">871</span> int newPos = UnsafeAccess.putInt(buffer, buffer.position(), val);<a name="line.871"></a>
-<span class="sourceLineNo">872</span> buffer.position(newPos);<a name="line.872"></a>
-<span class="sourceLineNo">873</span> } else {<a name="line.873"></a>
-<span class="sourceLineNo">874</span> buffer.putInt(val);<a name="line.874"></a>
-<span class="sourceLineNo">875</span> }<a name="line.875"></a>
-<span class="sourceLineNo">876</span> }<a name="line.876"></a>
-<span class="sourceLineNo">877</span><a name="line.877"></a>
-<span class="sourceLineNo">878</span> public static int putInt(ByteBuffer buffer, int index, int val) {<a name="line.878"></a>
-<span class="sourceLineNo">879</span> if (UNSAFE_UNALIGNED) {<a name="line.879"></a>
-<span class="sourceLineNo">880</span> return UnsafeAccess.putInt(buffer, index, val);<a name="line.880"></a>
-<span class="sourceLineNo">881</span> }<a name="line.881"></a>
-<span class="sourceLineNo">882</span> buffer.putInt(index, val);<a name="line.882"></a>
-<span class="sourceLineNo">883</span> return index + Bytes.SIZEOF_INT;<a name="line.883"></a>
-<span class="sourceLineNo">884</span> }<a name="line.884"></a>
-<span class="sourceLineNo">885</span><a name="line.885"></a>
-<span class="sourceLineNo">886</span> /**<a name="line.886"></a>
-<span class="sourceLineNo">887</span> * Reads a double value at the given buffer's offset.<a name="line.887"></a>
-<span class="sourceLineNo">888</span> * @param buffer<a name="line.888"></a>
-<span class="sourceLineNo">889</span> * @param offset offset where double is<a name="line.889"></a>
-<span class="sourceLineNo">890</span> * @return double value at offset<a name="line.890"></a>
-<span class="sourceLineNo">891</span> */<a name="line.891"></a>
-<span class="sourceLineNo">892</span> public static double toDouble(ByteBuffer buffer, int offset) {<a name="line.892"></a>
-<span class="sourceLineNo">893</span> return Double.longBitsToDouble(toLong(buffer, offset));<a name="line.893"></a>
-<span class="sourceLineNo">894</span> }<a name="line.894"></a>
-<span class="sourceLineNo">895</span><a name="line.895"></a>
-<span class="sourceLineNo">896</span> /**<a name="line.896"></a>
-<span class="sourceLineNo">897</span> * Reads a BigDecimal value at the given buffer's offset.<a name="line.897"></a>
-<span class="sourceLineNo">898</span> * @param buffer<a name="line.898"></a>
-<span class="sourceLineNo">899</span> * @param offset<a name="line.899"></a>
-<span class="sourceLineNo">900</span> * @return BigDecimal value at offset<a name="line.900"></a>
-<span class="sourceLineNo">901</span> */<a name="line.901"></a>
-<span class="sourceLineNo">902</span> public static BigDecimal toBigDecimal(ByteBuffer buffer, int offset, int length) {<a name="line.902"></a>
-<span class="sourceLineNo">903</span> if (buffer == null || length < Bytes.SIZEOF_INT + 1 ||<a name="line.903"></a>
-<span class="sourceLineNo">904</span> (offset + length > buffer.limit())) {<a name="line.904"></a>
-<span class="sourceLineNo">905</span> return null;<a name="line.905"></a>
-<span class="sourceLineNo">906</span> }<a name="line.906"></a>
-<span class="sourceLineNo">907</span><a name="line.907"></a>
-<span class="sourceLineNo">908</span> int scale = toInt(buffer, offset);<a name="line.908"></a>
-<span class="sourceLineNo">909</span> byte[] tcBytes = new byte[length - Bytes.SIZEOF_INT];<a name="line.909"></a>
-<span class="sourceLineNo">910</span> copyFromBufferToArray(tcBytes, buffer, offset + Bytes.SIZEOF_INT, 0, length - Bytes.SIZEOF_INT);<a name="line.910"></a>
-<span class="sourceLineNo">911</span> return new BigDecimal(new BigInteger(tcBytes), scale);<a name="line.911"></a>
-<span class="sourceLineNo">912</span> }<a name="line.912"></a>
-<span class="sourceLineNo">913</span><a name="line.913"></a>
-<span class="sourceLineNo">914</span> /**<a name="line.914"></a>
-<span class="sourceLineNo">915</span> * Put a short value out to the given ByteBuffer's current position in big-endian format.<a name="line.915"></a>
-<span class="sourceLineNo">916</span> * This also advances the position in buffer by short size.<a name="line.916"></a>
-<span class="sourceLineNo">917</span> * @param buffer the ByteBuffer to write to<a name="line.917"></a>
-<span class="sourceLineNo">918</span> * @param val short to write out<a name="line.918"></a>
-<span class="sourceLineNo">919</span> */<a name="line.919"></a>
-<span class="sourceLineNo">920</span> public static void putShort(ByteBuffer buffer, short val) {<a name="line.920"></a>
-<span class="sourceLineNo">921</span> if (UNSAFE_UNALIGNED) {<a name="line.921"></a>
-<span class="sourceLineNo">922</span> int newPos = UnsafeAccess.putShort(buffer, buffer.position(), val);<a name="line.922"></a>
-<span class="sourceLineNo">923</span> buffer.position(newPos);<a name="line.923"></a>
-<span class="sourceLineNo">924</span> } else {<a name="line.924"></a>
-<span class="sourceLineNo">925</span> buffer.putShort(val);<a name="line.925"></a>
-<span class="sourceLineNo">926</span> }<a name="line.926"></a>
-<span class="sourceLineNo">927</span> }<a name="line.927"></a>
-<span class="sourceLineNo">928</span><a name="line.928"></a>
-<span class="sourceLineNo">929</span> public static int putShort(ByteBuffer buffer, int index, short val) {<a name="line.929"></a>
-<span class="sourceLineNo">930</span> if (UNSAFE_UNALIGNED) {<a name="line.930"></a>
-<span class="sourceLineNo">931</span> return UnsafeAccess.putShort(buffer, index, val);<a name="line.931"></a>
-<span class="sourceLineNo">932</span> }<a name="line.932"></a>
-<span class="sourceLineNo">933</span> buffer.putShort(index, val);<a name="line.933"></a>
-<span class="sourceLineNo">934</span> return index + Bytes.SIZEOF_SHORT;<a name="line.934"></a>
-<span class="sourceLineNo">935</span> }<a name="line.935"></a>
-<span class="sourceLineNo">936</span><a name="line.936"></a>
-<span class="sourceLineNo">937</span> public static int putAsShort(ByteBuffer buf, int index, int val) {<a name="line.937"></a>
-<span class="sourceLineNo">938</span> buf.put(index + 1, (byte) val);<a name="line.938"></a>
-<span class="sourceLineNo">939</span> val >>= 8;<a name="line.939"></a>
-<span class="sourceLineNo">940</span> buf.put(index, (byte) val);<a name="line.940"></a>
-<span class="sourceLineNo">941</span> return index + Bytes.SIZEOF_SHORT;<a name="line.941"></a>
-<span class="sourceLineNo">942</span> }<a name="line.942"></a>
-<span class="sourceLineNo">943</span><a name="line.943"></a>
-<span class="sourceLineNo">944</span> /**<a name="line.944"></a>
-<span class="sourceLineNo">945</span> * Put a long value out to the given ByteBuffer's current position in big-endian format.<a name="line.945"></a>
-<span class="sourceLineNo">946</span> * This also advances the position in buffer by long size.<a name="line.946"></a>
-<span class="sourceLineNo">947</span> * @param buffer the ByteBuffer to write to<a name="line.947"></a>
-<span class="sourceLineNo">948</span> * @param val long to write out<a name="line.948"></a>
-<span class="sourceLineNo">949</span> */<a name="line.949"></a>
-<span class="sourceLineNo">950</span> public static void putLong(ByteBuffer buffer, long val) {<a name="line.950"></a>
-<span class="sourceLineNo">951</span> if (UNSAFE_UNALIGNED) {<a name="line.951"></a>
-<span class="sourceLineNo">952</span> int newPos = UnsafeAccess.putLong(buffer, buffer.position(), val);<a name="line.952"></a>
-<span class="sourceLineNo">953</span> buffer.position(newPos);<a name="line.953"></a>
-<span class="sourceLineNo">954</span> } else {<a name="line.954"></a>
-<span class="sourceLineNo">955</span> buffer.putLong(val);<a name="line.955"></a>
-<span class="sourceLineNo">956</span> }<a name="line.956"></a>
-<span class="sourceLineNo">957</span> }<a name="line.957"></a>
-<span class="sourceLineNo">958</span><a name="line.958"></a>
-<span class="sourceLineNo">959</span> public static int putLong(ByteBuffer buffer, int index, long val) {<a name="line.959"></a>
-<span class="sourceLineNo">960</span> if (UNSAFE_UNALIGNED) {<a name="line.960"></a>
-<span class="sourceLineNo">961</span> return UnsafeAccess.putLong(buffer, index, val);<a name="line.961"></a>
-<span class="sourceLineNo">962</span> }<a name="line.962"></a>
-<span class="sourceLineNo">963</span> buffer.putLong(index, val);<a name="line.963"></a>
-<span class="sourceLineNo">964</span> return index + Bytes.SIZEOF_LONG;<a name="line.964"></a>
-<span class="sourceLineNo">965</span> }<a name="line.965"></a>
-<span class="sourceLineNo">966</span><a name="line.966"></a>
-<span class="sourceLineNo">967</span> /**<a name="line.967"></a>
-<span class="sourceLineNo">968</span> * Copies the bytes from given array's offset to length part into the given buffer. Puts the bytes<a name="line.968"></a>
-<span class="sourceLineNo">969</span> * to buffer's current position. This also advances the position in the 'out' buffer by 'length'<a name="line.969"></a>
-<span class="sourceLineNo">970</span> * @param out<a name="line.970"></a>
-<span class="sourceLineNo">971</span> * @param in<a name="line.971"></a>
-<span class="sourceLineNo">972</span> * @param inOffset<a name="line.972"></a>
-<span class="sourceLineNo">973</span> * @param length<a name="line.973"></a>
-<span class="sourceLineNo">974</span> */<a name="line.974"></a>
-<span class="sourceLineNo">975</span> public static void copyFromArrayToBuffer(ByteBuffer out, byte[] in, int inOffset, int length) {<a name="line.975"></a>
-<span class="sourceLineNo">976</span> if (out.hasArray()) {<a name="line.976"></a>
-<span class="sourceLineNo">977</span> System.arraycopy(in, inOffset, out.array(), out.arrayOffset() + out.position(), length);<a name="line.977"></a>
-<span class="sourceLineNo">978</span> // Move the position in out by length<a name="line.978"></a>
-<span class="sourceLineNo">979</span> out.position(out.position() + length);<a name="line.979"></a>
-<span class="sourceLineNo">980</span> } else if (UNSAFE_AVAIL) {<a name="line.980"></a>
-<span class="sourceLineNo">981</span> UnsafeAccess.copy(in, inOffset, out, out.position(), length);<a name="line.981"></a>
-<span class="sourceLineNo">982</span> // Move the position in out by length<a name="line.982"></a>
-<span class="sourceLineNo">983</span> out.position(out.position() + length);<a name="line.983"></a>
-<span class="sourceLineNo">984</span> } else {<a name="line.984"></a>
-<span class="sourceLineNo">985</span> out.put(in, inOffset, length);<a name="line.985"></a>
-<span class="sourceLineNo">986</span> }<a name="line.986"></a>
-<span class="sourceLineNo">987</span> }<a name="line.987"></a>
-<span class="sourceLineNo">988</span><a name="line.988"></a>
-<span class="sourceLineNo">989</span> /**<a name="line.989"></a>
-<span class="sourceLineNo">990</span> * Copies bytes from given array's offset to length part into the given buffer. Puts the bytes<a name="line.990"></a>
-<span class="sourceLineNo">991</span> * to buffer's given position. This doesn't affact the position of buffer.<a name="line.991"></a>
-<span class="sourceLineNo">992</span> * @param out<a name="line.992"></a>
-<span class="sourceLineNo">993</span> * @param in<a name="line.993"></a>
-<span class="sourceLineNo">994</span> * @param inOffset<a name="line.994"></a>
-<span class="sourceLineNo">995</span> * @param length<a name="line.995"></a>
-<span class="sourceLineNo">996</span> */<a name="line.996"></a>
-<span class="sourceLineNo">997</span> public static void copyFromArrayToBuffer(ByteBuffer out, int outOffset, byte[] in, int inOffset,<a name="line.997"></a>
-<span class="sourceLineNo">998</span> int length) {<a name="line.998"></a>
-<span class="sourceLineNo">999</span> if (out.hasArray()) {<a name="line.999"></a>
-<span class="sourceLineNo">1000</span> System.arraycopy(in, inOffset, out.array(), out.arrayOffset() + outOffset, length);<a name="line.1000"></a>
-<span class="sourceLineNo">1001</span> } else if (UNSAFE_AVAIL) {<a name="line.1001"></a>
-<span class="sourceLineNo">1002</span> UnsafeAccess.copy(in, inOffset, out, outOffset, length);<a name="line.1002"></a>
-<span class="sourceLineNo">1003</span> } else {<a name="line.1003"></a>
-<span class="sourceLineNo">1004</span> ByteBuffer outDup = out.duplicate();<a name="line.1004"></a>
-<span class="sourceLineNo">1005</span> outDup.position(outOffset);<a name="line.1005"></a>
-<span class="sourceLineNo">1006</span> outDup.put(in, inOffset, length);<a name="line.1006"></a>
-<span class="sourceLineNo">1007</span> }<a name="line.1007"></a>
-<span class="sourceLineNo">1008</span> }<a name="line.1008"></a>
-<span class="sourceLineNo">1009</span><a name="line.1009"></a>
-<span class="sourceLineNo">1010</span> /**<a name="line.1010"></a>
-<span class="sourceLineNo">1011</span> * Copies specified number of bytes from given offset of 'in' ByteBuffer to<a name="line.1011"></a>
-<span class="sourceLineNo">1012</span> * the array. This doesn't affact the position of buffer.<a name="line.1012"></a>
-<span class="sourceLineNo">1013</span> * @param out<a name="line.1013"></a>
-<span class="sourceLineNo">1014</span> * @param in<a name="line.1014"></a>
-<span class="sourceLineNo">1015</span> * @param sourceOffset<a name="line.1015"></a>
-<span class="sourceLineNo">1016</span> * @param destinationOffset<a name="line.1016"></a>
-<span class="sourceLineNo">1017</span> * @param length<a name="line.1017"></a>
-<span class="sourceLineNo">1018</span> */<a name="line.1018"></a>
-<span class="sourceLineNo">1019</span> public static void copyFromBufferToArray(byte[] out, ByteBuffer in, int sourceOffset,<a name="line.1019"></a>
-<span class="sourceLineNo">1020</span> int destinationOffset, int length) {<a name="line.1020"></a>
-<span class="sourceLineNo">1021</span> if (in.hasArray()) {<a name="line.1021"></a>
-<span class="sourceLineNo">1022</span> System.arraycopy(in.array(), sourceOffset + in.arrayOffset(), out, destinationOffset, length);<a name="line.1022"></a>
-<span class="sourceLineNo">1023</span> } else if (UNSAFE_AVAIL) {<a name="line.1023"></a>
-<span class="sourceLineNo">1024</span> UnsafeAccess.copy(in, sourceOffset, out, destinationOffset, length);<a name="line.1024"></a>
-<span class="sourceLineNo">1025</span> } else {<a name="line.1025"></a>
-<span class="sourceLineNo">1026</span> ByteBuffer inDup = in.duplicate();<a name="line.1026"></a>
-<span class="sourceLineNo">1027</span> inDup.position(sourceOffset);<a name="line.1027"></a>
-<span class="sourceLineNo">1028</span> inDup.get(out, destinationOffset, length);<a name="line.1028"></a>
-<span class="sourceLineNo">1029</span> }<a name="line.1029"></a>
-<span class="sourceLineNo">1030</span> }<a name="line.1030"></a>
-<span class="sourceLineNo">1031</span><a name="line.1031"></a>
-<span class="sourceLineNo">1032</span> /**<a name="line.1032"></a>
-<span class="sourceLineNo">1033</span> * Similar to {@link Arrays#copyOfRange(byte[], int, int)}<a name="line.1033"></a>
-<span class="sourceLineNo">1034</span> * @param original the buffer from which the copy has to happen<a name="line.1034"></a>
-<span class="sourceLineNo">1035</span> * @param from the starting index<a name="line.1035"></a>
-<span class="sourceLineNo">1036</span> * @param to the ending index<a name="line.1036"></a>
-<span class="sourceLineNo">1037</span> * @return a byte[] created out of the copy<a name="line.1037"></a>
-<span class="sourceLineNo">1038</span> */<a name="line.1038"></a>
-<span class="sourceLineNo">1039</span> public static byte[] copyOfRange(ByteBuffer original, int from, int to) {<a name="line.1039"></a>
-<span class="sourceLineNo">1040</span> int newLength = to - from;<a name="line.1040"></a>
-<span class="sourceLineNo">1041</span> if (newLength < 0) throw new IllegalArgumentException(from + " > " + to);<a name="line.1041"></a>
-<span class="sourceLineNo">1042</span> byte[] copy = new byte[newLength];<a name="line.1042"></a>
-<span class="sourceLineNo">1043</span> ByteBufferUtils.copyFromBufferToArray(copy, original, from, 0, newLength);<a name="line.1043"></a>
-<span class="sourceLineNo">1044</span> return copy;<a name="line.1044"></a>
-<span class="sourceLineNo">1045</span> }<a name="line.1045"></a>
-<span class="sourceLineNo">1046</span><a name="line.1046"></a>
-<span class="sourceLineNo">1047</span> // For testing purpose<a name="line.1047"></a>
-<span class="sourceLineNo">1048</span> public static String toStringBinary(final ByteBuffer b, int off, int len) {<a name="line.1048"></a>
-<span class="sourceLineNo">1049</span> StringBuilder result = new StringBuilder();<a name="line.1049"></a>
-<span class="sourceLineNo">1050</span> // Just in case we are passed a 'len' that is > buffer length...<a name="line.1050"></a>
-<span class="sourceLineNo">1051</span> if (off >= b.capacity())<a name="line.1051"></a>
-<span class="sourceLineNo">1052</span> return result.toString();<a name="line.1052"></a>
-<span class="sourceLineNo">1053</span> if (off + len > b.capacity())<a name="line.1053"></a>
-<span class="sourceLineNo">1054</span> len = b.capacity() - off;<a name="line.1054"></a>
-<span class="sourceLineNo">1055</span> for (int i = off; i < off + len; ++i) {<a name="line.1055"></a>
-<span class="sourceLineNo">1056</span> int ch = b.get(i) & 0xFF;<a name="line.1056"></a>
-<span class="sourceLineNo">1057</span> if ((ch >= '0' && ch <= '9') || (ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z')<a name="line.1057"></a>
-<span class="sourceLineNo">1058</span> || " `~!@#$%^&*()-_=+[]{}|;:'\",.<>/?".indexOf(ch) >= 0) {<a name="line.1058"></a>
-<span class="sourceLineNo">1059</span> result.append((char) ch);<a name="line.1059"></a>
-<span class="sourceLineNo">1060</span> } else {<a name="line.1060"></a>
-<span class="sourceLineNo">1061</span> result.append(String.format("\\x%02X", ch));<a name="line.1061"></a>
-<span class="sourceLineNo">1062</span> }<a name="line.1062"></a>
-<span class="sourceLineNo">1063</span> }<a name="line.1063"></a>
-<span class="sourceLineNo">1064</span> return result.toString();<a name="line.1064"></a>
-<span class="sourceLineNo">1065</span> }<a name="line.1065"></a>
-<span class="sourceLineNo">1066</span><a name="line.1066"></a>
-<span class="sourceLineNo">1067</span> public static String toStringBinary(final ByteBuffer b) {<a name="line.1067"></a>
-<span class="sourceLineNo">1068</span> return toStringBinary(b, 0, b.capacity());<a name="line.1068"></a>
-<span class="sourceLineNo">1069</span> }<a name="line.1069"></a>
-<span class="sourceLineNo">1070</span>}<a name="line.1070"></a>
+<span class="sourceLineNo">704</span> final int stride = 8;<a name="line.704"></a>
+<span class="sourceLineNo">705</span> final int minLength = Math.min(l1, l2);<a name="line.705"></a>
+<span class="sourceLineNo">706</span> int strideLimit = minLength & ~(stride - 1);<a name="line.706"></a>
+<span class="sourceLineNo">707</span> int i;<a name="line.707"></a>
+<span class="sourceLineNo">708</span><a name="line.708"></a>
+<span class="sourceLineNo">709</span> /*<a name="line.709"></a>
+<span class="sourceLineNo">710</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a time is no slower than<a name="line.710"></a>
+<span class="sourceLineNo">711</span> * comparing 4 bytes at a time even on 32-bit. On the other hand, it is substantially faster on<a name="line.711"></a>
+<span class="sourceLineNo">712</span> * 64-bit.<a name="line.712"></a>
+<span class="sourceLineNo">713</span> */<a name="line.713"></a>
+<span class="sourceLineNo">714</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.714"></a>
+<span class="sourceLineNo">715</span> long lw = UnsafeAccess.theUnsafe.getLong(obj1, o1 + (long) i);<a name="line.715"></a>
+<span class="sourceLineNo">716</span> long rw = UnsafeAccess.theUnsafe.getLong(obj2, o2 + (long) i);<a name="line.716"></a>
+<span class="sourceLineNo">717</span> if (lw != rw) {<a name="line.717"></a>
+<span class="sourceLineNo">718</span> if (!UnsafeAccess.littleEndian) {<a name="line.718"></a>
+<span class="sourceLineNo">719</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.719"></a>
+<span class="sourceLineNo">720</span> }<a name="line.720"></a>
+<span class="sourceLineNo">721</span><a name="line.721"></a>
+<span class="sourceLineNo">722</span> /*<a name="line.722"></a>
+<span class="sourceLineNo">723</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.723"></a>
+<span class="sourceLineNo">724</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.724"></a>
+<span class="sourceLineNo">725</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.725"></a>
+<span class="sourceLineNo">726</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.726"></a>
+<span class="sourceLineNo">727</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.727"></a>
+<span class="sourceLineNo">728</span> * from guava v21<a name="line.728"></a>
+<span class="sourceLineNo">729</span> */<a name="line.729"></a>
+<span class="sourceLineNo">730</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.730"></a>
+<span class="sourceLineNo">731</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.731"></a>
+<span class="sourceLineNo">732</span> }<a name="line.732"></a>
+<span class="sourceLineNo">733</span> }<a name="line.733"></a>
+<span class="sourceLineNo">734</span><a name="line.734"></a>
+<span class="sourceLineNo">735</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.735"></a>
+<span class="sourceLineNo">736</span> for (; i < minLength; i++) {<a name="line.736"></a>
+<span class="sourceLineNo">737</span> int il = (UnsafeAccess.theUnsafe.getByte(obj1, o1 + i) & 0xFF);<a name="line.737"></a>
+<span class="sourceLineNo">738</span> int ir = (UnsafeAccess.theUnsafe.getByte(obj2, o2 + i) & 0xFF);<a name="line.738"></a>
+<span class="sourceLineNo">739</span> if (il != ir) {<a name="line.739"></a>
+<span class="sourceLineNo">740</span> return il - ir;<a name="line.740"></a>
+<span class="sourceLineNo">741</span> }<a name="line.741"></a>
+<span class="sourceLineNo">742</span> }<a name="line.742"></a>
+<span class="sourceLineNo">743</span> return l1 - l2;<a name="line.743"></a>
+<span class="sourceLineNo">744</span> }<a name="line.744"></a>
+<span class="sourceLineNo">745</span><a name="line.745"></a>
+<span class="sourceLineNo">746</span> /*<a name="line.746"></a>
+<span class="sourceLineNo">747</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.747"></a>
+<span class="sourceLineNo">748</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.748"></a>
+<span class="sourceLineNo">749</span> */<a name="line.749"></a>
+<span class="sourceLineNo">750</span> private static boolean lessThanUnsignedLong(long x1, long x2) {<a name="line.750"></a>
+<span class="sourceLineNo">751</span> if (UnsafeAccess.littleEndian) {<a name="line.751"></a>
+<span class="sourceLineNo">752</span> x1 = Long.reverseBytes(x1);<a name="line.752"></a>
+<span class="sourceLineNo">753</span> x2 = Long.reverseBytes(x2);<a name="line.753"></a>
+<span class="sourceLineNo">754</span> }<a name="line.754"></a>
+<span class="sourceLineNo">755</span> return (x1 + Long.MIN_VALUE) < (x2 + Long.MIN_VALUE);<a name="line.755"></a>
+<span class="sourceLineNo">756</span> }<a name="line.756"></a>
+<span class="sourceLineNo">757</span><a name="line.757"></a>
+<span class="sourceLineNo">758</span> /*<a name="line.758"></a>
+<span class="sourceLineNo">759</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.759"></a>
+<span class="sourceLineNo">760</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.760"></a>
+<span class="sourceLineNo">761</span> */<a name="line.761"></a>
+<span class="sourceLineNo">762</span> private static boolean lessThanUnsignedInt(int x1, int x2) {<a name="line.762"></a>
+<span class="sourceLineNo">763</span> if (UnsafeAccess.littleEndian) {<a name="line.763"></a>
+<span class="sourceLineNo">764</span> x1 = Integer.reverseBytes(x1);<a name="line.764"></a>
+<span class="sourceLineNo">765</span> x2 = Integer.reverseBytes(x2);<a name="line.765"></a>
+<span class="sourceLineNo">766</span> }<a name="line.766"></a>
+<span class="sourceLineNo">767</span> return (x1 & 0xffffffffL) < (x2 & 0xffffffffL);<a name="line.767"></a>
+<span class="sourceLineNo">768</span> }<a name="line.768"></a>
+<span class="sourceLineNo">769</span><a name="line.769"></a>
+<span class="sourceLineNo">770</span> /*<a name="line.770"></a>
+<span class="sourceLineNo">771</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.771"></a>
+<span class="sourceLineNo">772</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.772"></a>
+<span class="sourceLineNo">773</span> */<a name="line.773"></a>
+<span class="sourceLineNo">774</span> private static boolean lessThanUnsignedShort(short x1, short x2) {<a name="line.774"></a>
+<span class="sourceLineNo">775</span> if (UnsafeAccess.littleEndian) {<a name="line.775"></a>
+<span class="sourceLineNo">776</span> x1 = Short.reverseBytes(x1);<a name="line.776"></a>
+<span class="sourceLineNo">777</span> x2 = Short.reverseBytes(x2);<a name="line.777"></a>
+<span class="sourceLineNo">778</span> }<a name="line.778"></a>
+<span class="sourceLineNo">779</span> return (x1 & 0xffff) < (x2 & 0xffff);<a name="line.779"></a>
+<span class="sourceLineNo">780</span> }<a name="line.780"></a>
+<span class="sourceLineNo">781</span><a name="line.781"></a>
+<span class="sourceLineNo">782</span> /**<a name="line.782"></a>
+<span class="sourceLineNo">783</span> * Reads a short value at the given buffer's offset.<a name="line.783"></a>
+<span class="sourceLineNo">784</span> * @param buffer<a name="line.784"></a>
+<span class="sourceLineNo">785</span> * @param offset<a name="line.785"></a>
+<span class="sourceLineNo">786</span> * @return short value at offset<a name="line.786"></a>
+<span class="sourceLineNo">787</span> */<a name="line.787"></a>
+<span class="sourceLineNo">788</span> public static short toShort(ByteBuffer buffer, int offset) {<a name="line.788"></a>
+<span class="sourceLineNo">789</span> if (UNSAFE_UNALIGNED) {<a name="line.789"></a>
+<span class="sourceLineNo">790</span> return UnsafeAccess.toShort(buffer, offset);<a name="line.790"></a>
+<span class="sourceLineNo">791</span> } else {<a name="line.791"></a>
+<span class="sourceLineNo">792</span> return buffer.getShort(offset);<a name="line.792"></a>
+<span class="sourceLineNo">793</span> }<a name="line.793"></a>
+<span class="sourceLineNo">794</span> }<a name="line.794"></a>
+<span class="sourceLineNo">795</span><a name="line.795"></a>
+<span class="sourceLineNo">796</span> /**<a name="line.796"></a>
+<span class="sourceLineNo">797</span> * Reads an int value at the given buffer's current position. Also advances the buffer's position<a name="line.797"></a>
+<span class="sourceLineNo">798</span> */<a name="line.798"></a>
+<span class="sourceLineNo">799</span> public static int toInt(ByteBuffer buffer) {<a name="line.799"></a>
+<span class="sourceLineNo">800</span> if (UNSAFE_UNALIGNED) {<a name="line.800"></a>
+<span class="sourceLineNo">801</span> int i = UnsafeAccess.toInt(buffer, buffer.position());<a name="line.801"></a>
+<span class="sourceLineNo">802</span> buffer.position(buffer.position() + Bytes.SIZEOF_INT);<a name="line.802"></a>
+<span class="sourceLineNo">803</span> return i;<a name="line.803"></a>
+<span class="sourceLineNo">804</span> } else {<a name="line.804"></a>
+<span class="sourceLineNo">805</span> return buffer.getInt();<a name="line.805"></a>
+<span class="sourceLineNo">806</span> }<a name="line.806"></a>
+<span class="sourceLineNo">807</span> }<a name="line.807"></a>
+<span class="sourceLineNo">808</span><a name="line.808"></a>
+<span class="sourceLineNo">809</span> /**<a name="line.809"></a>
+<span class="sourceLineNo">810</span> * Reads an int value at the given buffer's offset.<a name="line.810"></a>
+<span class="sourceLineNo">811</span> * @param buffer<a name="line.811"></a>
+<span class="sourceLineNo">812</span> * @param offset<a name="line.812"></a>
+<span class="sourceLineNo">813</span> * @return int value at offset<a name="line.813"></a>
+<span class="sourceLineNo">814</span> */<a name="line.814"></a>
+<span class="sourceLineNo">815</span> public static int toInt(ByteBuffer buffer, int offset) {<a name="line.815"></a>
+<span class="sourceLineNo">816</span> if (UNSAFE_UNALIGNED) {<a name="line.816"></a>
+<span class="sourceLineNo">817</span> return UnsafeAccess.toInt(buffer, offset);<a name="line.817"></a>
+<span class="sourceLineNo">818</span> } else {<a name="line.818"></a>
+<span class="sourceLineNo">819</span> return buffer.getInt(offset);<a name="line.819"></a>
+<span class="sourceLineNo">820</span> }<a name="line.820"></a>
+<span class="sourceLineNo">821</span> }<a name="line.821"></a>
+<span class="sourceLineNo">822</span><a name="line.822"></a>
+<span class="sourceLineNo">823</span> /**<a name="line.823"></a>
+<span class="sourceLineNo">824</span> * Converts a ByteBuffer to an int value<a name="line.824"></a>
+<span class="sourceLineNo">825</span> *<a name="line.825"></a>
+<span class="sourceLineNo">826</span> * @param buf The ByteBuffer<a name="line.826"></a>
+<span class="sourceLineNo">827</span> * @param offset Offset to int value<a name="line.827"></a>
+<span class="sourceLineNo">828</span> * @param length Number of bytes used to store the int value.<a name="line.828"></a>
+<span class="sourceLineNo">829</span> * @return the int value<a name="line.829"></a>
+<span class="sourceLineNo">830</span> * @throws IllegalArgumentException<a name="line.830"></a>
+<span class="sourceLineNo">831</span> * if there's not enough bytes left in the buffer after the given offset<a name="line.831"></a>
+<span class="sourceLineNo">832</span> */<a name="line.832"></a>
+<span class="sourceLineNo">833</span> public static int readAsInt(ByteBuffer buf, int offset, final int length) {<a name="line.833"></a>
+<span class="sourceLineNo">834</span> if (offset + length > buf.limit()) {<a name="line.834"></a>
+<span class="sourceLineNo">835</span> throw new IllegalArgumentException("offset (" + offset + ") + length (" + length<a name="line.835"></a>
+<span class="sourceLineNo">836</span> + ") exceed the" + " limit of the buffer: " + buf.limit());<a name="line.836"></a>
+<span class="sourceLineNo">837</span> }<a name="line.837"></a>
+<span class="sourceLineNo">838</span> int n = 0;<a name="line.838"></a>
+<span class="sourceLineNo">839</span> for(int i = offset; i < (offset + length); i++) {<a name="line.839"></a>
+<span class="sourceLineNo">840</span> n <<= 8;<a name="line.840"></a>
+<span class="sourceLineNo">841</span> n ^= toByte(buf, i) & 0xFF;<a name="line.841"></a>
+<span class="sourceLineNo">842</span> }<a name="line.842"></a>
+<span class="sourceLineNo">843</span> return n;<a name="line.843"></a>
+<span class="sourceLineNo">844</span> }<a name="line.844"></a>
+<span class="sourceLineNo">845</span><a name="line.845"></a>
+<span class="sourceLineNo">846</span> /**<a name="line.846"></a>
+<span class="sourceLineNo">847</span> * Reads a long value at the given buffer's offset.<a name="line.847"></a>
+<span class="sourceLineNo">848</span> * @param buffer<a name="line.848"></a>
+<span class="sourceLineNo">849</span> * @param offset<a name="line.849"></a>
+<span class="sourceLineNo">850</span> * @return long value at offset<a name="line.850"></a>
+<span class="sourceLineNo">851</span> */<a name="line.851"></a>
+<span class="sourceLineNo">852</span> public static long toLong(ByteBuffer buffer, int offset) {<a name="line.852"></a>
+<span class="sourceLineNo">853</span> if (UNSAFE_UNALIGNED) {<a name="line.853"></a>
+<span class="sourceLineNo">854</span> return UnsafeAccess.toLong(buffer, offset);<a name="line.854"></a>
+<span class="sourceLineNo">855</span> } else {<a name="line.855"></a>
+<span class="sourceLineNo">856</span> return buffer.getLong(offset);<a name="line.856"></a>
+<span class="sourceLineNo">857</span> }<a name="line.857"></a>
+<span class="sourceLineNo">858</span> }<a name="line.858"></a>
+<span class="sourceLineNo">859</span><a name="line.859"></a>
+<span class="sourceLineNo">860</span> /**<a name="line.860"></a>
+<span class="sourceLineNo">861</span> * Put an int value out to the given ByteBuffer's current position in big-endian format.<a name="line.861"></a>
+<span class="sourceLineNo">862</span> * This also advances the position in buffer by int size.<a name="line.862"></a>
+<span class="sourceLineNo">863</span> * @param buffer the ByteBuffer to write to<a name="line.863"></a>
+<span class="sourceLineNo">864</span> * @param val int to write out<a name="line.864"></a>
+<span class="sourceLineNo">865</span> */<a name="line.865"></a>
+<span class="sourceLineNo">866</span> public static void putInt(ByteBuffer buffer, int val) {<a name="line.866"></a>
+<span class="sourceLineNo">867</span> if (UNSAFE_UNALIGNED) {<a name="line.867"></a>
+<span class="sourceLineNo">868</span> int newPos = UnsafeAccess.putInt(buffer, buffer.position(), val);<a name="line.868"></a>
+<span class="sourceLineNo">869</span> buffer.position(newPos);<a name="line.869"></a>
+<span class="sourceLineNo">870</span> } else {<a name="line.870"></a>
+<span class="sourceLineNo">871</span> buffer.putInt(val);<a name="line.871"></a>
+<span class="sourceLineNo">872</span> }<a name="line.872"></a>
+<span class="sourceLineNo">873</span> }<a name="line.873"></a>
+<span class="sourceLineNo">874</span><a name="line.874"></a>
+<span class="sourceLineNo">875</span> public static int putInt(ByteBuffer buffer, int index, int val) {<a name="line.875"></a>
+<span class="sourceLineNo">876</span> if (UNSAFE_UNALIGNED) {<a name="line.876"></a>
+<span class="sourceLineNo">877</span> return UnsafeAccess.putInt(buffer, index, val);<a name="line.877"></a>
+<span class="sourceLineNo">878</span> }<a name="line.878"></a>
+<span class="sourceLineNo">879</span> buffer.putInt(index, val);<a name="line.879"></a>
+<span class="sourceLineNo">880</span> return index + Bytes.SIZEOF_INT;<a name="line.880"></a>
+<span class="sourceLineNo">881</span> }<a name="line.881"></a>
+<span class="sourceLineNo">882</span><a name="line.882"></a>
+<span class="sourceLineNo">883</span> /**<a name="line.883"></a>
+<span class="sourceLineNo">884</span> * Reads a double value at the given buffer's offset.<a name="line.884"></a>
+<span class="sourceLineNo">885</span> * @param buffer<a name="line.885"></a>
+<span class="sourceLineNo">886</span> * @param offset offset where double is<a name="line.886"></a>
+<span class="sourceLineNo">887</span> * @return double value at offset<a name="line.887"></a>
+<span class="sourceLineNo">888</span> */<a name="line.888"></a>
+<span class="sourceLineNo">889</span> public static double toDouble(ByteBuffer buffer, int offset) {<a name="line.889"></a>
+<span class="sourceLineNo">890</span> return Double.longBitsToDouble(toLong(buffer, offset));<a name="line.890"></a>
+<span class="sourceLineNo">891</span> }<a name="line.891"></a>
+<span class="sourceLineNo">892</span><a name="line.892"></a>
+<span class="sourceLineNo">893</span> /**<a name="line.893"></a>
+<span class="sourceLineNo">894</span> * Reads a BigDecimal value at the given buffer's offset.<a name="line.894"></a>
+<span class="sourceLineNo">895</span> * @param buffer<a name="line.895"></a>
+<span class="sourceLineNo">896</span> * @param offset<a name="line.896"></a>
+<span class="sourceLineNo">897</span> * @return BigDecimal value at offset<a name="line.897"></a>
+<span class="sourceLineNo">898</span> */<a name="line.898"></a>
+<span class="sourceLineNo">899</span> public static BigDecimal toBigDecimal(ByteBuffer buffer, int offset, int length) {<a name="line.899"></a>
+<span class="sourceLineNo">900</span> if (buffer == null || length < Bytes.SIZEOF_INT + 1 ||<a name="line.900"></a>
+<span class="sourceLineNo">901</span> (offset + length > buffer.limit())) {<a name="line.901"></a>
+<span class="sourceLineNo">902</span> return null;<a name="line.902"></a>
+<span class="sourceLineNo">903</span> }<a name="line.903"></a>
+<span class="sourceLineNo">904</span><a name="line.904"></a>
+<span class="sourceLineNo">905</span> int scale = toInt(buffer, offset);<a name="line.905"></a>
+<span class="sourceLineNo">906</span> byte[] tcBytes = new byte[length - Bytes.SIZEOF_INT];<a name="line.906"></a>
+<span class="sourceLineNo">907</span> copyFromBufferToArray(tcBytes, buffer, offset + Bytes.SIZEOF_INT, 0, length - Bytes.SIZEOF_INT);<a name="line.907"></a>
+<span class="sourceLineNo">908</span> return new BigDecimal(new BigInteger(tcBytes), scale);<a name="line.908"></a>
+<span class="sourceLineNo">909</span> }<a name="line.909"></a>
+<span class="sourceLineNo">910</span><a name="line.910"></a>
+<span class="sourceLineNo">911</span> /**<a name="line.911"></a>
+<span class="sourceLineNo">912</span> * Put a short value out to the given ByteBuffer's current position in big-endian format.<a name="line.912"></a>
+<span class="sourceLineNo">913</span> * This also advances the position in buffer by short size.<a name="line.913"></a>
+<span class="sourceLineNo">914</span> * @param buffer the ByteBuffer to write to<a name="line.914"></a>
+<span class="sourceLineNo">915</span> * @param val short to write out<a name="line.915"></a>
+<span class="sourceLineNo">916</span> */<a name="line.916"></a>
+<span class="sourceLineNo">917</span> public static void putShort(ByteBuffer buffer, short val) {<a name="line.917"></a>
+<span class="sourceLineNo">918</span> if (UNSAFE_UNALIGNED) {<a name="line.918"></a>
+<span class="sourceLineNo">919</span> int newPos = UnsafeAccess.putShort(buffer, buffer.position(), val);<a name="line.919"></a>
+<span class="sourceLineNo">920</span> buffer.position(newPos);<a name="line.920"></a>
+<span class="sourceLineNo">921</span> } else {<a name="line.921"></a>
+<span class="sourceLineNo">922</span> buffer.putShort(val);<a name="line.922"></a>
+<span class="sourceLineNo">923</span> }<a name="line.923"></a>
+<span class="sourceLineNo">924</span> }<a name="line.924"></a>
+<span class="sourceLineNo">925</span><a name="line.925"></a>
+<span class="sourceLineNo">926</span> public static int putShort(ByteBuffer buffer, int index, short val) {<a name="line.926"></a>
+<span class="sourceLineNo">927</span> if (UNSAFE_UNALIGNED) {<a name="line.927"></a>
+<span class="sourceLineNo">928</span> return UnsafeAccess.putShort(buffer, index, val);<a name="line.928"></a>
+<span class="sourceLineNo">929</span> }<a name="line.929"></a>
+<span class="sourceLineNo">930</span> buffer.putShort(index, val);<a name="line.930"></a>
+<span class="sourceLineNo">931</span> return index + Bytes.SIZEOF_SHORT;<a name="line.931"></a>
+<span class="sourceLineNo">932</span> }<a name="line.932"></a>
+<span class="sourceLineNo">933</span><a name="line.933"></a>
+<span class="sourceLineNo">934</span> public static int putAsShort(ByteBuffer buf, int index, int val) {<a name="line.934"></a>
+<span class="sourceLineNo">935</span> buf.put(index + 1, (byte) val);<a name="line.935"></a>
+<span class="sourceLineNo">936</span> val >>= 8;<a name="line.936"></a>
+<span class="sourceLineNo">937</span> buf.put(index, (byte) val);<a name="line.937"></a>
+<span class="sourceLineNo">938</span> return index + Bytes.SIZEOF_SHORT;<a name="line.938"></a>
+<span class="sourceLineNo">939</span> }<a name="line.939"></a>
+<span class="sourceLineNo">940</span><a name="line.940"></a>
+<span class="sourceLineNo">941</span> /**<a name="line.941"></a>
+<span class="sourceLineNo">942</span> * Put a long value out to the given ByteBuffer's current position in big-endian format.<a name="line.942"></a>
+<span class="sourceLineNo">943</span> * This also advances the position in buffer by long size.<a name="line.943"></a>
+<span class="sourceLineNo">944</span> * @param buffer the ByteBuffer to write to<a name="line.944"></a>
+<span class="sourceLineNo">945</span> * @param val long to write out<a name="line.945"></a>
+<span class="sourceLineNo">946</span> */<a name="line.946"></a>
+<span class="sourceLineNo">947</span> public static void putLong(ByteBuffer buffer, long val) {<a name="line.947"></a>
+<span class="sourceLineNo">948</span> if (UNSAFE_UNALIGNED) {<a name="line.948"></a>
+<span class="sourceLineNo">949</span> int newPos = UnsafeAccess.putLong(buffer, buffer.position(), val);<a name="line.949"></a>
+<span class="sourceLineNo">950</span> buffer.position(newPos);<a name="line.950"></a>
+<span class="sourceLineNo">951</span> } else {<a name="line.951"></a>
+<span class="sourceLineNo">952</span> buffer.putLong(val);<a name="line.952"></a>
+<span class="sourceLineNo">953</span> }<a name="line.953"></a>
+<span class="sourceLineNo">954</span> }<a name="line.954"></a>
+<span class="sourceLineNo">955</span><a name="line.955"></a>
+<span class="sourceLineNo">956</span> public static int putLong(ByteBuffer buffer, int index, long val) {<a name="line.956"></a>
+<span class="sourceLineNo">957</span> if (UNSAFE_UNALIGNED) {<a name="line.957"></a>
+<span class="sourceLineNo">958</span> return UnsafeAccess.putLong(buffer, index, val);<a name="line.958"></a>
+<span class="sourceLineNo">959</span> }<a name="line.959"></a>
+<span class="sourceLineNo">960</span> buffer.putLong(index, val);<a name="line.960"></a>
+<span class="sourceLineNo">961</span> return index + Bytes.SIZEOF_LONG;<a name="line.961"></a>
+<span class="sourceLineNo">962</span> }<a name="line.962"></a>
+<span class="sourceLineNo">963</span><a name="line.963"></a>
+<span class="sourceLineNo">964</span> /**<a name="line.964"></a>
+<span class="sourceLineNo">965</span> * Copies the bytes from given array's offset to length part into the given buffer. Puts the bytes<a name="line.965"></a>
+<span class="sourceLineNo">966</span> * to buffer's current position. This also advances the position in the 'out' buffer by 'length'<a name="line.966"></a>
+<span class="sourceLineNo">967</span> * @param out<a name="line.967"></a>
+<span class="sourceLineNo">968</span> * @param in<a name="line.968"></a>
+<span class="sourceLineNo">969</span> * @param inOffset<a name="line.969"></a>
+<span class="sourceLineNo">970</span> * @param length<a name="line.970"></a>
+<span class="sourceLineNo">971</span> */<a name="line.971"></a>
+<span class="sourceLineNo">972</span> public static void copyFromArrayToBuffer(ByteBuffer out, byte[] in, int inOffset, int length) {<a name="line.972"></a>
+<span class="sourceLineNo">973</span> if (out.hasArray()) {<a name="line.973"></a>
+<span class="sourceLineNo">974</span> System.arraycopy(in, inOffset, out.array(), out.arrayOffset() + out.position(), length);<a name="line.974"></a>
+<span class="sourceLineNo">975</span> // Move the position in out by length<a name="line.975"></a>
+<span class="sourceLineNo">976</span> out.position(out.position() + length);<a name="line.976"></a>
+<span class="sourceLineNo">977</span> } else if (UNSAFE_AVAIL) {<a name="line.977"></a>
+<span class="sourceLineNo">978</span> UnsafeAccess.copy(in, inOffset, out, out.position(), length);<a name="line.978"></a>
+<span class="sourceLineNo">979</span> // Move the position in out by length<a name="line.979"></a>
+<span class="sourceLineNo">980</span> out.position(out.position() + length);<a name="line.980"></a>
+<span class="sourceLineNo">981</span> } else {<a name="line.981"></a>
+<span class="sourceLineNo">982</span> out.put(in, inOffset, length);<a name="line.982"></a>
+<span class="sourceLineNo">983</span> }<a name="line.983"></a>
+<span class="sourceLineNo">984</span> }<a name="line.984"></a>
+<span class="sourceLineNo">985</span><a name="line.985"></a>
+<span class="sourceLineNo">986</span> /**<a name="line.986"></a>
+<span class="sourceLineNo">987</span> * Copies bytes from given array's offset to length part into the given buffer. Puts the bytes<a name="line.987"></a>
+<span class="sourceLineNo">988</span> * to buffer's given position. This doesn't affact the position of buffer.<a name="line.988"></a>
+<span class="sourceLineNo">989</span> * @param out<a name="line.989"></a>
+<span class="sourceLineNo">990</span> * @param in<a name="line.990"></a>
+<span class="sourceLineNo">991</span> * @param inOffset<a name="line.991"></a>
+<span class="sourceLineNo">992</span> * @param length<a name="line.992"></a>
+<span class="sourceLineNo">993</span> */<a name="line.993"></a>
+<span class="sourceLineNo">994</span> public static void copyFromArrayToBuffer(ByteBuffer out, int outOffset, byte[] in, int inOffset,<a name="line.994"></a>
+<span class="sourceLineNo">995</span> int length) {<a name="line.995"></a>
+<span class="sourceLineNo">996</span> if (out.hasArray()) {<a name="line.996"></a>
+<span class="sourceLineNo">997</span> System.arraycopy(in, inOffset, out.array(), out.arrayOffset() + outOffset, length);<a name="line.997"></a>
+<span class="sourceLineNo">998</span> } else if (UNSAFE_AVAIL) {<a name="line.998"></a>
+<span class="sourceLineNo">999</span> UnsafeAccess.copy(in, inOffset, out, outOffset, length);<a name="line.999"></a>
+<span class="sourceLineNo">1000</span> } else {<a name="line.1000"></a>
+<span class="sourceLineNo">1001</span> ByteBuffer outDup = out.duplicate();<a name="line.1001"></a>
+<span class="sourceLineNo">1002</span> outDup.position(outOffset);<a name="line.1002"></a>
+<span class="sourceLineNo">1003</span> outDup.put(in, inOffset, length);<a name="line.1003"></a>
+<span class="sourceLineNo">1004</span> }<a name="line.1004"></a>
+<span class="sourceLineNo">1005</span> }<a name="line.1005"></a>
+<span class="sourceLineNo">1006</span><a name="line.1006"></a>
+<span class="sourceLineNo">1007</span> /**<a name="line.1007"></a>
+<span class="sourceLineNo">1008</span> * Copies specified number of bytes from given offset of 'in' ByteBuffer to<a name="line.1008"></a>
+<span class="sourceLineNo">1009</span> * the array. This doesn't affact the position of buffer.<a name="line.1009"></a>
+<span class="sourceLineNo">1010</span> * @param out<a name="line.1010"></a>
+<span class="sourceLineNo">1011</span> * @param in<a name="line.1011"></a>
+<span class="sourceLineNo">1012</span> * @param sourceOffset<a name="line.1012"></a>
+<span class="sourceLineNo">1013</span> * @param destinationOffset<a name="line.1013"></a>
+<span class="sourceLineNo">1014</span> * @param length<a name="line.1014"></a>
+<span class="sourceLineNo">1015</span> */<a name="line.1015"></a>
+<span class="sourceLineNo">1016</span> public static void copyFromBufferToArray(byte[] out, ByteBuffer in, int sourceOffset,<a name="line.1016"></a>
+<span class="sourceLineNo">1017</span> int destinationOffset, int length) {<a name="line.1017"></a>
+<span class="sourceLineNo">1018</span> if (in.hasArray()) {<a name="line.1018"></a>
+<span class="sourceLineNo">1019</span> System.arraycopy(in.array(), sourceOffset + in.arrayOffset(), out, destinationOffset, length);<a name="line.1019"></a>
+<span class="sourceLineNo">1020</span> } else if (UNSAFE_AVAIL) {<a name="line.1020"></a>
+<span class="sourceLineNo">1021</span> UnsafeAccess.copy(in, sourceOffset, out, destinationOffset, length);<a name="line.1021"></a>
+<span class="sourceLineNo">1022</span> } else {<a name="line.1022"></a>
+<span class="sourceLineNo">1023</span> ByteBuffer inDup = in.duplicate();<a name="line.1023"></a>
+<span class="sourceLineNo">1024</span> inDup.position(sourceOffset);<a name="line.1024"></a>
+<span class="sourceLineNo">1025</span> inDup.get(out, destinationOffset, length);<a name="line.1025"></a>
+<span class="sourceLineNo">1026</span> }<a name="line.1026"></a>
+<span class="sourceLineNo">1027</span> }<a name="line.1027"></a>
+<span class="sourceLineNo">1028</span><a name="line.1028"></a>
+<span class="sourceLineNo">1029</span> /**<a name="line.1029"></a>
+<span class="sourceLineNo">1030</span> * Similar to {@link Arrays#copyOfRange(byte[], int, int)}<a name="line.1030"></a>
+<span class="sourceLineNo">1031</span> * @param original the buffer from which the copy has to happen<a name="line.1031"></a>
+<span class="sourceLineNo">1032</span> * @param from the starting index<a name="line.1032"></a>
+<span class="sourceLineNo">1033</span> * @param to the ending index<a name="line.1033"></a>
+<span class="sourceLineNo">1034</span> * @return a byte[] created out of the copy<a name="line.1034"></a>
+<span class="sourceLineNo">1035</span> */<a name="line.1035"></a>
+<span class="sourceLineNo">1036</span> public static byte[] copyOfRange(ByteBuffer original, int from, int to) {<a name="line.1036"></a>
+<span class="sourceLineNo">1037</span> int newLength = to - from;<a name="line.1037"></a>
+<span class="sourceLineNo">1038</span> if (newLength < 0) throw new IllegalArgumentException(from + " > " + to);<a name="line.1038"></a>
+<span class="sourceLineNo">1039</span> byte[] copy = new byte[newLength];<a name="line.1039"></a>
+<span class="sourceLineNo">1040</span> ByteBufferUtils.copyFromBufferToArray(copy, original, from, 0, newLength);<a name="line.1040"></a>
+<span class="sourceLineNo">1041</span> return copy;<a name="line.1041"></a>
+<span class="sourceLineNo">1042</span> }<a name="line.1042"></a>
+<span class="sourceLineNo">1043</span><a name="line.1043"></a>
+<span class="sourceLineNo">1044</span> // For testing purpose<a name="line.1044"></a>
+<span class="sourceLineNo">1045</span> public static String toStringBinary(final ByteBuffer b, int off, int len) {<a name="line.1045"></a>
+<span class="sourceLineNo">1046</span> StringBuilder result = new StringBuilder();<a name="line.1046"></a>
+<span class="sourceLineNo">1047</span> // Just in case we are passed a 'len' that is > buffer length...<a name="line.1047"></a>
+<span class="sourceLineNo">1048</span> if (off >= b.capacity())<a name="line.1048"></a>
+<span class="sourceLineNo">1049</span> return result.toString();<a name="line.1049"></a>
+<span class="sourceLineNo">1050</span> if (off + len > b.capacity())<a name="line.1050"></a>
+<span class="sourceLineNo">1051</span> len = b.capacity() - off;<a name="line.1051"></a>
+<span class="sourceLineNo">1052</span> for (int i = off; i < off + len; ++i) {<a name="line.1052"></a>
+<span class="sourceLineNo">1053</span> int ch = b.get(i) & 0xFF;<a name="line.1053"></a>
+<span class="sourceLineNo">1054</span> if ((ch >= '0' && ch <= '9') || (ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z')<a name="line.1054"></a>
+<span class="sourceLineNo">1055</span> || " `~!@#$%^&*()-_=+[]{}|;:'\",.<>/?".indexOf(ch) >= 0) {<a name="line.1055"></a>
+<span class="sourceLineNo">1056</span> result.append((char) ch);<a name="line.1056"></a>
+<span class="sourceLineNo">1057</span> } else {<a name="line.1057"></a>
+<span class="sourceLineNo">1058</span> result.append(String.format("\\x%02X", ch));<a name="line.1058"></a>
+<span class="sourceLineNo">1059</span> }<a name="line.1059"></a>
+<span class="sourceLineNo">1060</span> }<a name="line.1060"></a>
+<span class="sourceLineNo">1061</span> return result.toString();<a name="line.1061"></a>
+<span class="sourceLineNo">1062</span> }<a name="line.1062"></a>
+<span class="sourceLineNo">1063</span><a name="line.1063"></a>
+<span class="sourceLineNo">1064</span> public static String toStringBinary(final ByteBuffer b) {<a name="line.1064"></a>
+<span class="sourceLineNo">1065</span> return toStringBinary(b, 0, b.capacity());<a name="line.1065"></a>
+<span class="sourceLineNo">1066</span> }<a name="line.1066"></a>
+<span class="sourceLineNo">1067</span>}<a name="line.1067"></a>
[12/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/org/apache/hadoop/hbase/util/ByteBufferUtils.html
----------------------------------------------------------------------
diff --git a/devapidocs/org/apache/hadoop/hbase/util/ByteBufferUtils.html b/devapidocs/org/apache/hadoop/hbase/util/ByteBufferUtils.html
index 03f87b4..a5c075e 100644
--- a/devapidocs/org/apache/hadoop/hbase/util/ByteBufferUtils.html
+++ b/devapidocs/org/apache/hadoop/hbase/util/ByteBufferUtils.html
@@ -1334,7 +1334,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>lessThanUnsignedLong</h4>
-<pre>private static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.753">lessThanUnsignedLong</a>(long x1,
+<pre>private static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.750">lessThanUnsignedLong</a>(long x1,
long x2)</pre>
</li>
</ul>
@@ -1344,7 +1344,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>lessThanUnsignedInt</h4>
-<pre>private static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.765">lessThanUnsignedInt</a>(int x1,
+<pre>private static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.762">lessThanUnsignedInt</a>(int x1,
int x2)</pre>
</li>
</ul>
@@ -1354,7 +1354,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>lessThanUnsignedShort</h4>
-<pre>private static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.777">lessThanUnsignedShort</a>(short x1,
+<pre>private static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.774">lessThanUnsignedShort</a>(short x1,
short x2)</pre>
</li>
</ul>
@@ -1364,7 +1364,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toShort</h4>
-<pre>public static short <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.791">toShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static short <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.788">toShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int offset)</pre>
<div class="block">Reads a short value at the given buffer's offset.</div>
<dl>
@@ -1382,7 +1382,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toInt</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.802">toInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer)</pre>
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.799">toInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer)</pre>
<div class="block">Reads an int value at the given buffer's current position. Also advances the buffer's position</div>
</li>
</ul>
@@ -1392,7 +1392,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toInt</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.818">toInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.815">toInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int offset)</pre>
<div class="block">Reads an int value at the given buffer's offset.</div>
<dl>
@@ -1410,7 +1410,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>readAsInt</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.836">readAsInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buf,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.833">readAsInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buf,
int offset,
int length)</pre>
<div class="block">Converts a ByteBuffer to an int value</div>
@@ -1432,7 +1432,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toLong</h4>
-<pre>public static long <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.855">toLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static long <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.852">toLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int offset)</pre>
<div class="block">Reads a long value at the given buffer's offset.</div>
<dl>
@@ -1450,7 +1450,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putInt</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.869">putInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.866">putInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int val)</pre>
<div class="block">Put an int value out to the given ByteBuffer's current position in big-endian format.
This also advances the position in buffer by int size.</div>
@@ -1467,7 +1467,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putInt</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.878">putInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.875">putInt</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int index,
int val)</pre>
</li>
@@ -1478,7 +1478,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toDouble</h4>
-<pre>public static double <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.892">toDouble</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static double <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.889">toDouble</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int offset)</pre>
<div class="block">Reads a double value at the given buffer's offset.</div>
<dl>
@@ -1496,7 +1496,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toBigDecimal</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/math/BigDecimal.html?is-external=true" title="class or interface in java.math">BigDecimal</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.902">toBigDecimal</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/math/BigDecimal.html?is-external=true" title="class or interface in java.math">BigDecimal</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.899">toBigDecimal</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int offset,
int length)</pre>
<div class="block">Reads a BigDecimal value at the given buffer's offset.</div>
@@ -1515,7 +1515,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putShort</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.920">putShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.917">putShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
short val)</pre>
<div class="block">Put a short value out to the given ByteBuffer's current position in big-endian format.
This also advances the position in buffer by short size.</div>
@@ -1532,7 +1532,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putShort</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.929">putShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.926">putShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int index,
short val)</pre>
</li>
@@ -1543,7 +1543,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putAsShort</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.937">putAsShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buf,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.934">putAsShort</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buf,
int index,
int val)</pre>
</li>
@@ -1554,7 +1554,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putLong</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.950">putLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.947">putLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
long val)</pre>
<div class="block">Put a long value out to the given ByteBuffer's current position in big-endian format.
This also advances the position in buffer by long size.</div>
@@ -1571,7 +1571,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>putLong</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.959">putLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.956">putLong</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buffer,
int index,
long val)</pre>
</li>
@@ -1582,7 +1582,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>copyFromArrayToBuffer</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.975">copyFromArrayToBuffer</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> out,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.972">copyFromArrayToBuffer</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> out,
byte[] in,
int inOffset,
int length)</pre>
@@ -1603,7 +1603,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>copyFromArrayToBuffer</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.997">copyFromArrayToBuffer</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> out,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.994">copyFromArrayToBuffer</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> out,
int outOffset,
byte[] in,
int inOffset,
@@ -1625,7 +1625,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>copyFromBufferToArray</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1019">copyFromBufferToArray</a>(byte[] out,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1016">copyFromBufferToArray</a>(byte[] out,
<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> in,
int sourceOffset,
int destinationOffset,
@@ -1648,7 +1648,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>copyOfRange</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1039">copyOfRange</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> original,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1036">copyOfRange</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> original,
int from,
int to)</pre>
<div class="block">Similar to <a href="http://docs.oracle.com/javase/8/docs/api/java/util/Arrays.html?is-external=true#copyOfRange-byte:A-int-int-" title="class or interface in java.util"><code>Arrays.copyOfRange(byte[], int, int)</code></a></div>
@@ -1668,7 +1668,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockList">
<li class="blockList">
<h4>toStringBinary</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1048">toStringBinary</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> b,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1045">toStringBinary</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> b,
int off,
int len)</pre>
</li>
@@ -1679,7 +1679,7 @@ extends <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Object.html?
<ul class="blockListLast">
<li class="blockList">
<h4>toStringBinary</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1067">toStringBinary</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> b)</pre>
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html#line.1064">toStringBinary</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> b)</pre>
</li>
</ul>
</li>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/org/apache/hadoop/hbase/util/Bytes.html
----------------------------------------------------------------------
diff --git a/devapidocs/org/apache/hadoop/hbase/util/Bytes.html b/devapidocs/org/apache/hadoop/hbase/util/Bytes.html
index 3cd4b13..b8263e4 100644
--- a/devapidocs/org/apache/hadoop/hbase/util/Bytes.html
+++ b/devapidocs/org/apache/hadoop/hbase/util/Bytes.html
@@ -1527,7 +1527,7 @@ implements <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Comparabl
<ul class="blockList">
<li class="blockList">
<h4>RNG</h4>
-<pre>private static final <a href="http://docs.oracle.com/javase/8/docs/api/java/security/SecureRandom.html?is-external=true" title="class or interface in java.security">SecureRandom</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2495">RNG</a></pre>
+<pre>private static final <a href="http://docs.oracle.com/javase/8/docs/api/java/security/SecureRandom.html?is-external=true" title="class or interface in java.security">SecureRandom</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2490">RNG</a></pre>
</li>
</ul>
<a name="HEX_CHARS">
@@ -1536,7 +1536,7 @@ implements <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Comparabl
<ul class="blockListLast">
<li class="blockList">
<h4>HEX_CHARS</h4>
-<pre>private static final char[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2551">HEX_CHARS</a></pre>
+<pre>private static final char[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2546">HEX_CHARS</a></pre>
</li>
</ul>
</li>
@@ -3095,7 +3095,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>equals</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1633">equals</a>(byte[] left,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1628">equals</a>(byte[] left,
byte[] right)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3112,7 +3112,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>equals</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1649">equals</a>(byte[] left,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1644">equals</a>(byte[] left,
int leftOffset,
int leftLen,
byte[] right,
@@ -3126,7 +3126,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>equals</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1680">equals</a>(byte[] a,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1675">equals</a>(byte[] a,
<a href="http://docs.oracle.com/javase/8/docs/api/java/nio/ByteBuffer.html?is-external=true" title="class or interface in java.nio">ByteBuffer</a> buf)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3143,7 +3143,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>startsWith</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1700">startsWith</a>(byte[] bytes,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1695">startsWith</a>(byte[] bytes,
byte[] prefix)</pre>
<div class="block">Return true if the byte array on the right is a prefix of the byte
array on the left.</div>
@@ -3155,7 +3155,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>hashCode</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1713">hashCode</a>(byte[] b)</pre>
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1708">hashCode</a>(byte[] b)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>b</code> - bytes to hash</dd>
@@ -3172,7 +3172,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>hashCode</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1724">hashCode</a>(byte[] b,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1719">hashCode</a>(byte[] b,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3191,7 +3191,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>mapKey</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1733">mapKey</a>(byte[] b)</pre>
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1728">mapKey</a>(byte[] b)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>b</code> - bytes to hash</dd>
@@ -3207,7 +3207,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>mapKey</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1743">mapKey</a>(byte[] b,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Integer.html?is-external=true" title="class or interface in java.lang">Integer</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1738">mapKey</a>(byte[] b,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3225,7 +3225,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1752">add</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1747">add</a>(byte[] a,
byte[] b)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3242,7 +3242,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1762">add</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1757">add</a>(byte[] a,
byte[] b,
byte[] c)</pre>
<dl>
@@ -3261,7 +3261,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1774">add</a>(byte[][] arrays)</pre>
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1769">add</a>(byte[][] arrays)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>arrays</code> - all the arrays to concatenate together.</dd>
@@ -3276,7 +3276,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>head</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1793">head</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1788">head</a>(byte[] a,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3293,7 +3293,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>tail</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1807">tail</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1802">tail</a>(byte[] a,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3310,7 +3310,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>padHead</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1821">padHead</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1816">padHead</a>(byte[] a,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3327,7 +3327,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>padTail</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1834">padTail</a>(byte[] a,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1829">padTail</a>(byte[] a,
int length)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3344,7 +3344,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>split</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1851">split</a>(byte[] a,
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1846">split</a>(byte[] a,
byte[] b,
int num)</pre>
<div class="block">Split passed range. Expensive operation relatively. Uses BigInteger math.
@@ -3366,7 +3366,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>split</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1867">split</a>(byte[] a,
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1862">split</a>(byte[] a,
byte[] b,
boolean inclusive,
int num)</pre>
@@ -3392,7 +3392,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>iterateOnSplits</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Iterable.html?is-external=true" title="class or interface in java.lang">Iterable</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1883">iterateOnSplits</a>(byte[] a,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Iterable.html?is-external=true" title="class or interface in java.lang">Iterable</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1878">iterateOnSplits</a>(byte[] a,
byte[] b,
int num)</pre>
<div class="block">Iterate over keys within the passed range, splitting at an [a,b) boundary.</div>
@@ -3404,7 +3404,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>iterateOnSplits</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Iterable.html?is-external=true" title="class or interface in java.lang">Iterable</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1892">iterateOnSplits</a>(byte[] a,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Iterable.html?is-external=true" title="class or interface in java.lang">Iterable</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1887">iterateOnSplits</a>(byte[] a,
byte[] b,
boolean inclusive,
int num)</pre>
@@ -3417,7 +3417,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>hashCode</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1986">hashCode</a>(byte[] bytes,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1981">hashCode</a>(byte[] bytes,
int offset,
int length)</pre>
<dl>
@@ -3434,7 +3434,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>toByteArrays</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1997">toByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>[] t)</pre>
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.1992">toByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>[] t)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>t</code> - operands</dd>
@@ -3449,7 +3449,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>toBinaryByteArrays</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2009">toBinaryByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>[] t)</pre>
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2004">toBinaryByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>[] t)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>t</code> - operands</dd>
@@ -3464,7 +3464,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>toByteArrays</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2022">toByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> column)</pre>
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2017">toByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> column)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>column</code> - operand</dd>
@@ -3480,7 +3480,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<ul class="blockList">
<li class="blockList">
<h4>toByteArrays</h4>
-<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2031">toByteArrays</a>(byte[] column)</pre>
+<pre>public static byte[][] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2026">toByteArrays</a>(byte[] column)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>column</code> - operand</dd>
@@ -3497,7 +3497,7 @@ public static long <a href="../../../../../src-html/org/apache/hadoop/
<li class="blockList">
<h4>binarySearch</h4>
<pre><a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Deprecated.html?is-external=true" title="class or interface in java.lang">@Deprecated</a>
-public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2054">binarySearch</a>(byte[][] arr,
+public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2049">binarySearch</a>(byte[][] arr,
byte[] key,
int offset,
int length,
@@ -3527,7 +3527,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>binarySearch</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2073">binarySearch</a>(byte[][] arr,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2068">binarySearch</a>(byte[][] arr,
byte[] key,
int offset,
int length)</pre>
@@ -3555,7 +3555,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<li class="blockList">
<h4>binarySearch</h4>
<pre><a href="http://docs.oracle.com/javase/8/docs/api/java/lang/Deprecated.html?is-external=true" title="class or interface in java.lang">@Deprecated</a>
-public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2112">binarySearch</a>(byte[][] arr,
+public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2107">binarySearch</a>(byte[][] arr,
<a href="../../../../../org/apache/hadoop/hbase/Cell.html" title="interface in org.apache.hadoop.hbase">Cell</a> key,
org.apache.hadoop.io.RawComparator<<a href="../../../../../org/apache/hadoop/hbase/Cell.html" title="interface in org.apache.hadoop.hbase">Cell</a>> comparator)</pre>
<div class="block"><span class="deprecatedLabel">Deprecated.</span> <span class="deprecationComment">Use <a href="../../../../../org/apache/hadoop/hbase/util/Bytes.html#binarySearch-org.apache.hadoop.hbase.Cell:A-org.apache.hadoop.hbase.Cell-org.apache.hadoop.hbase.CellComparator-"><code>binarySearch(Cell[], Cell, CellComparator)</code></a></span></div>
@@ -3581,7 +3581,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>binarySearch</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2149">binarySearch</a>(<a href="../../../../../org/apache/hadoop/hbase/Cell.html" title="interface in org.apache.hadoop.hbase">Cell</a>[] arr,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2144">binarySearch</a>(<a href="../../../../../org/apache/hadoop/hbase/Cell.html" title="interface in org.apache.hadoop.hbase">Cell</a>[] arr,
<a href="../../../../../org/apache/hadoop/hbase/Cell.html" title="interface in org.apache.hadoop.hbase">Cell</a> key,
<a href="../../../../../org/apache/hadoop/hbase/CellComparator.html" title="class in org.apache.hadoop.hbase">CellComparator</a> comparator)</pre>
<div class="block">Binary search for keys in indexes.</div>
@@ -3606,7 +3606,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>incrementBytes</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2178">incrementBytes</a>(byte[] value,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2173">incrementBytes</a>(byte[] value,
long amount)</pre>
<div class="block">Bytewise binary increment/deincrement of long contained in byte array
on given amount.</div>
@@ -3625,7 +3625,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>binaryIncrementPos</h4>
-<pre>private static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2204">binaryIncrementPos</a>(byte[] value,
+<pre>private static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2199">binaryIncrementPos</a>(byte[] value,
long amount)</pre>
</li>
</ul>
@@ -3635,7 +3635,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>binaryIncrementNeg</h4>
-<pre>private static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2229">binaryIncrementNeg</a>(byte[] value,
+<pre>private static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2224">binaryIncrementNeg</a>(byte[] value,
long amount)</pre>
</li>
</ul>
@@ -3645,7 +3645,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>writeStringFixedSize</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2256">writeStringFixedSize</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/io/DataOutput.html?is-external=true" title="class or interface in java.io">DataOutput</a> out,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2251">writeStringFixedSize</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/io/DataOutput.html?is-external=true" title="class or interface in java.io">DataOutput</a> out,
<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> s,
int size)
throws <a href="http://docs.oracle.com/javase/8/docs/api/java/io/IOException.html?is-external=true" title="class or interface in java.io">IOException</a></pre>
@@ -3662,7 +3662,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>readStringFixedSize</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2272">readStringFixedSize</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/io/DataInput.html?is-external=true" title="class or interface in java.io">DataInput</a> in,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2267">readStringFixedSize</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/io/DataInput.html?is-external=true" title="class or interface in java.io">DataInput</a> in,
int size)
throws <a href="http://docs.oracle.com/javase/8/docs/api/java/io/IOException.html?is-external=true" title="class or interface in java.io">IOException</a></pre>
<div class="block">Reads a fixed-size field and interprets it as a string padded with zeros.</div>
@@ -3678,7 +3678,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>copy</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2289">copy</a>(byte[] bytes)</pre>
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2284">copy</a>(byte[] bytes)</pre>
<div class="block">Copy the byte array given in parameter and return an instance
of a new byte array with the same length and the same content.</div>
<dl>
@@ -3695,7 +3695,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>copy</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2304">copy</a>(byte[] bytes,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2299">copy</a>(byte[] bytes,
int offset,
int length)</pre>
<div class="block">Copy the byte array given in parameter and return an instance
@@ -3716,7 +3716,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>unsignedBinarySearch</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2321">unsignedBinarySearch</a>(byte[] a,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2316">unsignedBinarySearch</a>(byte[] a,
int fromIndex,
int toIndex,
byte key)</pre>
@@ -3740,7 +3740,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>unsignedCopyAndIncrement</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2348">unsignedCopyAndIncrement</a>(byte[] input)</pre>
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2343">unsignedCopyAndIncrement</a>(byte[] input)</pre>
<div class="block">Treat the byte[] as an unsigned series of bytes, most significant bits first. Start by adding
1 to the rightmost bit/byte and carry over all overflows to the more significant bits/bytes.</div>
<dl>
@@ -3757,7 +3757,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>equals</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2368">equals</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><byte[]> a,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2363">equals</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><byte[]> a,
<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><byte[]> b)</pre>
</li>
</ul>
@@ -3767,7 +3767,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>isSorted</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2389">isSorted</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Collection.html?is-external=true" title="class or interface in java.util">Collection</a><byte[]> arrays)</pre>
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2384">isSorted</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/Collection.html?is-external=true" title="class or interface in java.util">Collection</a><byte[]> arrays)</pre>
</li>
</ul>
<a name="getUtf8ByteArrays-java.util.List-">
@@ -3776,7 +3776,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>getUtf8ByteArrays</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2400">getUtf8ByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>> strings)</pre>
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><byte[]> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2395">getUtf8ByteArrays</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a>> strings)</pre>
</li>
</ul>
<a name="indexOf-byte:A-byte-">
@@ -3785,7 +3785,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>indexOf</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2417">indexOf</a>(byte[] array,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2412">indexOf</a>(byte[] array,
byte target)</pre>
<div class="block">Returns the index of the first appearance of the value <code>target</code> in
<code>array</code>.</div>
@@ -3805,7 +3805,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>indexOf</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2437">indexOf</a>(byte[] array,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2432">indexOf</a>(byte[] array,
byte[] target)</pre>
<div class="block">Returns the start position of the first occurrence of the specified <code>target</code> within <code>array</code>, or <code>-1</code> if there is no such occurrence.
@@ -3824,7 +3824,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>contains</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2461">contains</a>(byte[] array,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2456">contains</a>(byte[] array,
byte target)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3841,7 +3841,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>contains</h4>
-<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2470">contains</a>(byte[] array,
+<pre>public static boolean <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2465">contains</a>(byte[] array,
byte[] target)</pre>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3858,7 +3858,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>zero</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2478">zero</a>(byte[] b)</pre>
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2473">zero</a>(byte[] b)</pre>
<div class="block">Fill given array with zeros.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3872,7 +3872,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>zero</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2488">zero</a>(byte[] b,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2483">zero</a>(byte[] b,
int offset,
int length)</pre>
<div class="block">Fill given array with zeros at the specified position.</div>
@@ -3890,7 +3890,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>random</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2501">random</a>(byte[] b)</pre>
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2496">random</a>(byte[] b)</pre>
<div class="block">Fill given array with random bytes.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3904,7 +3904,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>random</h4>
-<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2511">random</a>(byte[] b,
+<pre>public static void <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2506">random</a>(byte[] b,
int offset,
int length)</pre>
<div class="block">Fill given array with random bytes at the specified position.</div>
@@ -3922,7 +3922,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>createMaxByteArray</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2525">createMaxByteArray</a>(int maxByteCount)</pre>
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2520">createMaxByteArray</a>(int maxByteCount)</pre>
<div class="block">Create a max byte array with the specified max byte count</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
@@ -3938,7 +3938,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>multiple</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2539">multiple</a>(byte[] srcBytes,
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2534">multiple</a>(byte[] srcBytes,
int multiNum)</pre>
<div class="block">Create a byte array which is multiple given bytes</div>
<dl>
@@ -3956,7 +3956,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>toHex</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2558">toHex</a>(byte[] b,
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2553">toHex</a>(byte[] b,
int offset,
int length)</pre>
<div class="block">Convert a byte range into a hex string</div>
@@ -3968,7 +3968,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>toHex</h4>
-<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2574">toHex</a>(byte[] b)</pre>
+<pre>public static <a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2569">toHex</a>(byte[] b)</pre>
<div class="block">Convert a byte array into a hex string</div>
</li>
</ul>
@@ -3978,7 +3978,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>hexCharToNibble</h4>
-<pre>private static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2578">hexCharToNibble</a>(char ch)</pre>
+<pre>private static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2573">hexCharToNibble</a>(char ch)</pre>
</li>
</ul>
<a name="hexCharsToByte-char-char-">
@@ -3987,7 +3987,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>hexCharsToByte</h4>
-<pre>private static byte <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2589">hexCharsToByte</a>(char c1,
+<pre>private static byte <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2584">hexCharsToByte</a>(char c1,
char c2)</pre>
</li>
</ul>
@@ -3997,7 +3997,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>fromHex</h4>
-<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2598">fromHex</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> hex)</pre>
+<pre>public static byte[] <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2593">fromHex</a>(<a href="http://docs.oracle.com/javase/8/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</a> hex)</pre>
<div class="block">Create a byte array from a string of hash digits. The length of the
string must be a multiple of 2</div>
<dl>
@@ -4012,7 +4012,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>searchDelimiterIndex</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2613">searchDelimiterIndex</a>(byte[] b,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2608">searchDelimiterIndex</a>(byte[] b,
int offset,
int length,
int delimiter)</pre>
@@ -4031,7 +4031,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockList">
<li class="blockList">
<h4>searchDelimiterIndexInReverse</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2635">searchDelimiterIndexInReverse</a>(byte[] b,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2630">searchDelimiterIndexInReverse</a>(byte[] b,
int offset,
int length,
int delimiter)</pre>
@@ -4051,7 +4051,7 @@ public static int <a href="../../../../../src-html/org/apache/hadoop/h
<ul class="blockListLast">
<li class="blockList">
<h4>findCommonPrefix</h4>
-<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2650">findCommonPrefix</a>(byte[] left,
+<pre>public static int <a href="../../../../../src-html/org/apache/hadoop/hbase/util/Bytes.html#line.2645">findCommonPrefix</a>(byte[] left,
byte[] right,
int leftLength,
int rightLength,
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/Version.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/Version.html b/devapidocs/src-html/org/apache/hadoop/hbase/Version.html
index 1585939..2d5588c 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/Version.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/Version.html
@@ -16,11 +16,11 @@
<span class="sourceLineNo">008</span>@InterfaceAudience.Private<a name="line.8"></a>
<span class="sourceLineNo">009</span>public class Version {<a name="line.9"></a>
<span class="sourceLineNo">010</span> public static final String version = "2.0.0-SNAPSHOT";<a name="line.10"></a>
-<span class="sourceLineNo">011</span> public static final String revision = "880db3eee4f1908854f4ac9f778758213eaab20a";<a name="line.11"></a>
+<span class="sourceLineNo">011</span> public static final String revision = "b81e00f5eabe8d99fd77d74f60e3754add8205da";<a name="line.11"></a>
<span class="sourceLineNo">012</span> public static final String user = "jenkins";<a name="line.12"></a>
-<span class="sourceLineNo">013</span> public static final String date = "Thu Apr 27 17:44:54 UTC 2017";<a name="line.13"></a>
+<span class="sourceLineNo">013</span> public static final String date = "Thu Apr 27 22:33:25 UTC 2017";<a name="line.13"></a>
<span class="sourceLineNo">014</span> public static final String url = "git://asf920.gq1.ygridcore.net/home/jenkins/jenkins-slave/workspace/hbase_generate_website/hbase";<a name="line.14"></a>
-<span class="sourceLineNo">015</span> public static final String srcChecksum = "2f7a0c4b7f219141434feed0dbc30e54";<a name="line.15"></a>
+<span class="sourceLineNo">015</span> public static final String srcChecksum = "f5899e22d243da9cc32fb736a2ec9230";<a name="line.15"></a>
<span class="sourceLineNo">016</span>}<a name="line.16"></a>
[14/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/checkstyle-aggregate.html
----------------------------------------------------------------------
diff --git a/checkstyle-aggregate.html b/checkstyle-aggregate.html
index fc4246c..61eb5a1 100644
--- a/checkstyle-aggregate.html
+++ b/checkstyle-aggregate.html
@@ -289,7 +289,7 @@
<td>2155</td>
<td>0</td>
<td>0</td>
-<td>14362</td></tr></table></div>
+<td>14361</td></tr></table></div>
<div class="section">
<h2><a name="Files"></a>Files</h2>
<table border="0" class="table table-striped">
@@ -6382,7 +6382,7 @@
<td><a href="#org.apache.hadoop.hbase.util.Bytes.java">org/apache/hadoop/hbase/util/Bytes.java</a></td>
<td>0</td>
<td>0</td>
-<td>86</td></tr>
+<td>85</td></tr>
<tr class="a">
<td><a href="#org.apache.hadoop.hbase.util.ChecksumType.java">org/apache/hadoop/hbase/util/ChecksumType.java</a></td>
<td>0</td>
@@ -7139,7 +7139,7 @@
<li>caseIndent: <tt>"2"</tt></li>
<li>basicOffset: <tt>"2"</tt></li>
<li>lineWrappingIndentation: <tt>"2"</tt></li></ul></td>
-<td>5103</td>
+<td>5102</td>
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td></tr>
<tr class="a">
<td>javadoc</td>
@@ -96208,151 +96208,151 @@
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>787</td></tr>
+<td>784</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>788</td></tr>
+<td>785</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>814</td></tr>
+<td>811</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>815</td></tr>
+<td>812</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>851</td></tr>
+<td>848</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>852</td></tr>
+<td>849</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>888</td></tr>
+<td>885</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>898</td></tr>
+<td>895</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>899</td></tr>
+<td>896</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>970</td></tr>
+<td>967</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>971</td></tr>
+<td>968</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>972</td></tr>
+<td>969</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>973</td></tr>
+<td>970</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>992</td></tr>
+<td>989</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>993</td></tr>
+<td>990</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>994</td></tr>
+<td>991</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>995</td></tr>
+<td>992</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>1013</td></tr>
+<td>1010</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>1014</td></tr>
+<td>1011</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>1015</td></tr>
+<td>1012</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>1016</td></tr>
+<td>1013</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>1017</td></tr>
+<td>1014</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1041</td></tr>
+<td>1038</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1051</td></tr>
+<td>1048</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1053</td></tr></table></div>
+<td>1050</td></tr></table></div>
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.ByteRangeUtils.java">org/apache/hadoop/hbase/util/ByteRangeUtils.java</h3>
<table border="0" class="table table-striped">
@@ -96550,28 +96550,28 @@
<td>1270</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
-<td>indentation</td>
-<td>Indentation</td>
-<td>'if' child have incorrect indentation level 14, expected level should be 12.</td>
-<td>1595</td></tr>
+<td>blocks</td>
+<td>NeedBraces</td>
+<td>'if' construct must use '{}'s.</td>
+<td>1631</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1636</td></tr>
+<td>1632</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1637</td></tr>
+<td>1633</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1638</td></tr>
+<td>1634</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
@@ -96583,359 +96583,353 @@
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1644</td></tr>
+<td>1663</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1668</td></tr>
+<td>1676</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1681</td></tr>
+<td>1677</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1682</td></tr>
+<td>1678</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
-<td>blocks</td>
-<td>NeedBraces</td>
-<td>'if' construct must use '{}'s.</td>
-<td>1683</td></tr>
+<td>javadoc</td>
+<td>JavadocTagContinuationIndentation</td>
+<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
+<td>1705</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
-<td>1710</td></tr>
+<td>1706</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
-<td>1711</td></tr>
+<td>1716</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
-<td>1721</td></tr>
+<td>1717</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
-<td>1722</td></tr>
+<td>1726</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
-<td>1731</td></tr>
+<td>1736</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
-<td>1741</td></tr>
+<td>1843</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
-<td>1848</td></tr>
+<td>1856</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
-<td>1861</td></tr>
+<td>1857</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
-<td>1862</td></tr>
+<td>1859</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
-<td>javadoc</td>
-<td>JavadocTagContinuationIndentation</td>
-<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
-<td>1864</td></tr>
-<tr class="b">
-<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1872</td></tr>
-<tr class="a">
-<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
-<td>blocks</td>
-<td>LeftCurly</td>
-<td>'{' at column 3 should be on the previous line.</td>
-<td>1885</td></tr>
+<td>1867</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>LeftCurly</td>
<td>'{' at column 3 should be on the previous line.</td>
-<td>1894</td></tr>
+<td>1880</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
-<td>NeedBraces</td>
-<td>'if' construct must use '{}'s.</td>
-<td>1954</td></tr>
+<td>LeftCurly</td>
+<td>'{' at column 3 should be on the previous line.</td>
+<td>1889</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1955</td></tr>
+<td>1949</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>1959</td></tr>
+<td>1950</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
-<td>'else' construct must use '{}'s.</td>
-<td>1961</td></tr>
+<td>'if' construct must use '{}'s.</td>
+<td>1954</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
-<td>'for' construct must use '{}'s.</td>
-<td>1988</td></tr>
+<td>'else' construct must use '{}'s.</td>
+<td>1956</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
-<td>'if' construct must use '{}'s.</td>
-<td>2084</td></tr>
+<td>'for' construct must use '{}'s.</td>
+<td>1983</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>2087</td></tr>
+<td>2079</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
-<td>'else' construct must use '{}'s.</td>
-<td>2090</td></tr>
+<td>'if' construct must use '{}'s.</td>
+<td>2082</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
-<td>'if' construct must use '{}'s.</td>
-<td>2123</td></tr>
+<td>'else' construct must use '{}'s.</td>
+<td>2085</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>2126</td></tr>
+<td>2118</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
-<td>'else' construct must use '{}'s.</td>
-<td>2129</td></tr>
+<td>'if' construct must use '{}'s.</td>
+<td>2121</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
-<td>'if' construct must use '{}'s.</td>
-<td>2158</td></tr>
+<td>'else' construct must use '{}'s.</td>
+<td>2124</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>2161</td></tr>
+<td>2153</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
-<td>'else' construct must use '{}'s.</td>
-<td>2164</td></tr>
+<td>'if' construct must use '{}'s.</td>
+<td>2156</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
-<td>LeftCurly</td>
-<td>'{' at column 3 should be on the previous line.</td>
-<td>2179</td></tr>
+<td>NeedBraces</td>
+<td>'else' construct must use '{}'s.</td>
+<td>2159</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
-<td>NeedBraces</td>
-<td>'if' construct must use '{}'s.</td>
-<td>2196</td></tr>
+<td>LeftCurly</td>
+<td>'{' at column 3 should be on the previous line.</td>
+<td>2174</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>2223</td></tr>
+<td>2191</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>2248</td></tr>
+<td>2218</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
-<td>'for' construct must use '{}'s.</td>
-<td>2265</td></tr>
+<td>'if' construct must use '{}'s.</td>
+<td>2243</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
-<td>'while' construct must use '{}'s.</td>
-<td>2277</td></tr>
+<td>'for' construct must use '{}'s.</td>
+<td>2260</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
-<td>'if' construct must use '{}'s.</td>
-<td>2290</td></tr>
+<td>'while' construct must use '{}'s.</td>
+<td>2272</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
+<td>blocks</td>
+<td>NeedBraces</td>
+<td>'if' construct must use '{}'s.</td>
+<td>2285</td></tr>
+<tr class="a">
+<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2301</td></tr>
-<tr class="a">
+<td>2296</td></tr>
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2302</td></tr>
-<tr class="b">
+<td>2297</td></tr>
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
-<td>2305</td></tr>
-<tr class="a">
-<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
-<td>javadoc</td>
-<td>NonEmptyAtclauseDescription</td>
-<td>At-clause should have a non-empty description.</td>
-<td>2484</td></tr>
+<td>2300</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2485</td></tr>
+<td>2479</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2486</td></tr>
+<td>2480</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2507</td></tr>
+<td>2481</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2508</td></tr>
+<td>2502</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2509</td></tr>
+<td>2503</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2535</td></tr>
+<td>2504</td></tr>
<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2536</td></tr>
+<td>2530</td></tr>
<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
+<td>javadoc</td>
+<td>NonEmptyAtclauseDescription</td>
+<td>At-clause should have a non-empty description.</td>
+<td>2531</td></tr>
+<tr class="b">
+<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>LeftCurly</td>
<td>'{' at column 5 should be on the previous line.</td>
-<td>2563</td></tr>
-<tr class="b">
+<td>2558</td></tr>
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2596</td></tr>
-<tr class="a">
+<td>2591</td></tr>
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'for' child have incorrect indentation level 8, expected level should be 6.</td>
-<td>2603</td></tr>
-<tr class="b">
+<td>2598</td></tr>
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2609</td></tr>
-<tr class="a">
+<td>2604</td></tr>
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2610</td></tr>
-<tr class="b">
+<td>2605</td></tr>
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2631</td></tr>
-<tr class="a">
+<td>2626</td></tr>
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
-<td>2632</td></tr></table></div>
+<td>2627</td></tr></table></div>
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.ChecksumType.java">org/apache/hadoop/hbase/util/ChecksumType.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>89</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
@@ -96944,13 +96938,13 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.ClassLoaderBase.java">org/apache/hadoop/hbase/util/ClassLoaderBase.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
@@ -96959,85 +96953,85 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.ClassSize.java">org/apache/hadoop/hbase/util/ClassSize.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>HideUtilityClassConstructor</td>
<td>Utility classes should not have a public or default constructor.</td>
<td>40</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
<td>327</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
<td>328</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>341</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>351</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>353</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>355</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>357</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>359</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>361</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>363</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>365</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>whitespace</td>
<td>ParenPad</td>
@@ -97046,13 +97040,13 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.Classes.java">org/apache/hadoop/hbase/util/Classes.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>HideUtilityClassConstructor</td>
@@ -97061,13 +97055,13 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.CollectionBackedScanner.java">org/apache/hadoop/hbase/util/CollectionBackedScanner.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
@@ -97076,37 +97070,37 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.CollectionUtils.java">org/apache/hadoop/hbase/util/CollectionUtils.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>HideUtilityClassConstructor</td>
<td>Utility classes should not have a public or default constructor.</td>
<td>34</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>95</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>coding</td>
<td>InnerAssignment</td>
<td>Inner assignments should be avoided.</td>
<td>138</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>coding</td>
<td>InnerAssignment</td>
<td>Inner assignments should be avoided.</td>
<td>138</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>coding</td>
<td>InnerAssignment</td>
@@ -97115,31 +97109,31 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.CompressionTest.java">org/apache/hadoop/hbase/util/CompressionTest.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.hadoop.conf.Configuration' import.</td>
<td>29</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.hadoop.hbase.io.hfile.CacheConfig' import.</td>
<td>40</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>HideUtilityClassConstructor</td>
<td>Utility classes should not have a public or default constructor.</td>
<td>51</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>whitespace</td>
<td>ParenPad</td>
@@ -97148,25 +97142,25 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.ConcatenatedLists.java">org/apache/hadoop/hbase/util/ConcatenatedLists.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>66</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>74</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
@@ -97175,13 +97169,13 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.ConfigurationUtil.java">org/apache/hadoop/hbase/util/ConfigurationUtil.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
@@ -97190,31 +97184,31 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.ConnectionCache.java">org/apache/hadoop/hbase/util/ConnectionCache.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.commons.logging.LogFactory' import.</td>
<td>41</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>LeftCurly</td>
<td>'{' at column 46 should have line break after.</td>
<td>74</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>LeftCurly</td>
<td>'{' at column 44 should have line break after.</td>
<td>75</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
@@ -97223,85 +97217,85 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.CoprocessorClassLoader.java">org/apache/hadoop/hbase/util/CoprocessorClassLoader.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.hadoop.fs.FileStatus' import.</td>
<td>42</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'com.google.common.base.Preconditions' import.</td>
<td>47</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>FinalClass</td>
<td>Class CoprocessorClassLoader should be declared as final.</td>
<td>77</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'array initialization rcurly' have incorrect indentation level 2, expected level should be one of the following: 6, 8.</td>
<td>126</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 104).</td>
<td>169</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>238</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'method def modifier' have incorrect indentation level 8, expected level should be one of the following: 10, 12.</td>
<td>264</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'method def' child have incorrect indentation level 10, expected level should be one of the following: 12, 14.</td>
<td>266</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'method def rcurly' have incorrect indentation level 8, expected level should be one of the following: 10, 12.</td>
<td>267</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'object def rcurly' have incorrect indentation level 6, expected level should be one of the following: 8, 10.</td>
<td>268</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
<td>372</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
<td>395</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
@@ -97310,19 +97304,19 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.Counter.java">org/apache/hadoop/hbase/util/Counter.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>LeftCurly</td>
<td>'{' at column 23 should have line break after.</td>
<td>180</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>LeftCurly</td>
@@ -97331,25 +97325,25 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.DirectMemoryUtils.java">org/apache/hadoop/hbase/util/DirectMemoryUtils.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'com.google.common.base.Preconditions' import.</td>
<td>40</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>HideUtilityClassConstructor</td>
<td>Utility classes should not have a public or default constructor.</td>
<td>45</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
@@ -97358,37 +97352,37 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.DrainBarrier.java">org/apache/hadoop/hbase/util/DrainBarrier.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>52</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>LeftCurly</td>
<td>'{' at column 27 should have line break after.</td>
<td>73</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>110</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>114</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>LeftCurly</td>
@@ -97397,163 +97391,163 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.DynamicClassLoader.java">org/apache/hadoop/hbase/util/DynamicClassLoader.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'synchronized' child have incorrect indentation level 8, expected level should be 6.</td>
<td>151</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if' have incorrect indentation level 8, expected level should be 6.</td>
<td>152</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if' have incorrect indentation level 10, expected level should be 8.</td>
<td>153</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if' child have incorrect indentation level 12, expected level should be 10.</td>
<td>154</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if rcurly' have incorrect indentation level 10, expected level should be 8.</td>
<td>155</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if rcurly' have incorrect indentation level 8, expected level should be 6.</td>
<td>156</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'else' have incorrect indentation level 8, expected level should be 6.</td>
<td>157</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'try' have incorrect indentation level 10, expected level should be 8.</td>
<td>158</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if' have incorrect indentation level 12, expected level should be 10.</td>
<td>159</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if' child have incorrect indentation level 14, expected level should be 12.</td>
<td>160</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if rcurly' have incorrect indentation level 12, expected level should be 10.</td>
<td>161</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'try' child have incorrect indentation level 12, expected level should be 10.</td>
<td>162</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'try rcurly' have incorrect indentation level 10, expected level should be 8.</td>
<td>163</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if' have incorrect indentation level 12, expected level should be 10.</td>
<td>165</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if' child have incorrect indentation level 14, expected level should be 12.</td>
<td>166</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if rcurly' have incorrect indentation level 12, expected level should be 10.</td>
<td>167</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'catch' child have incorrect indentation level 12, expected level should be 10.</td>
<td>168</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if' have incorrect indentation level 12, expected level should be 10.</td>
<td>170</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if' child have incorrect indentation level 14, expected level should be 12.</td>
<td>171</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if rcurly' have incorrect indentation level 12, expected level should be 10.</td>
<td>172</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'catch' child have incorrect indentation level 12, expected level should be 10.</td>
<td>173</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'catch rcurly' have incorrect indentation level 10, expected level should be 8.</td>
<td>174</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'else rcurly' have incorrect indentation level 8, expected level should be 6.</td>
<td>175</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'synchronized' child have incorrect indentation level 8, expected level should be 6.</td>
<td>176</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'synchronized rcurly' have incorrect indentation level 6, expected level should be 4.</td>
<td>177</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
@@ -97562,67 +97556,67 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.EncryptionTest.java">org/apache/hadoop/hbase/util/EncryptionTest.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.hadoop.conf.Configuration' import.</td>
<td>30</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>FinalClass</td>
<td>Class EncryptionTest should be declared as final.</td>
<td>37</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>52</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>53</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>77</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>78</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>103</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>104</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>105</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
@@ -97631,13 +97625,13 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.EnvironmentEdgeManager.java">org/apache/hadoop/hbase/util/EnvironmentEdgeManager.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>FinalClass</td>
@@ -97646,43 +97640,43 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.ExceptionUtil.java">org/apache/hadoop/hbase/util/ExceptionUtil.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>FinalClass</td>
<td>Class ExceptionUtil should be declared as final.</td>
<td>36</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>43</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>44</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>53</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>60</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
@@ -97691,145 +97685,145 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.FSHDFSUtils.java">org/apache/hadoop/hbase/util/FSHDFSUtils.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'java.util.Collection' import.</td>
<td>30</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'com.google.common.collect.Sets' import.</td>
<td>32</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.hadoop.conf.Configuration' import.</td>
<td>37</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>55</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>56</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>113</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>114</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>162</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>217</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>219</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>271</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>272</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>273</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>274</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>276</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>299</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>300</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>301</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>311</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>312</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>313</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>329</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
@@ -97838,19 +97832,19 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.FSMapRUtils.java">org/apache/hadoop/hbase/util/FSMapRUtils.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.hadoop.conf.Configuration' import.</td>
<td>24</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
@@ -97859,19 +97853,19 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.FSRegionScanner.java">org/apache/hadoop/hbase/util/FSRegionScanner.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.hadoop.fs.BlockLocation' import.</td>
<td>29</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>RedundantImport</td>
@@ -97880,97 +97874,97 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.FSTableDescriptors.java">org/apache/hadoop/hbase/util/FSTableDescriptors.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'com.google.common.annotations.VisibleForTesting' import.</td>
<td>30</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
<td>116</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if' child have incorrect indentation level 7, expected level should be 6.</td>
<td>232</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>332</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>385</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>414</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>432</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>451</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>457</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'new' have incorrect indentation level 2, expected level should be 4.</td>
<td>486</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>539</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>541</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>543</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>548</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
@@ -97979,583 +97973,583 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.FSUtils.java">org/apache/hadoop/hbase/util/FSUtils.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>UnusedImports</td>
<td>Unused import - org.apache.hadoop.hdfs.protocol.HdfsConstants.</td>
<td>96</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.hadoop.hbase.HConstants.HBASE_DIR' import.</td>
<td>105</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
<td>140</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
<td>168</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
<td>169</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>253</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>269</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>270</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>284</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>296</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>300</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>313</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>348</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>349</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>351</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 102).</td>
<td>406</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>458</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>483</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>508</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>545</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>596</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>598</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'array initialization' child have incorrect indentation level 10, expected level should be 8.</td>
<td>604</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>608</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>619</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>620</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>642</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>655</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>685</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 102).</td>
<td>705</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>721</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>738</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>751</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>830</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>934</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>935</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>943</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>981</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 108).</td>
<td>1028</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 104).</td>
<td>1029</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1030</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1031</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1033</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>1039</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>1054</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 114).</td>
<td>1083</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
<td>1084</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 126).</td>
<td>1108</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
<td>1109</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 105).</td>
<td>1109</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>1400</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1414</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1416</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1430</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1448</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1449</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 105).</td>
<td>1450</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>JavadocTagContinuationIndentation</td>
<td>Line continuation have incorrect indentation level, expected level should be 2.</td>
<td>1451</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1452</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1467</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1508</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 103).</td>
<td>1510</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1561</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 104).</td>
<td>1563</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 112).</td>
<td>1574</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1652</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1654</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1676</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'final' have incorrect indentation level 2, expected level should be 4.</td>
<td>1679</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 101).</td>
<td>1695</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1704</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 102).</td>
<td>1709</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 110).</td>
<td>1722</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 101).</td>
<td>1744</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>whitespace</td>
<td>ParenPad</td>
<td>'(' is followed by whitespace.</td>
<td>1770</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1845</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>1868</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>1896</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>1909</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>1984</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>2031</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>2032</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>2033</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>2035</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>2045</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>2046</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>2048</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>2111</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 101).</td>
<td>2208</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 110).</td>
<td>2210</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>2304</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>2322</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>2331</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>2338</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>javadoc</td>
<td>NonEmptyAtclauseDescription</td>
<td>At-clause should have a non-empty description.</td>
<td>2340</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
@@ -98564,25 +98558,25 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.FSVisitor.java">org/apache/hadoop/hbase/util/FSVisitor.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.hadoop.fs.FileStatus' import.</td>
<td>27</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
<td>Line is longer than 100 characters (found 113).</td>
<td>58</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>sizes</td>
<td>LineLength</td>
@@ -98591,19 +98585,19 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.ForeignExceptionUtil.java">org/apache/hadoop/hbase/util/ForeignExceptionUtil.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>98</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
@@ -98612,19 +98606,19 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.GetJavaProperty.java">org/apache/hadoop/hbase/util/GetJavaProperty.java</h3>
<table border="0" class="table table-striped">
-<tr class="a">
+<tr class="b">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>HideUtilityClassConstructor</td>
<td>Utility classes should not have a public or default constructor.</td>
<td>24</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>misc</td>
<td>ArrayTypeStyle</td>
@@ -98633,25 +98627,25 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.HBaseConfTool.java">org/apache/hadoop/hbase/util/HBaseConfTool.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.hadoop.conf.Configuration' import.</td>
<td>23</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>HideUtilityClassConstructor</td>
<td>Utility classes should not have a public or default constructor.</td>
<td>30</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>misc</td>
<td>ArrayTypeStyle</td>
@@ -98660,595 +98654,595 @@
<div class="section">
<h3 id="org.apache.hadoop.hbase.util.HBaseFsck.java">org/apache/hadoop/hbase/util/HBaseFsck.java</h3>
<table border="0" class="table table-striped">
-<tr class="b">
+<tr class="a">
<th>Severity</th>
<th>Category</th>
<th>Rule</th>
<th>Message</th>
<th>Line</th></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>imports</td>
<td>ImportOrder</td>
<td>Wrong order for 'org.apache.hadoop.hbase.regionserver.HRegion' import.</td>
<td>121</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>651</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>indentation</td>
<td>Indentation</td>
<td>'if' child have incorrect indentation level 11, expected level should be 10.</td>
<td>709</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>whitespace</td>
<td>MethodParamPad</td>
<td>'(' is preceded with whitespace.</td>
<td>784</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>785</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>VisibilityModifier</td>
<td>Variable 'regionName' must be private and have accessor methods.</td>
<td>812</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>VisibilityModifier</td>
<td>Variable 'metaFirstKey' must be private and have accessor methods.</td>
<td>813</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>VisibilityModifier</td>
<td>Variable 'metaLastKey' must be private and have accessor methods.</td>
<td>814</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>VisibilityModifier</td>
<td>Variable 'storesFirstKey' must be private and have accessor methods.</td>
<td>815</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>design</td>
<td>VisibilityModifier</td>
<td>Variable 'storesLastKey' must be private and have accessor methods.</td>
<td>816</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>whitespace</td>
<td>MethodParamPad</td>
<td>'(' is preceded with whitespace.</td>
<td>818</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>872</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>874</td></tr>
-<tr class="b">
+<tr class="a">
<td><img src="images/icon_error_sml.gif" alt="" /> Error</td>
<td>blocks</td>
<td>NeedBraces</td>
<td>'if' construct must use '{}'s.</td>
<td>949</td></tr>
-<tr class="a">
+<tr class="b">
<td><img src=
<TRUNCATED>
[02/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.html
----------------------------------------------------------------------
diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.html b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.html
index 3c7d6b4..3dea877 100644
--- a/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.html
+++ b/devapidocs/src-html/org/apache/hadoop/hbase/util/Bytes.html
@@ -1583,1089 +1583,1084 @@
<span class="sourceLineNo">1575</span> length1 == length2) {<a name="line.1575"></a>
<span class="sourceLineNo">1576</span> return 0;<a name="line.1576"></a>
<span class="sourceLineNo">1577</span> }<a name="line.1577"></a>
-<span class="sourceLineNo">1578</span> final int minLength = Math.min(length1, length2);<a name="line.1578"></a>
-<span class="sourceLineNo">1579</span> final int minWords = minLength / SIZEOF_LONG;<a name="line.1579"></a>
-<span class="sourceLineNo">1580</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1580"></a>
-<span class="sourceLineNo">1581</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
-<span class="sourceLineNo">1582</span><a name="line.1582"></a>
-<span class="sourceLineNo">1583</span> /*<a name="line.1583"></a>
-<span class="sourceLineNo">1584</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a<a name="line.1584"></a>
-<span class="sourceLineNo">1585</span> * time is no slower than comparing 4 bytes at a time even on 32-bit.<a name="line.1585"></a>
-<span class="sourceLineNo">1586</span> * On the other hand, it is substantially faster on 64-bit.<a name="line.1586"></a>
-<span class="sourceLineNo">1587</span> */<a name="line.1587"></a>
-<span class="sourceLineNo">1588</span> // This is the end offset of long parts.<a name="line.1588"></a>
-<span class="sourceLineNo">1589</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.1589"></a>
-<span class="sourceLineNo">1590</span> for (int i = 0; i < j; i += SIZEOF_LONG) {<a name="line.1590"></a>
-<span class="sourceLineNo">1591</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1591"></a>
-<span class="sourceLineNo">1592</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1592"></a>
-<span class="sourceLineNo">1593</span> long diff = lw ^ rw;<a name="line.1593"></a>
-<span class="sourceLineNo">1594</span> if (diff != 0) {<a name="line.1594"></a>
-<span class="sourceLineNo">1595</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.1595"></a>
-<span class="sourceLineNo">1596</span> }<a name="line.1596"></a>
-<span class="sourceLineNo">1597</span> }<a name="line.1597"></a>
-<span class="sourceLineNo">1598</span> int offset = j;<a name="line.1598"></a>
-<span class="sourceLineNo">1599</span><a name="line.1599"></a>
-<span class="sourceLineNo">1600</span> if (minLength - offset >= SIZEOF_INT) {<a name="line.1600"></a>
-<span class="sourceLineNo">1601</span> int il = theUnsafe.getInt(buffer1, offset1Adj + offset);<a name="line.1601"></a>
-<span class="sourceLineNo">1602</span> int ir = theUnsafe.getInt(buffer2, offset2Adj + offset);<a name="line.1602"></a>
-<span class="sourceLineNo">1603</span> if (il != ir) {<a name="line.1603"></a>
-<span class="sourceLineNo">1604</span> return lessThanUnsignedInt(il, ir) ? -1: 1;<a name="line.1604"></a>
-<span class="sourceLineNo">1605</span> }<a name="line.1605"></a>
-<span class="sourceLineNo">1606</span> offset += SIZEOF_INT;<a name="line.1606"></a>
-<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
-<span class="sourceLineNo">1608</span> if (minLength - offset >= SIZEOF_SHORT) {<a name="line.1608"></a>
-<span class="sourceLineNo">1609</span> short sl = theUnsafe.getShort(buffer1, offset1Adj + offset);<a name="line.1609"></a>
-<span class="sourceLineNo">1610</span> short sr = theUnsafe.getShort(buffer2, offset2Adj + offset);<a name="line.1610"></a>
-<span class="sourceLineNo">1611</span> if (sl != sr) {<a name="line.1611"></a>
-<span class="sourceLineNo">1612</span> return lessThanUnsignedShort(sl, sr) ? -1: 1;<a name="line.1612"></a>
-<span class="sourceLineNo">1613</span> }<a name="line.1613"></a>
-<span class="sourceLineNo">1614</span> offset += SIZEOF_SHORT;<a name="line.1614"></a>
-<span class="sourceLineNo">1615</span> }<a name="line.1615"></a>
-<span class="sourceLineNo">1616</span> if (minLength - offset == 1) {<a name="line.1616"></a>
-<span class="sourceLineNo">1617</span> int a = (buffer1[(int)(offset1 + offset)] & 0xff);<a name="line.1617"></a>
-<span class="sourceLineNo">1618</span> int b = (buffer2[(int)(offset2 + offset)] & 0xff);<a name="line.1618"></a>
-<span class="sourceLineNo">1619</span> if (a != b) {<a name="line.1619"></a>
-<span class="sourceLineNo">1620</span> return a - b;<a name="line.1620"></a>
-<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
-<span class="sourceLineNo">1622</span> }<a name="line.1622"></a>
-<span class="sourceLineNo">1623</span> return length1 - length2;<a name="line.1623"></a>
-<span class="sourceLineNo">1624</span> }<a name="line.1624"></a>
-<span class="sourceLineNo">1625</span> }<a name="line.1625"></a>
-<span class="sourceLineNo">1626</span> }<a name="line.1626"></a>
-<span class="sourceLineNo">1627</span><a name="line.1627"></a>
-<span class="sourceLineNo">1628</span> /**<a name="line.1628"></a>
-<span class="sourceLineNo">1629</span> * @param left left operand<a name="line.1629"></a>
-<span class="sourceLineNo">1630</span> * @param right right operand<a name="line.1630"></a>
-<span class="sourceLineNo">1631</span> * @return True if equal<a name="line.1631"></a>
-<span class="sourceLineNo">1632</span> */<a name="line.1632"></a>
-<span class="sourceLineNo">1633</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1633"></a>
-<span class="sourceLineNo">1634</span> // Could use Arrays.equals?<a name="line.1634"></a>
-<span class="sourceLineNo">1635</span> //noinspection SimplifiableConditionalExpression<a name="line.1635"></a>
-<span class="sourceLineNo">1636</span> if (left == right) return true;<a name="line.1636"></a>
-<span class="sourceLineNo">1637</span> if (left == null || right == null) return false;<a name="line.1637"></a>
-<span class="sourceLineNo">1638</span> if (left.length != right.length) return false;<a name="line.1638"></a>
-<span class="sourceLineNo">1639</span> if (left.length == 0) return true;<a name="line.1639"></a>
+<span class="sourceLineNo">1578</span> final int stride = 8;<a name="line.1578"></a>
+<span class="sourceLineNo">1579</span> final int minLength = Math.min(length1, length2);<a name="line.1579"></a>
+<span class="sourceLineNo">1580</span> int strideLimit = minLength & ~(stride - 1);<a name="line.1580"></a>
+<span class="sourceLineNo">1581</span> final long offset1Adj = offset1 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1581"></a>
+<span class="sourceLineNo">1582</span> final long offset2Adj = offset2 + UnsafeAccess.BYTE_ARRAY_BASE_OFFSET;<a name="line.1582"></a>
+<span class="sourceLineNo">1583</span> int i;<a name="line.1583"></a>
+<span class="sourceLineNo">1584</span><a name="line.1584"></a>
+<span class="sourceLineNo">1585</span> /*<a name="line.1585"></a>
+<span class="sourceLineNo">1586</span> * Compare 8 bytes at a time. Benchmarking on x86 shows a stride of 8 bytes is no slower<a name="line.1586"></a>
+<span class="sourceLineNo">1587</span> * than 4 bytes even on 32-bit. On the other hand, it is substantially faster on 64-bit.<a name="line.1587"></a>
+<span class="sourceLineNo">1588</span> */<a name="line.1588"></a>
+<span class="sourceLineNo">1589</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.1589"></a>
+<span class="sourceLineNo">1590</span> long lw = theUnsafe.getLong(buffer1, offset1Adj + (long) i);<a name="line.1590"></a>
+<span class="sourceLineNo">1591</span> long rw = theUnsafe.getLong(buffer2, offset2Adj + (long) i);<a name="line.1591"></a>
+<span class="sourceLineNo">1592</span> if (lw != rw) {<a name="line.1592"></a>
+<span class="sourceLineNo">1593</span> if(!UnsafeAccess.littleEndian) {<a name="line.1593"></a>
+<span class="sourceLineNo">1594</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.1594"></a>
+<span class="sourceLineNo">1595</span> }<a name="line.1595"></a>
+<span class="sourceLineNo">1596</span><a name="line.1596"></a>
+<span class="sourceLineNo">1597</span> /*<a name="line.1597"></a>
+<span class="sourceLineNo">1598</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.1598"></a>
+<span class="sourceLineNo">1599</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.1599"></a>
+<span class="sourceLineNo">1600</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.1600"></a>
+<span class="sourceLineNo">1601</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.1601"></a>
+<span class="sourceLineNo">1602</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.1602"></a>
+<span class="sourceLineNo">1603</span> * comparator from guava v21<a name="line.1603"></a>
+<span class="sourceLineNo">1604</span> */<a name="line.1604"></a>
+<span class="sourceLineNo">1605</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.1605"></a>
+<span class="sourceLineNo">1606</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.1606"></a>
+<span class="sourceLineNo">1607</span> }<a name="line.1607"></a>
+<span class="sourceLineNo">1608</span> }<a name="line.1608"></a>
+<span class="sourceLineNo">1609</span><a name="line.1609"></a>
+<span class="sourceLineNo">1610</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.1610"></a>
+<span class="sourceLineNo">1611</span> for (; i < minLength; i++) {<a name="line.1611"></a>
+<span class="sourceLineNo">1612</span> int a = (buffer1[offset1 + i] & 0xFF);<a name="line.1612"></a>
+<span class="sourceLineNo">1613</span> int b = (buffer2[offset2 + i] & 0xFF);<a name="line.1613"></a>
+<span class="sourceLineNo">1614</span> if (a != b) {<a name="line.1614"></a>
+<span class="sourceLineNo">1615</span> return a - b;<a name="line.1615"></a>
+<span class="sourceLineNo">1616</span> }<a name="line.1616"></a>
+<span class="sourceLineNo">1617</span> }<a name="line.1617"></a>
+<span class="sourceLineNo">1618</span> return length1 - length2;<a name="line.1618"></a>
+<span class="sourceLineNo">1619</span> }<a name="line.1619"></a>
+<span class="sourceLineNo">1620</span> }<a name="line.1620"></a>
+<span class="sourceLineNo">1621</span> }<a name="line.1621"></a>
+<span class="sourceLineNo">1622</span><a name="line.1622"></a>
+<span class="sourceLineNo">1623</span> /**<a name="line.1623"></a>
+<span class="sourceLineNo">1624</span> * @param left left operand<a name="line.1624"></a>
+<span class="sourceLineNo">1625</span> * @param right right operand<a name="line.1625"></a>
+<span class="sourceLineNo">1626</span> * @return True if equal<a name="line.1626"></a>
+<span class="sourceLineNo">1627</span> */<a name="line.1627"></a>
+<span class="sourceLineNo">1628</span> public static boolean equals(final byte [] left, final byte [] right) {<a name="line.1628"></a>
+<span class="sourceLineNo">1629</span> // Could use Arrays.equals?<a name="line.1629"></a>
+<span class="sourceLineNo">1630</span> //noinspection SimplifiableConditionalExpression<a name="line.1630"></a>
+<span class="sourceLineNo">1631</span> if (left == right) return true;<a name="line.1631"></a>
+<span class="sourceLineNo">1632</span> if (left == null || right == null) return false;<a name="line.1632"></a>
+<span class="sourceLineNo">1633</span> if (left.length != right.length) return false;<a name="line.1633"></a>
+<span class="sourceLineNo">1634</span> if (left.length == 0) return true;<a name="line.1634"></a>
+<span class="sourceLineNo">1635</span><a name="line.1635"></a>
+<span class="sourceLineNo">1636</span> // Since we're often comparing adjacent sorted data,<a name="line.1636"></a>
+<span class="sourceLineNo">1637</span> // it's usual to have equal arrays except for the very last byte<a name="line.1637"></a>
+<span class="sourceLineNo">1638</span> // so check that first<a name="line.1638"></a>
+<span class="sourceLineNo">1639</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1639"></a>
<span class="sourceLineNo">1640</span><a name="line.1640"></a>
-<span class="sourceLineNo">1641</span> // Since we're often comparing adjacent sorted data,<a name="line.1641"></a>
-<span class="sourceLineNo">1642</span> // it's usual to have equal arrays except for the very last byte<a name="line.1642"></a>
-<span class="sourceLineNo">1643</span> // so check that first<a name="line.1643"></a>
-<span class="sourceLineNo">1644</span> if (left[left.length - 1] != right[right.length - 1]) return false;<a name="line.1644"></a>
-<span class="sourceLineNo">1645</span><a name="line.1645"></a>
-<span class="sourceLineNo">1646</span> return compareTo(left, right) == 0;<a name="line.1646"></a>
-<span class="sourceLineNo">1647</span> }<a name="line.1647"></a>
-<span class="sourceLineNo">1648</span><a name="line.1648"></a>
-<span class="sourceLineNo">1649</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1649"></a>
-<span class="sourceLineNo">1650</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1650"></a>
-<span class="sourceLineNo">1651</span> // short circuit case<a name="line.1651"></a>
-<span class="sourceLineNo">1652</span> if (left == right &&<a name="line.1652"></a>
-<span class="sourceLineNo">1653</span> leftOffset == rightOffset &&<a name="line.1653"></a>
-<span class="sourceLineNo">1654</span> leftLen == rightLen) {<a name="line.1654"></a>
-<span class="sourceLineNo">1655</span> return true;<a name="line.1655"></a>
-<span class="sourceLineNo">1656</span> }<a name="line.1656"></a>
-<span class="sourceLineNo">1657</span> // different lengths fast check<a name="line.1657"></a>
-<span class="sourceLineNo">1658</span> if (leftLen != rightLen) {<a name="line.1658"></a>
-<span class="sourceLineNo">1659</span> return false;<a name="line.1659"></a>
-<span class="sourceLineNo">1660</span> }<a name="line.1660"></a>
-<span class="sourceLineNo">1661</span> if (leftLen == 0) {<a name="line.1661"></a>
-<span class="sourceLineNo">1662</span> return true;<a name="line.1662"></a>
-<span class="sourceLineNo">1663</span> }<a name="line.1663"></a>
+<span class="sourceLineNo">1641</span> return compareTo(left, right) == 0;<a name="line.1641"></a>
+<span class="sourceLineNo">1642</span> }<a name="line.1642"></a>
+<span class="sourceLineNo">1643</span><a name="line.1643"></a>
+<span class="sourceLineNo">1644</span> public static boolean equals(final byte[] left, int leftOffset, int leftLen,<a name="line.1644"></a>
+<span class="sourceLineNo">1645</span> final byte[] right, int rightOffset, int rightLen) {<a name="line.1645"></a>
+<span class="sourceLineNo">1646</span> // short circuit case<a name="line.1646"></a>
+<span class="sourceLineNo">1647</span> if (left == right &&<a name="line.1647"></a>
+<span class="sourceLineNo">1648</span> leftOffset == rightOffset &&<a name="line.1648"></a>
+<span class="sourceLineNo">1649</span> leftLen == rightLen) {<a name="line.1649"></a>
+<span class="sourceLineNo">1650</span> return true;<a name="line.1650"></a>
+<span class="sourceLineNo">1651</span> }<a name="line.1651"></a>
+<span class="sourceLineNo">1652</span> // different lengths fast check<a name="line.1652"></a>
+<span class="sourceLineNo">1653</span> if (leftLen != rightLen) {<a name="line.1653"></a>
+<span class="sourceLineNo">1654</span> return false;<a name="line.1654"></a>
+<span class="sourceLineNo">1655</span> }<a name="line.1655"></a>
+<span class="sourceLineNo">1656</span> if (leftLen == 0) {<a name="line.1656"></a>
+<span class="sourceLineNo">1657</span> return true;<a name="line.1657"></a>
+<span class="sourceLineNo">1658</span> }<a name="line.1658"></a>
+<span class="sourceLineNo">1659</span><a name="line.1659"></a>
+<span class="sourceLineNo">1660</span> // Since we're often comparing adjacent sorted data,<a name="line.1660"></a>
+<span class="sourceLineNo">1661</span> // it's usual to have equal arrays except for the very last byte<a name="line.1661"></a>
+<span class="sourceLineNo">1662</span> // so check that first<a name="line.1662"></a>
+<span class="sourceLineNo">1663</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1663"></a>
<span class="sourceLineNo">1664</span><a name="line.1664"></a>
-<span class="sourceLineNo">1665</span> // Since we're often comparing adjacent sorted data,<a name="line.1665"></a>
-<span class="sourceLineNo">1666</span> // it's usual to have equal arrays except for the very last byte<a name="line.1666"></a>
-<span class="sourceLineNo">1667</span> // so check that first<a name="line.1667"></a>
-<span class="sourceLineNo">1668</span> if (left[leftOffset + leftLen - 1] != right[rightOffset + rightLen - 1]) return false;<a name="line.1668"></a>
+<span class="sourceLineNo">1665</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1665"></a>
+<span class="sourceLineNo">1666</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1666"></a>
+<span class="sourceLineNo">1667</span> }<a name="line.1667"></a>
+<span class="sourceLineNo">1668</span><a name="line.1668"></a>
<span class="sourceLineNo">1669</span><a name="line.1669"></a>
-<span class="sourceLineNo">1670</span> return LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1670"></a>
-<span class="sourceLineNo">1671</span> compareTo(left, leftOffset, leftLen, right, rightOffset, rightLen) == 0;<a name="line.1671"></a>
-<span class="sourceLineNo">1672</span> }<a name="line.1672"></a>
-<span class="sourceLineNo">1673</span><a name="line.1673"></a>
-<span class="sourceLineNo">1674</span><a name="line.1674"></a>
-<span class="sourceLineNo">1675</span> /**<a name="line.1675"></a>
-<span class="sourceLineNo">1676</span> * @param a left operand<a name="line.1676"></a>
-<span class="sourceLineNo">1677</span> * @param buf right operand<a name="line.1677"></a>
-<span class="sourceLineNo">1678</span> * @return True if equal<a name="line.1678"></a>
-<span class="sourceLineNo">1679</span> */<a name="line.1679"></a>
-<span class="sourceLineNo">1680</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1680"></a>
-<span class="sourceLineNo">1681</span> if (a == null) return buf == null;<a name="line.1681"></a>
-<span class="sourceLineNo">1682</span> if (buf == null) return false;<a name="line.1682"></a>
-<span class="sourceLineNo">1683</span> if (a.length != buf.remaining()) return false;<a name="line.1683"></a>
-<span class="sourceLineNo">1684</span><a name="line.1684"></a>
-<span class="sourceLineNo">1685</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1685"></a>
-<span class="sourceLineNo">1686</span> ByteBuffer b = buf.duplicate();<a name="line.1686"></a>
-<span class="sourceLineNo">1687</span> for (byte anA : a) {<a name="line.1687"></a>
-<span class="sourceLineNo">1688</span> if (anA != b.get()) {<a name="line.1688"></a>
-<span class="sourceLineNo">1689</span> return false;<a name="line.1689"></a>
-<span class="sourceLineNo">1690</span> }<a name="line.1690"></a>
-<span class="sourceLineNo">1691</span> }<a name="line.1691"></a>
-<span class="sourceLineNo">1692</span> return true;<a name="line.1692"></a>
-<span class="sourceLineNo">1693</span> }<a name="line.1693"></a>
-<span class="sourceLineNo">1694</span><a name="line.1694"></a>
-<span class="sourceLineNo">1695</span><a name="line.1695"></a>
-<span class="sourceLineNo">1696</span> /**<a name="line.1696"></a>
-<span class="sourceLineNo">1697</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1697"></a>
-<span class="sourceLineNo">1698</span> * array on the left.<a name="line.1698"></a>
-<span class="sourceLineNo">1699</span> */<a name="line.1699"></a>
-<span class="sourceLineNo">1700</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1700"></a>
-<span class="sourceLineNo">1701</span> return bytes != null && prefix != null &&<a name="line.1701"></a>
-<span class="sourceLineNo">1702</span> bytes.length >= prefix.length &&<a name="line.1702"></a>
-<span class="sourceLineNo">1703</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1703"></a>
-<span class="sourceLineNo">1704</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1704"></a>
-<span class="sourceLineNo">1705</span> }<a name="line.1705"></a>
-<span class="sourceLineNo">1706</span><a name="line.1706"></a>
-<span class="sourceLineNo">1707</span> /**<a name="line.1707"></a>
-<span class="sourceLineNo">1708</span> * @param b bytes to hash<a name="line.1708"></a>
-<span class="sourceLineNo">1709</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1709"></a>
-<span class="sourceLineNo">1710</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1710"></a>
-<span class="sourceLineNo">1711</span> * use calculating hash code.<a name="line.1711"></a>
-<span class="sourceLineNo">1712</span> */<a name="line.1712"></a>
-<span class="sourceLineNo">1713</span> public static int hashCode(final byte [] b) {<a name="line.1713"></a>
-<span class="sourceLineNo">1714</span> return hashCode(b, b.length);<a name="line.1714"></a>
-<span class="sourceLineNo">1715</span> }<a name="line.1715"></a>
-<span class="sourceLineNo">1716</span><a name="line.1716"></a>
-<span class="sourceLineNo">1717</span> /**<a name="line.1717"></a>
-<span class="sourceLineNo">1718</span> * @param b value<a name="line.1718"></a>
-<span class="sourceLineNo">1719</span> * @param length length of the value<a name="line.1719"></a>
-<span class="sourceLineNo">1720</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1720"></a>
-<span class="sourceLineNo">1721</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1721"></a>
-<span class="sourceLineNo">1722</span> * use calculating hash code.<a name="line.1722"></a>
-<span class="sourceLineNo">1723</span> */<a name="line.1723"></a>
-<span class="sourceLineNo">1724</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1724"></a>
-<span class="sourceLineNo">1725</span> return WritableComparator.hashBytes(b, length);<a name="line.1725"></a>
-<span class="sourceLineNo">1726</span> }<a name="line.1726"></a>
-<span class="sourceLineNo">1727</span><a name="line.1727"></a>
-<span class="sourceLineNo">1728</span> /**<a name="line.1728"></a>
-<span class="sourceLineNo">1729</span> * @param b bytes to hash<a name="line.1729"></a>
-<span class="sourceLineNo">1730</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1730"></a>
-<span class="sourceLineNo">1731</span> * Maps.<a name="line.1731"></a>
-<span class="sourceLineNo">1732</span> */<a name="line.1732"></a>
-<span class="sourceLineNo">1733</span> public static Integer mapKey(final byte [] b) {<a name="line.1733"></a>
-<span class="sourceLineNo">1734</span> return hashCode(b);<a name="line.1734"></a>
-<span class="sourceLineNo">1735</span> }<a name="line.1735"></a>
-<span class="sourceLineNo">1736</span><a name="line.1736"></a>
-<span class="sourceLineNo">1737</span> /**<a name="line.1737"></a>
-<span class="sourceLineNo">1738</span> * @param b bytes to hash<a name="line.1738"></a>
-<span class="sourceLineNo">1739</span> * @param length length to hash<a name="line.1739"></a>
-<span class="sourceLineNo">1740</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1740"></a>
-<span class="sourceLineNo">1741</span> * Maps.<a name="line.1741"></a>
-<span class="sourceLineNo">1742</span> */<a name="line.1742"></a>
-<span class="sourceLineNo">1743</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1743"></a>
-<span class="sourceLineNo">1744</span> return hashCode(b, length);<a name="line.1744"></a>
-<span class="sourceLineNo">1745</span> }<a name="line.1745"></a>
-<span class="sourceLineNo">1746</span><a name="line.1746"></a>
-<span class="sourceLineNo">1747</span> /**<a name="line.1747"></a>
-<span class="sourceLineNo">1748</span> * @param a lower half<a name="line.1748"></a>
-<span class="sourceLineNo">1749</span> * @param b upper half<a name="line.1749"></a>
-<span class="sourceLineNo">1750</span> * @return New array that has a in lower half and b in upper half.<a name="line.1750"></a>
-<span class="sourceLineNo">1751</span> */<a name="line.1751"></a>
-<span class="sourceLineNo">1752</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1752"></a>
-<span class="sourceLineNo">1753</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1753"></a>
-<span class="sourceLineNo">1754</span> }<a name="line.1754"></a>
-<span class="sourceLineNo">1755</span><a name="line.1755"></a>
-<span class="sourceLineNo">1756</span> /**<a name="line.1756"></a>
-<span class="sourceLineNo">1757</span> * @param a first third<a name="line.1757"></a>
-<span class="sourceLineNo">1758</span> * @param b second third<a name="line.1758"></a>
-<span class="sourceLineNo">1759</span> * @param c third third<a name="line.1759"></a>
-<span class="sourceLineNo">1760</span> * @return New array made from a, b and c<a name="line.1760"></a>
-<span class="sourceLineNo">1761</span> */<a name="line.1761"></a>
-<span class="sourceLineNo">1762</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1762"></a>
-<span class="sourceLineNo">1763</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1763"></a>
-<span class="sourceLineNo">1764</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1764"></a>
-<span class="sourceLineNo">1765</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1765"></a>
-<span class="sourceLineNo">1766</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1766"></a>
-<span class="sourceLineNo">1767</span> return result;<a name="line.1767"></a>
-<span class="sourceLineNo">1768</span> }<a name="line.1768"></a>
-<span class="sourceLineNo">1769</span><a name="line.1769"></a>
-<span class="sourceLineNo">1770</span> /**<a name="line.1770"></a>
-<span class="sourceLineNo">1771</span> * @param arrays all the arrays to concatenate together.<a name="line.1771"></a>
-<span class="sourceLineNo">1772</span> * @return New array made from the concatenation of the given arrays.<a name="line.1772"></a>
-<span class="sourceLineNo">1773</span> */<a name="line.1773"></a>
-<span class="sourceLineNo">1774</span> public static byte [] add(final byte [][] arrays) {<a name="line.1774"></a>
-<span class="sourceLineNo">1775</span> int length = 0;<a name="line.1775"></a>
+<span class="sourceLineNo">1670</span> /**<a name="line.1670"></a>
+<span class="sourceLineNo">1671</span> * @param a left operand<a name="line.1671"></a>
+<span class="sourceLineNo">1672</span> * @param buf right operand<a name="line.1672"></a>
+<span class="sourceLineNo">1673</span> * @return True if equal<a name="line.1673"></a>
+<span class="sourceLineNo">1674</span> */<a name="line.1674"></a>
+<span class="sourceLineNo">1675</span> public static boolean equals(byte[] a, ByteBuffer buf) {<a name="line.1675"></a>
+<span class="sourceLineNo">1676</span> if (a == null) return buf == null;<a name="line.1676"></a>
+<span class="sourceLineNo">1677</span> if (buf == null) return false;<a name="line.1677"></a>
+<span class="sourceLineNo">1678</span> if (a.length != buf.remaining()) return false;<a name="line.1678"></a>
+<span class="sourceLineNo">1679</span><a name="line.1679"></a>
+<span class="sourceLineNo">1680</span> // Thou shalt not modify the original byte buffer in what should be read only operations.<a name="line.1680"></a>
+<span class="sourceLineNo">1681</span> ByteBuffer b = buf.duplicate();<a name="line.1681"></a>
+<span class="sourceLineNo">1682</span> for (byte anA : a) {<a name="line.1682"></a>
+<span class="sourceLineNo">1683</span> if (anA != b.get()) {<a name="line.1683"></a>
+<span class="sourceLineNo">1684</span> return false;<a name="line.1684"></a>
+<span class="sourceLineNo">1685</span> }<a name="line.1685"></a>
+<span class="sourceLineNo">1686</span> }<a name="line.1686"></a>
+<span class="sourceLineNo">1687</span> return true;<a name="line.1687"></a>
+<span class="sourceLineNo">1688</span> }<a name="line.1688"></a>
+<span class="sourceLineNo">1689</span><a name="line.1689"></a>
+<span class="sourceLineNo">1690</span><a name="line.1690"></a>
+<span class="sourceLineNo">1691</span> /**<a name="line.1691"></a>
+<span class="sourceLineNo">1692</span> * Return true if the byte array on the right is a prefix of the byte<a name="line.1692"></a>
+<span class="sourceLineNo">1693</span> * array on the left.<a name="line.1693"></a>
+<span class="sourceLineNo">1694</span> */<a name="line.1694"></a>
+<span class="sourceLineNo">1695</span> public static boolean startsWith(byte[] bytes, byte[] prefix) {<a name="line.1695"></a>
+<span class="sourceLineNo">1696</span> return bytes != null && prefix != null &&<a name="line.1696"></a>
+<span class="sourceLineNo">1697</span> bytes.length >= prefix.length &&<a name="line.1697"></a>
+<span class="sourceLineNo">1698</span> LexicographicalComparerHolder.BEST_COMPARER.<a name="line.1698"></a>
+<span class="sourceLineNo">1699</span> compareTo(bytes, 0, prefix.length, prefix, 0, prefix.length) == 0;<a name="line.1699"></a>
+<span class="sourceLineNo">1700</span> }<a name="line.1700"></a>
+<span class="sourceLineNo">1701</span><a name="line.1701"></a>
+<span class="sourceLineNo">1702</span> /**<a name="line.1702"></a>
+<span class="sourceLineNo">1703</span> * @param b bytes to hash<a name="line.1703"></a>
+<span class="sourceLineNo">1704</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1704"></a>
+<span class="sourceLineNo">1705</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1705"></a>
+<span class="sourceLineNo">1706</span> * use calculating hash code.<a name="line.1706"></a>
+<span class="sourceLineNo">1707</span> */<a name="line.1707"></a>
+<span class="sourceLineNo">1708</span> public static int hashCode(final byte [] b) {<a name="line.1708"></a>
+<span class="sourceLineNo">1709</span> return hashCode(b, b.length);<a name="line.1709"></a>
+<span class="sourceLineNo">1710</span> }<a name="line.1710"></a>
+<span class="sourceLineNo">1711</span><a name="line.1711"></a>
+<span class="sourceLineNo">1712</span> /**<a name="line.1712"></a>
+<span class="sourceLineNo">1713</span> * @param b value<a name="line.1713"></a>
+<span class="sourceLineNo">1714</span> * @param length length of the value<a name="line.1714"></a>
+<span class="sourceLineNo">1715</span> * @return Runs {@link WritableComparator#hashBytes(byte[], int)} on the<a name="line.1715"></a>
+<span class="sourceLineNo">1716</span> * passed in array. This method is what {@link org.apache.hadoop.io.Text}<a name="line.1716"></a>
+<span class="sourceLineNo">1717</span> * use calculating hash code.<a name="line.1717"></a>
+<span class="sourceLineNo">1718</span> */<a name="line.1718"></a>
+<span class="sourceLineNo">1719</span> public static int hashCode(final byte [] b, final int length) {<a name="line.1719"></a>
+<span class="sourceLineNo">1720</span> return WritableComparator.hashBytes(b, length);<a name="line.1720"></a>
+<span class="sourceLineNo">1721</span> }<a name="line.1721"></a>
+<span class="sourceLineNo">1722</span><a name="line.1722"></a>
+<span class="sourceLineNo">1723</span> /**<a name="line.1723"></a>
+<span class="sourceLineNo">1724</span> * @param b bytes to hash<a name="line.1724"></a>
+<span class="sourceLineNo">1725</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1725"></a>
+<span class="sourceLineNo">1726</span> * Maps.<a name="line.1726"></a>
+<span class="sourceLineNo">1727</span> */<a name="line.1727"></a>
+<span class="sourceLineNo">1728</span> public static Integer mapKey(final byte [] b) {<a name="line.1728"></a>
+<span class="sourceLineNo">1729</span> return hashCode(b);<a name="line.1729"></a>
+<span class="sourceLineNo">1730</span> }<a name="line.1730"></a>
+<span class="sourceLineNo">1731</span><a name="line.1731"></a>
+<span class="sourceLineNo">1732</span> /**<a name="line.1732"></a>
+<span class="sourceLineNo">1733</span> * @param b bytes to hash<a name="line.1733"></a>
+<span class="sourceLineNo">1734</span> * @param length length to hash<a name="line.1734"></a>
+<span class="sourceLineNo">1735</span> * @return A hash of <code>b</code> as an Integer that can be used as key in<a name="line.1735"></a>
+<span class="sourceLineNo">1736</span> * Maps.<a name="line.1736"></a>
+<span class="sourceLineNo">1737</span> */<a name="line.1737"></a>
+<span class="sourceLineNo">1738</span> public static Integer mapKey(final byte [] b, final int length) {<a name="line.1738"></a>
+<span class="sourceLineNo">1739</span> return hashCode(b, length);<a name="line.1739"></a>
+<span class="sourceLineNo">1740</span> }<a name="line.1740"></a>
+<span class="sourceLineNo">1741</span><a name="line.1741"></a>
+<span class="sourceLineNo">1742</span> /**<a name="line.1742"></a>
+<span class="sourceLineNo">1743</span> * @param a lower half<a name="line.1743"></a>
+<span class="sourceLineNo">1744</span> * @param b upper half<a name="line.1744"></a>
+<span class="sourceLineNo">1745</span> * @return New array that has a in lower half and b in upper half.<a name="line.1745"></a>
+<span class="sourceLineNo">1746</span> */<a name="line.1746"></a>
+<span class="sourceLineNo">1747</span> public static byte [] add(final byte [] a, final byte [] b) {<a name="line.1747"></a>
+<span class="sourceLineNo">1748</span> return add(a, b, EMPTY_BYTE_ARRAY);<a name="line.1748"></a>
+<span class="sourceLineNo">1749</span> }<a name="line.1749"></a>
+<span class="sourceLineNo">1750</span><a name="line.1750"></a>
+<span class="sourceLineNo">1751</span> /**<a name="line.1751"></a>
+<span class="sourceLineNo">1752</span> * @param a first third<a name="line.1752"></a>
+<span class="sourceLineNo">1753</span> * @param b second third<a name="line.1753"></a>
+<span class="sourceLineNo">1754</span> * @param c third third<a name="line.1754"></a>
+<span class="sourceLineNo">1755</span> * @return New array made from a, b and c<a name="line.1755"></a>
+<span class="sourceLineNo">1756</span> */<a name="line.1756"></a>
+<span class="sourceLineNo">1757</span> public static byte [] add(final byte [] a, final byte [] b, final byte [] c) {<a name="line.1757"></a>
+<span class="sourceLineNo">1758</span> byte [] result = new byte[a.length + b.length + c.length];<a name="line.1758"></a>
+<span class="sourceLineNo">1759</span> System.arraycopy(a, 0, result, 0, a.length);<a name="line.1759"></a>
+<span class="sourceLineNo">1760</span> System.arraycopy(b, 0, result, a.length, b.length);<a name="line.1760"></a>
+<span class="sourceLineNo">1761</span> System.arraycopy(c, 0, result, a.length + b.length, c.length);<a name="line.1761"></a>
+<span class="sourceLineNo">1762</span> return result;<a name="line.1762"></a>
+<span class="sourceLineNo">1763</span> }<a name="line.1763"></a>
+<span class="sourceLineNo">1764</span><a name="line.1764"></a>
+<span class="sourceLineNo">1765</span> /**<a name="line.1765"></a>
+<span class="sourceLineNo">1766</span> * @param arrays all the arrays to concatenate together.<a name="line.1766"></a>
+<span class="sourceLineNo">1767</span> * @return New array made from the concatenation of the given arrays.<a name="line.1767"></a>
+<span class="sourceLineNo">1768</span> */<a name="line.1768"></a>
+<span class="sourceLineNo">1769</span> public static byte [] add(final byte [][] arrays) {<a name="line.1769"></a>
+<span class="sourceLineNo">1770</span> int length = 0;<a name="line.1770"></a>
+<span class="sourceLineNo">1771</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1771"></a>
+<span class="sourceLineNo">1772</span> length += arrays[i].length;<a name="line.1772"></a>
+<span class="sourceLineNo">1773</span> }<a name="line.1773"></a>
+<span class="sourceLineNo">1774</span> byte [] result = new byte[length];<a name="line.1774"></a>
+<span class="sourceLineNo">1775</span> int index = 0;<a name="line.1775"></a>
<span class="sourceLineNo">1776</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1776"></a>
-<span class="sourceLineNo">1777</span> length += arrays[i].length;<a name="line.1777"></a>
-<span class="sourceLineNo">1778</span> }<a name="line.1778"></a>
-<span class="sourceLineNo">1779</span> byte [] result = new byte[length];<a name="line.1779"></a>
-<span class="sourceLineNo">1780</span> int index = 0;<a name="line.1780"></a>
-<span class="sourceLineNo">1781</span> for (int i = 0; i < arrays.length; i++) {<a name="line.1781"></a>
-<span class="sourceLineNo">1782</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1782"></a>
-<span class="sourceLineNo">1783</span> index += arrays[i].length;<a name="line.1783"></a>
-<span class="sourceLineNo">1784</span> }<a name="line.1784"></a>
-<span class="sourceLineNo">1785</span> return result;<a name="line.1785"></a>
-<span class="sourceLineNo">1786</span> }<a name="line.1786"></a>
-<span class="sourceLineNo">1787</span><a name="line.1787"></a>
-<span class="sourceLineNo">1788</span> /**<a name="line.1788"></a>
-<span class="sourceLineNo">1789</span> * @param a array<a name="line.1789"></a>
-<span class="sourceLineNo">1790</span> * @param length amount of bytes to grab<a name="line.1790"></a>
-<span class="sourceLineNo">1791</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1791"></a>
-<span class="sourceLineNo">1792</span> */<a name="line.1792"></a>
-<span class="sourceLineNo">1793</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1793"></a>
-<span class="sourceLineNo">1794</span> if (a.length < length) {<a name="line.1794"></a>
-<span class="sourceLineNo">1795</span> return null;<a name="line.1795"></a>
-<span class="sourceLineNo">1796</span> }<a name="line.1796"></a>
-<span class="sourceLineNo">1797</span> byte [] result = new byte[length];<a name="line.1797"></a>
-<span class="sourceLineNo">1798</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1798"></a>
-<span class="sourceLineNo">1799</span> return result;<a name="line.1799"></a>
-<span class="sourceLineNo">1800</span> }<a name="line.1800"></a>
-<span class="sourceLineNo">1801</span><a name="line.1801"></a>
-<span class="sourceLineNo">1802</span> /**<a name="line.1802"></a>
-<span class="sourceLineNo">1803</span> * @param a array<a name="line.1803"></a>
-<span class="sourceLineNo">1804</span> * @param length amount of bytes to snarf<a name="line.1804"></a>
-<span class="sourceLineNo">1805</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1805"></a>
-<span class="sourceLineNo">1806</span> */<a name="line.1806"></a>
-<span class="sourceLineNo">1807</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1807"></a>
-<span class="sourceLineNo">1808</span> if (a.length < length) {<a name="line.1808"></a>
-<span class="sourceLineNo">1809</span> return null;<a name="line.1809"></a>
-<span class="sourceLineNo">1810</span> }<a name="line.1810"></a>
-<span class="sourceLineNo">1811</span> byte [] result = new byte[length];<a name="line.1811"></a>
-<span class="sourceLineNo">1812</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1812"></a>
-<span class="sourceLineNo">1813</span> return result;<a name="line.1813"></a>
-<span class="sourceLineNo">1814</span> }<a name="line.1814"></a>
-<span class="sourceLineNo">1815</span><a name="line.1815"></a>
-<span class="sourceLineNo">1816</span> /**<a name="line.1816"></a>
-<span class="sourceLineNo">1817</span> * @param a array<a name="line.1817"></a>
-<span class="sourceLineNo">1818</span> * @param length new array size<a name="line.1818"></a>
-<span class="sourceLineNo">1819</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1819"></a>
-<span class="sourceLineNo">1820</span> */<a name="line.1820"></a>
-<span class="sourceLineNo">1821</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1821"></a>
-<span class="sourceLineNo">1822</span> byte [] padding = new byte[length];<a name="line.1822"></a>
-<span class="sourceLineNo">1823</span> for (int i = 0; i < length; i++) {<a name="line.1823"></a>
-<span class="sourceLineNo">1824</span> padding[i] = 0;<a name="line.1824"></a>
-<span class="sourceLineNo">1825</span> }<a name="line.1825"></a>
-<span class="sourceLineNo">1826</span> return add(padding,a);<a name="line.1826"></a>
-<span class="sourceLineNo">1827</span> }<a name="line.1827"></a>
-<span class="sourceLineNo">1828</span><a name="line.1828"></a>
-<span class="sourceLineNo">1829</span> /**<a name="line.1829"></a>
-<span class="sourceLineNo">1830</span> * @param a array<a name="line.1830"></a>
-<span class="sourceLineNo">1831</span> * @param length new array size<a name="line.1831"></a>
-<span class="sourceLineNo">1832</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1832"></a>
-<span class="sourceLineNo">1833</span> */<a name="line.1833"></a>
-<span class="sourceLineNo">1834</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1834"></a>
-<span class="sourceLineNo">1835</span> byte [] padding = new byte[length];<a name="line.1835"></a>
-<span class="sourceLineNo">1836</span> for (int i = 0; i < length; i++) {<a name="line.1836"></a>
-<span class="sourceLineNo">1837</span> padding[i] = 0;<a name="line.1837"></a>
-<span class="sourceLineNo">1838</span> }<a name="line.1838"></a>
-<span class="sourceLineNo">1839</span> return add(a,padding);<a name="line.1839"></a>
-<span class="sourceLineNo">1840</span> }<a name="line.1840"></a>
-<span class="sourceLineNo">1841</span><a name="line.1841"></a>
-<span class="sourceLineNo">1842</span> /**<a name="line.1842"></a>
-<span class="sourceLineNo">1843</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1843"></a>
-<span class="sourceLineNo">1844</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1844"></a>
-<span class="sourceLineNo">1845</span> * @param a Beginning of range<a name="line.1845"></a>
-<span class="sourceLineNo">1846</span> * @param b End of range<a name="line.1846"></a>
-<span class="sourceLineNo">1847</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1847"></a>
-<span class="sourceLineNo">1848</span> * the range in two; i.e. one split.<a name="line.1848"></a>
-<span class="sourceLineNo">1849</span> * @return Array of dividing values<a name="line.1849"></a>
-<span class="sourceLineNo">1850</span> */<a name="line.1850"></a>
-<span class="sourceLineNo">1851</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1851"></a>
-<span class="sourceLineNo">1852</span> return split(a, b, false, num);<a name="line.1852"></a>
-<span class="sourceLineNo">1853</span> }<a name="line.1853"></a>
-<span class="sourceLineNo">1854</span><a name="line.1854"></a>
-<span class="sourceLineNo">1855</span> /**<a name="line.1855"></a>
-<span class="sourceLineNo">1856</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1856"></a>
-<span class="sourceLineNo">1857</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1857"></a>
-<span class="sourceLineNo">1858</span> * @param a Beginning of range<a name="line.1858"></a>
-<span class="sourceLineNo">1859</span> * @param b End of range<a name="line.1859"></a>
-<span class="sourceLineNo">1860</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1860"></a>
-<span class="sourceLineNo">1861</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1861"></a>
-<span class="sourceLineNo">1862</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1862"></a>
-<span class="sourceLineNo">1863</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1863"></a>
-<span class="sourceLineNo">1864</span> * the range in two; i.e. one split.<a name="line.1864"></a>
-<span class="sourceLineNo">1865</span> * @return Array of dividing values<a name="line.1865"></a>
-<span class="sourceLineNo">1866</span> */<a name="line.1866"></a>
-<span class="sourceLineNo">1867</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1867"></a>
-<span class="sourceLineNo">1868</span> boolean inclusive, final int num) {<a name="line.1868"></a>
-<span class="sourceLineNo">1869</span> byte[][] ret = new byte[num + 2][];<a name="line.1869"></a>
-<span class="sourceLineNo">1870</span> int i = 0;<a name="line.1870"></a>
-<span class="sourceLineNo">1871</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1871"></a>
-<span class="sourceLineNo">1872</span> if (iter == null)<a name="line.1872"></a>
-<span class="sourceLineNo">1873</span> return null;<a name="line.1873"></a>
-<span class="sourceLineNo">1874</span> for (byte[] elem : iter) {<a name="line.1874"></a>
-<span class="sourceLineNo">1875</span> ret[i++] = elem;<a name="line.1875"></a>
-<span class="sourceLineNo">1876</span> }<a name="line.1876"></a>
-<span class="sourceLineNo">1877</span> return ret;<a name="line.1877"></a>
-<span class="sourceLineNo">1878</span> }<a name="line.1878"></a>
-<span class="sourceLineNo">1879</span><a name="line.1879"></a>
-<span class="sourceLineNo">1880</span> /**<a name="line.1880"></a>
-<span class="sourceLineNo">1881</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1881"></a>
-<span class="sourceLineNo">1882</span> */<a name="line.1882"></a>
-<span class="sourceLineNo">1883</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1883"></a>
-<span class="sourceLineNo">1884</span> final byte[] b, final int num)<a name="line.1884"></a>
-<span class="sourceLineNo">1885</span> {<a name="line.1885"></a>
-<span class="sourceLineNo">1886</span> return iterateOnSplits(a, b, false, num);<a name="line.1886"></a>
-<span class="sourceLineNo">1887</span> }<a name="line.1887"></a>
-<span class="sourceLineNo">1888</span><a name="line.1888"></a>
-<span class="sourceLineNo">1889</span> /**<a name="line.1889"></a>
-<span class="sourceLineNo">1890</span> * Iterate over keys within the passed range.<a name="line.1890"></a>
-<span class="sourceLineNo">1891</span> */<a name="line.1891"></a>
-<span class="sourceLineNo">1892</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1892"></a>
-<span class="sourceLineNo">1893</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1893"></a>
-<span class="sourceLineNo">1894</span> {<a name="line.1894"></a>
-<span class="sourceLineNo">1895</span> byte [] aPadded;<a name="line.1895"></a>
-<span class="sourceLineNo">1896</span> byte [] bPadded;<a name="line.1896"></a>
-<span class="sourceLineNo">1897</span> if (a.length < b.length) {<a name="line.1897"></a>
-<span class="sourceLineNo">1898</span> aPadded = padTail(a, b.length - a.length);<a name="line.1898"></a>
-<span class="sourceLineNo">1899</span> bPadded = b;<a name="line.1899"></a>
-<span class="sourceLineNo">1900</span> } else if (b.length < a.length) {<a name="line.1900"></a>
-<span class="sourceLineNo">1901</span> aPadded = a;<a name="line.1901"></a>
-<span class="sourceLineNo">1902</span> bPadded = padTail(b, a.length - b.length);<a name="line.1902"></a>
-<span class="sourceLineNo">1903</span> } else {<a name="line.1903"></a>
-<span class="sourceLineNo">1904</span> aPadded = a;<a name="line.1904"></a>
-<span class="sourceLineNo">1905</span> bPadded = b;<a name="line.1905"></a>
-<span class="sourceLineNo">1906</span> }<a name="line.1906"></a>
-<span class="sourceLineNo">1907</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1907"></a>
-<span class="sourceLineNo">1908</span> throw new IllegalArgumentException("b <= a");<a name="line.1908"></a>
-<span class="sourceLineNo">1909</span> }<a name="line.1909"></a>
-<span class="sourceLineNo">1910</span> if (num <= 0) {<a name="line.1910"></a>
-<span class="sourceLineNo">1911</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1911"></a>
-<span class="sourceLineNo">1912</span> }<a name="line.1912"></a>
-<span class="sourceLineNo">1913</span> byte [] prependHeader = {1, 0};<a name="line.1913"></a>
-<span class="sourceLineNo">1914</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1914"></a>
-<span class="sourceLineNo">1915</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1915"></a>
-<span class="sourceLineNo">1916</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1916"></a>
-<span class="sourceLineNo">1917</span> if (inclusive) {<a name="line.1917"></a>
-<span class="sourceLineNo">1918</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1918"></a>
-<span class="sourceLineNo">1919</span> }<a name="line.1919"></a>
-<span class="sourceLineNo">1920</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1920"></a>
-<span class="sourceLineNo">1921</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1921"></a>
-<span class="sourceLineNo">1922</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1922"></a>
-<span class="sourceLineNo">1923</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1923"></a>
-<span class="sourceLineNo">1924</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1924"></a>
-<span class="sourceLineNo">1925</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1925"></a>
-<span class="sourceLineNo">1926</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1926"></a>
-<span class="sourceLineNo">1927</span> }<a name="line.1927"></a>
-<span class="sourceLineNo">1928</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1928"></a>
-<span class="sourceLineNo">1929</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1929"></a>
-<span class="sourceLineNo">1930</span> }<a name="line.1930"></a>
-<span class="sourceLineNo">1931</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1931"></a>
-<span class="sourceLineNo">1932</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1932"></a>
-<span class="sourceLineNo">1933</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1933"></a>
-<span class="sourceLineNo">1934</span> }<a name="line.1934"></a>
-<span class="sourceLineNo">1935</span> final BigInteger intervalBI;<a name="line.1935"></a>
-<span class="sourceLineNo">1936</span> try {<a name="line.1936"></a>
-<span class="sourceLineNo">1937</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1937"></a>
-<span class="sourceLineNo">1938</span> } catch(Exception e) {<a name="line.1938"></a>
-<span class="sourceLineNo">1939</span> LOG.error("Exception caught during division", e);<a name="line.1939"></a>
-<span class="sourceLineNo">1940</span> return null;<a name="line.1940"></a>
-<span class="sourceLineNo">1941</span> }<a name="line.1941"></a>
-<span class="sourceLineNo">1942</span><a name="line.1942"></a>
-<span class="sourceLineNo">1943</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1943"></a>
-<span class="sourceLineNo">1944</span> private int i = -1;<a name="line.1944"></a>
+<span class="sourceLineNo">1777</span> System.arraycopy(arrays[i], 0, result, index, arrays[i].length);<a name="line.1777"></a>
+<span class="sourceLineNo">1778</span> index += arrays[i].length;<a name="line.1778"></a>
+<span class="sourceLineNo">1779</span> }<a name="line.1779"></a>
+<span class="sourceLineNo">1780</span> return result;<a name="line.1780"></a>
+<span class="sourceLineNo">1781</span> }<a name="line.1781"></a>
+<span class="sourceLineNo">1782</span><a name="line.1782"></a>
+<span class="sourceLineNo">1783</span> /**<a name="line.1783"></a>
+<span class="sourceLineNo">1784</span> * @param a array<a name="line.1784"></a>
+<span class="sourceLineNo">1785</span> * @param length amount of bytes to grab<a name="line.1785"></a>
+<span class="sourceLineNo">1786</span> * @return First <code>length</code> bytes from <code>a</code><a name="line.1786"></a>
+<span class="sourceLineNo">1787</span> */<a name="line.1787"></a>
+<span class="sourceLineNo">1788</span> public static byte [] head(final byte [] a, final int length) {<a name="line.1788"></a>
+<span class="sourceLineNo">1789</span> if (a.length < length) {<a name="line.1789"></a>
+<span class="sourceLineNo">1790</span> return null;<a name="line.1790"></a>
+<span class="sourceLineNo">1791</span> }<a name="line.1791"></a>
+<span class="sourceLineNo">1792</span> byte [] result = new byte[length];<a name="line.1792"></a>
+<span class="sourceLineNo">1793</span> System.arraycopy(a, 0, result, 0, length);<a name="line.1793"></a>
+<span class="sourceLineNo">1794</span> return result;<a name="line.1794"></a>
+<span class="sourceLineNo">1795</span> }<a name="line.1795"></a>
+<span class="sourceLineNo">1796</span><a name="line.1796"></a>
+<span class="sourceLineNo">1797</span> /**<a name="line.1797"></a>
+<span class="sourceLineNo">1798</span> * @param a array<a name="line.1798"></a>
+<span class="sourceLineNo">1799</span> * @param length amount of bytes to snarf<a name="line.1799"></a>
+<span class="sourceLineNo">1800</span> * @return Last <code>length</code> bytes from <code>a</code><a name="line.1800"></a>
+<span class="sourceLineNo">1801</span> */<a name="line.1801"></a>
+<span class="sourceLineNo">1802</span> public static byte [] tail(final byte [] a, final int length) {<a name="line.1802"></a>
+<span class="sourceLineNo">1803</span> if (a.length < length) {<a name="line.1803"></a>
+<span class="sourceLineNo">1804</span> return null;<a name="line.1804"></a>
+<span class="sourceLineNo">1805</span> }<a name="line.1805"></a>
+<span class="sourceLineNo">1806</span> byte [] result = new byte[length];<a name="line.1806"></a>
+<span class="sourceLineNo">1807</span> System.arraycopy(a, a.length - length, result, 0, length);<a name="line.1807"></a>
+<span class="sourceLineNo">1808</span> return result;<a name="line.1808"></a>
+<span class="sourceLineNo">1809</span> }<a name="line.1809"></a>
+<span class="sourceLineNo">1810</span><a name="line.1810"></a>
+<span class="sourceLineNo">1811</span> /**<a name="line.1811"></a>
+<span class="sourceLineNo">1812</span> * @param a array<a name="line.1812"></a>
+<span class="sourceLineNo">1813</span> * @param length new array size<a name="line.1813"></a>
+<span class="sourceLineNo">1814</span> * @return Value in <code>a</code> plus <code>length</code> prepended 0 bytes<a name="line.1814"></a>
+<span class="sourceLineNo">1815</span> */<a name="line.1815"></a>
+<span class="sourceLineNo">1816</span> public static byte [] padHead(final byte [] a, final int length) {<a name="line.1816"></a>
+<span class="sourceLineNo">1817</span> byte [] padding = new byte[length];<a name="line.1817"></a>
+<span class="sourceLineNo">1818</span> for (int i = 0; i < length; i++) {<a name="line.1818"></a>
+<span class="sourceLineNo">1819</span> padding[i] = 0;<a name="line.1819"></a>
+<span class="sourceLineNo">1820</span> }<a name="line.1820"></a>
+<span class="sourceLineNo">1821</span> return add(padding,a);<a name="line.1821"></a>
+<span class="sourceLineNo">1822</span> }<a name="line.1822"></a>
+<span class="sourceLineNo">1823</span><a name="line.1823"></a>
+<span class="sourceLineNo">1824</span> /**<a name="line.1824"></a>
+<span class="sourceLineNo">1825</span> * @param a array<a name="line.1825"></a>
+<span class="sourceLineNo">1826</span> * @param length new array size<a name="line.1826"></a>
+<span class="sourceLineNo">1827</span> * @return Value in <code>a</code> plus <code>length</code> appended 0 bytes<a name="line.1827"></a>
+<span class="sourceLineNo">1828</span> */<a name="line.1828"></a>
+<span class="sourceLineNo">1829</span> public static byte [] padTail(final byte [] a, final int length) {<a name="line.1829"></a>
+<span class="sourceLineNo">1830</span> byte [] padding = new byte[length];<a name="line.1830"></a>
+<span class="sourceLineNo">1831</span> for (int i = 0; i < length; i++) {<a name="line.1831"></a>
+<span class="sourceLineNo">1832</span> padding[i] = 0;<a name="line.1832"></a>
+<span class="sourceLineNo">1833</span> }<a name="line.1833"></a>
+<span class="sourceLineNo">1834</span> return add(a,padding);<a name="line.1834"></a>
+<span class="sourceLineNo">1835</span> }<a name="line.1835"></a>
+<span class="sourceLineNo">1836</span><a name="line.1836"></a>
+<span class="sourceLineNo">1837</span> /**<a name="line.1837"></a>
+<span class="sourceLineNo">1838</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1838"></a>
+<span class="sourceLineNo">1839</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1839"></a>
+<span class="sourceLineNo">1840</span> * @param a Beginning of range<a name="line.1840"></a>
+<span class="sourceLineNo">1841</span> * @param b End of range<a name="line.1841"></a>
+<span class="sourceLineNo">1842</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1842"></a>
+<span class="sourceLineNo">1843</span> * the range in two; i.e. one split.<a name="line.1843"></a>
+<span class="sourceLineNo">1844</span> * @return Array of dividing values<a name="line.1844"></a>
+<span class="sourceLineNo">1845</span> */<a name="line.1845"></a>
+<span class="sourceLineNo">1846</span> public static byte [][] split(final byte [] a, final byte [] b, final int num) {<a name="line.1846"></a>
+<span class="sourceLineNo">1847</span> return split(a, b, false, num);<a name="line.1847"></a>
+<span class="sourceLineNo">1848</span> }<a name="line.1848"></a>
+<span class="sourceLineNo">1849</span><a name="line.1849"></a>
+<span class="sourceLineNo">1850</span> /**<a name="line.1850"></a>
+<span class="sourceLineNo">1851</span> * Split passed range. Expensive operation relatively. Uses BigInteger math.<a name="line.1851"></a>
+<span class="sourceLineNo">1852</span> * Useful splitting ranges for MapReduce jobs.<a name="line.1852"></a>
+<span class="sourceLineNo">1853</span> * @param a Beginning of range<a name="line.1853"></a>
+<span class="sourceLineNo">1854</span> * @param b End of range<a name="line.1854"></a>
+<span class="sourceLineNo">1855</span> * @param inclusive Whether the end of range is prefix-inclusive or is<a name="line.1855"></a>
+<span class="sourceLineNo">1856</span> * considered an exclusive boundary. Automatic splits are generally exclusive<a name="line.1856"></a>
+<span class="sourceLineNo">1857</span> * and manual splits with an explicit range utilize an inclusive end of range.<a name="line.1857"></a>
+<span class="sourceLineNo">1858</span> * @param num Number of times to split range. Pass 1 if you want to split<a name="line.1858"></a>
+<span class="sourceLineNo">1859</span> * the range in two; i.e. one split.<a name="line.1859"></a>
+<span class="sourceLineNo">1860</span> * @return Array of dividing values<a name="line.1860"></a>
+<span class="sourceLineNo">1861</span> */<a name="line.1861"></a>
+<span class="sourceLineNo">1862</span> public static byte[][] split(final byte[] a, final byte[] b,<a name="line.1862"></a>
+<span class="sourceLineNo">1863</span> boolean inclusive, final int num) {<a name="line.1863"></a>
+<span class="sourceLineNo">1864</span> byte[][] ret = new byte[num + 2][];<a name="line.1864"></a>
+<span class="sourceLineNo">1865</span> int i = 0;<a name="line.1865"></a>
+<span class="sourceLineNo">1866</span> Iterable<byte[]> iter = iterateOnSplits(a, b, inclusive, num);<a name="line.1866"></a>
+<span class="sourceLineNo">1867</span> if (iter == null)<a name="line.1867"></a>
+<span class="sourceLineNo">1868</span> return null;<a name="line.1868"></a>
+<span class="sourceLineNo">1869</span> for (byte[] elem : iter) {<a name="line.1869"></a>
+<span class="sourceLineNo">1870</span> ret[i++] = elem;<a name="line.1870"></a>
+<span class="sourceLineNo">1871</span> }<a name="line.1871"></a>
+<span class="sourceLineNo">1872</span> return ret;<a name="line.1872"></a>
+<span class="sourceLineNo">1873</span> }<a name="line.1873"></a>
+<span class="sourceLineNo">1874</span><a name="line.1874"></a>
+<span class="sourceLineNo">1875</span> /**<a name="line.1875"></a>
+<span class="sourceLineNo">1876</span> * Iterate over keys within the passed range, splitting at an [a,b) boundary.<a name="line.1876"></a>
+<span class="sourceLineNo">1877</span> */<a name="line.1877"></a>
+<span class="sourceLineNo">1878</span> public static Iterable<byte[]> iterateOnSplits(final byte[] a,<a name="line.1878"></a>
+<span class="sourceLineNo">1879</span> final byte[] b, final int num)<a name="line.1879"></a>
+<span class="sourceLineNo">1880</span> {<a name="line.1880"></a>
+<span class="sourceLineNo">1881</span> return iterateOnSplits(a, b, false, num);<a name="line.1881"></a>
+<span class="sourceLineNo">1882</span> }<a name="line.1882"></a>
+<span class="sourceLineNo">1883</span><a name="line.1883"></a>
+<span class="sourceLineNo">1884</span> /**<a name="line.1884"></a>
+<span class="sourceLineNo">1885</span> * Iterate over keys within the passed range.<a name="line.1885"></a>
+<span class="sourceLineNo">1886</span> */<a name="line.1886"></a>
+<span class="sourceLineNo">1887</span> public static Iterable<byte[]> iterateOnSplits(<a name="line.1887"></a>
+<span class="sourceLineNo">1888</span> final byte[] a, final byte[]b, boolean inclusive, final int num)<a name="line.1888"></a>
+<span class="sourceLineNo">1889</span> {<a name="line.1889"></a>
+<span class="sourceLineNo">1890</span> byte [] aPadded;<a name="line.1890"></a>
+<span class="sourceLineNo">1891</span> byte [] bPadded;<a name="line.1891"></a>
+<span class="sourceLineNo">1892</span> if (a.length < b.length) {<a name="line.1892"></a>
+<span class="sourceLineNo">1893</span> aPadded = padTail(a, b.length - a.length);<a name="line.1893"></a>
+<span class="sourceLineNo">1894</span> bPadded = b;<a name="line.1894"></a>
+<span class="sourceLineNo">1895</span> } else if (b.length < a.length) {<a name="line.1895"></a>
+<span class="sourceLineNo">1896</span> aPadded = a;<a name="line.1896"></a>
+<span class="sourceLineNo">1897</span> bPadded = padTail(b, a.length - b.length);<a name="line.1897"></a>
+<span class="sourceLineNo">1898</span> } else {<a name="line.1898"></a>
+<span class="sourceLineNo">1899</span> aPadded = a;<a name="line.1899"></a>
+<span class="sourceLineNo">1900</span> bPadded = b;<a name="line.1900"></a>
+<span class="sourceLineNo">1901</span> }<a name="line.1901"></a>
+<span class="sourceLineNo">1902</span> if (compareTo(aPadded,bPadded) >= 0) {<a name="line.1902"></a>
+<span class="sourceLineNo">1903</span> throw new IllegalArgumentException("b <= a");<a name="line.1903"></a>
+<span class="sourceLineNo">1904</span> }<a name="line.1904"></a>
+<span class="sourceLineNo">1905</span> if (num <= 0) {<a name="line.1905"></a>
+<span class="sourceLineNo">1906</span> throw new IllegalArgumentException("num cannot be <= 0");<a name="line.1906"></a>
+<span class="sourceLineNo">1907</span> }<a name="line.1907"></a>
+<span class="sourceLineNo">1908</span> byte [] prependHeader = {1, 0};<a name="line.1908"></a>
+<span class="sourceLineNo">1909</span> final BigInteger startBI = new BigInteger(add(prependHeader, aPadded));<a name="line.1909"></a>
+<span class="sourceLineNo">1910</span> final BigInteger stopBI = new BigInteger(add(prependHeader, bPadded));<a name="line.1910"></a>
+<span class="sourceLineNo">1911</span> BigInteger diffBI = stopBI.subtract(startBI);<a name="line.1911"></a>
+<span class="sourceLineNo">1912</span> if (inclusive) {<a name="line.1912"></a>
+<span class="sourceLineNo">1913</span> diffBI = diffBI.add(BigInteger.ONE);<a name="line.1913"></a>
+<span class="sourceLineNo">1914</span> }<a name="line.1914"></a>
+<span class="sourceLineNo">1915</span> final BigInteger splitsBI = BigInteger.valueOf(num + 1);<a name="line.1915"></a>
+<span class="sourceLineNo">1916</span> //when diffBI < splitBI, use an additional byte to increase diffBI<a name="line.1916"></a>
+<span class="sourceLineNo">1917</span> if(diffBI.compareTo(splitsBI) < 0) {<a name="line.1917"></a>
+<span class="sourceLineNo">1918</span> byte[] aPaddedAdditional = new byte[aPadded.length+1];<a name="line.1918"></a>
+<span class="sourceLineNo">1919</span> byte[] bPaddedAdditional = new byte[bPadded.length+1];<a name="line.1919"></a>
+<span class="sourceLineNo">1920</span> for (int i = 0; i < aPadded.length; i++){<a name="line.1920"></a>
+<span class="sourceLineNo">1921</span> aPaddedAdditional[i] = aPadded[i];<a name="line.1921"></a>
+<span class="sourceLineNo">1922</span> }<a name="line.1922"></a>
+<span class="sourceLineNo">1923</span> for (int j = 0; j < bPadded.length; j++){<a name="line.1923"></a>
+<span class="sourceLineNo">1924</span> bPaddedAdditional[j] = bPadded[j];<a name="line.1924"></a>
+<span class="sourceLineNo">1925</span> }<a name="line.1925"></a>
+<span class="sourceLineNo">1926</span> aPaddedAdditional[aPadded.length] = 0;<a name="line.1926"></a>
+<span class="sourceLineNo">1927</span> bPaddedAdditional[bPadded.length] = 0;<a name="line.1927"></a>
+<span class="sourceLineNo">1928</span> return iterateOnSplits(aPaddedAdditional, bPaddedAdditional, inclusive, num);<a name="line.1928"></a>
+<span class="sourceLineNo">1929</span> }<a name="line.1929"></a>
+<span class="sourceLineNo">1930</span> final BigInteger intervalBI;<a name="line.1930"></a>
+<span class="sourceLineNo">1931</span> try {<a name="line.1931"></a>
+<span class="sourceLineNo">1932</span> intervalBI = diffBI.divide(splitsBI);<a name="line.1932"></a>
+<span class="sourceLineNo">1933</span> } catch(Exception e) {<a name="line.1933"></a>
+<span class="sourceLineNo">1934</span> LOG.error("Exception caught during division", e);<a name="line.1934"></a>
+<span class="sourceLineNo">1935</span> return null;<a name="line.1935"></a>
+<span class="sourceLineNo">1936</span> }<a name="line.1936"></a>
+<span class="sourceLineNo">1937</span><a name="line.1937"></a>
+<span class="sourceLineNo">1938</span> final Iterator<byte[]> iterator = new Iterator<byte[]>() {<a name="line.1938"></a>
+<span class="sourceLineNo">1939</span> private int i = -1;<a name="line.1939"></a>
+<span class="sourceLineNo">1940</span><a name="line.1940"></a>
+<span class="sourceLineNo">1941</span> @Override<a name="line.1941"></a>
+<span class="sourceLineNo">1942</span> public boolean hasNext() {<a name="line.1942"></a>
+<span class="sourceLineNo">1943</span> return i < num+1;<a name="line.1943"></a>
+<span class="sourceLineNo">1944</span> }<a name="line.1944"></a>
<span class="sourceLineNo">1945</span><a name="line.1945"></a>
<span class="sourceLineNo">1946</span> @Override<a name="line.1946"></a>
-<span class="sourceLineNo">1947</span> public boolean hasNext() {<a name="line.1947"></a>
-<span class="sourceLineNo">1948</span> return i < num+1;<a name="line.1948"></a>
-<span class="sourceLineNo">1949</span> }<a name="line.1949"></a>
-<span class="sourceLineNo">1950</span><a name="line.1950"></a>
-<span class="sourceLineNo">1951</span> @Override<a name="line.1951"></a>
-<span class="sourceLineNo">1952</span> public byte[] next() {<a name="line.1952"></a>
-<span class="sourceLineNo">1953</span> i++;<a name="line.1953"></a>
-<span class="sourceLineNo">1954</span> if (i == 0) return a;<a name="line.1954"></a>
-<span class="sourceLineNo">1955</span> if (i == num + 1) return b;<a name="line.1955"></a>
-<span class="sourceLineNo">1956</span><a name="line.1956"></a>
-<span class="sourceLineNo">1957</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1957"></a>
-<span class="sourceLineNo">1958</span> byte [] padded = curBI.toByteArray();<a name="line.1958"></a>
-<span class="sourceLineNo">1959</span> if (padded[1] == 0)<a name="line.1959"></a>
-<span class="sourceLineNo">1960</span> padded = tail(padded, padded.length - 2);<a name="line.1960"></a>
-<span class="sourceLineNo">1961</span> else<a name="line.1961"></a>
-<span class="sourceLineNo">1962</span> padded = tail(padded, padded.length - 1);<a name="line.1962"></a>
-<span class="sourceLineNo">1963</span> return padded;<a name="line.1963"></a>
+<span class="sourceLineNo">1947</span> public byte[] next() {<a name="line.1947"></a>
+<span class="sourceLineNo">1948</span> i++;<a name="line.1948"></a>
+<span class="sourceLineNo">1949</span> if (i == 0) return a;<a name="line.1949"></a>
+<span class="sourceLineNo">1950</span> if (i == num + 1) return b;<a name="line.1950"></a>
+<span class="sourceLineNo">1951</span><a name="line.1951"></a>
+<span class="sourceLineNo">1952</span> BigInteger curBI = startBI.add(intervalBI.multiply(BigInteger.valueOf(i)));<a name="line.1952"></a>
+<span class="sourceLineNo">1953</span> byte [] padded = curBI.toByteArray();<a name="line.1953"></a>
+<span class="sourceLineNo">1954</span> if (padded[1] == 0)<a name="line.1954"></a>
+<span class="sourceLineNo">1955</span> padded = tail(padded, padded.length - 2);<a name="line.1955"></a>
+<span class="sourceLineNo">1956</span> else<a name="line.1956"></a>
+<span class="sourceLineNo">1957</span> padded = tail(padded, padded.length - 1);<a name="line.1957"></a>
+<span class="sourceLineNo">1958</span> return padded;<a name="line.1958"></a>
+<span class="sourceLineNo">1959</span> }<a name="line.1959"></a>
+<span class="sourceLineNo">1960</span><a name="line.1960"></a>
+<span class="sourceLineNo">1961</span> @Override<a name="line.1961"></a>
+<span class="sourceLineNo">1962</span> public void remove() {<a name="line.1962"></a>
+<span class="sourceLineNo">1963</span> throw new UnsupportedOperationException();<a name="line.1963"></a>
<span class="sourceLineNo">1964</span> }<a name="line.1964"></a>
<span class="sourceLineNo">1965</span><a name="line.1965"></a>
-<span class="sourceLineNo">1966</span> @Override<a name="line.1966"></a>
-<span class="sourceLineNo">1967</span> public void remove() {<a name="line.1967"></a>
-<span class="sourceLineNo">1968</span> throw new UnsupportedOperationException();<a name="line.1968"></a>
-<span class="sourceLineNo">1969</span> }<a name="line.1969"></a>
-<span class="sourceLineNo">1970</span><a name="line.1970"></a>
-<span class="sourceLineNo">1971</span> };<a name="line.1971"></a>
-<span class="sourceLineNo">1972</span><a name="line.1972"></a>
-<span class="sourceLineNo">1973</span> return new Iterable<byte[]>() {<a name="line.1973"></a>
-<span class="sourceLineNo">1974</span> @Override<a name="line.1974"></a>
-<span class="sourceLineNo">1975</span> public Iterator<byte[]> iterator() {<a name="line.1975"></a>
-<span class="sourceLineNo">1976</span> return iterator;<a name="line.1976"></a>
-<span class="sourceLineNo">1977</span> }<a name="line.1977"></a>
-<span class="sourceLineNo">1978</span> };<a name="line.1978"></a>
-<span class="sourceLineNo">1979</span> }<a name="line.1979"></a>
-<span class="sourceLineNo">1980</span><a name="line.1980"></a>
-<span class="sourceLineNo">1981</span> /**<a name="line.1981"></a>
-<span class="sourceLineNo">1982</span> * @param bytes array to hash<a name="line.1982"></a>
-<span class="sourceLineNo">1983</span> * @param offset offset to start from<a name="line.1983"></a>
-<span class="sourceLineNo">1984</span> * @param length length to hash<a name="line.1984"></a>
-<span class="sourceLineNo">1985</span> * */<a name="line.1985"></a>
-<span class="sourceLineNo">1986</span> public static int hashCode(byte[] bytes, int offset, int length) {<a name="line.1986"></a>
-<span class="sourceLineNo">1987</span> int hash = 1;<a name="line.1987"></a>
-<span class="sourceLineNo">1988</span> for (int i = offset; i < offset + length; i++)<a name="line.1988"></a>
-<span class="sourceLineNo">1989</span> hash = (31 * hash) + (int) bytes[i];<a name="line.1989"></a>
-<span class="sourceLineNo">1990</span> return hash;<a name="line.1990"></a>
-<span class="sourceLineNo">1991</span> }<a name="line.1991"></a>
-<span class="sourceLineNo">1992</span><a name="line.1992"></a>
-<span class="sourceLineNo">1993</span> /**<a name="line.1993"></a>
-<span class="sourceLineNo">1994</span> * @param t operands<a name="line.1994"></a>
-<span class="sourceLineNo">1995</span> * @return Array of byte arrays made from passed array of Text<a name="line.1995"></a>
-<span class="sourceLineNo">1996</span> */<a name="line.1996"></a>
-<span class="sourceLineNo">1997</span> public static byte [][] toByteArrays(final String [] t) {<a name="line.1997"></a>
-<span class="sourceLineNo">1998</span> byte [][] result = new byte[t.length][];<a name="line.1998"></a>
-<span class="sourceLineNo">1999</span> for (int i = 0; i < t.length; i++) {<a name="line.1999"></a>
-<span class="sourceLineNo">2000</span> result[i] = Bytes.toBytes(t[i]);<a name="line.2000"></a>
-<span class="sourceLineNo">2001</span> }<a name="line.2001"></a>
-<span class="sourceLineNo">2002</span> return result;<a name="line.2002"></a>
-<span class="sourceLineNo">2003</span> }<a name="line.2003"></a>
-<span class="sourceLineNo">2004</span><a name="line.2004"></a>
-<span class="sourceLineNo">2005</span> /**<a name="line.2005"></a>
-<span class="sourceLineNo">2006</span> * @param t operands<a name="line.2006"></a>
-<span class="sourceLineNo">2007</span> * @return Array of binary byte arrays made from passed array of binary strings<a name="line.2007"></a>
-<span class="sourceLineNo">2008</span> */<a name="line.2008"></a>
-<span class="sourceLineNo">2009</span> public static byte[][] toBinaryByteArrays(final String[] t) {<a name="line.2009"></a>
-<span class="sourceLineNo">2010</span> byte[][] result = new byte[t.length][];<a name="line.2010"></a>
-<span class="sourceLineNo">2011</span> for (int i = 0; i < t.length; i++) {<a name="line.2011"></a>
-<span class="sourceLineNo">2012</span> result[i] = Bytes.toBytesBinary(t[i]);<a name="line.2012"></a>
-<span class="sourceLineNo">2013</span> }<a name="line.2013"></a>
-<span class="sourceLineNo">2014</span> return result;<a name="line.2014"></a>
-<span class="sourceLineNo">2015</span> }<a name="line.2015"></a>
-<span class="sourceLineNo">2016</span><a name="line.2016"></a>
-<span class="sourceLineNo">2017</span> /**<a name="line.2017"></a>
-<span class="sourceLineNo">2018</span> * @param column operand<a name="line.2018"></a>
-<span class="sourceLineNo">2019</span> * @return A byte array of a byte array where first and only entry is<a name="line.2019"></a>
-<span class="sourceLineNo">2020</span> * <code>column</code><a name="line.2020"></a>
-<span class="sourceLineNo">2021</span> */<a name="line.2021"></a>
-<span class="sourceLineNo">2022</span> public static byte [][] toByteArrays(final String column) {<a name="line.2022"></a>
-<span class="sourceLineNo">2023</span> return toByteArrays(toBytes(column));<a name="line.2023"></a>
-<span class="sourceLineNo">2024</span> }<a name="line.2024"></a>
-<span class="sourceLineNo">2025</span><a name="line.2025"></a>
-<span class="sourceLineNo">2026</span> /**<a name="line.2026"></a>
-<span class="sourceLineNo">2027</span> * @param column operand<a name="line.2027"></a>
-<span class="sourceLineNo">2028</span> * @return A byte array of a byte array where first and only entry is<a name="line.2028"></a>
-<span class="sourceLineNo">2029</span> * <code>column</code><a name="line.2029"></a>
-<span class="sourceLineNo">2030</span> */<a name="line.2030"></a>
-<span class="sourceLineNo">2031</span> public static byte [][] toByteArrays(final byte [] column) {<a name="line.2031"></a>
-<span class="sourceLineNo">2032</span> byte [][] result = new byte[1][];<a name="line.2032"></a>
-<span class="sourceLineNo">2033</span> result[0] = column;<a name="line.2033"></a>
-<span class="sourceLineNo">2034</span> return result;<a name="line.2034"></a>
-<span class="sourceLineNo">2035</span> }<a name="line.2035"></a>
-<span class="sourceLineNo">2036</span><a name="line.2036"></a>
-<span class="sourceLineNo">2037</span> /**<a name="line.2037"></a>
-<span class="sourceLineNo">2038</span> * Binary search for keys in indexes.<a name="line.2038"></a>
-<span class="sourceLineNo">2039</span> *<a name="line.2039"></a>
-<span class="sourceLineNo">2040</span> * @param arr array of byte arrays to search for<a name="line.2040"></a>
-<span class="sourceLineNo">2041</span> * @param key the key you want to find<a name="line.2041"></a>
-<span class="sourceLineNo">2042</span> * @param offset the offset in the key you want to find<a name="line.2042"></a>
-<span class="sourceLineNo">2043</span> * @param length the length of the key<a name="line.2043"></a>
-<span class="sourceLineNo">2044</span> * @param comparator a comparator to compare.<a name="line.2044"></a>
-<span class="sourceLineNo">2045</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2045"></a>
-<span class="sourceLineNo">2046</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2046"></a>
-<span class="sourceLineNo">2047</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2047"></a>
-<span class="sourceLineNo">2048</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2048"></a>
-<span class="sourceLineNo">2049</span> * means that this function can return 2N + 1 different values<a name="line.2049"></a>
-<span class="sourceLineNo">2050</span> * ranging from -(N + 1) to N - 1.<a name="line.2050"></a>
-<span class="sourceLineNo">2051</span> * @deprecated {@link Bytes#binarySearch(byte[][], byte[], int, int)}<a name="line.2051"></a>
-<span class="sourceLineNo">2052</span> */<a name="line.2052"></a>
-<span class="sourceLineNo">2053</span> @Deprecated<a name="line.2053"></a>
-<span class="sourceLineNo">2054</span> public static int binarySearch(byte [][]arr, byte []key, int offset,<a name="line.2054"></a>
-<span class="sourceLineNo">2055</span> int length, RawComparator<?> comparator) {<a name="line.2055"></a>
-<span class="sourceLineNo">2056</span> return binarySearch(arr, key, offset, length);<a name="line.2056"></a>
-<span class="sourceLineNo">2057</span> }<a name="line.2057"></a>
-<span class="sourceLineNo">2058</span><a name="line.2058"></a>
-<span class="sourceLineNo">2059</span> /**<a name="line.2059"></a>
-<span class="sourceLineNo">2060</span> * Binary search for keys in indexes using Bytes.BYTES_RAWCOMPARATOR.<a name="line.2060"></a>
-<span class="sourceLineNo">2061</span> *<a name="line.2061"></a>
-<span class="sourceLineNo">2062</span> * @param arr array of byte arrays to search for<a name="line.2062"></a>
-<span class="sourceLineNo">2063</span> * @param key the key you want to find<a name="line.2063"></a>
-<span class="sourceLineNo">2064</span> * @param offset the offset in the key you want to find<a name="line.2064"></a>
-<span class="sourceLineNo">2065</span> * @param length the length of the key<a name="line.2065"></a>
-<span class="sourceLineNo">2066</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2066"></a>
-<span class="sourceLineNo">2067</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2067"></a>
-<span class="sourceLineNo">2068</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2068"></a>
-<span class="sourceLineNo">2069</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2069"></a>
-<span class="sourceLineNo">2070</span> * means that this function can return 2N + 1 different values<a name="line.2070"></a>
-<span class="sourceLineNo">2071</span> * ranging from -(N + 1) to N - 1.<a name="line.2071"></a>
-<span class="sourceLineNo">2072</span> */<a name="line.2072"></a>
-<span class="sourceLineNo">2073</span> public static int binarySearch(byte[][] arr, byte[] key, int offset, int length) {<a name="line.2073"></a>
-<span class="sourceLineNo">2074</span> int low = 0;<a name="line.2074"></a>
-<span class="sourceLineNo">2075</span> int high = arr.length - 1;<a name="line.2075"></a>
-<span class="sourceLineNo">2076</span><a name="line.2076"></a>
-<span class="sourceLineNo">2077</span> while (low <= high) {<a name="line.2077"></a>
-<span class="sourceLineNo">2078</span> int mid = (low + high) >>> 1;<a name="line.2078"></a>
-<span class="sourceLineNo">2079</span> // we have to compare in this order, because the comparator order<a name="line.2079"></a>
-<span class="sourceLineNo">2080</span> // has special logic when the 'left side' is a special key.<a name="line.2080"></a>
-<span class="sourceLineNo">2081</span> int cmp = Bytes.BYTES_RAWCOMPARATOR<a name="line.2081"></a>
-<span class="sourceLineNo">2082</span> .compare(key, offset, length, arr[mid], 0, arr[mid].length);<a name="line.2082"></a>
-<span class="sourceLineNo">2083</span> // key lives above the midpoint<a name="line.2083"></a>
-<span class="sourceLineNo">2084</span> if (cmp > 0)<a name="line.2084"></a>
-<span class="sourceLineNo">2085</span> low = mid + 1;<a name="line.2085"></a>
-<span class="sourceLineNo">2086</span> // key lives below the midpoint<a name="line.2086"></a>
-<span class="sourceLineNo">2087</span> else if (cmp < 0)<a name="line.2087"></a>
-<span class="sourceLineNo">2088</span> high = mid - 1;<a name="line.2088"></a>
-<span class="sourceLineNo">2089</span> // BAM. how often does this really happen?<a name="line.2089"></a>
-<span class="sourceLineNo">2090</span> else<a name="line.2090"></a>
-<span class="sourceLineNo">2091</span> return mid;<a name="line.2091"></a>
-<span class="sourceLineNo">2092</span> }<a name="line.2092"></a>
-<span class="sourceLineNo">2093</span> return -(low + 1);<a name="line.2093"></a>
-<span class="sourceLineNo">2094</span> }<a name="line.2094"></a>
-<span class="sourceLineNo">2095</span><a name="line.2095"></a>
-<span class="sourceLineNo">2096</span> /**<a name="line.2096"></a>
-<span class="sourceLineNo">2097</span> * Binary search for keys in indexes.<a name="line.2097"></a>
-<span class="sourceLineNo">2098</span> *<a name="line.2098"></a>
-<span class="sourceLineNo">2099</span> * @param arr array of byte arrays to search for<a name="line.2099"></a>
-<span class="sourceLineNo">2100</span> * @param key the key you want to find<a name="line.2100"></a>
-<span class="sourceLineNo">2101</span> * @param comparator a comparator to compare.<a name="line.2101"></a>
-<span class="sourceLineNo">2102</span> * @return zero-based index of the key, if the key is present in the array.<a name="line.2102"></a>
-<span class="sourceLineNo">2103</span> * Otherwise, a value -(i + 1) such that the key is between arr[i -<a name="line.2103"></a>
-<span class="sourceLineNo">2104</span> * 1] and arr[i] non-inclusively, where i is in [0, i], if we define<a name="line.2104"></a>
-<span class="sourceLineNo">2105</span> * arr[-1] = -Inf and arr[N] = Inf for an N-element array. The above<a name="line.2105"></a>
-<span class="sourceLineNo">2106</span> * means that this function can return 2N + 1 different values<a name="line.2106"></a>
-<span class="sourceLineNo">2107</span> * ranging from -(N + 1) to N - 1.<a name="line.2107"></a>
-<span class="sourceLineNo">2108</span> * @return the index of the block<a name="line.2108"></a>
-<span class="sourceLineNo">2109</span> * @deprecated Use {@link Bytes#binarySearch(Cell[], Cell, CellComparator)}<a name="line.2109"></a>
-<span class="sourceLineNo">2110</span> */<a name="line.2110"></a>
-<span class="sourceLineNo">2111</span> @Deprecated<a name="line.2111"></a>
-<span class="sourceLineNo">2112</span> public static int binarySearch(byte[][] arr, Cell key, RawComparator<Cell> comparator) {<a name="line.2112"></a>
-<span class="sourceLineNo">2113</span> int low = 0;<a name="line.2113"></a>
-<span class="sourceLineNo">2114</span> int high = arr.length - 1;<a name="line.2114"></a>
-<span class="sourceLineNo">2115</span> KeyValue.KeyOnlyKeyValue r = new KeyValue.KeyOnlyKeyValue();<a name="line.2115"></a>
-<span class="sourceLineNo">2116</span> while (low <= high) {<a name="line.2116"></a>
-<span class="sourceLineNo">2117</span> int mid = (low+high) >>> 1;<a name="line.2117"></a>
-<span class="sourceLineNo">2118</sp
<TRUNCATED>
[18/19] hbase-site git commit: Published site at
82d554e3783372cc6b05489452c815b57c06f6cd.
Posted by gi...@apache.org.
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/f9332e6e/apidocs/src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html
----------------------------------------------------------------------
diff --git a/apidocs/src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html b/apidocs/src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html
index 5b83354..a4090da 100644
--- a/apidocs/src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html
+++ b/apidocs/src-html/org/apache/hadoop/hbase/util/ByteBufferUtils.html
@@ -709,373 +709,370 @@
<span class="sourceLineNo">701</span> }<a name="line.701"></a>
<span class="sourceLineNo">702</span><a name="line.702"></a>
<span class="sourceLineNo">703</span> static int compareToUnsafe(Object obj1, long o1, int l1, Object obj2, long o2, int l2) {<a name="line.703"></a>
-<span class="sourceLineNo">704</span> final int minLength = Math.min(l1, l2);<a name="line.704"></a>
-<span class="sourceLineNo">705</span> final int minWords = minLength / Bytes.SIZEOF_LONG;<a name="line.705"></a>
-<span class="sourceLineNo">706</span><a name="line.706"></a>
-<span class="sourceLineNo">707</span> /*<a name="line.707"></a>
-<span class="sourceLineNo">708</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a time is no slower than<a name="line.708"></a>
-<span class="sourceLineNo">709</span> * comparing 4 bytes at a time even on 32-bit. On the other hand, it is substantially faster on<a name="line.709"></a>
-<span class="sourceLineNo">710</span> * 64-bit.<a name="line.710"></a>
-<span class="sourceLineNo">711</span> */<a name="line.711"></a>
-<span class="sourceLineNo">712</span> int j = minWords << 3; // Same as minWords * SIZEOF_LONG<a name="line.712"></a>
-<span class="sourceLineNo">713</span> for (int i = 0; i < j; i += Bytes.SIZEOF_LONG) {<a name="line.713"></a>
-<span class="sourceLineNo">714</span> long lw = UnsafeAccess.theUnsafe.getLong(obj1, o1 + i);<a name="line.714"></a>
-<span class="sourceLineNo">715</span> long rw = UnsafeAccess.theUnsafe.getLong(obj2, o2 + i);<a name="line.715"></a>
-<span class="sourceLineNo">716</span> long diff = lw ^ rw;<a name="line.716"></a>
-<span class="sourceLineNo">717</span> if (diff != 0) {<a name="line.717"></a>
-<span class="sourceLineNo">718</span> return lessThanUnsignedLong(lw, rw) ? -1 : 1;<a name="line.718"></a>
-<span class="sourceLineNo">719</span> }<a name="line.719"></a>
-<span class="sourceLineNo">720</span> }<a name="line.720"></a>
-<span class="sourceLineNo">721</span> int offset = j;<a name="line.721"></a>
-<span class="sourceLineNo">722</span><a name="line.722"></a>
-<span class="sourceLineNo">723</span> if (minLength - offset >= Bytes.SIZEOF_INT) {<a name="line.723"></a>
-<span class="sourceLineNo">724</span> int il = UnsafeAccess.theUnsafe.getInt(obj1, o1 + offset);<a name="line.724"></a>
-<span class="sourceLineNo">725</span> int ir = UnsafeAccess.theUnsafe.getInt(obj2, o2 + offset);<a name="line.725"></a>
-<span class="sourceLineNo">726</span> if (il != ir) {<a name="line.726"></a>
-<span class="sourceLineNo">727</span> return lessThanUnsignedInt(il, ir) ? -1 : 1;<a name="line.727"></a>
-<span class="sourceLineNo">728</span> }<a name="line.728"></a>
-<span class="sourceLineNo">729</span> offset += Bytes.SIZEOF_INT;<a name="line.729"></a>
-<span class="sourceLineNo">730</span> }<a name="line.730"></a>
-<span class="sourceLineNo">731</span> if (minLength - offset >= Bytes.SIZEOF_SHORT) {<a name="line.731"></a>
-<span class="sourceLineNo">732</span> short sl = UnsafeAccess.theUnsafe.getShort(obj1, o1 + offset);<a name="line.732"></a>
-<span class="sourceLineNo">733</span> short sr = UnsafeAccess.theUnsafe.getShort(obj2, o2 + offset);<a name="line.733"></a>
-<span class="sourceLineNo">734</span> if (sl != sr) {<a name="line.734"></a>
-<span class="sourceLineNo">735</span> return lessThanUnsignedShort(sl, sr) ? -1 : 1;<a name="line.735"></a>
-<span class="sourceLineNo">736</span> }<a name="line.736"></a>
-<span class="sourceLineNo">737</span> offset += Bytes.SIZEOF_SHORT;<a name="line.737"></a>
-<span class="sourceLineNo">738</span> }<a name="line.738"></a>
-<span class="sourceLineNo">739</span> if (minLength - offset == 1) {<a name="line.739"></a>
-<span class="sourceLineNo">740</span> int a = (UnsafeAccess.theUnsafe.getByte(obj1, o1 + offset) & 0xff);<a name="line.740"></a>
-<span class="sourceLineNo">741</span> int b = (UnsafeAccess.theUnsafe.getByte(obj2, o2 + offset) & 0xff);<a name="line.741"></a>
-<span class="sourceLineNo">742</span> if (a != b) {<a name="line.742"></a>
-<span class="sourceLineNo">743</span> return a - b;<a name="line.743"></a>
-<span class="sourceLineNo">744</span> }<a name="line.744"></a>
-<span class="sourceLineNo">745</span> }<a name="line.745"></a>
-<span class="sourceLineNo">746</span> return l1 - l2;<a name="line.746"></a>
-<span class="sourceLineNo">747</span> }<a name="line.747"></a>
-<span class="sourceLineNo">748</span><a name="line.748"></a>
-<span class="sourceLineNo">749</span> /*<a name="line.749"></a>
-<span class="sourceLineNo">750</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.750"></a>
-<span class="sourceLineNo">751</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.751"></a>
-<span class="sourceLineNo">752</span> */<a name="line.752"></a>
-<span class="sourceLineNo">753</span> private static boolean lessThanUnsignedLong(long x1, long x2) {<a name="line.753"></a>
-<span class="sourceLineNo">754</span> if (UnsafeAccess.littleEndian) {<a name="line.754"></a>
-<span class="sourceLineNo">755</span> x1 = Long.reverseBytes(x1);<a name="line.755"></a>
-<span class="sourceLineNo">756</span> x2 = Long.reverseBytes(x2);<a name="line.756"></a>
-<span class="sourceLineNo">757</span> }<a name="line.757"></a>
-<span class="sourceLineNo">758</span> return (x1 + Long.MIN_VALUE) < (x2 + Long.MIN_VALUE);<a name="line.758"></a>
-<span class="sourceLineNo">759</span> }<a name="line.759"></a>
-<span class="sourceLineNo">760</span><a name="line.760"></a>
-<span class="sourceLineNo">761</span> /*<a name="line.761"></a>
-<span class="sourceLineNo">762</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.762"></a>
-<span class="sourceLineNo">763</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.763"></a>
-<span class="sourceLineNo">764</span> */<a name="line.764"></a>
-<span class="sourceLineNo">765</span> private static boolean lessThanUnsignedInt(int x1, int x2) {<a name="line.765"></a>
-<span class="sourceLineNo">766</span> if (UnsafeAccess.littleEndian) {<a name="line.766"></a>
-<span class="sourceLineNo">767</span> x1 = Integer.reverseBytes(x1);<a name="line.767"></a>
-<span class="sourceLineNo">768</span> x2 = Integer.reverseBytes(x2);<a name="line.768"></a>
-<span class="sourceLineNo">769</span> }<a name="line.769"></a>
-<span class="sourceLineNo">770</span> return (x1 & 0xffffffffL) < (x2 & 0xffffffffL);<a name="line.770"></a>
-<span class="sourceLineNo">771</span> }<a name="line.771"></a>
-<span class="sourceLineNo">772</span><a name="line.772"></a>
-<span class="sourceLineNo">773</span> /*<a name="line.773"></a>
-<span class="sourceLineNo">774</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.774"></a>
-<span class="sourceLineNo">775</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.775"></a>
-<span class="sourceLineNo">776</span> */<a name="line.776"></a>
-<span class="sourceLineNo">777</span> private static boolean lessThanUnsignedShort(short x1, short x2) {<a name="line.777"></a>
-<span class="sourceLineNo">778</span> if (UnsafeAccess.littleEndian) {<a name="line.778"></a>
-<span class="sourceLineNo">779</span> x1 = Short.reverseBytes(x1);<a name="line.779"></a>
-<span class="sourceLineNo">780</span> x2 = Short.reverseBytes(x2);<a name="line.780"></a>
-<span class="sourceLineNo">781</span> }<a name="line.781"></a>
-<span class="sourceLineNo">782</span> return (x1 & 0xffff) < (x2 & 0xffff);<a name="line.782"></a>
-<span class="sourceLineNo">783</span> }<a name="line.783"></a>
-<span class="sourceLineNo">784</span><a name="line.784"></a>
-<span class="sourceLineNo">785</span> /**<a name="line.785"></a>
-<span class="sourceLineNo">786</span> * Reads a short value at the given buffer's offset.<a name="line.786"></a>
-<span class="sourceLineNo">787</span> * @param buffer<a name="line.787"></a>
-<span class="sourceLineNo">788</span> * @param offset<a name="line.788"></a>
-<span class="sourceLineNo">789</span> * @return short value at offset<a name="line.789"></a>
-<span class="sourceLineNo">790</span> */<a name="line.790"></a>
-<span class="sourceLineNo">791</span> public static short toShort(ByteBuffer buffer, int offset) {<a name="line.791"></a>
-<span class="sourceLineNo">792</span> if (UNSAFE_UNALIGNED) {<a name="line.792"></a>
-<span class="sourceLineNo">793</span> return UnsafeAccess.toShort(buffer, offset);<a name="line.793"></a>
-<span class="sourceLineNo">794</span> } else {<a name="line.794"></a>
-<span class="sourceLineNo">795</span> return buffer.getShort(offset);<a name="line.795"></a>
-<span class="sourceLineNo">796</span> }<a name="line.796"></a>
-<span class="sourceLineNo">797</span> }<a name="line.797"></a>
-<span class="sourceLineNo">798</span><a name="line.798"></a>
-<span class="sourceLineNo">799</span> /**<a name="line.799"></a>
-<span class="sourceLineNo">800</span> * Reads an int value at the given buffer's current position. Also advances the buffer's position<a name="line.800"></a>
-<span class="sourceLineNo">801</span> */<a name="line.801"></a>
-<span class="sourceLineNo">802</span> public static int toInt(ByteBuffer buffer) {<a name="line.802"></a>
-<span class="sourceLineNo">803</span> if (UNSAFE_UNALIGNED) {<a name="line.803"></a>
-<span class="sourceLineNo">804</span> int i = UnsafeAccess.toInt(buffer, buffer.position());<a name="line.804"></a>
-<span class="sourceLineNo">805</span> buffer.position(buffer.position() + Bytes.SIZEOF_INT);<a name="line.805"></a>
-<span class="sourceLineNo">806</span> return i;<a name="line.806"></a>
-<span class="sourceLineNo">807</span> } else {<a name="line.807"></a>
-<span class="sourceLineNo">808</span> return buffer.getInt();<a name="line.808"></a>
-<span class="sourceLineNo">809</span> }<a name="line.809"></a>
-<span class="sourceLineNo">810</span> }<a name="line.810"></a>
-<span class="sourceLineNo">811</span><a name="line.811"></a>
-<span class="sourceLineNo">812</span> /**<a name="line.812"></a>
-<span class="sourceLineNo">813</span> * Reads an int value at the given buffer's offset.<a name="line.813"></a>
-<span class="sourceLineNo">814</span> * @param buffer<a name="line.814"></a>
-<span class="sourceLineNo">815</span> * @param offset<a name="line.815"></a>
-<span class="sourceLineNo">816</span> * @return int value at offset<a name="line.816"></a>
-<span class="sourceLineNo">817</span> */<a name="line.817"></a>
-<span class="sourceLineNo">818</span> public static int toInt(ByteBuffer buffer, int offset) {<a name="line.818"></a>
-<span class="sourceLineNo">819</span> if (UNSAFE_UNALIGNED) {<a name="line.819"></a>
-<span class="sourceLineNo">820</span> return UnsafeAccess.toInt(buffer, offset);<a name="line.820"></a>
-<span class="sourceLineNo">821</span> } else {<a name="line.821"></a>
-<span class="sourceLineNo">822</span> return buffer.getInt(offset);<a name="line.822"></a>
-<span class="sourceLineNo">823</span> }<a name="line.823"></a>
-<span class="sourceLineNo">824</span> }<a name="line.824"></a>
-<span class="sourceLineNo">825</span><a name="line.825"></a>
-<span class="sourceLineNo">826</span> /**<a name="line.826"></a>
-<span class="sourceLineNo">827</span> * Converts a ByteBuffer to an int value<a name="line.827"></a>
-<span class="sourceLineNo">828</span> *<a name="line.828"></a>
-<span class="sourceLineNo">829</span> * @param buf The ByteBuffer<a name="line.829"></a>
-<span class="sourceLineNo">830</span> * @param offset Offset to int value<a name="line.830"></a>
-<span class="sourceLineNo">831</span> * @param length Number of bytes used to store the int value.<a name="line.831"></a>
-<span class="sourceLineNo">832</span> * @return the int value<a name="line.832"></a>
-<span class="sourceLineNo">833</span> * @throws IllegalArgumentException<a name="line.833"></a>
-<span class="sourceLineNo">834</span> * if there's not enough bytes left in the buffer after the given offset<a name="line.834"></a>
-<span class="sourceLineNo">835</span> */<a name="line.835"></a>
-<span class="sourceLineNo">836</span> public static int readAsInt(ByteBuffer buf, int offset, final int length) {<a name="line.836"></a>
-<span class="sourceLineNo">837</span> if (offset + length > buf.limit()) {<a name="line.837"></a>
-<span class="sourceLineNo">838</span> throw new IllegalArgumentException("offset (" + offset + ") + length (" + length<a name="line.838"></a>
-<span class="sourceLineNo">839</span> + ") exceed the" + " limit of the buffer: " + buf.limit());<a name="line.839"></a>
-<span class="sourceLineNo">840</span> }<a name="line.840"></a>
-<span class="sourceLineNo">841</span> int n = 0;<a name="line.841"></a>
-<span class="sourceLineNo">842</span> for(int i = offset; i < (offset + length); i++) {<a name="line.842"></a>
-<span class="sourceLineNo">843</span> n <<= 8;<a name="line.843"></a>
-<span class="sourceLineNo">844</span> n ^= toByte(buf, i) & 0xFF;<a name="line.844"></a>
-<span class="sourceLineNo">845</span> }<a name="line.845"></a>
-<span class="sourceLineNo">846</span> return n;<a name="line.846"></a>
-<span class="sourceLineNo">847</span> }<a name="line.847"></a>
-<span class="sourceLineNo">848</span><a name="line.848"></a>
-<span class="sourceLineNo">849</span> /**<a name="line.849"></a>
-<span class="sourceLineNo">850</span> * Reads a long value at the given buffer's offset.<a name="line.850"></a>
-<span class="sourceLineNo">851</span> * @param buffer<a name="line.851"></a>
-<span class="sourceLineNo">852</span> * @param offset<a name="line.852"></a>
-<span class="sourceLineNo">853</span> * @return long value at offset<a name="line.853"></a>
-<span class="sourceLineNo">854</span> */<a name="line.854"></a>
-<span class="sourceLineNo">855</span> public static long toLong(ByteBuffer buffer, int offset) {<a name="line.855"></a>
-<span class="sourceLineNo">856</span> if (UNSAFE_UNALIGNED) {<a name="line.856"></a>
-<span class="sourceLineNo">857</span> return UnsafeAccess.toLong(buffer, offset);<a name="line.857"></a>
-<span class="sourceLineNo">858</span> } else {<a name="line.858"></a>
-<span class="sourceLineNo">859</span> return buffer.getLong(offset);<a name="line.859"></a>
-<span class="sourceLineNo">860</span> }<a name="line.860"></a>
-<span class="sourceLineNo">861</span> }<a name="line.861"></a>
-<span class="sourceLineNo">862</span><a name="line.862"></a>
-<span class="sourceLineNo">863</span> /**<a name="line.863"></a>
-<span class="sourceLineNo">864</span> * Put an int value out to the given ByteBuffer's current position in big-endian format.<a name="line.864"></a>
-<span class="sourceLineNo">865</span> * This also advances the position in buffer by int size.<a name="line.865"></a>
-<span class="sourceLineNo">866</span> * @param buffer the ByteBuffer to write to<a name="line.866"></a>
-<span class="sourceLineNo">867</span> * @param val int to write out<a name="line.867"></a>
-<span class="sourceLineNo">868</span> */<a name="line.868"></a>
-<span class="sourceLineNo">869</span> public static void putInt(ByteBuffer buffer, int val) {<a name="line.869"></a>
-<span class="sourceLineNo">870</span> if (UNSAFE_UNALIGNED) {<a name="line.870"></a>
-<span class="sourceLineNo">871</span> int newPos = UnsafeAccess.putInt(buffer, buffer.position(), val);<a name="line.871"></a>
-<span class="sourceLineNo">872</span> buffer.position(newPos);<a name="line.872"></a>
-<span class="sourceLineNo">873</span> } else {<a name="line.873"></a>
-<span class="sourceLineNo">874</span> buffer.putInt(val);<a name="line.874"></a>
-<span class="sourceLineNo">875</span> }<a name="line.875"></a>
-<span class="sourceLineNo">876</span> }<a name="line.876"></a>
-<span class="sourceLineNo">877</span><a name="line.877"></a>
-<span class="sourceLineNo">878</span> public static int putInt(ByteBuffer buffer, int index, int val) {<a name="line.878"></a>
-<span class="sourceLineNo">879</span> if (UNSAFE_UNALIGNED) {<a name="line.879"></a>
-<span class="sourceLineNo">880</span> return UnsafeAccess.putInt(buffer, index, val);<a name="line.880"></a>
-<span class="sourceLineNo">881</span> }<a name="line.881"></a>
-<span class="sourceLineNo">882</span> buffer.putInt(index, val);<a name="line.882"></a>
-<span class="sourceLineNo">883</span> return index + Bytes.SIZEOF_INT;<a name="line.883"></a>
-<span class="sourceLineNo">884</span> }<a name="line.884"></a>
-<span class="sourceLineNo">885</span><a name="line.885"></a>
-<span class="sourceLineNo">886</span> /**<a name="line.886"></a>
-<span class="sourceLineNo">887</span> * Reads a double value at the given buffer's offset.<a name="line.887"></a>
-<span class="sourceLineNo">888</span> * @param buffer<a name="line.888"></a>
-<span class="sourceLineNo">889</span> * @param offset offset where double is<a name="line.889"></a>
-<span class="sourceLineNo">890</span> * @return double value at offset<a name="line.890"></a>
-<span class="sourceLineNo">891</span> */<a name="line.891"></a>
-<span class="sourceLineNo">892</span> public static double toDouble(ByteBuffer buffer, int offset) {<a name="line.892"></a>
-<span class="sourceLineNo">893</span> return Double.longBitsToDouble(toLong(buffer, offset));<a name="line.893"></a>
-<span class="sourceLineNo">894</span> }<a name="line.894"></a>
-<span class="sourceLineNo">895</span><a name="line.895"></a>
-<span class="sourceLineNo">896</span> /**<a name="line.896"></a>
-<span class="sourceLineNo">897</span> * Reads a BigDecimal value at the given buffer's offset.<a name="line.897"></a>
-<span class="sourceLineNo">898</span> * @param buffer<a name="line.898"></a>
-<span class="sourceLineNo">899</span> * @param offset<a name="line.899"></a>
-<span class="sourceLineNo">900</span> * @return BigDecimal value at offset<a name="line.900"></a>
-<span class="sourceLineNo">901</span> */<a name="line.901"></a>
-<span class="sourceLineNo">902</span> public static BigDecimal toBigDecimal(ByteBuffer buffer, int offset, int length) {<a name="line.902"></a>
-<span class="sourceLineNo">903</span> if (buffer == null || length < Bytes.SIZEOF_INT + 1 ||<a name="line.903"></a>
-<span class="sourceLineNo">904</span> (offset + length > buffer.limit())) {<a name="line.904"></a>
-<span class="sourceLineNo">905</span> return null;<a name="line.905"></a>
-<span class="sourceLineNo">906</span> }<a name="line.906"></a>
-<span class="sourceLineNo">907</span><a name="line.907"></a>
-<span class="sourceLineNo">908</span> int scale = toInt(buffer, offset);<a name="line.908"></a>
-<span class="sourceLineNo">909</span> byte[] tcBytes = new byte[length - Bytes.SIZEOF_INT];<a name="line.909"></a>
-<span class="sourceLineNo">910</span> copyFromBufferToArray(tcBytes, buffer, offset + Bytes.SIZEOF_INT, 0, length - Bytes.SIZEOF_INT);<a name="line.910"></a>
-<span class="sourceLineNo">911</span> return new BigDecimal(new BigInteger(tcBytes), scale);<a name="line.911"></a>
-<span class="sourceLineNo">912</span> }<a name="line.912"></a>
-<span class="sourceLineNo">913</span><a name="line.913"></a>
-<span class="sourceLineNo">914</span> /**<a name="line.914"></a>
-<span class="sourceLineNo">915</span> * Put a short value out to the given ByteBuffer's current position in big-endian format.<a name="line.915"></a>
-<span class="sourceLineNo">916</span> * This also advances the position in buffer by short size.<a name="line.916"></a>
-<span class="sourceLineNo">917</span> * @param buffer the ByteBuffer to write to<a name="line.917"></a>
-<span class="sourceLineNo">918</span> * @param val short to write out<a name="line.918"></a>
-<span class="sourceLineNo">919</span> */<a name="line.919"></a>
-<span class="sourceLineNo">920</span> public static void putShort(ByteBuffer buffer, short val) {<a name="line.920"></a>
-<span class="sourceLineNo">921</span> if (UNSAFE_UNALIGNED) {<a name="line.921"></a>
-<span class="sourceLineNo">922</span> int newPos = UnsafeAccess.putShort(buffer, buffer.position(), val);<a name="line.922"></a>
-<span class="sourceLineNo">923</span> buffer.position(newPos);<a name="line.923"></a>
-<span class="sourceLineNo">924</span> } else {<a name="line.924"></a>
-<span class="sourceLineNo">925</span> buffer.putShort(val);<a name="line.925"></a>
-<span class="sourceLineNo">926</span> }<a name="line.926"></a>
-<span class="sourceLineNo">927</span> }<a name="line.927"></a>
-<span class="sourceLineNo">928</span><a name="line.928"></a>
-<span class="sourceLineNo">929</span> public static int putShort(ByteBuffer buffer, int index, short val) {<a name="line.929"></a>
-<span class="sourceLineNo">930</span> if (UNSAFE_UNALIGNED) {<a name="line.930"></a>
-<span class="sourceLineNo">931</span> return UnsafeAccess.putShort(buffer, index, val);<a name="line.931"></a>
-<span class="sourceLineNo">932</span> }<a name="line.932"></a>
-<span class="sourceLineNo">933</span> buffer.putShort(index, val);<a name="line.933"></a>
-<span class="sourceLineNo">934</span> return index + Bytes.SIZEOF_SHORT;<a name="line.934"></a>
-<span class="sourceLineNo">935</span> }<a name="line.935"></a>
-<span class="sourceLineNo">936</span><a name="line.936"></a>
-<span class="sourceLineNo">937</span> public static int putAsShort(ByteBuffer buf, int index, int val) {<a name="line.937"></a>
-<span class="sourceLineNo">938</span> buf.put(index + 1, (byte) val);<a name="line.938"></a>
-<span class="sourceLineNo">939</span> val >>= 8;<a name="line.939"></a>
-<span class="sourceLineNo">940</span> buf.put(index, (byte) val);<a name="line.940"></a>
-<span class="sourceLineNo">941</span> return index + Bytes.SIZEOF_SHORT;<a name="line.941"></a>
-<span class="sourceLineNo">942</span> }<a name="line.942"></a>
-<span class="sourceLineNo">943</span><a name="line.943"></a>
-<span class="sourceLineNo">944</span> /**<a name="line.944"></a>
-<span class="sourceLineNo">945</span> * Put a long value out to the given ByteBuffer's current position in big-endian format.<a name="line.945"></a>
-<span class="sourceLineNo">946</span> * This also advances the position in buffer by long size.<a name="line.946"></a>
-<span class="sourceLineNo">947</span> * @param buffer the ByteBuffer to write to<a name="line.947"></a>
-<span class="sourceLineNo">948</span> * @param val long to write out<a name="line.948"></a>
-<span class="sourceLineNo">949</span> */<a name="line.949"></a>
-<span class="sourceLineNo">950</span> public static void putLong(ByteBuffer buffer, long val) {<a name="line.950"></a>
-<span class="sourceLineNo">951</span> if (UNSAFE_UNALIGNED) {<a name="line.951"></a>
-<span class="sourceLineNo">952</span> int newPos = UnsafeAccess.putLong(buffer, buffer.position(), val);<a name="line.952"></a>
-<span class="sourceLineNo">953</span> buffer.position(newPos);<a name="line.953"></a>
-<span class="sourceLineNo">954</span> } else {<a name="line.954"></a>
-<span class="sourceLineNo">955</span> buffer.putLong(val);<a name="line.955"></a>
-<span class="sourceLineNo">956</span> }<a name="line.956"></a>
-<span class="sourceLineNo">957</span> }<a name="line.957"></a>
-<span class="sourceLineNo">958</span><a name="line.958"></a>
-<span class="sourceLineNo">959</span> public static int putLong(ByteBuffer buffer, int index, long val) {<a name="line.959"></a>
-<span class="sourceLineNo">960</span> if (UNSAFE_UNALIGNED) {<a name="line.960"></a>
-<span class="sourceLineNo">961</span> return UnsafeAccess.putLong(buffer, index, val);<a name="line.961"></a>
-<span class="sourceLineNo">962</span> }<a name="line.962"></a>
-<span class="sourceLineNo">963</span> buffer.putLong(index, val);<a name="line.963"></a>
-<span class="sourceLineNo">964</span> return index + Bytes.SIZEOF_LONG;<a name="line.964"></a>
-<span class="sourceLineNo">965</span> }<a name="line.965"></a>
-<span class="sourceLineNo">966</span><a name="line.966"></a>
-<span class="sourceLineNo">967</span> /**<a name="line.967"></a>
-<span class="sourceLineNo">968</span> * Copies the bytes from given array's offset to length part into the given buffer. Puts the bytes<a name="line.968"></a>
-<span class="sourceLineNo">969</span> * to buffer's current position. This also advances the position in the 'out' buffer by 'length'<a name="line.969"></a>
-<span class="sourceLineNo">970</span> * @param out<a name="line.970"></a>
-<span class="sourceLineNo">971</span> * @param in<a name="line.971"></a>
-<span class="sourceLineNo">972</span> * @param inOffset<a name="line.972"></a>
-<span class="sourceLineNo">973</span> * @param length<a name="line.973"></a>
-<span class="sourceLineNo">974</span> */<a name="line.974"></a>
-<span class="sourceLineNo">975</span> public static void copyFromArrayToBuffer(ByteBuffer out, byte[] in, int inOffset, int length) {<a name="line.975"></a>
-<span class="sourceLineNo">976</span> if (out.hasArray()) {<a name="line.976"></a>
-<span class="sourceLineNo">977</span> System.arraycopy(in, inOffset, out.array(), out.arrayOffset() + out.position(), length);<a name="line.977"></a>
-<span class="sourceLineNo">978</span> // Move the position in out by length<a name="line.978"></a>
-<span class="sourceLineNo">979</span> out.position(out.position() + length);<a name="line.979"></a>
-<span class="sourceLineNo">980</span> } else if (UNSAFE_AVAIL) {<a name="line.980"></a>
-<span class="sourceLineNo">981</span> UnsafeAccess.copy(in, inOffset, out, out.position(), length);<a name="line.981"></a>
-<span class="sourceLineNo">982</span> // Move the position in out by length<a name="line.982"></a>
-<span class="sourceLineNo">983</span> out.position(out.position() + length);<a name="line.983"></a>
-<span class="sourceLineNo">984</span> } else {<a name="line.984"></a>
-<span class="sourceLineNo">985</span> out.put(in, inOffset, length);<a name="line.985"></a>
-<span class="sourceLineNo">986</span> }<a name="line.986"></a>
-<span class="sourceLineNo">987</span> }<a name="line.987"></a>
-<span class="sourceLineNo">988</span><a name="line.988"></a>
-<span class="sourceLineNo">989</span> /**<a name="line.989"></a>
-<span class="sourceLineNo">990</span> * Copies bytes from given array's offset to length part into the given buffer. Puts the bytes<a name="line.990"></a>
-<span class="sourceLineNo">991</span> * to buffer's given position. This doesn't affact the position of buffer.<a name="line.991"></a>
-<span class="sourceLineNo">992</span> * @param out<a name="line.992"></a>
-<span class="sourceLineNo">993</span> * @param in<a name="line.993"></a>
-<span class="sourceLineNo">994</span> * @param inOffset<a name="line.994"></a>
-<span class="sourceLineNo">995</span> * @param length<a name="line.995"></a>
-<span class="sourceLineNo">996</span> */<a name="line.996"></a>
-<span class="sourceLineNo">997</span> public static void copyFromArrayToBuffer(ByteBuffer out, int outOffset, byte[] in, int inOffset,<a name="line.997"></a>
-<span class="sourceLineNo">998</span> int length) {<a name="line.998"></a>
-<span class="sourceLineNo">999</span> if (out.hasArray()) {<a name="line.999"></a>
-<span class="sourceLineNo">1000</span> System.arraycopy(in, inOffset, out.array(), out.arrayOffset() + outOffset, length);<a name="line.1000"></a>
-<span class="sourceLineNo">1001</span> } else if (UNSAFE_AVAIL) {<a name="line.1001"></a>
-<span class="sourceLineNo">1002</span> UnsafeAccess.copy(in, inOffset, out, outOffset, length);<a name="line.1002"></a>
-<span class="sourceLineNo">1003</span> } else {<a name="line.1003"></a>
-<span class="sourceLineNo">1004</span> ByteBuffer outDup = out.duplicate();<a name="line.1004"></a>
-<span class="sourceLineNo">1005</span> outDup.position(outOffset);<a name="line.1005"></a>
-<span class="sourceLineNo">1006</span> outDup.put(in, inOffset, length);<a name="line.1006"></a>
-<span class="sourceLineNo">1007</span> }<a name="line.1007"></a>
-<span class="sourceLineNo">1008</span> }<a name="line.1008"></a>
-<span class="sourceLineNo">1009</span><a name="line.1009"></a>
-<span class="sourceLineNo">1010</span> /**<a name="line.1010"></a>
-<span class="sourceLineNo">1011</span> * Copies specified number of bytes from given offset of 'in' ByteBuffer to<a name="line.1011"></a>
-<span class="sourceLineNo">1012</span> * the array. This doesn't affact the position of buffer.<a name="line.1012"></a>
-<span class="sourceLineNo">1013</span> * @param out<a name="line.1013"></a>
-<span class="sourceLineNo">1014</span> * @param in<a name="line.1014"></a>
-<span class="sourceLineNo">1015</span> * @param sourceOffset<a name="line.1015"></a>
-<span class="sourceLineNo">1016</span> * @param destinationOffset<a name="line.1016"></a>
-<span class="sourceLineNo">1017</span> * @param length<a name="line.1017"></a>
-<span class="sourceLineNo">1018</span> */<a name="line.1018"></a>
-<span class="sourceLineNo">1019</span> public static void copyFromBufferToArray(byte[] out, ByteBuffer in, int sourceOffset,<a name="line.1019"></a>
-<span class="sourceLineNo">1020</span> int destinationOffset, int length) {<a name="line.1020"></a>
-<span class="sourceLineNo">1021</span> if (in.hasArray()) {<a name="line.1021"></a>
-<span class="sourceLineNo">1022</span> System.arraycopy(in.array(), sourceOffset + in.arrayOffset(), out, destinationOffset, length);<a name="line.1022"></a>
-<span class="sourceLineNo">1023</span> } else if (UNSAFE_AVAIL) {<a name="line.1023"></a>
-<span class="sourceLineNo">1024</span> UnsafeAccess.copy(in, sourceOffset, out, destinationOffset, length);<a name="line.1024"></a>
-<span class="sourceLineNo">1025</span> } else {<a name="line.1025"></a>
-<span class="sourceLineNo">1026</span> ByteBuffer inDup = in.duplicate();<a name="line.1026"></a>
-<span class="sourceLineNo">1027</span> inDup.position(sourceOffset);<a name="line.1027"></a>
-<span class="sourceLineNo">1028</span> inDup.get(out, destinationOffset, length);<a name="line.1028"></a>
-<span class="sourceLineNo">1029</span> }<a name="line.1029"></a>
-<span class="sourceLineNo">1030</span> }<a name="line.1030"></a>
-<span class="sourceLineNo">1031</span><a name="line.1031"></a>
-<span class="sourceLineNo">1032</span> /**<a name="line.1032"></a>
-<span class="sourceLineNo">1033</span> * Similar to {@link Arrays#copyOfRange(byte[], int, int)}<a name="line.1033"></a>
-<span class="sourceLineNo">1034</span> * @param original the buffer from which the copy has to happen<a name="line.1034"></a>
-<span class="sourceLineNo">1035</span> * @param from the starting index<a name="line.1035"></a>
-<span class="sourceLineNo">1036</span> * @param to the ending index<a name="line.1036"></a>
-<span class="sourceLineNo">1037</span> * @return a byte[] created out of the copy<a name="line.1037"></a>
-<span class="sourceLineNo">1038</span> */<a name="line.1038"></a>
-<span class="sourceLineNo">1039</span> public static byte[] copyOfRange(ByteBuffer original, int from, int to) {<a name="line.1039"></a>
-<span class="sourceLineNo">1040</span> int newLength = to - from;<a name="line.1040"></a>
-<span class="sourceLineNo">1041</span> if (newLength < 0) throw new IllegalArgumentException(from + " > " + to);<a name="line.1041"></a>
-<span class="sourceLineNo">1042</span> byte[] copy = new byte[newLength];<a name="line.1042"></a>
-<span class="sourceLineNo">1043</span> ByteBufferUtils.copyFromBufferToArray(copy, original, from, 0, newLength);<a name="line.1043"></a>
-<span class="sourceLineNo">1044</span> return copy;<a name="line.1044"></a>
-<span class="sourceLineNo">1045</span> }<a name="line.1045"></a>
-<span class="sourceLineNo">1046</span><a name="line.1046"></a>
-<span class="sourceLineNo">1047</span> // For testing purpose<a name="line.1047"></a>
-<span class="sourceLineNo">1048</span> public static String toStringBinary(final ByteBuffer b, int off, int len) {<a name="line.1048"></a>
-<span class="sourceLineNo">1049</span> StringBuilder result = new StringBuilder();<a name="line.1049"></a>
-<span class="sourceLineNo">1050</span> // Just in case we are passed a 'len' that is > buffer length...<a name="line.1050"></a>
-<span class="sourceLineNo">1051</span> if (off >= b.capacity())<a name="line.1051"></a>
-<span class="sourceLineNo">1052</span> return result.toString();<a name="line.1052"></a>
-<span class="sourceLineNo">1053</span> if (off + len > b.capacity())<a name="line.1053"></a>
-<span class="sourceLineNo">1054</span> len = b.capacity() - off;<a name="line.1054"></a>
-<span class="sourceLineNo">1055</span> for (int i = off; i < off + len; ++i) {<a name="line.1055"></a>
-<span class="sourceLineNo">1056</span> int ch = b.get(i) & 0xFF;<a name="line.1056"></a>
-<span class="sourceLineNo">1057</span> if ((ch >= '0' && ch <= '9') || (ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z')<a name="line.1057"></a>
-<span class="sourceLineNo">1058</span> || " `~!@#$%^&*()-_=+[]{}|;:'\",.<>/?".indexOf(ch) >= 0) {<a name="line.1058"></a>
-<span class="sourceLineNo">1059</span> result.append((char) ch);<a name="line.1059"></a>
-<span class="sourceLineNo">1060</span> } else {<a name="line.1060"></a>
-<span class="sourceLineNo">1061</span> result.append(String.format("\\x%02X", ch));<a name="line.1061"></a>
-<span class="sourceLineNo">1062</span> }<a name="line.1062"></a>
-<span class="sourceLineNo">1063</span> }<a name="line.1063"></a>
-<span class="sourceLineNo">1064</span> return result.toString();<a name="line.1064"></a>
-<span class="sourceLineNo">1065</span> }<a name="line.1065"></a>
-<span class="sourceLineNo">1066</span><a name="line.1066"></a>
-<span class="sourceLineNo">1067</span> public static String toStringBinary(final ByteBuffer b) {<a name="line.1067"></a>
-<span class="sourceLineNo">1068</span> return toStringBinary(b, 0, b.capacity());<a name="line.1068"></a>
-<span class="sourceLineNo">1069</span> }<a name="line.1069"></a>
-<span class="sourceLineNo">1070</span>}<a name="line.1070"></a>
+<span class="sourceLineNo">704</span> final int stride = 8;<a name="line.704"></a>
+<span class="sourceLineNo">705</span> final int minLength = Math.min(l1, l2);<a name="line.705"></a>
+<span class="sourceLineNo">706</span> int strideLimit = minLength & ~(stride - 1);<a name="line.706"></a>
+<span class="sourceLineNo">707</span> int i;<a name="line.707"></a>
+<span class="sourceLineNo">708</span><a name="line.708"></a>
+<span class="sourceLineNo">709</span> /*<a name="line.709"></a>
+<span class="sourceLineNo">710</span> * Compare 8 bytes at a time. Benchmarking shows comparing 8 bytes at a time is no slower than<a name="line.710"></a>
+<span class="sourceLineNo">711</span> * comparing 4 bytes at a time even on 32-bit. On the other hand, it is substantially faster on<a name="line.711"></a>
+<span class="sourceLineNo">712</span> * 64-bit.<a name="line.712"></a>
+<span class="sourceLineNo">713</span> */<a name="line.713"></a>
+<span class="sourceLineNo">714</span> for (i = 0; i < strideLimit; i += stride) {<a name="line.714"></a>
+<span class="sourceLineNo">715</span> long lw = UnsafeAccess.theUnsafe.getLong(obj1, o1 + (long) i);<a name="line.715"></a>
+<span class="sourceLineNo">716</span> long rw = UnsafeAccess.theUnsafe.getLong(obj2, o2 + (long) i);<a name="line.716"></a>
+<span class="sourceLineNo">717</span> if (lw != rw) {<a name="line.717"></a>
+<span class="sourceLineNo">718</span> if (!UnsafeAccess.littleEndian) {<a name="line.718"></a>
+<span class="sourceLineNo">719</span> return ((lw + Long.MIN_VALUE) < (rw + Long.MIN_VALUE)) ? -1 : 1;<a name="line.719"></a>
+<span class="sourceLineNo">720</span> }<a name="line.720"></a>
+<span class="sourceLineNo">721</span><a name="line.721"></a>
+<span class="sourceLineNo">722</span> /*<a name="line.722"></a>
+<span class="sourceLineNo">723</span> * We want to compare only the first index where left[index] != right[index]. This<a name="line.723"></a>
+<span class="sourceLineNo">724</span> * corresponds to the least significant nonzero byte in lw ^ rw, since lw and rw are<a name="line.724"></a>
+<span class="sourceLineNo">725</span> * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant<a name="line.725"></a>
+<span class="sourceLineNo">726</span> * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get<a name="line.726"></a>
+<span class="sourceLineNo">727</span> * that least significant nonzero byte. This comparison logic is based on UnsignedBytes<a name="line.727"></a>
+<span class="sourceLineNo">728</span> * from guava v21<a name="line.728"></a>
+<span class="sourceLineNo">729</span> */<a name="line.729"></a>
+<span class="sourceLineNo">730</span> int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;<a name="line.730"></a>
+<span class="sourceLineNo">731</span> return ((int) ((lw >>> n) & 0xFF)) - ((int) ((rw >>> n) & 0xFF));<a name="line.731"></a>
+<span class="sourceLineNo">732</span> }<a name="line.732"></a>
+<span class="sourceLineNo">733</span> }<a name="line.733"></a>
+<span class="sourceLineNo">734</span><a name="line.734"></a>
+<span class="sourceLineNo">735</span> // The epilogue to cover the last (minLength % stride) elements.<a name="line.735"></a>
+<span class="sourceLineNo">736</span> for (; i < minLength; i++) {<a name="line.736"></a>
+<span class="sourceLineNo">737</span> int il = (UnsafeAccess.theUnsafe.getByte(obj1, o1 + i) & 0xFF);<a name="line.737"></a>
+<span class="sourceLineNo">738</span> int ir = (UnsafeAccess.theUnsafe.getByte(obj2, o2 + i) & 0xFF);<a name="line.738"></a>
+<span class="sourceLineNo">739</span> if (il != ir) {<a name="line.739"></a>
+<span class="sourceLineNo">740</span> return il - ir;<a name="line.740"></a>
+<span class="sourceLineNo">741</span> }<a name="line.741"></a>
+<span class="sourceLineNo">742</span> }<a name="line.742"></a>
+<span class="sourceLineNo">743</span> return l1 - l2;<a name="line.743"></a>
+<span class="sourceLineNo">744</span> }<a name="line.744"></a>
+<span class="sourceLineNo">745</span><a name="line.745"></a>
+<span class="sourceLineNo">746</span> /*<a name="line.746"></a>
+<span class="sourceLineNo">747</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.747"></a>
+<span class="sourceLineNo">748</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.748"></a>
+<span class="sourceLineNo">749</span> */<a name="line.749"></a>
+<span class="sourceLineNo">750</span> private static boolean lessThanUnsignedLong(long x1, long x2) {<a name="line.750"></a>
+<span class="sourceLineNo">751</span> if (UnsafeAccess.littleEndian) {<a name="line.751"></a>
+<span class="sourceLineNo">752</span> x1 = Long.reverseBytes(x1);<a name="line.752"></a>
+<span class="sourceLineNo">753</span> x2 = Long.reverseBytes(x2);<a name="line.753"></a>
+<span class="sourceLineNo">754</span> }<a name="line.754"></a>
+<span class="sourceLineNo">755</span> return (x1 + Long.MIN_VALUE) < (x2 + Long.MIN_VALUE);<a name="line.755"></a>
+<span class="sourceLineNo">756</span> }<a name="line.756"></a>
+<span class="sourceLineNo">757</span><a name="line.757"></a>
+<span class="sourceLineNo">758</span> /*<a name="line.758"></a>
+<span class="sourceLineNo">759</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.759"></a>
+<span class="sourceLineNo">760</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.760"></a>
+<span class="sourceLineNo">761</span> */<a name="line.761"></a>
+<span class="sourceLineNo">762</span> private static boolean lessThanUnsignedInt(int x1, int x2) {<a name="line.762"></a>
+<span class="sourceLineNo">763</span> if (UnsafeAccess.littleEndian) {<a name="line.763"></a>
+<span class="sourceLineNo">764</span> x1 = Integer.reverseBytes(x1);<a name="line.764"></a>
+<span class="sourceLineNo">765</span> x2 = Integer.reverseBytes(x2);<a name="line.765"></a>
+<span class="sourceLineNo">766</span> }<a name="line.766"></a>
+<span class="sourceLineNo">767</span> return (x1 & 0xffffffffL) < (x2 & 0xffffffffL);<a name="line.767"></a>
+<span class="sourceLineNo">768</span> }<a name="line.768"></a>
+<span class="sourceLineNo">769</span><a name="line.769"></a>
+<span class="sourceLineNo">770</span> /*<a name="line.770"></a>
+<span class="sourceLineNo">771</span> * Both values are passed as is read by Unsafe. When platform is Little Endian, have to convert<a name="line.771"></a>
+<span class="sourceLineNo">772</span> * to corresponding Big Endian value and then do compare. We do all writes in Big Endian format.<a name="line.772"></a>
+<span class="sourceLineNo">773</span> */<a name="line.773"></a>
+<span class="sourceLineNo">774</span> private static boolean lessThanUnsignedShort(short x1, short x2) {<a name="line.774"></a>
+<span class="sourceLineNo">775</span> if (UnsafeAccess.littleEndian) {<a name="line.775"></a>
+<span class="sourceLineNo">776</span> x1 = Short.reverseBytes(x1);<a name="line.776"></a>
+<span class="sourceLineNo">777</span> x2 = Short.reverseBytes(x2);<a name="line.777"></a>
+<span class="sourceLineNo">778</span> }<a name="line.778"></a>
+<span class="sourceLineNo">779</span> return (x1 & 0xffff) < (x2 & 0xffff);<a name="line.779"></a>
+<span class="sourceLineNo">780</span> }<a name="line.780"></a>
+<span class="sourceLineNo">781</span><a name="line.781"></a>
+<span class="sourceLineNo">782</span> /**<a name="line.782"></a>
+<span class="sourceLineNo">783</span> * Reads a short value at the given buffer's offset.<a name="line.783"></a>
+<span class="sourceLineNo">784</span> * @param buffer<a name="line.784"></a>
+<span class="sourceLineNo">785</span> * @param offset<a name="line.785"></a>
+<span class="sourceLineNo">786</span> * @return short value at offset<a name="line.786"></a>
+<span class="sourceLineNo">787</span> */<a name="line.787"></a>
+<span class="sourceLineNo">788</span> public static short toShort(ByteBuffer buffer, int offset) {<a name="line.788"></a>
+<span class="sourceLineNo">789</span> if (UNSAFE_UNALIGNED) {<a name="line.789"></a>
+<span class="sourceLineNo">790</span> return UnsafeAccess.toShort(buffer, offset);<a name="line.790"></a>
+<span class="sourceLineNo">791</span> } else {<a name="line.791"></a>
+<span class="sourceLineNo">792</span> return buffer.getShort(offset);<a name="line.792"></a>
+<span class="sourceLineNo">793</span> }<a name="line.793"></a>
+<span class="sourceLineNo">794</span> }<a name="line.794"></a>
+<span class="sourceLineNo">795</span><a name="line.795"></a>
+<span class="sourceLineNo">796</span> /**<a name="line.796"></a>
+<span class="sourceLineNo">797</span> * Reads an int value at the given buffer's current position. Also advances the buffer's position<a name="line.797"></a>
+<span class="sourceLineNo">798</span> */<a name="line.798"></a>
+<span class="sourceLineNo">799</span> public static int toInt(ByteBuffer buffer) {<a name="line.799"></a>
+<span class="sourceLineNo">800</span> if (UNSAFE_UNALIGNED) {<a name="line.800"></a>
+<span class="sourceLineNo">801</span> int i = UnsafeAccess.toInt(buffer, buffer.position());<a name="line.801"></a>
+<span class="sourceLineNo">802</span> buffer.position(buffer.position() + Bytes.SIZEOF_INT);<a name="line.802"></a>
+<span class="sourceLineNo">803</span> return i;<a name="line.803"></a>
+<span class="sourceLineNo">804</span> } else {<a name="line.804"></a>
+<span class="sourceLineNo">805</span> return buffer.getInt();<a name="line.805"></a>
+<span class="sourceLineNo">806</span> }<a name="line.806"></a>
+<span class="sourceLineNo">807</span> }<a name="line.807"></a>
+<span class="sourceLineNo">808</span><a name="line.808"></a>
+<span class="sourceLineNo">809</span> /**<a name="line.809"></a>
+<span class="sourceLineNo">810</span> * Reads an int value at the given buffer's offset.<a name="line.810"></a>
+<span class="sourceLineNo">811</span> * @param buffer<a name="line.811"></a>
+<span class="sourceLineNo">812</span> * @param offset<a name="line.812"></a>
+<span class="sourceLineNo">813</span> * @return int value at offset<a name="line.813"></a>
+<span class="sourceLineNo">814</span> */<a name="line.814"></a>
+<span class="sourceLineNo">815</span> public static int toInt(ByteBuffer buffer, int offset) {<a name="line.815"></a>
+<span class="sourceLineNo">816</span> if (UNSAFE_UNALIGNED) {<a name="line.816"></a>
+<span class="sourceLineNo">817</span> return UnsafeAccess.toInt(buffer, offset);<a name="line.817"></a>
+<span class="sourceLineNo">818</span> } else {<a name="line.818"></a>
+<span class="sourceLineNo">819</span> return buffer.getInt(offset);<a name="line.819"></a>
+<span class="sourceLineNo">820</span> }<a name="line.820"></a>
+<span class="sourceLineNo">821</span> }<a name="line.821"></a>
+<span class="sourceLineNo">822</span><a name="line.822"></a>
+<span class="sourceLineNo">823</span> /**<a name="line.823"></a>
+<span class="sourceLineNo">824</span> * Converts a ByteBuffer to an int value<a name="line.824"></a>
+<span class="sourceLineNo">825</span> *<a name="line.825"></a>
+<span class="sourceLineNo">826</span> * @param buf The ByteBuffer<a name="line.826"></a>
+<span class="sourceLineNo">827</span> * @param offset Offset to int value<a name="line.827"></a>
+<span class="sourceLineNo">828</span> * @param length Number of bytes used to store the int value.<a name="line.828"></a>
+<span class="sourceLineNo">829</span> * @return the int value<a name="line.829"></a>
+<span class="sourceLineNo">830</span> * @throws IllegalArgumentException<a name="line.830"></a>
+<span class="sourceLineNo">831</span> * if there's not enough bytes left in the buffer after the given offset<a name="line.831"></a>
+<span class="sourceLineNo">832</span> */<a name="line.832"></a>
+<span class="sourceLineNo">833</span> public static int readAsInt(ByteBuffer buf, int offset, final int length) {<a name="line.833"></a>
+<span class="sourceLineNo">834</span> if (offset + length > buf.limit()) {<a name="line.834"></a>
+<span class="sourceLineNo">835</span> throw new IllegalArgumentException("offset (" + offset + ") + length (" + length<a name="line.835"></a>
+<span class="sourceLineNo">836</span> + ") exceed the" + " limit of the buffer: " + buf.limit());<a name="line.836"></a>
+<span class="sourceLineNo">837</span> }<a name="line.837"></a>
+<span class="sourceLineNo">838</span> int n = 0;<a name="line.838"></a>
+<span class="sourceLineNo">839</span> for(int i = offset; i < (offset + length); i++) {<a name="line.839"></a>
+<span class="sourceLineNo">840</span> n <<= 8;<a name="line.840"></a>
+<span class="sourceLineNo">841</span> n ^= toByte(buf, i) & 0xFF;<a name="line.841"></a>
+<span class="sourceLineNo">842</span> }<a name="line.842"></a>
+<span class="sourceLineNo">843</span> return n;<a name="line.843"></a>
+<span class="sourceLineNo">844</span> }<a name="line.844"></a>
+<span class="sourceLineNo">845</span><a name="line.845"></a>
+<span class="sourceLineNo">846</span> /**<a name="line.846"></a>
+<span class="sourceLineNo">847</span> * Reads a long value at the given buffer's offset.<a name="line.847"></a>
+<span class="sourceLineNo">848</span> * @param buffer<a name="line.848"></a>
+<span class="sourceLineNo">849</span> * @param offset<a name="line.849"></a>
+<span class="sourceLineNo">850</span> * @return long value at offset<a name="line.850"></a>
+<span class="sourceLineNo">851</span> */<a name="line.851"></a>
+<span class="sourceLineNo">852</span> public static long toLong(ByteBuffer buffer, int offset) {<a name="line.852"></a>
+<span class="sourceLineNo">853</span> if (UNSAFE_UNALIGNED) {<a name="line.853"></a>
+<span class="sourceLineNo">854</span> return UnsafeAccess.toLong(buffer, offset);<a name="line.854"></a>
+<span class="sourceLineNo">855</span> } else {<a name="line.855"></a>
+<span class="sourceLineNo">856</span> return buffer.getLong(offset);<a name="line.856"></a>
+<span class="sourceLineNo">857</span> }<a name="line.857"></a>
+<span class="sourceLineNo">858</span> }<a name="line.858"></a>
+<span class="sourceLineNo">859</span><a name="line.859"></a>
+<span class="sourceLineNo">860</span> /**<a name="line.860"></a>
+<span class="sourceLineNo">861</span> * Put an int value out to the given ByteBuffer's current position in big-endian format.<a name="line.861"></a>
+<span class="sourceLineNo">862</span> * This also advances the position in buffer by int size.<a name="line.862"></a>
+<span class="sourceLineNo">863</span> * @param buffer the ByteBuffer to write to<a name="line.863"></a>
+<span class="sourceLineNo">864</span> * @param val int to write out<a name="line.864"></a>
+<span class="sourceLineNo">865</span> */<a name="line.865"></a>
+<span class="sourceLineNo">866</span> public static void putInt(ByteBuffer buffer, int val) {<a name="line.866"></a>
+<span class="sourceLineNo">867</span> if (UNSAFE_UNALIGNED) {<a name="line.867"></a>
+<span class="sourceLineNo">868</span> int newPos = UnsafeAccess.putInt(buffer, buffer.position(), val);<a name="line.868"></a>
+<span class="sourceLineNo">869</span> buffer.position(newPos);<a name="line.869"></a>
+<span class="sourceLineNo">870</span> } else {<a name="line.870"></a>
+<span class="sourceLineNo">871</span> buffer.putInt(val);<a name="line.871"></a>
+<span class="sourceLineNo">872</span> }<a name="line.872"></a>
+<span class="sourceLineNo">873</span> }<a name="line.873"></a>
+<span class="sourceLineNo">874</span><a name="line.874"></a>
+<span class="sourceLineNo">875</span> public static int putInt(ByteBuffer buffer, int index, int val) {<a name="line.875"></a>
+<span class="sourceLineNo">876</span> if (UNSAFE_UNALIGNED) {<a name="line.876"></a>
+<span class="sourceLineNo">877</span> return UnsafeAccess.putInt(buffer, index, val);<a name="line.877"></a>
+<span class="sourceLineNo">878</span> }<a name="line.878"></a>
+<span class="sourceLineNo">879</span> buffer.putInt(index, val);<a name="line.879"></a>
+<span class="sourceLineNo">880</span> return index + Bytes.SIZEOF_INT;<a name="line.880"></a>
+<span class="sourceLineNo">881</span> }<a name="line.881"></a>
+<span class="sourceLineNo">882</span><a name="line.882"></a>
+<span class="sourceLineNo">883</span> /**<a name="line.883"></a>
+<span class="sourceLineNo">884</span> * Reads a double value at the given buffer's offset.<a name="line.884"></a>
+<span class="sourceLineNo">885</span> * @param buffer<a name="line.885"></a>
+<span class="sourceLineNo">886</span> * @param offset offset where double is<a name="line.886"></a>
+<span class="sourceLineNo">887</span> * @return double value at offset<a name="line.887"></a>
+<span class="sourceLineNo">888</span> */<a name="line.888"></a>
+<span class="sourceLineNo">889</span> public static double toDouble(ByteBuffer buffer, int offset) {<a name="line.889"></a>
+<span class="sourceLineNo">890</span> return Double.longBitsToDouble(toLong(buffer, offset));<a name="line.890"></a>
+<span class="sourceLineNo">891</span> }<a name="line.891"></a>
+<span class="sourceLineNo">892</span><a name="line.892"></a>
+<span class="sourceLineNo">893</span> /**<a name="line.893"></a>
+<span class="sourceLineNo">894</span> * Reads a BigDecimal value at the given buffer's offset.<a name="line.894"></a>
+<span class="sourceLineNo">895</span> * @param buffer<a name="line.895"></a>
+<span class="sourceLineNo">896</span> * @param offset<a name="line.896"></a>
+<span class="sourceLineNo">897</span> * @return BigDecimal value at offset<a name="line.897"></a>
+<span class="sourceLineNo">898</span> */<a name="line.898"></a>
+<span class="sourceLineNo">899</span> public static BigDecimal toBigDecimal(ByteBuffer buffer, int offset, int length) {<a name="line.899"></a>
+<span class="sourceLineNo">900</span> if (buffer == null || length < Bytes.SIZEOF_INT + 1 ||<a name="line.900"></a>
+<span class="sourceLineNo">901</span> (offset + length > buffer.limit())) {<a name="line.901"></a>
+<span class="sourceLineNo">902</span> return null;<a name="line.902"></a>
+<span class="sourceLineNo">903</span> }<a name="line.903"></a>
+<span class="sourceLineNo">904</span><a name="line.904"></a>
+<span class="sourceLineNo">905</span> int scale = toInt(buffer, offset);<a name="line.905"></a>
+<span class="sourceLineNo">906</span> byte[] tcBytes = new byte[length - Bytes.SIZEOF_INT];<a name="line.906"></a>
+<span class="sourceLineNo">907</span> copyFromBufferToArray(tcBytes, buffer, offset + Bytes.SIZEOF_INT, 0, length - Bytes.SIZEOF_INT);<a name="line.907"></a>
+<span class="sourceLineNo">908</span> return new BigDecimal(new BigInteger(tcBytes), scale);<a name="line.908"></a>
+<span class="sourceLineNo">909</span> }<a name="line.909"></a>
+<span class="sourceLineNo">910</span><a name="line.910"></a>
+<span class="sourceLineNo">911</span> /**<a name="line.911"></a>
+<span class="sourceLineNo">912</span> * Put a short value out to the given ByteBuffer's current position in big-endian format.<a name="line.912"></a>
+<span class="sourceLineNo">913</span> * This also advances the position in buffer by short size.<a name="line.913"></a>
+<span class="sourceLineNo">914</span> * @param buffer the ByteBuffer to write to<a name="line.914"></a>
+<span class="sourceLineNo">915</span> * @param val short to write out<a name="line.915"></a>
+<span class="sourceLineNo">916</span> */<a name="line.916"></a>
+<span class="sourceLineNo">917</span> public static void putShort(ByteBuffer buffer, short val) {<a name="line.917"></a>
+<span class="sourceLineNo">918</span> if (UNSAFE_UNALIGNED) {<a name="line.918"></a>
+<span class="sourceLineNo">919</span> int newPos = UnsafeAccess.putShort(buffer, buffer.position(), val);<a name="line.919"></a>
+<span class="sourceLineNo">920</span> buffer.position(newPos);<a name="line.920"></a>
+<span class="sourceLineNo">921</span> } else {<a name="line.921"></a>
+<span class="sourceLineNo">922</span> buffer.putShort(val);<a name="line.922"></a>
+<span class="sourceLineNo">923</span> }<a name="line.923"></a>
+<span class="sourceLineNo">924</span> }<a name="line.924"></a>
+<span class="sourceLineNo">925</span><a name="line.925"></a>
+<span class="sourceLineNo">926</span> public static int putShort(ByteBuffer buffer, int index, short val) {<a name="line.926"></a>
+<span class="sourceLineNo">927</span> if (UNSAFE_UNALIGNED) {<a name="line.927"></a>
+<span class="sourceLineNo">928</span> return UnsafeAccess.putShort(buffer, index, val);<a name="line.928"></a>
+<span class="sourceLineNo">929</span> }<a name="line.929"></a>
+<span class="sourceLineNo">930</span> buffer.putShort(index, val);<a name="line.930"></a>
+<span class="sourceLineNo">931</span> return index + Bytes.SIZEOF_SHORT;<a name="line.931"></a>
+<span class="sourceLineNo">932</span> }<a name="line.932"></a>
+<span class="sourceLineNo">933</span><a name="line.933"></a>
+<span class="sourceLineNo">934</span> public static int putAsShort(ByteBuffer buf, int index, int val) {<a name="line.934"></a>
+<span class="sourceLineNo">935</span> buf.put(index + 1, (byte) val);<a name="line.935"></a>
+<span class="sourceLineNo">936</span> val >>= 8;<a name="line.936"></a>
+<span class="sourceLineNo">937</span> buf.put(index, (byte) val);<a name="line.937"></a>
+<span class="sourceLineNo">938</span> return index + Bytes.SIZEOF_SHORT;<a name="line.938"></a>
+<span class="sourceLineNo">939</span> }<a name="line.939"></a>
+<span class="sourceLineNo">940</span><a name="line.940"></a>
+<span class="sourceLineNo">941</span> /**<a name="line.941"></a>
+<span class="sourceLineNo">942</span> * Put a long value out to the given ByteBuffer's current position in big-endian format.<a name="line.942"></a>
+<span class="sourceLineNo">943</span> * This also advances the position in buffer by long size.<a name="line.943"></a>
+<span class="sourceLineNo">944</span> * @param buffer the ByteBuffer to write to<a name="line.944"></a>
+<span class="sourceLineNo">945</span> * @param val long to write out<a name="line.945"></a>
+<span class="sourceLineNo">946</span> */<a name="line.946"></a>
+<span class="sourceLineNo">947</span> public static void putLong(ByteBuffer buffer, long val) {<a name="line.947"></a>
+<span class="sourceLineNo">948</span> if (UNSAFE_UNALIGNED) {<a name="line.948"></a>
+<span class="sourceLineNo">949</span> int newPos = UnsafeAccess.putLong(buffer, buffer.position(), val);<a name="line.949"></a>
+<span class="sourceLineNo">950</span> buffer.position(newPos);<a name="line.950"></a>
+<span class="sourceLineNo">951</span> } else {<a name="line.951"></a>
+<span class="sourceLineNo">952</span> buffer.putLong(val);<a name="line.952"></a>
+<span class="sourceLineNo">953</span> }<a name="line.953"></a>
+<span class="sourceLineNo">954</span> }<a name="line.954"></a>
+<span class="sourceLineNo">955</span><a name="line.955"></a>
+<span class="sourceLineNo">956</span> public static int putLong(ByteBuffer buffer, int index, long val) {<a name="line.956"></a>
+<span class="sourceLineNo">957</span> if (UNSAFE_UNALIGNED) {<a name="line.957"></a>
+<span class="sourceLineNo">958</span> return UnsafeAccess.putLong(buffer, index, val);<a name="line.958"></a>
+<span class="sourceLineNo">959</span> }<a name="line.959"></a>
+<span class="sourceLineNo">960</span> buffer.putLong(index, val);<a name="line.960"></a>
+<span class="sourceLineNo">961</span> return index + Bytes.SIZEOF_LONG;<a name="line.961"></a>
+<span class="sourceLineNo">962</span> }<a name="line.962"></a>
+<span class="sourceLineNo">963</span><a name="line.963"></a>
+<span class="sourceLineNo">964</span> /**<a name="line.964"></a>
+<span class="sourceLineNo">965</span> * Copies the bytes from given array's offset to length part into the given buffer. Puts the bytes<a name="line.965"></a>
+<span class="sourceLineNo">966</span> * to buffer's current position. This also advances the position in the 'out' buffer by 'length'<a name="line.966"></a>
+<span class="sourceLineNo">967</span> * @param out<a name="line.967"></a>
+<span class="sourceLineNo">968</span> * @param in<a name="line.968"></a>
+<span class="sourceLineNo">969</span> * @param inOffset<a name="line.969"></a>
+<span class="sourceLineNo">970</span> * @param length<a name="line.970"></a>
+<span class="sourceLineNo">971</span> */<a name="line.971"></a>
+<span class="sourceLineNo">972</span> public static void copyFromArrayToBuffer(ByteBuffer out, byte[] in, int inOffset, int length) {<a name="line.972"></a>
+<span class="sourceLineNo">973</span> if (out.hasArray()) {<a name="line.973"></a>
+<span class="sourceLineNo">974</span> System.arraycopy(in, inOffset, out.array(), out.arrayOffset() + out.position(), length);<a name="line.974"></a>
+<span class="sourceLineNo">975</span> // Move the position in out by length<a name="line.975"></a>
+<span class="sourceLineNo">976</span> out.position(out.position() + length);<a name="line.976"></a>
+<span class="sourceLineNo">977</span> } else if (UNSAFE_AVAIL) {<a name="line.977"></a>
+<span class="sourceLineNo">978</span> UnsafeAccess.copy(in, inOffset, out, out.position(), length);<a name="line.978"></a>
+<span class="sourceLineNo">979</span> // Move the position in out by length<a name="line.979"></a>
+<span class="sourceLineNo">980</span> out.position(out.position() + length);<a name="line.980"></a>
+<span class="sourceLineNo">981</span> } else {<a name="line.981"></a>
+<span class="sourceLineNo">982</span> out.put(in, inOffset, length);<a name="line.982"></a>
+<span class="sourceLineNo">983</span> }<a name="line.983"></a>
+<span class="sourceLineNo">984</span> }<a name="line.984"></a>
+<span class="sourceLineNo">985</span><a name="line.985"></a>
+<span class="sourceLineNo">986</span> /**<a name="line.986"></a>
+<span class="sourceLineNo">987</span> * Copies bytes from given array's offset to length part into the given buffer. Puts the bytes<a name="line.987"></a>
+<span class="sourceLineNo">988</span> * to buffer's given position. This doesn't affact the position of buffer.<a name="line.988"></a>
+<span class="sourceLineNo">989</span> * @param out<a name="line.989"></a>
+<span class="sourceLineNo">990</span> * @param in<a name="line.990"></a>
+<span class="sourceLineNo">991</span> * @param inOffset<a name="line.991"></a>
+<span class="sourceLineNo">992</span> * @param length<a name="line.992"></a>
+<span class="sourceLineNo">993</span> */<a name="line.993"></a>
+<span class="sourceLineNo">994</span> public static void copyFromArrayToBuffer(ByteBuffer out, int outOffset, byte[] in, int inOffset,<a name="line.994"></a>
+<span class="sourceLineNo">995</span> int length) {<a name="line.995"></a>
+<span class="sourceLineNo">996</span> if (out.hasArray()) {<a name="line.996"></a>
+<span class="sourceLineNo">997</span> System.arraycopy(in, inOffset, out.array(), out.arrayOffset() + outOffset, length);<a name="line.997"></a>
+<span class="sourceLineNo">998</span> } else if (UNSAFE_AVAIL) {<a name="line.998"></a>
+<span class="sourceLineNo">999</span> UnsafeAccess.copy(in, inOffset, out, outOffset, length);<a name="line.999"></a>
+<span class="sourceLineNo">1000</span> } else {<a name="line.1000"></a>
+<span class="sourceLineNo">1001</span> ByteBuffer outDup = out.duplicate();<a name="line.1001"></a>
+<span class="sourceLineNo">1002</span> outDup.position(outOffset);<a name="line.1002"></a>
+<span class="sourceLineNo">1003</span> outDup.put(in, inOffset, length);<a name="line.1003"></a>
+<span class="sourceLineNo">1004</span> }<a name="line.1004"></a>
+<span class="sourceLineNo">1005</span> }<a name="line.1005"></a>
+<span class="sourceLineNo">1006</span><a name="line.1006"></a>
+<span class="sourceLineNo">1007</span> /**<a name="line.1007"></a>
+<span class="sourceLineNo">1008</span> * Copies specified number of bytes from given offset of 'in' ByteBuffer to<a name="line.1008"></a>
+<span class="sourceLineNo">1009</span> * the array. This doesn't affact the position of buffer.<a name="line.1009"></a>
+<span class="sourceLineNo">1010</span> * @param out<a name="line.1010"></a>
+<span class="sourceLineNo">1011</span> * @param in<a name="line.1011"></a>
+<span class="sourceLineNo">1012</span> * @param sourceOffset<a name="line.1012"></a>
+<span class="sourceLineNo">1013</span> * @param destinationOffset<a name="line.1013"></a>
+<span class="sourceLineNo">1014</span> * @param length<a name="line.1014"></a>
+<span class="sourceLineNo">1015</span> */<a name="line.1015"></a>
+<span class="sourceLineNo">1016</span> public static void copyFromBufferToArray(byte[] out, ByteBuffer in, int sourceOffset,<a name="line.1016"></a>
+<span class="sourceLineNo">1017</span> int destinationOffset, int length) {<a name="line.1017"></a>
+<span class="sourceLineNo">1018</span> if (in.hasArray()) {<a name="line.1018"></a>
+<span class="sourceLineNo">1019</span> System.arraycopy(in.array(), sourceOffset + in.arrayOffset(), out, destinationOffset, length);<a name="line.1019"></a>
+<span class="sourceLineNo">1020</span> } else if (UNSAFE_AVAIL) {<a name="line.1020"></a>
+<span class="sourceLineNo">1021</span> UnsafeAccess.copy(in, sourceOffset, out, destinationOffset, length);<a name="line.1021"></a>
+<span class="sourceLineNo">1022</span> } else {<a name="line.1022"></a>
+<span class="sourceLineNo">1023</span> ByteBuffer inDup = in.duplicate();<a name="line.1023"></a>
+<span class="sourceLineNo">1024</span> inDup.position(sourceOffset);<a name="line.1024"></a>
+<span class="sourceLineNo">1025</span> inDup.get(out, destinationOffset, length);<a name="line.1025"></a>
+<span class="sourceLineNo">1026</span> }<a name="line.1026"></a>
+<span class="sourceLineNo">1027</span> }<a name="line.1027"></a>
+<span class="sourceLineNo">1028</span><a name="line.1028"></a>
+<span class="sourceLineNo">1029</span> /**<a name="line.1029"></a>
+<span class="sourceLineNo">1030</span> * Similar to {@link Arrays#copyOfRange(byte[], int, int)}<a name="line.1030"></a>
+<span class="sourceLineNo">1031</span> * @param original the buffer from which the copy has to happen<a name="line.1031"></a>
+<span class="sourceLineNo">1032</span> * @param from the starting index<a name="line.1032"></a>
+<span class="sourceLineNo">1033</span> * @param to the ending index<a name="line.1033"></a>
+<span class="sourceLineNo">1034</span> * @return a byte[] created out of the copy<a name="line.1034"></a>
+<span class="sourceLineNo">1035</span> */<a name="line.1035"></a>
+<span class="sourceLineNo">1036</span> public static byte[] copyOfRange(ByteBuffer original, int from, int to) {<a name="line.1036"></a>
+<span class="sourceLineNo">1037</span> int newLength = to - from;<a name="line.1037"></a>
+<span class="sourceLineNo">1038</span> if (newLength < 0) throw new IllegalArgumentException(from + " > " + to);<a name="line.1038"></a>
+<span class="sourceLineNo">1039</span> byte[] copy = new byte[newLength];<a name="line.1039"></a>
+<span class="sourceLineNo">1040</span> ByteBufferUtils.copyFromBufferToArray(copy, original, from, 0, newLength);<a name="line.1040"></a>
+<span class="sourceLineNo">1041</span> return copy;<a name="line.1041"></a>
+<span class="sourceLineNo">1042</span> }<a name="line.1042"></a>
+<span class="sourceLineNo">1043</span><a name="line.1043"></a>
+<span class="sourceLineNo">1044</span> // For testing purpose<a name="line.1044"></a>
+<span class="sourceLineNo">1045</span> public static String toStringBinary(final ByteBuffer b, int off, int len) {<a name="line.1045"></a>
+<span class="sourceLineNo">1046</span> StringBuilder result = new StringBuilder();<a name="line.1046"></a>
+<span class="sourceLineNo">1047</span> // Just in case we are passed a 'len' that is > buffer length...<a name="line.1047"></a>
+<span class="sourceLineNo">1048</span> if (off >= b.capacity())<a name="line.1048"></a>
+<span class="sourceLineNo">1049</span> return result.toString();<a name="line.1049"></a>
+<span class="sourceLineNo">1050</span> if (off + len > b.capacity())<a name="line.1050"></a>
+<span class="sourceLineNo">1051</span> len = b.capacity() - off;<a name="line.1051"></a>
+<span class="sourceLineNo">1052</span> for (int i = off; i < off + len; ++i) {<a name="line.1052"></a>
+<span class="sourceLineNo">1053</span> int ch = b.get(i) & 0xFF;<a name="line.1053"></a>
+<span class="sourceLineNo">1054</span> if ((ch >= '0' && ch <= '9') || (ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z')<a name="line.1054"></a>
+<span class="sourceLineNo">1055</span> || " `~!@#$%^&*()-_=+[]{}|;:'\",.<>/?".indexOf(ch) >= 0) {<a name="line.1055"></a>
+<span class="sourceLineNo">1056</span> result.append((char) ch);<a name="line.1056"></a>
+<span class="sourceLineNo">1057</span> } else {<a name="line.1057"></a>
+<span class="sourceLineNo">1058</span> result.append(String.format("\\x%02X", ch));<a name="line.1058"></a>
+<span class="sourceLineNo">1059</span> }<a name="line.1059"></a>
+<span class="sourceLineNo">1060</span> }<a name="line.1060"></a>
+<span class="sourceLineNo">1061</span> return result.toString();<a name="line.1061"></a>
+<span class="sourceLineNo">1062</span> }<a name="line.1062"></a>
+<span class="sourceLineNo">1063</span><a name="line.1063"></a>
+<span class="sourceLineNo">1064</span> public static String toStringBinary(final ByteBuffer b) {<a name="line.1064"></a>
+<span class="sourceLineNo">1065</span> return toStringBinary(b, 0, b.capacity());<a name="line.1065"></a>
+<span class="sourceLineNo">1066</span> }<a name="line.1066"></a>
+<span class="sourceLineNo">1067</span>}<a name="line.1067"></a>