net.automatalib.util.ts.traversal.SimpleDFRecord 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

This artifact provides various common utility operations for analyzing and manipulating automata and graphs, such as traversal, minimization and copying.

There is a newer version: 0.11.0

Show newest version

/* Copyright (C) 2013-2019 TU Dortmund
 * This file is part of AutomataLib, http://www.automatalib.net/.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package net.automatalib.util.ts.traversal;

import java.util.Collection;
import java.util.Iterator;

import net.automatalib.ts.TransitionSystem;

class SimpleDFRecord {

    public final S state;

    private final Iterator inputsIterator;
    private I input;
    private Iterator transitionIterator;

    SimpleDFRecord(S state, Collection inputs) {
        this.state = state;
        this.inputsIterator = inputs.iterator();
    }

    public boolean start(TransitionSystem ts) {
        if (transitionIterator != null) {
            return false;
        }

        findNext(ts);
        return true;
    }

    private void findNext(TransitionSystem ts) {
        if (transitionIterator != null && transitionIterator.hasNext()) {
            return;
        }
        while (inputsIterator.hasNext()) {
            input = inputsIterator.next();
            Collection transitions = ts.getTransitions(state, input);
            if (!transitions.isEmpty()) {
                transitionIterator = transitions.iterator();
                break;
            }
        }
    }

    public boolean hasNextTransition(TransitionSystem ts) {
        if (transitionIterator == null) {
            return false;
        }
        if (!transitionIterator.hasNext()) {
            findNext(ts);
        }
        return transitionIterator.hasNext();
    }

    public void advance(TransitionSystem ts) {
        if (transitionIterator.hasNext()) {
            return;
        }
        findNext(ts);
    }

    public void advanceInput(TransitionSystem ts) {
        transitionIterator = null;
        findNext(ts);
    }

    public I input() {
        return input;
    }

    public T transition() {
        return transitionIterator.next();
    }

}