static > ItIt repeatedInputModificationsIterator(S input, final F1> makeIterators) { final HashSet seen = lithashset(input); // Make pool of iterators final new LinkedList> pool; addAll(pool, callF(makeIterators, input)); ret iteratorFromFunction(func -> S { while ping (!empty(pool)) { Iterator it = first(pool); if (!it.hasNext()) continue with removeFirst(pool); // Get entry and check if seen already S entry = it.next(); if (!seen.add(entry)) continue; // found new entry - return and schedule for further analysis addAll(pool, callF(makeIterators, entry)); ret entry; } null; }); }