当前位置: 首页>>代码示例>>Java>>正文


Java StringHelper类代码示例

本文整理汇总了Java中org.apache.lucene.util.StringHelper的典型用法代码示例。如果您正苦于以下问题:Java StringHelper类的具体用法?Java StringHelper怎么用?Java StringHelper使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。


StringHelper类属于org.apache.lucene.util包,在下文中一共展示了StringHelper类的15个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: startTerm

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
@Override
public void startTerm(BytesRef term, int freq) throws IOException {
  final int prefix = StringHelper.bytesDifference(lastTerm.get(), term);
  final int suffix = term.length - prefix;
  tvf.writeVInt(prefix);
  tvf.writeVInt(suffix);
  tvf.writeBytes(term.bytes, term.offset + prefix, suffix);
  tvf.writeVInt(freq);
  lastTerm.copyBytes(term);
  lastPosition = lastOffset = 0;
  
  if (offsets && positions) {
    // we might need to buffer if its a non-bulk merge
    offsetStartBuffer = ArrayUtil.grow(offsetStartBuffer, freq);
    offsetEndBuffer = ArrayUtil.grow(offsetEndBuffer, freq);
  }
  bufferedIndex = 0;
  bufferedFreq = freq;
  payloadData.clear();
}
 
开发者ID:lamsfoundation,项目名称:lams,代码行数:21,代码来源:Lucene40TermVectorsWriter.java

示例2: readFields

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
private TreeMap<String,Long> readFields(IndexInput in) throws IOException {
  ChecksumIndexInput input = new BufferedChecksumIndexInput(in);
  BytesRefBuilder scratch = new BytesRefBuilder();
  TreeMap<String,Long> fields = new TreeMap<>();
  
  while (true) {
    SimpleTextUtil.readLine(input, scratch);
    if (scratch.get().equals(END)) {
      SimpleTextUtil.checkFooter(input);
      return fields;
    } else if (StringHelper.startsWith(scratch.get(), FIELD)) {
      String fieldName = new String(scratch.bytes(), FIELD.length, scratch.length() - FIELD.length, StandardCharsets.UTF_8);
      fields.put(fieldName, input.getFilePointer());
    }
  }
}
 
开发者ID:europeana,项目名称:search,代码行数:17,代码来源:SimpleTextFieldsReader.java

示例3: scan

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
/**
 * Scans ({@code termsEnum.next()}) terms until a term is found that does
 * not start with curVNode's cell. If it finds a leaf cell or a cell at
 * level {@code scanDetailLevel} then it calls {@link
 * #visitScanned(org.apache.lucene.spatial.prefix.tree.Cell)}.
 */
protected void scan(int scanDetailLevel) throws IOException {
  for (;
       thisTerm != null && StringHelper.startsWith(thisTerm, curVNodeTerm);//TODO refactor to use method on curVNode.cell
       thisTerm = termsEnum.next()) {
    scanCell = grid.getCell(thisTerm.bytes, thisTerm.offset, thisTerm.length, scanCell);

    int termLevel = scanCell.getLevel();
    if (termLevel < scanDetailLevel) {
      if (scanCell.isLeaf())
        visitScanned(scanCell);
    } else if (termLevel == scanDetailLevel) {
      if (!scanCell.isLeaf())//LUCENE-5529
        visitScanned(scanCell);
    }
  }//term loop
}
 
开发者ID:europeana,项目名称:search,代码行数:23,代码来源:AbstractVisitingPrefixTreeFilter.java

示例4: startTerm

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
@Override
public void startTerm(BytesRef term, int freq) throws IOException {
  final int prefix = StringHelper.bytesDifference(lastTerm.get(), term);
  final int suffix = term.length - prefix;
  tvf.writeVInt(prefix);
  tvf.writeVInt(suffix);
  tvf.writeBytes(term.bytes, term.offset + prefix, suffix);
  tvf.writeVInt(freq);
  lastTerm.copyBytes(term);
  lastPosition = lastOffset = 0;
  
  if (offsets && positions) {
    // we might need to buffer if its a non-bulk merge
    offsetStartBuffer = ArrayUtil.grow(offsetStartBuffer, freq);
    offsetEndBuffer = ArrayUtil.grow(offsetEndBuffer, freq);
    offsetIndex = 0;
    offsetFreq = freq;
  }
}
 
