6673214172

Committed 27 Oct 2023 11:30PM UTC coverage: 89.166% (-0.6%) from 89.796%

Build # 6673214172

Build Type

push

github

Committed by

mtf90

Commit Message

cleanup release configuration

Run Details

15399 of 17270 relevant lines covered (89.17%)

1.67 hits per line

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

0.0

/adapters/brics/src/main/java/net/automatalib/brics/BricsNFA.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.brics;

import dk.brics.automaton.Automaton;
import dk.brics.automaton.State;
import net.automatalib.automaton.fsa.NFA;

/**
 * Adapter class for wrapping a Brics automaton as an {@link NFA}.
 * <p>
 * This adapter is backed by the Brics automaton, so changes to the {@link Automaton} are reflected.
 * <p>
 * As a DFA can be regarded as a special case of an NFA, using this class on a Brics {@link Automaton} will always work.
 * However, determining successor states for input characters might be much less efficient than when using a {@link
 * BricsDFA}.
 */
public class BricsNFA extends AbstractBricsAutomaton implements NFA<State, Character> {

    /**
     * Constructor.
     * <p>
     * <b>Note:</b> Brics automata may only be partially defined (especially when created from regular expressions). If
     * you plan to use this wrapper in any structural analysis (e.g. for determining equivalence), consider using
     * {@link #BricsNFA(Automaton, boolean)} instead.
     *
     * @param automaton
     *         the Brics automaton to wrap.
     */
    public BricsNFA(Automaton automaton) {
        this(automaton, false);
    }

    /**
     * Constructor.
     * <p>
     * If the parameter {@code totalize} is set to {@code true}, an additional sink state will be added to the automaton
     * and all otherwise undefined transitions will transition the automaton into the sink. <b>Note:</b> this mutates
     * the original {@code automaton}.
     *
     * @param automaton
     *         the Brics automaton to wrap.
     * @param totalize
     *         flag, indicating whether the automaton should have a total transition function.
     */
    public BricsNFA(Automaton automaton, boolean totalize) {
        super(automaton, totalize);
    }
}

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.brics;
17
18	import dk.brics.automaton.Automaton;
19	import dk.brics.automaton.State;
20	import net.automatalib.automaton.fsa.NFA;
21
22	/**
23	* Adapter class for wrapping a Brics automaton as an {@link NFA}.
24	* <p>
25	* This adapter is backed by the Brics automaton, so changes to the {@link Automaton} are reflected.
26	* <p>
27	* As a DFA can be regarded as a special case of an NFA, using this class on a Brics {@link Automaton} will always work.
28	* However, determining successor states for input characters might be much less efficient than when using a {@link
29	* BricsDFA}.
30	*/
31	public class BricsNFA extends AbstractBricsAutomaton implements NFA<State, Character> {
32
33	/**
34	* Constructor.
35	* <p>
36	* <b>Note:</b> Brics automata may only be partially defined (especially when created from regular expressions). If
37	* you plan to use this wrapper in any structural analysis (e.g. for determining equivalence), consider using
38	* {@link #BricsNFA(Automaton, boolean)} instead.
39	*
40	* @param automaton
41	* the Brics automaton to wrap.
42	*/
43	public BricsNFA(Automaton automaton) {
44	this(automaton, false);	×
45	}	×
46
47	/**
48	* Constructor.
49	* <p>
50	* If the parameter {@code totalize} is set to {@code true}, an additional sink state will be added to the automaton
51	* and all otherwise undefined transitions will transition the automaton into the sink. <b>Note:</b> this mutates
52	* the original {@code automaton}.
53	*
54	* @param automaton
55	* the Brics automaton to wrap.
56	* @param totalize
57	* flag, indicating whether the automaton should have a total transition function.
58	*/
59	public BricsNFA(Automaton automaton, boolean totalize) {
60	super(automaton, totalize);	×
61	}	×
62	}

LearnLib / automatalib / 6673214172

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