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

Operations.getCommonPrefixBytesRef介绍

[英]Returns the longest BytesRef that is a prefix of all accepted strings and visits each state at most once. The automaton must be deterministic.
[中]返回最长字节引用，它是所有接受字符串的前缀，最多访问一次每个状态。自动机必须是确定性的。

代码示例

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

/**
 * Returns the longest BytesRef that is a suffix of all accepted strings.
 * Worst case complexity: exponential in number of states (this calls
 * determinize).
 * @param maxDeterminizedStates maximum number of states determinizing the
 *  automaton can result in.  Set higher to allow more complex queries and
 *  lower to prevent memory exhaustion.
 * @return common suffix, which can be an empty (length 0) BytesRef (never null)
 */
public static BytesRef getCommonSuffixBytesRef(Automaton a, int maxDeterminizedStates) {
 // reverse the language of the automaton, then reverse its common prefix.
 Automaton r = Operations.determinize(reverse(a), maxDeterminizedStates);
 BytesRef ref = getCommonPrefixBytesRef(r);
 reverseBytes(ref);
 return ref;
}

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

/**
 * Returns the longest BytesRef that is a suffix of all accepted strings.
 * Worst case complexity: exponential in number of states (this calls
 * determinize).
 * @param maxDeterminizedStates maximum number of states determinizing the
 *  automaton can result in.  Set higher to allow more complex queries and
 *  lower to prevent memory exhaustion.
 * @return common suffix, which can be an empty (length 0) BytesRef (never null)
 */
public static BytesRef getCommonSuffixBytesRef(Automaton a, int maxDeterminizedStates) {
 // reverse the language of the automaton, then reverse its common prefix.
 Automaton r = Operations.determinize(reverse(a), maxDeterminizedStates);
 BytesRef ref = getCommonPrefixBytesRef(r);
 reverseBytes(ref);
 return ref;
}

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

/**
 * Returns the longest BytesRef that is a suffix of all accepted strings.
 * Worst case complexity: exponential in number of states (this calls
 * determinize).
 * @param maxDeterminizedStates maximum number of states determinizing the
 *  automaton can result in.  Set higher to allow more complex queries and
 *  lower to prevent memory exhaustion.
 * @return common suffix, which can be an empty (length 0) BytesRef (never null)
 */
public static BytesRef getCommonSuffixBytesRef(Automaton a, int maxDeterminizedStates) {
 // reverse the language of the automaton, then reverse its common prefix.
 Automaton r = Operations.determinize(reverse(a), maxDeterminizedStates);
 BytesRef ref = getCommonPrefixBytesRef(r);
 reverseBytes(ref);
 return ref;
}

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

/**
 * Returns the longest BytesRef that is a suffix of all accepted strings.
 * Worst case complexity: exponential in number of states (this calls
 * determinize).
 * @param maxDeterminizedStates maximum number of states determinizing the
 *  automaton can result in.  Set higher to allow more complex queries and
 *  lower to prevent memory exhaustion.
 * @return common suffix, which can be an empty (length 0) BytesRef (never null)
 */
public static BytesRef getCommonSuffixBytesRef(Automaton a, int maxDeterminizedStates) {
 // reverse the language of the automaton, then reverse its common prefix.
 Automaton r = Operations.determinize(reverse(a), maxDeterminizedStates);
 BytesRef ref = getCommonPrefixBytesRef(r);
 reverseBytes(ref);
 return ref;
}