Java IntStack.isEmpty方法代码示例

import com.carrotsearch.hppc.IntStack; //导入方法依赖的package包/类
/**
 * Compute in-link count for each state.
 */
private IntIntHashMap computeInlinkCount(final FSA fsa) {
  IntIntHashMap inlinkCount = new IntIntHashMap();
  BitSet visited = new BitSet();
  IntStack nodes = new IntStack();
  nodes.push(fsa.getRootNode());

  while (!nodes.isEmpty()) {
    final int node = nodes.pop();
    if (visited.get(node))
      continue;

    visited.set(node);

    for (int arc = fsa.getFirstArc(node); arc != 0; arc = fsa.getNextArc(arc)) {
      if (!fsa.isArcTerminal(arc)) {
        final int target = fsa.getEndNode(arc);
        inlinkCount.putOrAdd(target, 1, 1);
        if (!visited.get(target))
          nodes.push(target);
      }
    }
  }

  return inlinkCount;
}
 

import com.carrotsearch.hppc.IntStack; //导入方法依赖的package包/类
private void buildPropagationPath() {
    byte[] state = new byte[types.length];
    int[] path = new int[types.length];
    int pathSize = 0;
    IntStack stack = new IntStack();

    for (int i = 0; i < graph.size(); ++i) {
        if (graph.incomingEdgesCount(i) == 0 && types[i] != null) {
            stack.push(i);
        }
    }

    while (!stack.isEmpty()) {
        int node = stack.pop();
        if (state[node] == FRESH) {
            state[node] = VISITING;

            stack.push(node);

            for (int successor : graph.outgoingEdges(node)) {
                if (state[successor] == FRESH) {
                    stack.push(successor);
                }
            }

        } else if (state[node] == VISITING) {
            path[pathSize++] = node;
            state[node] = VISITED;
        }
    }

    propagationPath = Arrays.copyOf(path, pathSize);
}
 

import com.carrotsearch.hppc.IntStack; //导入方法依赖的package包/类
/**
 * Linearization of states.
 */
private int[] linearize(final FSA fsa) {
  int[] linearized = new int[0];
  int last = 0;

  BitSet visited = new BitSet();
  IntStack nodes = new IntStack();
  nodes.push(fsa.getRootNode());

  while (!nodes.isEmpty()) {
    final int node = nodes.pop();
    if (visited.get(node)) {
      continue;
    }

    if (last >= linearized.length) {
      linearized = Arrays.copyOf(linearized, linearized.length + 100000);
    }

    visited.set(node);
    linearized[last++] = node;

    for (int arc = fsa.getFirstArc(node); arc != 0; arc = fsa.getNextArc(arc)) {
      if (!fsa.isArcTerminal(arc)) {
        int target = fsa.getEndNode(arc);
        if (!visited.get(target))
          nodes.push(target);
      }
    }
  }

  return Arrays.copyOf(linearized, last);
}
 

import com.carrotsearch.hppc.IntStack; //导入方法依赖的package包/类
/**
 * Linearize all states, putting <code>states</code> in front of the automaton
 * and calculating stable state offsets.
 */
private int linearizeAndCalculateOffsets(FSA fsa, IntArrayList states, IntArrayList linearized,
    IntIntHashMap offsets) throws IOException {
  final BitSet visited = new BitSet();
  final IntStack nodes = new IntStack();
  linearized.clear();

  /*
   * Linearize states with most inlinks first.
   */
  for (int i = 0; i < states.size(); i++) {
    linearizeState(fsa, nodes, linearized, visited, states.get(i));
  }

  /*
   * Linearize the remaining states by chaining them one after another, in depth-order.
   */
  nodes.push(fsa.getRootNode());
  while (!nodes.isEmpty()) {
    final int node = nodes.pop();
    if (visited.get(node))
      continue;

    linearizeState(fsa, nodes, linearized, visited, node);
  }

  /*
   * Calculate new state offsets. This is iterative. We start with 
   * maximum potential offsets and recalculate until converged.
   */
  int MAX_OFFSET = Integer.MAX_VALUE;
  for (IntCursor c : linearized) {
    offsets.put(c.value, MAX_OFFSET);
  }

  int i, j = 0;
  while ((i = emitNodes(fsa, null, linearized)) > 0) {
    j = i;
  }
  return j;
}