public void run() { try { for (GlobalState globalState : globallyExtant) { if (globalState.tidy == null) continue; // do a graph exploration of the GlobalState, since it should be shallow; if it references itself, we have a problem path.clear(); visited.clear(); lastVisitedCount = 0; iterations = 0; visited.add(globalState); visiting = globalState; traverse(globalState.tidy); } } catch (Throwable t) { t.printStackTrace(); } finally { lastVisitedCount = visited.size(); path.clear(); visited.clear(); } }
public void run() { try { for (GlobalState globalState : globallyExtant) { if (globalState.tidy == null) continue; // do a graph exploration of the GlobalState, since it should be shallow; if it references itself, we have a problem path.clear(); visited.clear(); lastVisitedCount = 0; iterations = 0; visited.add(globalState); visiting = globalState; traverse(globalState.tidy); } } catch (Throwable t) { t.printStackTrace(); } finally { lastVisitedCount = visited.size(); path.clear(); visited.clear(); } }
public void run() { try { for (GlobalState globalState : globallyExtant) { if (globalState.tidy == null) continue; // do a graph exploration of the GlobalState, since it should be shallow; if it references itself, we have a problem path.clear(); visited.clear(); lastVisitedCount = 0; iterations = 0; visited.add(globalState); visiting = globalState; traverse(globalState.tidy); } } catch (Throwable t) { t.printStackTrace(); } finally { lastVisitedCount = visited.size(); path.clear(); visited.clear(); } }
public void run() { try { for (GlobalState globalState : globallyExtant) { if (globalState.tidy == null) continue; // do a graph exploration of the GlobalState, since it should be shallow; if it references itself, we have a problem path.clear(); visited.clear(); lastVisitedCount = 0; iterations = 0; visited.add(globalState); visiting = globalState; traverse(globalState.tidy); } } catch (Throwable t) { t.printStackTrace(); } finally { lastVisitedCount = visited.size(); path.clear(); visited.clear(); } }