net.automatalib.util.ts.TSIterators Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of automata-util Show documentation
Show all versions of automata-util Show documentation
This artifact provides various common utility operations for analyzing and manipulating
automata and graphs, such as traversal, minimization and copying.
/* Copyright (C) 2013 TU Dortmund
* This file is part of AutomataLib, http://www.automatalib.net/.
*
* AutomataLib is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 3.0 as published by the Free Software Foundation.
*
* AutomataLib is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with AutomataLib; if not, see
* http://www.gnu.de/documents/lgpl.en.html.
*/
package net.automatalib.util.ts;
import java.util.Collection;
import java.util.Iterator;
import net.automatalib.commons.util.collections.TwoLevelIterator;
import net.automatalib.ts.TransitionSystem;
import net.automatalib.util.ts.TS.TransRef;
import com.google.common.collect.AbstractIterator;
abstract class TSIterators {
public static final class DefinedInputsIterator extends AbstractIterator {
private final TransitionSystem ts;
private final Iterator inputsIt;
private final S state;
public DefinedInputsIterator(
TransitionSystem ts,
S state,
Iterator inputsIt) {
this.ts = ts;
this.inputsIt = inputsIt;
this.state = state;
}
@Override
protected I computeNext() {
while(inputsIt.hasNext()) {
I input = inputsIt.next();
Collection transitions = ts.getTransitions(state, input);
if(transitions != null && !transitions.isEmpty()) {
return input;
}
}
return endOfData();
}
}
public static final class AllDefinedInputsIterator
extends TwoLevelIterator> {
private final TransitionSystem ts;
private final Iterable inputs;
public AllDefinedInputsIterator(
Iterator stateIt,
TransitionSystem ts,
Iterable inputs) {
super(stateIt);
this.ts = ts;
this.inputs = inputs;
}
@Override
protected Iterator l2Iterator(S state) {
return TS.definedInputsIterator(ts, state, inputs.iterator());
}
@Override
protected TransRef combine(S state, I input) {
return new TransRef<>(state, input);
}
}
public static final class UndefinedInputsIterator extends AbstractIterator {
private final TransitionSystem ts;
private final Iterator inputsIt;
private final S state;
public UndefinedInputsIterator(TransitionSystem ts, S state, Iterator inputsIt) {
this.ts = ts;
this.inputsIt = inputsIt;
this.state = state;
}
@Override
protected I computeNext() {
while(inputsIt.hasNext()) {
I input = inputsIt.next();
Collection transitions = ts.getTransitions(state, input);
if(transitions == null || !transitions.isEmpty()) {
return input;
}
}
return endOfData();
}
}
public static final class AllUndefinedInputsIterator
extends TwoLevelIterator> {
private final TransitionSystem ts;
private final Iterable inputs;
public AllUndefinedInputsIterator(
Iterator stateIt,
TransitionSystem ts,
Iterable inputs) {
super(stateIt);
this.ts = ts;
this.inputs = inputs;
}
@Override
protected Iterator l2Iterator(S state) {
return TS.undefinedInputsIterator(ts, state, inputs.iterator());
}
@Override
protected TransRef combine(S l1Object, I l2Object) {
return new TransRef<>(l1Object, l2Object);
}
}
}