private int findHash(BytesRef bytes) { assert bytesStart != null : "bytesStart is null - not initialized"; int code = doHash(bytes.bytes, bytes.offset, bytes.length); // final position int hashPos = code & hashMask; int e = ids[hashPos]; if (e != -1 && !equals(e, bytes)) { // Conflict; use linear probe to find an open slot // (see LUCENE-5604): do { code++; hashPos = code & hashMask; e = ids[hashPos]; } while (e != -1 && !equals(e, bytes)); } return hashPos; }
pos = start + 2; code = doHash(bytes, pos, len); } else { code = bytesStart[e0];
private int findHash(BytesRef bytes) { assert bytesStart != null : "bytesStart is null - not initialized"; int code = doHash(bytes.bytes, bytes.offset, bytes.length); // final position int hashPos = code & hashMask; int e = ids[hashPos]; if (e != -1 && !equals(e, bytes)) { // Conflict; use linear probe to find an open slot // (see LUCENE-5604): do { code++; hashPos = code & hashMask; e = ids[hashPos]; } while (e != -1 && !equals(e, bytes)); } return hashPos; }
private int findHash(BytesRef bytes) { assert bytesStart != null : "bytesStart is null - not initialized"; int code = doHash(bytes.bytes, bytes.offset, bytes.length); // final position int hashPos = code & hashMask; int e = ids[hashPos]; if (e != -1 && !equals(e, bytes)) { // Conflict; use linear probe to find an open slot // (see LUCENE-5604): do { code++; hashPos = code & hashMask; e = ids[hashPos]; } while (e != -1 && !equals(e, bytes)); } return hashPos; }
private int findHash(BytesRef bytes) { assert bytesStart != null : "bytesStart is null - not initialized"; int code = doHash(bytes.bytes, bytes.offset, bytes.length); // final position int hashPos = code & hashMask; int e = ids[hashPos]; if (e != -1 && !equals(e, bytes)) { // Conflict; use linear probe to find an open slot // (see LUCENE-5604): do { code++; hashPos = code & hashMask; e = ids[hashPos]; } while (e != -1 && !equals(e, bytes)); } return hashPos; }
pos = start + 2; code = doHash(bytes, pos, len); } else { code = bytesStart[e0];
pos = start + 2; code = doHash(bytes, pos, len); } else { code = bytesStart[e0];
pos = start + 2; code = doHash(bytes, pos, len); } else { code = bytesStart[e0];