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

    final boolean[] result = { false };
    nfaStateSet.forEach(new TIntProcedure() {
      @Override
      public boolean execute(int oneState) {
        if (graph.isFinalState(oneState)) {
          result[0] = true;
          return false;
        }
        return true;
      }
    });
    return result[0];
  }
/**
   * This checks if the given set of states of the non-deterministic automaton
   * contains any final state.
   *
   * @param nfaStateSet
   * a <code>TIntHashSet</code>
   * with states of the non-deterministic automaton
   * @return a <code>boolean</code> that is <code>true</code> if any final state
   * is found
   */
This checks if the given set of states of the non-deterministic automaton
contains any final state.

@param nfaStateSet
a TIntHashSet
with states of the non-deterministic automaton
@return a boolean that is true if any final state
is found
This checks if the given set of states of the non - deterministic automaton contains any final state . @param nfaStateSet a TIntHashSet with states of the non - deterministic automaton @return a boolean that is true if any final state is found
private static <EdgeInfo> boolean isFinal(
      final AbstractAutomaton<EdgeInfo> graph,
    TIntHashSet nfaStateSet) {
    final boolean[] result = { false };
    nfaStateSet.forEach(new TIntProcedure() {
      @Override
      public boolean execute(int oneState) {
        if (graph.isFinalState(oneState)) {
          result[0] = true;
          return false;
        }
        return true;
      }
    });
    return result[0];
  }
private static < EdgeInfo > boolean isFinal ( final AbstractAutomaton < EdgeInfo > graph , TIntHashSet nfaStateSet ) { final boolean [ ] result = { false } ; nfaStateSet . forEach ( new TIntProcedure ( ) { @ Override public boolean execute ( int oneState ) { if ( graph . isFinalState ( oneState ) ) { result [ 0 ] = true ; return false ; } return true ; } } ) ; return result [ 0 ] ; }
This checks if the given set of states of the non-deterministic automaton
 contains any final state.
This checks if the given set of states of the non - deterministic automaton contains any final state .