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

Operations.isFinite介绍

[英]Returns true if the language of this automaton is finite. The automaton must not have any dead states.
[中]如果此自动机的语言是有限的，则返回true。自动机不能有任何死态。

代码示例

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

/**
 * Checks whether there is a loop containing state. (This is sufficient since
 * there are never transitions to dead states.)
 */
// TODO: not great that this is recursive... in theory a
// large automata could exceed java's stack so the maximum level of recursion is bounded to 1000
private static boolean isFinite(Transition scratch, Automaton a, int state, BitSet path, BitSet visited, int level) {
 if (level > MAX_RECURSION_LEVEL) {
  throw new IllegalArgumentException("input automaton is too large: " +  level);
 }
 path.set(state);
 int numTransitions = a.initTransition(state, scratch);
 for(int t=0;t<numTransitions;t++) {
  a.getTransition(state, t, scratch);
  if (path.get(scratch.dest) || (!visited.get(scratch.dest) && !isFinite(scratch, a, scratch.dest, path, visited, level+1))) {
   return false;
  }
 }
 path.clear(state);
 visited.set(state);
 return true;
}

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

/**
 * Returns true if the language of this automaton is finite.  The
 * automaton must not have any dead states.
 */
public static boolean isFinite(Automaton a) {
 if (a.getNumStates() == 0) {
  return true;
 }
 return isFinite(new Transition(), a, 0, new BitSet(a.getNumStates()), new BitSet(a.getNumStates()), 0);
}

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

this.finite = Operations.isFinite(automaton);
} else {
 this.finite = finite;

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

/**
 * Checks whether there is a loop containing state. (This is sufficient since
 * there are never transitions to dead states.)
 */
// TODO: not great that this is recursive... in theory a
// large automata could exceed java's stack
private static boolean isFinite(Transition scratch, Automaton a, int state, BitSet path, BitSet visited) {
 path.set(state);
 int numTransitions = a.initTransition(state, scratch);
 for(int t=0;t<numTransitions;t++) {
  a.getTransition(state, t, scratch);
  if (path.get(scratch.dest) || (!visited.get(scratch.dest) && !isFinite(scratch, a, scratch.dest, path, visited))) {
   return false;
  }
 }
 path.clear(state);
 visited.set(state);
 return true;
}

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

/**
 * Checks whether there is a loop containing state. (This is sufficient since
 * there are never transitions to dead states.)
 */
// TODO: not great that this is recursive... in theory a
// large automata could exceed java's stack
private static boolean isFinite(Transition scratch, Automaton a, int state, BitSet path, BitSet visited) {
 path.set(state);
 int numTransitions = a.initTransition(state, scratch);
 for(int t=0;t<numTransitions;t++) {
  a.getTransition(state, t, scratch);
  if (path.get(scratch.dest) || (!visited.get(scratch.dest) && !isFinite(scratch, a, scratch.dest, path, visited))) {
   return false;
  }
 }
 path.clear(state);
 visited.set(state);
 return true;
}

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

/**
 * Checks whether there is a loop containing state. (This is sufficient since
 * there are never transitions to dead states.)
 */
// TODO: not great that this is recursive... in theory a
// large automata could exceed java's stack so the maximum level of recursion is bounded to 1000
private static boolean isFinite(Transition scratch, Automaton a, int state, BitSet path, BitSet visited, int level) {
 if (level > MAX_RECURSION_LEVEL) {
  throw new IllegalArgumentException("input automaton is too large: " +  level);
 }
 path.set(state);
 int numTransitions = a.initTransition(state, scratch);
 for(int t=0;t<numTransitions;t++) {
  a.getTransition(state, t, scratch);
  if (path.get(scratch.dest) || (!visited.get(scratch.dest) && !isFinite(scratch, a, scratch.dest, path, visited, level+1))) {
   return false;
  }
 }
 path.clear(state);
 visited.set(state);
 return true;
}

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

/**
 * Returns true if the language of this automaton is finite.  The
 * automaton must not have any dead states.
 */
public static boolean isFinite(Automaton a) {
 if (a.getNumStates() == 0) {
  return true;
 }
 return isFinite(new Transition(), a, 0, new BitSet(a.getNumStates()), new BitSet(a.getNumStates()), 0);
}

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

/**
 * Returns true if the language of this automaton is finite.  The
 * automaton must not have any dead states.
 */
public static boolean isFinite(Automaton a) {
 if (a.getNumStates() == 0) {
  return true;
 }
 return isFinite(new Transition(), a, 0, new BitSet(a.getNumStates()), new BitSet(a.getNumStates()));
}

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

/**
 * Returns true if the language of this automaton is finite.  The
 * automaton must not have any dead states.
 */
public static boolean isFinite(Automaton a) {
 if (a.getNumStates() == 0) {
  return true;
 }
 return isFinite(new Transition(), a, 0, new BitSet(a.getNumStates()), new BitSet(a.getNumStates()));
}

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

this.finite = Operations.isFinite(automaton);
} else {
 this.finite = finite;

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

this.finite = Operations.isFinite(automaton);
} else {
 this.finite = finite;

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

this.finite = Operations.isFinite(automaton);
} else {
 this.finite = finite;