本文整理了Java中org.apache.lucene.util.BytesRefHash.doHash()方法的一些代码示例，展示了BytesRefHash.doHash()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。BytesRefHash.doHash()方法的具体详情如下：
包路径：org.apache.lucene.util.BytesRefHash
类名称：BytesRefHash
方法名：doHash

BytesRefHash.doHash介绍

暂无

代码示例

代码示例来源：origin: org.apache.lucene/lucene-core

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;
}

代码示例来源：origin: org.apache.lucene/lucene-core

pos = start + 2;
 code = doHash(bytes, pos, len);
} else {
 code = bytesStart[e0];

代码示例来源：origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

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;
}

代码示例来源：origin: org.infinispan/infinispan-embedded-query

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;
}

代码示例来源：origin: harbby/presto-connectors

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;
}

代码示例来源：origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

pos = start + 2;
 code = doHash(bytes, pos, len);
} else {
 code = bytesStart[e0];

代码示例来源：origin: org.infinispan/infinispan-embedded-query

pos = start + 2;
 code = doHash(bytes, pos, len);
} else {
 code = bytesStart[e0];

代码示例来源：origin: harbby/presto-connectors

pos = start + 2;
 code = doHash(bytes, pos, len);
} else {
 code = bytesStart[e0];