more cleanups

Author: mtf90

algorithms/active/sparse/src/main/java/de/learnlib/algorithm/sparse/FringeRow.java

@@ -42,8 +42,8 @@ class FringeRow<S, I, O> extends Row<S, I, O> {
      */
     O transOut;
     /**
-     * For compression, fringe rows do not store observations directly. instead, they point to some leaf in a tree
-     * encoding their classification history. this trick avoids redundantly storing identical observations.
+     * For compression, fringe rows do not store observations directly. Instead, they point to some leaf in a tree
+     * encoding their classification history. This trick avoids redundantly storing identical observations.
      */
     Leaf<S, I, O> leaf;
 

algorithms/active/sparse/src/main/java/de/learnlib/algorithm/sparse/GenericSparseLearner.java

@@ -290,8 +290,8 @@ private int moveToCore(FringeRow<S, I, O> f, List<Integer> cellIds) {
     }
 
     /**
-     * Takes fringe row and its observations, Queries the missing entries and returns a list containing the observations
-     * for all suffixes.
+     * Takes fringe row and its observations, queries the missing entries, and returns a list containing the
+     * observations for all suffixes.
      */
     private List<Integer> completeRowObservations(FringeRow<S, I, O> f, List<Integer> cellIds) {
         final Set<Word<I>> sufsPresent = new HashSet<>(HashUtil.capacity(cellIds.size()));

algorithms/active/sparse/src/main/java/de/learnlib/algorithm/sparse/Leaf.java

@@ -28,7 +28,7 @@ class Leaf<S, I, O> extends Node<S, I, O> {
     private int lastNumSufs;
 
     /**
-     * Split leafs always remember how many core rows and suffixes the table contained at their last visit. Tis
+     * Split leafs always remember how many core rows and suffixes the table contained at their last visit. This
      * information is used as a logical timestamp to check whether the separator is still guaranteed to be optimal or if
      * it needs to be recomputed.
      */

…se/src/test/java/sparse/it/SparseIT.java …arnlib/algorithm/sparse/it/SparseIT.javaalgorithms/active/sparse/src/test/java/sparse/it/SparseIT.java renamed to algorithms/active/sparse/src/test/java/de/learnlib/algorithm/sparse/it/SparseIT.java algorithms/active/sparse/src/test/java/sparse/it/SparseIT.java renamed to algorithms/active/sparse/src/test/java/de/learnlib/algorithm/sparse/it/SparseIT.java

@@ -13,7 +13,7 @@
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-package sparse.it;
+package de.learnlib.algorithm.sparse.it;
 
 import de.learnlib.algorithm.sparse.SparseLearner;
 import de.learnlib.oracle.MembershipOracle.MealyMembershipOracle;