src/main/java/de/dfki/lt/loot/fsa/algo/Determinization.java
private static <EdgeInfo> TIntHashSet move(
      final AbstractAutomaton<EdgeInfo> graph,
      TIntHashSet nfaStateSet,
      final EdgeInfo transChar,
      final Comparator<EdgeInfo> comp) {

    // init result set
    final TIntHashSet targetStates = new TIntHashSet();

    nfaStateSet.forEach(new TIntProcedure() {
      @Override
      public boolean execute(int state) {
        // get all edges with the transition character
        Iterable<Edge<EdgeInfo>> outEdges =
            graph.findEdges(state, transChar, comp);
        // add target states of these edges to result
        for (Edge<EdgeInfo> oneEdge : outEdges) {
          targetStates.add(oneEdge.getTarget());
        }
        return true;
      }
    });

    return targetStates;
  }
/**
   * This returns the set of states of the non-deterministic automaton that
   * can be reached from the given states via the given transition character
   *
   * @param nfaStateSet
   * a <code>TIntHashSet</code>
   * with states of the non-deterministic automaton
   * @param transChar a <code>char</code> with the transition character
   * @return a <code>TIntHashSet</code>
   * with the reachable states
   */
This returns the set of states of the non-deterministic automaton that
can be reached from the given states via the given transition character

@param nfaStateSet
a TIntHashSet
with states of the non-deterministic automaton
@param transChar a char with the transition character
@return a TIntHashSet
with the reachable states
This returns the set of states of the non - deterministic automaton that can be reached from the given states via the given transition character @param nfaStateSet a TIntHashSet with states of the non - deterministic automaton @param transChar a char with the transition character @return a TIntHashSet with the reachable states
private static <EdgeInfo> TIntHashSet move(
      final AbstractAutomaton<EdgeInfo> graph,
      TIntHashSet nfaStateSet,
      final EdgeInfo transChar,
      final Comparator<EdgeInfo> comp) {
    final TIntHashSet targetStates = new TIntHashSet();
    nfaStateSet.forEach(new TIntProcedure() {
      @Override
      public boolean execute(int state) {
        Iterable<Edge<EdgeInfo>> outEdges =
            graph.findEdges(state, transChar, comp);
        for (Edge<EdgeInfo> oneEdge : outEdges) {
          targetStates.add(oneEdge.getTarget());
        }
        return true;
      }
    });
    return targetStates;
  }
private static < EdgeInfo > TIntHashSet move ( final AbstractAutomaton < EdgeInfo > graph , TIntHashSet nfaStateSet , final EdgeInfo transChar , final Comparator < EdgeInfo > comp ) { final TIntHashSet targetStates = new TIntHashSet ( ) ; nfaStateSet . forEach ( new TIntProcedure ( ) { @ Override public boolean execute ( int state ) { Iterable < Edge < EdgeInfo > > outEdges = graph . findEdges ( state , transChar , comp ) ; for ( Edge < EdgeInfo > oneEdge : outEdges ) { targetStates . add ( oneEdge . getTarget ( ) ) ; } return true ; } } ) ; return targetStates ; }
This returns the set of states of the non-deterministic automaton that
 can be reached from the given states via the given transition character
This returns the set of states of the non - deterministic automaton that can be reached from the given states via the given transition character
// init result set // get all edges with the transition character // add target states of these edges to result