6763327895

Committed 05 Nov 2023 07:29PM UTC coverage: 89.726% (-0.1%) from 89.868%

Build # 6763327895

Build Type

push

github

Committed by

mtf90

Commit Message

fix typo

Run Details

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

99 existing lines in 18 files now uncovered.

15677 of 17472 relevant lines covered (89.73%)

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/SimpleNodeIDs.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.ArrayList;
import java.util.List;
import java.util.Map;

import com.google.common.collect.Maps;
import net.automatalib.graph.SimpleGraph;
import net.automatalib.graph.concept.NodeIDs;

public class SimpleNodeIDs<N> implements NodeIDs<N> {

    private final Map<N, Integer> nodeIds;
    private final List<N> nodes;

    public SimpleNodeIDs(SimpleGraph<N> graph) {
        this.nodes = new ArrayList<>(graph.getNodes());
        int numNodes = this.nodes.size();
        this.nodeIds = Maps.newHashMapWithExpectedSize(numNodes);

        for (int i = 0; i < numNodes; i++) {
            N node = this.nodes.get(i);
            nodeIds.put(node, i);
        }
    }

    @Override
    public int getNodeId(N node) {
        final Integer id = nodeIds.get(node);

        if (id == null) {
            throw new IllegalArgumentException();
        }

        return id;
    }

    @Override
    public N getNode(int id) {
        return nodes.get(id);
    }
}

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.ArrayList;
19	import java.util.List;
20	import java.util.Map;
21
22	import com.google.common.collect.Maps;
23	import net.automatalib.graph.SimpleGraph;
24	import net.automatalib.graph.concept.NodeIDs;
25
26	public class SimpleNodeIDs<N> implements NodeIDs<N> {
27
28	private final Map<N, Integer> nodeIds;
29	private final List<N> nodes;
30
UNCOV 31	public SimpleNodeIDs(SimpleGraph<N> graph) {	×
UNCOV 32	this.nodes = new ArrayList<>(graph.getNodes());	×
UNCOV 33	int numNodes = this.nodes.size();	×
UNCOV 34	this.nodeIds = Maps.newHashMapWithExpectedSize(numNodes);	×
35
UNCOV 36	for (int i = 0; i < numNodes; i++) {	×
UNCOV 37	N node = this.nodes.get(i);	×
UNCOV 38	nodeIds.put(node, i);	×
39	}
UNCOV 40	}	×
41
42	@Override
43	public int getNodeId(N node) {
UNCOV 44	final Integer id = nodeIds.get(node);	×
45
UNCOV 46	if (id == null) {	×
47	throw new IllegalArgumentException();	×
48	}
49
UNCOV 50	return id;	×
51	}
52
53	@Override
54	public N getNode(int id) {
55	return nodes.get(id);	×
56	}
57	}

LearnLib / automatalib / 6763327895

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