开发者ID:europeana,项目名称:search,代码行数:20,代码来源:PreFlexRWTermVectorsWriter.java

示例5: scan

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
/**
 * Scans ({@code termsEnum.next()}) terms until a term is found that does
 * not start with curVNode's cell. If it finds a leaf cell or a cell at
 * level {@code scanDetailLevel} then it calls {@link
 * #visitScanned(org.apache.lucene.spatial.prefix.tree.Node,
 * com.spatial4j.core.shape.Shape)}.
 */
protected void scan(int scanDetailLevel) throws IOException {
  for (;
       thisTerm != null && StringHelper.startsWith(thisTerm, curVNodeTerm);
       thisTerm = termsEnum.next()) {
    scanCell = grid.getNode(thisTerm.bytes, thisTerm.offset, thisTerm.length, scanCell);

    int termLevel = scanCell.getLevel();
    if (termLevel > scanDetailLevel)
      continue;
    if (termLevel == scanDetailLevel || scanCell.isLeaf()) {
      Shape cShape;
      //if this cell represents a point, use the cell center vs the box
      // (points never have isLeaf())
      if (termLevel == grid.getMaxLevels() && !scanCell.isLeaf())
        cShape = scanCell.getCenter();
      else
        cShape = scanCell.getShape();

      visitScanned(scanCell, cShape);
    }
  }//term loop
}
 
开发者ID:pkarmstr,项目名称:NYBC,代码行数:30,代码来源:AbstractVisitingPrefixTreeFilter.java

示例6: startTerm

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
@Override
public void startTerm(BytesRef term, int freq) throws IOException {
  final int prefix = StringHelper.bytesDifference(lastTerm, term);
  final int suffix = term.length - prefix;
  tvf.writeVInt(prefix);
  tvf.writeVInt(suffix);
  tvf.writeBytes(term.bytes, term.offset + prefix, suffix);
  tvf.writeVInt(freq);
  lastTerm.copyBytes(term);
  lastPosition = lastOffset = 0;
  
  if (offsets && positions) {
    // we might need to buffer if its a non-bulk merge
    offsetStartBuffer = ArrayUtil.grow(offsetStartBuffer, freq);
    offsetEndBuffer = ArrayUtil.grow(offsetEndBuffer, freq);
    offsetIndex = 0;
    offsetFreq = freq;
  }
}
 
开发者ID:pkarmstr,项目名称:NYBC,代码行数:20,代码来源:PreFlexRWTermVectorsWriter.java

示例7: startTerm

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
@Override
public void startTerm(BytesRef term, int freq) throws IOException {
  final int prefix = StringHelper.bytesDifference(lastTerm, term);
  final int suffix = term.length - prefix;
  tvf.writeVInt(prefix);
  tvf.writeVInt(suffix);
  tvf.writeBytes(term.bytes, term.offset + prefix, suffix);
  tvf.writeVInt(freq);
  lastTerm.copyBytes(term);
  lastPosition = lastOffset = 0;
  
  if (offsets && positions) {
    // we might need to buffer if its a non-bulk merge
    offsetStartBuffer = ArrayUtil.grow(offsetStartBuffer, freq);
    offsetEndBuffer = ArrayUtil.grow(offsetEndBuffer, freq);
  }
  bufferedIndex = 0;
  bufferedFreq = freq;
  payloadData.length = 0;
}
 
开发者ID:pkarmstr,项目名称:NYBC,代码行数:21,代码来源:Lucene40TermVectorsWriter.java

