Java Utililty Methods Byte Array Compare

maxLength = Math.min(offset + maxLength, array.length);
for (int i = offset; i < maxLength; i++) {
    if (array[i] != value) {
        return false;
return true;

boolean ret = true;
if (a.length == b.length) {
    for (int i = 0; i < a.length; i++) {
        if (a[i] != b[i]) {
            ret = false;
            break;
} else {
    ret = false;
return ret;

if (oi.length - oj.length != 0)
    return false;
for (int i = 0; i < oi.length; i++) {
    if (oi[i] != oj[i])
        return false;
return true;

if (a.length != b.length)
    return false;
for (int i = 0; i < a.length; i++)
    if (a[i] != b[i])
        return false;
return true;

if (null == a && null == b)
    return 0;
if (null == a && null != b)
    return -1;
if (null != a && null == b)
    return 1;
int minLen = Math.min(a.length, b.length);
for (int i = 0; i < minLen; ++i) {
...

if (bytes1 == bytes2) {
    return 0;
int len1 = bytes1.length;
int len2 = bytes2.length;
int len = len1 < len2 ? len1 : len2;
for (int i = 0; i < len; i++) {
    int a = (bytes1[i] & 0xff);
...

for (; len-- > 0; a_off++, b_off++)
    if (a[a_off] != b[b_off])
        return (a[a_off] & 0xff) - (b[b_off] & 0xff);
return 0;

int min = a.length > b.length ? b.length : a.length;
for (int i = 0; i < min; i++)
    if (a[i] < b[i])
        return -1;
    else if (a[i] > b[i])
        return 1;
return a.length - b.length;

if ((a == null) && (b == null)) {
    return true;
if ((a == null) || (b == null)) {
    return false;
for (int i = 0; i < length; ++i, ++a_offset, ++b_offset)
    if (a[a_offset] != b[b_offset]) {
...

int result;
if (alen < blen)
    result = -1;
else if (alen > blen)
    result = 1;
else
    result = 0;
int length = Math.min(alen, blen);
...