Build has been canceled!

6433387082

Committed 06 Oct 2023 03:10PM UTC coverage: 92.296% (-0.007%) from 92.303%

Build # 6433387082

Build Type

push

github

Committed by

mtf90

Commit Message

update Falk's developer id

Run Details

11573 of 12539 relevant lines covered (92.3%)

1.67 hits per line

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

92.0

/algorithms/active/oml/src/main/java/de/learnlib/algorithms/oml/ttt/dfa/ChildrenDFA.java

/* Copyright (C) 2013-2023 TU Dortmund
 * This file is part of LearnLib, http://www.learnlib.de/.
 *
 * 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 de.learnlib.algorithms.oml.ttt.dfa;

import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;

import de.learnlib.algorithms.oml.ttt.dt.AbstractDTNode;
import de.learnlib.algorithms.oml.ttt.dt.Children;
import de.learnlib.algorithms.oml.ttt.dt.DTInnerNode;
import de.learnlib.algorithms.oml.ttt.dt.DTLeaf;
import org.checkerframework.checker.nullness.qual.Nullable;

class ChildrenDFA<I> implements Children<I, Boolean> {

    private @Nullable AbstractDTNode<I, Boolean> trueChild;
    private @Nullable AbstractDTNode<I, Boolean> falseChild;

    @Override
    public @Nullable AbstractDTNode<I, Boolean> child(Boolean out) {
        return out ? trueChild : falseChild;
    }

    @Override
    public Boolean key(AbstractDTNode<I, Boolean> child) {
        if (child == trueChild) {
            return true;
        } else if (child == falseChild) {
            return false;
        } else {
            throw new AssertionError("this should not be possible");
        }
    }

    @Override
    public void addChild(Boolean out, AbstractDTNode<I, Boolean> child) {
        assert child(out) == null;
        if (out) {
            trueChild = child;
        } else {
            falseChild = child;
        }
    }

    @Override
    public void replace(DTLeaf<I, Boolean> oldNode, DTInnerNode<I, Boolean> newNode) {
        if (oldNode == trueChild) {
            trueChild = newNode;
        } else if (oldNode == falseChild) {
            falseChild = newNode;
        } else {
            throw new AssertionError("this should not be possible");
        }
    }

    @Override
    public Collection<AbstractDTNode<I, Boolean>> all() {
        if (trueChild != null && falseChild != null) {
            return Arrays.asList(trueChild, falseChild);
        } else if (trueChild != null) {
            return Collections.singletonList(trueChild);
        } else if (falseChild != null) {
            return Collections.singletonList(falseChild);
        } else {
            return Collections.emptyList();
        }
    }

}

1	/* Copyright (C) 2013-2023 TU Dortmund
2	* This file is part of LearnLib, http://www.learnlib.de/.
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 de.learnlib.algorithms.oml.ttt.dfa;
17
18	import java.util.Arrays;
19	import java.util.Collection;
20	import java.util.Collections;
21
22	import de.learnlib.algorithms.oml.ttt.dt.AbstractDTNode;
23	import de.learnlib.algorithms.oml.ttt.dt.Children;
24	import de.learnlib.algorithms.oml.ttt.dt.DTInnerNode;
25	import de.learnlib.algorithms.oml.ttt.dt.DTLeaf;
26	import org.checkerframework.checker.nullness.qual.Nullable;
27
28	class ChildrenDFA<I> implements Children<I, Boolean> {	2✔
29
30	private @Nullable AbstractDTNode<I, Boolean> trueChild;
31	private @Nullable AbstractDTNode<I, Boolean> falseChild;
32
33	@Override
34	public @Nullable AbstractDTNode<I, Boolean> child(Boolean out) {
35	return out ? trueChild : falseChild;	2✔
36	}
37
38	@Override
39	public Boolean key(AbstractDTNode<I, Boolean> child) {
40	if (child == trueChild) {	2✔
41	return true;	2✔
42	} else if (child == falseChild) {	2✔
43	return false;	2✔
44	} else {
45	throw new AssertionError("this should not be possible");	×
46	}
47	}
48
49	@Override
50	public void addChild(Boolean out, AbstractDTNode<I, Boolean> child) {
51	assert child(out) == null;	2✔
52	if (out) {	2✔
53	trueChild = child;	2✔
54	} else {
55	falseChild = child;	2✔
56	}
57	}	2✔
58
59	@Override
60	public void replace(DTLeaf<I, Boolean> oldNode, DTInnerNode<I, Boolean> newNode) {
61	if (oldNode == trueChild) {	2✔
62	trueChild = newNode;	2✔
63	} else if (oldNode == falseChild) {	2✔
64	falseChild = newNode;	2✔
65	} else {
66	throw new AssertionError("this should not be possible");	×
67	}
68	}	2✔
69
70	@Override
71	public Collection<AbstractDTNode<I, Boolean>> all() {
72	if (trueChild != null && falseChild != null) {	2✔
73	return Arrays.asList(trueChild, falseChild);	2✔
74	} else if (trueChild != null) {	2✔
75	return Collections.singletonList(trueChild);	1✔
76	} else if (falseChild != null) {	2✔
77	return Collections.singletonList(falseChild);	2✔
78	} else {
79	return Collections.emptyList();	2✔
80	}
81	}
82
83	}

LearnLib / learnlib / 6433387082

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