6668764019

Committed 27 Oct 2023 02:48PM UTC coverage: 89.69% (+0.007%) from 89.683%

Build # 6668764019

Build Type

push

github

Committed by

mtf90

Commit Message

cleanup (Idefinite)Graph interfaces

Run Details

22 of 22 new or added lines in 10 files covered. (100.0%)

15832 of 17652 relevant lines covered (89.69%)

1.66 hits per line

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

0.0

/api/src/main/java/net/automatalib/graph/helper/SimpleNormalGraphView.java

/* Copyright (C) 2013-2023 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.graph.helper;

import java.util.Collection;
import java.util.Iterator;
import java.util.stream.Stream;

import com.google.common.collect.Lists;
import net.automatalib.graph.Graph;
import net.automatalib.graph.SimpleGraph;

public class SimpleNormalGraphView<N, G extends SimpleGraph<N>> extends IndefiniteNormalGraphView<N, G>
        implements Graph<N, N> {

    public SimpleNormalGraphView(G simpleGraph) {
        super(simpleGraph);
    }

    @Override
    public int size() {
        return simpleGraph.size();
    }

    @Override
    public Collection<N> getOutgoingEdges(N node) {
        return Lists.newArrayList(simpleGraph.getAdjacentTargetsIterator(node));
    }

    @Override
    public Collection<N> getNodes() {
        return simpleGraph.getNodes();
    }

    @Override
    public Iterator<N> iterator() {
        return simpleGraph.iterator();
    }

    @Override
    public Stream<N> nodesStream() {
        return simpleGraph.nodesStream();
    }

}

1	/* Copyright (C) 2013-2023 TU Dortmund
2	* This file is part of AutomataLib, http://www.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.graph.helper;
17
18	import java.util.Collection;
19	import java.util.Iterator;
20	import java.util.stream.Stream;
21
22	import com.google.common.collect.Lists;
23	import net.automatalib.graph.Graph;
24	import net.automatalib.graph.SimpleGraph;
25
26	public class SimpleNormalGraphView<N, G extends SimpleGraph<N>> extends IndefiniteNormalGraphView<N, G>
27	implements Graph<N, N> {
28
29	public SimpleNormalGraphView(G simpleGraph) {
30	super(simpleGraph);	×
31	}	×
32
33	@Override
34	public int size() {
35	return simpleGraph.size();	×
36	}
37
38	@Override
39	public Collection<N> getOutgoingEdges(N node) {
40	return Lists.newArrayList(simpleGraph.getAdjacentTargetsIterator(node));	×
41	}
42
43	@Override
44	public Collection<N> getNodes() {
45	return simpleGraph.getNodes();	×
46	}
47
48	@Override
49	public Iterator<N> iterator() {
50	return simpleGraph.iterator();	×
51	}
52
53	@Override
54	public Stream<N> nodesStream() {
55	return simpleGraph.nodesStream();	×
56	}
57
58	}

LearnLib / automatalib / 6668764019

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