13138848026

Committed 04 Feb 2025 02:53PM UTC coverage: 92.108% (+2.2%) from 89.877%

Build # 13138848026

Build Type

push

github

Committed by

mtf90

Commit Message

[maven-release-plugin] prepare release automatalib-0.12.0

Run Details

16609 of 18032 relevant lines covered (92.11%)

1.7 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

95.65

/util/src/main/java/net/automatalib/util/ts/traversal/BreadthFirstIterator.java

/* Copyright (C) 2013-2025 TU Dortmund University
 * This file is part of AutomataLib <https://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.ArrayDeque;
import java.util.Collection;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.Queue;

import net.automatalib.common.util.mapping.MutableMapping;
import net.automatalib.ts.simple.SimpleTS;
import net.automatalib.util.traversal.VisitedState;

final class BreadthFirstIterator<S, I> implements Iterator<S> {

    private final Queue<S> bfsQueue = new ArrayDeque<>();
    private final MutableMapping<S, VisitedState> seen;
    private final SimpleTS<S, I> ts;
    private final Collection<? extends I> inputs;

    BreadthFirstIterator(SimpleTS<S, I> ts, Collection<? extends I> inputs) {
        this.ts = ts;
        this.inputs = inputs;
        seen = ts.createStaticStateMapping();
        Collection<S> initial = ts.getInitialStates();
        bfsQueue.addAll(initial);
        for (S state : initial) {
            seen.put(state, VisitedState.VISITED);
        }
    }

    @Override
    public boolean hasNext() {
        return !bfsQueue.isEmpty();
    }

    @Override
    public S next() {
        S state = bfsQueue.poll();

        if (state == null) {
            throw new NoSuchElementException();
        }

        for (I input : inputs) {
            Collection<S> succs = ts.getSuccessors(state, input);
            for (S succ : succs) {
                if (seen.put(succ, VisitedState.VISITED) != VisitedState.VISITED) {
                    bfsQueue.add(succ);
                }
            }
        }

        return state;
    }

}

1	/* Copyright (C) 2013-2025 TU Dortmund University
2	* This file is part of AutomataLib <https://automatalib.net>.
3	*
4	* Licensed under the Apache License, Version 2.0 (the "License");
5	* you may not use this file except in compliance with the License.
6	* You may obtain a copy of the License at
7	*
8	* http://www.apache.org/licenses/LICENSE-2.0
9	*
10	* Unless required by applicable law or agreed to in writing, software
11	* distributed under the License is distributed on an "AS IS" BASIS,
12	* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13	* See the License for the specific language governing permissions and
14	* limitations under the License.
15	*/
16	package net.automatalib.util.ts.traversal;
17
18	import java.util.ArrayDeque;
19	import java.util.Collection;
20	import java.util.Iterator;
21	import java.util.NoSuchElementException;
22	import java.util.Queue;
23
24	import net.automatalib.common.util.mapping.MutableMapping;
25	import net.automatalib.ts.simple.SimpleTS;
26	import net.automatalib.util.traversal.VisitedState;
27
28	final class BreadthFirstIterator<S, I> implements Iterator<S> {
29
30	private final Queue<S> bfsQueue = new ArrayDeque<>();	2✔
31	private final MutableMapping<S, VisitedState> seen;
32	private final SimpleTS<S, I> ts;
33	private final Collection<? extends I> inputs;
34
35	BreadthFirstIterator(SimpleTS<S, I> ts, Collection<? extends I> inputs) {	2✔
36	this.ts = ts;	2✔
37	this.inputs = inputs;	2✔
38	seen = ts.createStaticStateMapping();	2✔
39	Collection<S> initial = ts.getInitialStates();	2✔
40	bfsQueue.addAll(initial);	2✔
41	for (S state : initial) {	2✔
42	seen.put(state, VisitedState.VISITED);	2✔
43	}	2✔
44	}	2✔
45
46	@Override
47	public boolean hasNext() {
48	return !bfsQueue.isEmpty();	2✔
49	}
50
51	@Override
52	public S next() {
53	S state = bfsQueue.poll();	2✔
54
55	if (state == null) {	2✔
56	throw new NoSuchElementException();	×
57	}
58
59	for (I input : inputs) {	2✔
60	Collection<S> succs = ts.getSuccessors(state, input);	2✔
61	for (S succ : succs) {	2✔
62	if (seen.put(succ, VisitedState.VISITED) != VisitedState.VISITED) {	2✔
63	bfsQueue.add(succ);	2✔
64	}
65	}	2✔
66	}	2✔
67
68	return state;	2✔
69	}
70
71	}

LearnLib / automatalib / 13138848026

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous