sizeInNonDictPartB += lengthB; int difference = UnsafeComparer.INSTANCE.compareTo(byteArr1, byteArr2); if (difference != 0) { return difference;
/** * This method will compare 2 DictionaryByteArrayWrapper objects * * @param other * @return */ @Override public boolean equals(Object other) { if (this == other) { return true; } if (other == null || getClass() != other.getClass()) { return false; } DictionaryByteArrayWrapper otherObjectToCompare = (DictionaryByteArrayWrapper) other; if (data.length != otherObjectToCompare.data.length) { return false; } return ByteUtil.UnsafeComparer.INSTANCE.equals(data, otherObjectToCompare.data); }
return lessThanUnsigned(lw, rw) ? -1 : 1;
if (isScanRequired(rawColumnChunk, i)) { int compare = ByteUtil.UnsafeComparer.INSTANCE .compareTo(filterRangeValues[0], rawColumnChunk.getMinValues()[i]); if (compare <= 0) { BitSet bitSet = new BitSet(rawColumnChunk.getRowCount()[i]);
if (isScanRequired(rawColumnChunk, i)) { int compare = ByteUtil.UnsafeComparer.INSTANCE .compareTo(filterRangeValues[0], rawColumnChunk.getMinValues()[i]); if (compare < 0) { BitSet bitSet = new BitSet(rawColumnChunk.getRowCount()[i]);
for (int index = 0; index < minValues.length; index++) { if (index < dimCount) { if (ByteUtil.UnsafeComparer.INSTANCE.compareTo(minValues[index], mergedMinValues[index]) > 0) { minValues[index] = mergedMinValues[index]; for (int index = 0; index < maxValues.length; index++) { if (index < dimCount) { if (ByteUtil.UnsafeComparer.INSTANCE.compareTo(maxValues[index], mergedMaxValues[index]) < 0) { maxValues[index] = mergedMaxValues[index];
.compareTo(setOfEndKeyByteArray.get(dimensionFromCurrentBlock.getOrdinal()), noDictionaryEndKey) < 0) { setOfEndKeyByteArray.put(dimensionFromCurrentBlock.getOrdinal(), noDictionaryEndKey);
.compareTo(setOfStartKeyByteArray.get(dimensionFromCurrentBlock.getOrdinal()), noDictionaryStartKey) > 0) { setOfStartKeyByteArray.put(dimensionFromCurrentBlock.getOrdinal(), noDictionaryStartKey);
return lessThanUnsigned(lw, rw) ? -1 : 1;
for (int index = 0; index < minValues.length; index++) { if (index < dimCount1) { if (ByteUtil.UnsafeComparer.INSTANCE.compareTo(minValues[index], mergedMinValues[index]) > 0) { minValues[index] = mergedMinValues[index]; for (int index = 0; index < maxValues.length; index++) { if (index < dimCount2) { if (ByteUtil.UnsafeComparer.INSTANCE.compareTo(maxValues[index], mergedMaxValues[index]) < 0) { maxValues[index] = mergedMaxValues[index];
.equals(CarbonCommonConstants.MEMBER_DEFAULT_VAL_ARRAY, 0, CarbonCommonConstants.MEMBER_DEFAULT_VAL_ARRAY.length, data, currentDataOffset, length)) {
byte[] byteArr2 = (byte[]) rowB[index]; int difference = UnsafeComparer.INSTANCE.compareTo(byteArr1, byteArr2); if (difference != 0) { return difference;
} else { for (int i = 0; i < noDictionaryKeys.length; i++) { result = UnsafeComparer.INSTANCE.equals(noDictionaryKeys[i], noDictionaryKeysOther[i]); if (!result) { return false; } else { for (int i = 0; i < complexTypesKeys.length; i++) { result = UnsafeComparer.INSTANCE.equals(complexTypesKeys[i], complexTypesKeysOther[i]); if (!result) { return false; return UnsafeComparer.INSTANCE.equals(dictionaryKey, ((ByteArrayWrapper) other).dictionaryKey);
.compareTo(actualFilter, dictionary.getDictionaryValue(i)) == 0) { try { dummy[0] = i;
.compareTo(dimCols1, dictionaryKeyOffset, eachColumnValueSize, dimCols2, dictionaryKeyOffset, eachColumnValueSize); dictionaryKeyOffset += eachColumnValueSize; byte[] noDictionaryDim2 = key2.getNoDictionaryKeyByIndex(noDicIndex); compareResult = ByteUtil.UnsafeComparer.INSTANCE.compareTo(noDictionaryDim1, noDictionaryDim2); noDicIndex++;
byte[] byteArr2 = (byte[]) rowB.getNoDictSortDims()[nonDictIndex]; int difference = UnsafeComparer.INSTANCE.compareTo(byteArr1, byteArr2); if (difference != 0) { return difference;
for (int k = 0; k < filterRangeValues.length; k++) { int maxCompare = ByteUtil.UnsafeComparer.INSTANCE.compareTo(filterRangeValues[k], defaultValue); if (maxCompare < 0) { isDefaultValuePresentInFilter = true;
int compareTo = UnsafeComparer.INSTANCE.compareTo(dictionaryKey, other.dictionaryKey); if (compareTo == 0) { for (int i = 0; i < noDictionaryKeys.length; i++) { compareTo = UnsafeComparer.INSTANCE.compareTo(noDictionaryKeys[i], other.noDictionaryKeys[i]); if (compareTo != 0) { return compareTo; for (int i = 0; i < complexTypesKeys.length; i++) { compareTo = UnsafeComparer.INSTANCE.compareTo(complexTypesKeys[i], other.complexTypesKeys[i]); if (compareTo != 0) { return compareTo;