Skip to content

Commit 5a5141a

Browse files
committed
Fix Javadoc errors
1 parent bc466bd commit 5a5141a

5 files changed

Lines changed: 10 additions & 7 deletions

File tree

src/main/java/de/learnlib/ralib/ct/CTAutomatonBuilder.java

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -39,8 +39,10 @@
3939

4040
/**
4141
* Builder class for building a {@link CTHypothesis} from a {@link ClassificationTree}.
42-
* This class implements similar functionality as {@link AutomatonBuilder} and {@link IOAutomatonBuilder},
43-
* but tailored for the {@link SLLambda} and {@link SLCT} learning algorithms.
42+
* This class implements similar functionality as {@link AutomatonBuilder} and
43+
* {@link de.learnlib.ralib.learning.IOAutomatonBuilder},
44+
* but tailored for the {@link de.learnlib.ralib.learning.ralambda.SLLambda} and
45+
* {@link de.learnlib.ralib.learning.ralambda.SLCT} learning algorithms.
4446
*
4547
* {@code CTAutomatonBuilder} supports construction of automata from an incomplete classification tree,
4648
* so long as the classification tree is closed and consistent.

src/main/java/de/learnlib/ralib/ct/CTBranch.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -43,7 +43,7 @@ public CTNode getChild() {
4343
* @param other the path to compare for equivalence
4444
* @param solver constraint solver to use when comparing for equivalence
4545
* @return {@code Bijection} under which the {@code SDT}s of {@code other} are equivalent to those of {@code this}, or {@code null} if the {@code SDT}s are not equivalent.
46-
* @see SDT
46+
* @see de.learnlib.ralib.theory.SDT
4747
*/
4848
public Bijection<DataValue> matches(CTPath other, ConstraintSolver solver) {
4949
if (!reprPath.typeSizesMatch(other)) {

src/main/java/de/learnlib/ralib/ct/CTLeaf.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -137,7 +137,7 @@ protected CTLeaf sift(Prefix prefix, TreeOracle oracle, ConstraintSolver solver,
137137
* @param inputs all input symbols
138138
* @return {@code u} as a {@code ShortPrefix}
139139
* @see Branching
140-
* @see SDT
140+
* @see de.learnlib.ralib.theory.SDT
141141
* @see CTPath
142142
*/
143143
protected ShortPrefix elevatePrefix(Word<PSymbolInstance> u, TreeOracle oracle, ParameterizedSymbol ... inputs) {

src/main/java/de/learnlib/ralib/ct/CTPath.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -17,11 +17,11 @@
1717
/**
1818
* This data structure stores the SDTs from tree queries for a prefix along a path
1919
* in a {@link ClassificationTree}. It contains much of the same functionality as
20-
* {@link Row}, but adapted for use with classification trees.
20+
* {@link de.learnlib.ralib.learning.rastar.Row}, but adapted for use with classification trees.
2121
*
2222
* @author fredrik
2323
* @author falk
24-
* @see Row
24+
* @see de.learnlib.ralib.learning.rastar.Row
2525
*/
2626
public class CTPath {
2727
private final Map<SymbolicSuffix, SDT> sdts;

src/main/java/de/learnlib/ralib/learning/IOAutomatonBuilder.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
/*
2-
* Copyright (C) 2014-2015 The LearnLib Contributors
2+
* Copyright (C) 2014-2025 The LearnLib Contributors
33
* This file is part of LearnLib, http://www.learnlib.de/.
44
*
55
* Licensed under the Apache License, Version 2.0 (the "License");
@@ -46,6 +46,7 @@
4646
import net.automatalib.word.Word;
4747

4848
/**
49+
* Constructs IO Register Automata from observation tables
4950
*
5051
* @author falk
5152
*/

0 commit comments

Comments
 (0)