示例8: getPrefixTerms

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
private void getPrefixTerms(ObjectHashSet<Term> terms, final Term prefix, final IndexReader reader) throws IOException {
    // SlowCompositeReaderWrapper could be used... but this would merge all terms from each segment into one terms
    // instance, which is very expensive. Therefore I think it is better to iterate over each leaf individually.
    List<LeafReaderContext> leaves = reader.leaves();
    for (LeafReaderContext leaf : leaves) {
        Terms _terms = leaf.reader().terms(field);
        if (_terms == null) {
            continue;
        }

        TermsEnum termsEnum = _terms.iterator();
        TermsEnum.SeekStatus seekStatus = termsEnum.seekCeil(prefix.bytes());
        if (TermsEnum.SeekStatus.END == seekStatus) {
            continue;
        }

        for (BytesRef term = termsEnum.term(); term != null; term = termsEnum.next()) {
            if (!StringHelper.startsWith(term, prefix.bytes())) {
                break;
            }

            terms.add(new Term(field, BytesRef.deepCopyOf(term)));
            if (terms.size() >= maxExpansions) {
                return;
            }
        }
    }
}
 
开发者ID:justor,项目名称:elasticsearch_my,代码行数:29,代码来源:MultiPhrasePrefixQuery.java

示例9: addReverseTermIndex

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
private void addReverseTermIndex(FieldInfo field, final Iterable<BytesRef> values, int maxLength) throws IOException {
  long count = 0;
  BytesRefBuilder priorTerm = new BytesRefBuilder();
  priorTerm.grow(maxLength);
  BytesRef indexTerm = new BytesRef();
  long startFP = data.getFilePointer();
  PagedBytes pagedBytes = new PagedBytes(15);
  MonotonicBlockPackedWriter addresses = new MonotonicBlockPackedWriter(data, BLOCK_SIZE);
  
  for (BytesRef b : values) {
    int termPosition = (int) (count & REVERSE_INTERVAL_MASK);
    if (termPosition == 0) {
      int len = StringHelper.sortKeyLength(priorTerm.get(), b);
      indexTerm.bytes = b.bytes;
      indexTerm.offset = b.offset;
      indexTerm.length = len;
      addresses.add(pagedBytes.copyUsingLengthPrefix(indexTerm));
    } else if (termPosition == REVERSE_INTERVAL_MASK) {
      priorTerm.copyBytes(b);
    }
    count++;
  }
  addresses.finish();
  long numBytes = pagedBytes.getPointer();
  pagedBytes.freeze(true);
  PagedBytesDataInput in = pagedBytes.getDataInput();
  meta.writeLong(startFP);
  data.writeVLong(numBytes);
  data.copyBytes(in, numBytes);
}
 
开发者ID:lamsfoundation,项目名称:lams,代码行数:31,代码来源:Lucene410DocValuesConsumer.java

示例10: accept

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
@Override
protected AcceptStatus accept(BytesRef term) {
  if (StringHelper.startsWith(term, prefixRef)) {
    return AcceptStatus.YES;
  } else {
    return AcceptStatus.END;
  }
}
 
开发者ID:lamsfoundation,项目名称:lams,代码行数:9,代码来源:PrefixTermsEnum.java

示例11: equals

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
/** Returns true if <code>o</code> is equal to this.  If a
 *  {@link FieldComparatorSource} or {@link
 *  FieldCache.Parser} was provided, it must properly
 *  implement equals (unless a singleton is always used). */
@Override
public boolean equals(Object o) {
  if (this == o) return true;
  if (!(o instanceof SortField)) return false;
  final SortField other = (SortField)o;
  return (
    StringHelper.equals(other.field, this.field)
    && other.type == this.type
    && other.reverse == this.reverse
    && (other.comparatorSource == null ? this.comparatorSource == null : other.comparatorSource.equals(this.comparatorSource))
  );
}
 
开发者ID:lamsfoundation,项目名称:lams,代码行数:17,代码来源:SortField.java

示例12: accept

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
/**
 * Returns true if the term matches the automaton. Also stashes away the term
 * to assist with smart enumeration.
 */
