return ((left[pos] < right[pos]) ? -1 : 1);
return ((ByteUtil.toUnsignedInt(left[pos]) < ByteUtil.toUnsignedInt(right[pos])) ? -1 : 1);
      public int compare(byte[] left, byte[] right) {        if(left == right) {          return 0;        }        if(left == null) {          return -1;        }        if(right == null) {          return 1;        }        int len = Math.min(left.length, right.length);        int pos = 0;        while((pos < len) && (left[pos] == right[pos])) {          ++pos;        }        if(pos < len) {          return ((left[pos] < right[pos]) ? -1 : 1);        }        return ((left.length < right.length) ? -1 :                ((left.length > right.length) ? 1 : 0));      }