public boolean check(byte[] byteS, int start, int len) { int lenSub = byteSub.length; if (len < byteSub.length) { return false; } return StringExpr.equal(byteSub, 0, lenSub, byteS, start, lenSub); } }
public boolean check(byte[] byteS, int start, int len) { int lenSub = byteSub.length; if (len < lenSub) { return false; } return StringExpr.equal(byteSub, 0, lenSub, byteS, start + len - lenSub, lenSub); } }
private static boolean entryEqual(byte[][] t, int hash, byte[] b, int start, int len) { return t[hash] != null && StringExpr.equal(t[hash], 0, t[hash].length, b, start, len); }
public boolean check(byte[] byteS, int start, int len) { int lenSub = byteSub.length; if (len < lenSub) { return false; } return StringExpr.equal(byteSub, 0, lenSub, byteS, start + len - lenSub, lenSub); } }
public boolean check(byte[] byteS, int start, int len) { int lenSub = byteSub.length; if (len < byteSub.length) { return false; } return StringExpr.equal(byteSub, 0, lenSub, byteS, start, lenSub); } }
private static boolean entryEqual(byte[][] t, int hash, byte[] b, int start, int len) { return t[hash] != null && StringExpr.equal(t[hash], 0, t[hash].length, b, start, len); }
private boolean bytesEquals(VectorHashKeyWrapperGeneral keyThat) { //By the time we enter here the byteValues.lentgh and isNull must have already been compared for (int i = 0; i < byteValues.length; ++i) { // the byte comparison is potentially expensive so is better to branch on null if (byteLengths[i] != -1) { if (!StringExpr.equal( byteValues[i], byteStarts[i], byteLengths[i], keyThat.byteValues[i], keyThat.byteStarts[i], keyThat.byteLengths[i])) { return false; } } } return true; }
@Override public int findScalarInMap(MapColumnVector mapColumnVector, int mapBatchIndex) { final int offset = (int) mapColumnVector.offsets[mapBatchIndex]; final int count = (int) mapColumnVector.lengths[mapBatchIndex]; BytesColumnVector keyColVector = (BytesColumnVector) mapColumnVector.keys; byte[][] keyVector = keyColVector.vector; int[] keyStart = keyColVector.start; int[] keyLength = keyColVector.length; for (int i = 0; i < count; i++) { final int keyOffset = offset + i; if (StringExpr.equal(key, 0, key.length, keyVector[keyOffset], keyStart[keyOffset], keyLength[keyOffset])) { return offset + i; } } return -1; } }
private boolean bytesEquals(VectorHashKeyWrapper keyThat) { //By the time we enter here the byteValues.lentgh and isNull must have already been compared for (int i = 0; i < byteValues.length; ++i) { // the byte comparison is potentially expensive so is better to branch on null if (byteLengths[i] != -1) { if (!StringExpr.equal( byteValues[i], byteStarts[i], byteLengths[i], keyThat.byteValues[i], keyThat.byteStarts[i], keyThat.byteLengths[i])) { return false; } } } return true; }
@Override public int findInMap(ColumnVector indexColumnVector, int indexBatchIndex, MapColumnVector mapColumnVector, int mapBatchIndex) { final int offset = (int) mapColumnVector.offsets[mapBatchIndex]; final int count = (int) mapColumnVector.lengths[mapBatchIndex]; BytesColumnVector keyColVector = (BytesColumnVector) mapColumnVector.keys; byte[][] keyVector = keyColVector.vector; int[] keyStart = keyColVector.start; int[] keyLength = keyColVector.length; BytesColumnVector indexColVector = (BytesColumnVector) indexColumnVector; byte[] indexBytes = indexColVector.vector[indexBatchIndex]; int indexStart = indexColVector.start[indexBatchIndex]; int indexLength = indexColVector.length[indexBatchIndex]; for (int i = 0; i < count; i++) { final int keyOffset = offset + i; if (StringExpr.equal(indexBytes, indexStart, indexLength, keyVector[keyOffset], keyStart[keyOffset], keyLength[keyOffset])) { return offset + i; } } return -1; } }
if (!(!StringExpr.equal(value, 0, value.length, vector[0], start[0], length[0]))) { for(int j=0; j != n; j++) { int i = sel[j]; if (!StringExpr.equal(value, 0, value.length, vector[i], start[i], length[i])) { sel[newSize++] = i; int newSize = 0; for(int i = 0; i != n; i++) { if (!StringExpr.equal(value, 0, value.length, vector[i], start[i], length[i])) { sel[newSize++] = i; if (inputColVector.isRepeating) { if (!inputIsNull[0]) { if (!(!StringExpr.equal(value, 0, value.length, vector[0], start[0], length[0]))) { int i = sel[j]; if (!inputIsNull[i]) { if (!StringExpr.equal(value, 0, value.length, vector[i], start[i], length[i])) { sel[newSize++] = i; for(int i = 0; i != n; i++) { if (!inputIsNull[i]) { if (!StringExpr.equal(value, 0, value.length, vector[i], start[i], length[i])) { sel[newSize++] = i;
if (!(StringExpr.equal(value, 0, value.length, vector[0], start[0], length[0]))) { for(int j=0; j != n; j++) { int i = sel[j]; if (StringExpr.equal(value, 0, value.length, vector[i], start[i], length[i])) { sel[newSize++] = i; int newSize = 0; for(int i = 0; i != n; i++) { if (StringExpr.equal(value, 0, value.length, vector[i], start[i], length[i])) { sel[newSize++] = i; if (inputColVector.isRepeating) { if (!inputIsNull[0]) { if (!(StringExpr.equal(value, 0, value.length, vector[0], start[0], length[0]))) { int i = sel[j]; if (!inputIsNull[i]) { if (StringExpr.equal(value, 0, value.length, vector[i], start[i], length[i])) { sel[newSize++] = i; for(int i = 0; i != n; i++) { if (!inputIsNull[i]) { if (StringExpr.equal(value, 0, value.length, vector[i], start[i], length[i])) { sel[newSize++] = i;
if (!(!StringExpr.equal(vector[0], start[0], length[0], value, 0, value.length))) { for(int j=0; j != n; j++) { int i = sel[j]; if (!StringExpr.equal(vector[i], start[i], length[i], value, 0, value.length)) { sel[newSize++] = i; int newSize = 0; for(int i = 0; i != n; i++) { if (!StringExpr.equal(vector[i], start[i], length[i], value, 0, value.length)) { sel[newSize++] = i; if (inputColVector.isRepeating) { if (!inputIsNull[0]) { if (!(!StringExpr.equal(vector[0], start[0], length[0], value, 0, value.length))) { int i = sel[j]; if (!inputIsNull[i]) { if (!StringExpr.equal(vector[i], start[i], length[i], value, 0, value.length)) { sel[newSize++] = i; for(int i = 0; i != n; i++) { if (!inputIsNull[i]) { if (!StringExpr.equal(vector[i], start[i], length[i], value, 0, value.length)) { sel[newSize++] = i;
outputColVector.isRepeating = true; outputIsNull[0] = false; if (!StringExpr.equal(value, 0, value.length, vector[0], start[0], length[0])) { outVector[0] = 1; } else { int i = sel[j]; outputIsNull[i] = false; if (!StringExpr.equal(value, 0, value.length, vector[i], start[i], length[i])) { outVector[i] = 1; } else { Arrays.fill(outputIsNull, 0, n, false); for(int i = 0; i != n; i++) { if (!StringExpr.equal(value, 0, value.length, vector[i], start[i], length[i])) { outVector[i] = 1; } else { outputIsNull[0] = inputIsNull[0]; if (!inputIsNull[0]) { if (!StringExpr.equal(value, 0, value.length, vector[0], start[0], length[0])) { outVector[0] = 1; } else { outputIsNull[i] = inputIsNull[i]; if (!inputIsNull[i]) { if (!StringExpr.equal(value, 0, value.length, vector[i], start[i], length[i])) { outVector[i] = 1; } else {
outputColVector.isRepeating = true; outputIsNull[0] = false; if (StringExpr.equal(vector[0], start[0], length[0], value, 0, value.length)) { outVector[0] = 1; } else { int i = sel[j]; outputIsNull[i] = false; if (StringExpr.equal(vector[i], start[i], length[i], value, 0, value.length)) { outVector[i] = 1; } else { Arrays.fill(outputIsNull, 0, n, false); for(int i = 0; i != n; i++) { if (StringExpr.equal(vector[i], start[i], length[i], value, 0, value.length)) { outVector[i] = 1; } else { outputIsNull[0] = inputIsNull[0]; if (!inputIsNull[0]) { if (StringExpr.equal(vector[0], start[0], length[0], value, 0, value.length)) { outVector[0] = 1; } else { outputIsNull[i] = inputIsNull[i]; if (!inputIsNull[i]) { if (StringExpr.equal(vector[i], start[i], length[i], value, 0, value.length)) { outVector[i] = 1; } else {
outputColVector.isRepeating = true; outputIsNull[0] = false; if (!StringExpr.equal(vector[0], start[0], length[0], value, 0, value.length)) { outVector[0] = 1; } else { int i = sel[j]; outputIsNull[i] = false; if (!StringExpr.equal(vector[i], start[i], length[i], value, 0, value.length)) { outVector[i] = 1; } else { Arrays.fill(outputIsNull, 0, n, false); for(int i = 0; i != n; i++) { if (!StringExpr.equal(vector[i], start[i], length[i], value, 0, value.length)) { outVector[i] = 1; } else { outputIsNull[0] = inputIsNull[0]; if (!inputIsNull[0]) { if (!StringExpr.equal(vector[0], start[0], length[0], value, 0, value.length)) { outVector[0] = 1; } else { outputIsNull[i] = inputIsNull[i]; if (!inputIsNull[i]) { if (!StringExpr.equal(vector[i], start[i], length[i], value, 0, value.length)) { outVector[i] = 1; } else {
private int findKeyInArray(byte[] searchKeyBytes, int searchKeyOffset, int searchKeyLength) { // Brute force search. for (int index = 0; index < count; index++) { FastBytesHashMapElement element = array[index]; byte[] keyBytes = element.getKey(); if (keyBytes.length == searchKeyLength && StringExpr.equal( keyBytes, 0, keyBytes.length, searchKeyBytes, searchKeyOffset, searchKeyLength)) { return index; } } return -1; }
final int start = byteColVector.start[0]; final int length = byteColVector.length[0]; if (!StringExpr.equal( bytes, start, length, currentPartitionByteArrays[i], 0, currentPartitionByteLengths[i])) {
byte[] decBytes = decOutputStream.toByteArray(); if (!StringExpr.equal(bytes, 0, bytes.length, decBytes, 0, decBytes.length)) {
if (!StringExpr.equal(bytes, 0, bytes.length, bytesExpected, 0, bytesExpected.length)) {