@Override
protected AcceptStatus accept(final BytesRef term) {
  if (commonSuffixRef == null || StringHelper.endsWith(term, commonSuffixRef)) {
    if (runAutomaton.run(term.bytes, term.offset, term.length))
      return linear ? AcceptStatus.YES : AcceptStatus.YES_AND_SEEK;
    else
      return (linear && termComp.compare(term, linearUpperBound) < 0) ? 
          AcceptStatus.NO : AcceptStatus.NO_AND_SEEK;
  } else {
    return (linear && termComp.compare(term, linearUpperBound) < 0) ? 
        AcceptStatus.NO : AcceptStatus.NO_AND_SEEK;
  }
}
 
开发者ID:lamsfoundation,项目名称:lams,代码行数:18,代码来源:AutomatonTermsEnum.java

示例13: setTerm

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
private BytesRef setTerm() throws IOException {
  term = termsEnum.term();
  //System.out.println("  setTerm() term=" + term.utf8ToString() + " vs prefix=" + (prefix == null ? "null" : prefix.utf8ToString()));
  if (prefix != null && !StringHelper.startsWith(term, prefix)) {
    term = null;
  }
  return term;
}
 
开发者ID:lamsfoundation,项目名称:lams,代码行数:9,代码来源:DocTermOrds.java

示例14: visitMatchingTerms

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
@Override
public void visitMatchingTerms(
  IndexReader reader,
  String fieldName,
  MatchingTermVisitor mtv) throws IOException
{
  int prefixLength = prefix.length();
  Terms terms = MultiFields.getTerms(reader, fieldName);
  if (terms != null) {
    Matcher matcher = pattern.matcher("");
    try {
      TermsEnum termsEnum = terms.iterator(null);

      TermsEnum.SeekStatus status = termsEnum.seekCeil(prefixRef);
      BytesRef text;
      if (status == TermsEnum.SeekStatus.FOUND) {
        text = prefixRef;
      } else if (status == TermsEnum.SeekStatus.NOT_FOUND) {
        text = termsEnum.term();
      } else {
        text = null;
      }

      while(text != null) {
        if (text != null && StringHelper.startsWith(text, prefixRef)) {
          String textString = text.utf8ToString();
          matcher.reset(textString.substring(prefixLength));
          if (matcher.matches()) {
            mtv.visitMatchingTerm(new Term(fieldName, textString));
          }
        } else {
          break;
        }
        text = termsEnum.next();
      }
    } finally {
      matcher.reset();
    }
  }
}
 
开发者ID:lamsfoundation,项目名称:lams,代码行数:41,代码来源:SrndTruncQuery.java

示例15: visitMatchingTerms

import org.apache.lucene.util.StringHelper; //导入依赖的package包/类
@Override
public void visitMatchingTerms(
  IndexReader reader,
  String fieldName,
  MatchingTermVisitor mtv) throws IOException
{
  /* inspired by PrefixQuery.rewrite(): */
  Terms terms = MultiFields.getTerms(reader, fieldName);
  if (terms != null) {
    TermsEnum termsEnum = terms.iterator(null);

    boolean skip = false;
    TermsEnum.SeekStatus status = termsEnum.seekCeil(new BytesRef(getPrefix()));
    if (status == TermsEnum.SeekStatus.FOUND) {
      mtv.visitMatchingTerm(getLucenePrefixTerm(fieldName));
    } else if (status == TermsEnum.SeekStatus.NOT_FOUND) {
      if (StringHelper.startsWith(termsEnum.term(), prefixRef)) {
        mtv.visitMatchingTerm(new Term(fieldName, termsEnum.term().utf8ToString()));
      } else {
        skip = true;
      }
    } else {
      // EOF
      skip = true;
    }

    if (!skip) {
      while(true) {
        BytesRef text = termsEnum.next();
        if (text != null && StringHelper.startsWith(text, prefixRef)) {
          mtv.visitMatchingTerm(new Term(fieldName, text.utf8ToString()));
        } else {
          break;
        }
      }
    }
  }
}
 
开发者ID:lamsfoundation,项目名称:lams,代码行数:39,代码来源:SrndPrefixQuery.java


注:本文中的org.apache.lucene.util.StringHelper类示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。