Spotless

Author: edwardalee

lfc/core/src/main/java/org/lflang/ast/IsEqual.java

@@ -67,8 +67,8 @@
 
 /**
  * Switch class that checks if subtrees of the AST are semantically equivalent to each other. Return
- * `false` if they are not equivalent; return `true` or `false` (but preferably
- * `true`) if they are equivalent.
+ * `false` if they are not equivalent; return `true` or `false` (but preferably `true`) if they are
+ * equivalent.
  *
  * @ingroup Utilities
  */
@@ -657,7 +657,8 @@ <T> ComparisonMachine<E> equalAsObjects(Function<E, T> propertyGetter) {
 
     /**
      * Conclude false if the two properties are not equal as objects, given that
-     * `projectionToClassRepresentatives` maps each object to some semantically equivalent object. If either or both of the objects are null, also conclude false.
+     * `projectionToClassRepresentatives` maps each object to some semantically equivalent object.
+     * If either or both of the objects are null, also conclude false.
      */
     <T> ComparisonMachine<E> equalAsObjectsModulo(
         Function<E, T> propertyGetter, Function<T, T> projectionToClassRepresentatives) {
@@ -678,8 +679,7 @@ <T extends EObject> ComparisonMachine<E> equivalent(Function<E, T> propertyGette
 
     /**
      * Conclude false if the two properties are not semantically equivalent parse nodes, given that
-     * `projectionToClassRepresentatives` maps each parse node to some semantically equivalent
-     * node.
+     * `projectionToClassRepresentatives` maps each parse node to some semantically equivalent node.
      */
     <T extends EObject> ComparisonMachine<E> equivalentModulo(
         Function<E, T> propertyGetter, Function<T, T> projectionToClassRepresentatives) {

lfc/core/src/main/java/org/lflang/ast/ToLf.java

@@ -177,9 +177,7 @@ static ICompositeNode getNextCompositeSibling(INode node, Function<INode, INode>
     return null;
   }
 
-  /**
-   * Return the siblings following `node` up to (and not including) the next non-leaf sibling.
-   */
+  /** Return the siblings following `node` up to (and not including) the next non-leaf sibling. */
   private static Stream<INode> getFollowingNonCompositeSiblings(ICompositeNode node) {
     INode sibling = node;
     List<INode> ret = new ArrayList<>();
@@ -190,8 +188,8 @@ private static Stream<INode> getFollowingNonCompositeSiblings(ICompositeNode nod
   }
 
   /**
-   * Return comments that follow `node` in the source code and that either satisfy `filter`
-   * or that cannot belong to any following sibling of `node`.
+   * Return comments that follow `node` in the source code and that either satisfy `filter` or that
+   * cannot belong to any following sibling of `node`.
    */
   private static Stream<String> getFollowingComments(
       ICompositeNode node, Predicate<INode> precedingFilter, Predicate<INode> followingFilter) {
@@ -207,8 +205,8 @@ private static Stream<String> getFollowingComments(
   }
 
   /**
-   * Return comments contained by `node` that logically belong to this node (and not to any of
-   * its children).
+   * Return comments contained by `node` that logically belong to this node (and not to any of its
+   * children).
    */
   private static List<INode> getContainedCodeComments(INode node) {
     ArrayList<INode> ret = new ArrayList<>();
@@ -231,8 +229,8 @@ private static List<INode> getContainedCodeComments(INode node) {
   }
 
   /**
-   * Return all comments that are part of `node`, regardless of where they appear relative to
-   * the main content of the node.
+   * Return all comments that are part of `node`, regardless of where they appear relative to the
+   * main content of the node.
    */
   private static List<INode> getContainedComments(INode node) {
     var ret = new ArrayList<INode>();