Readiness: swift-format BeginDocumentationCommentWithOneLineSummary (6.3.2-Linux period/blank-line)

Author: coenttb

Sources/Algebra Lattice Primitives/Algebra.Lattice+Comparable.swift

@@ -10,6 +10,7 @@ import Algebra_Semilattice_Primitives
 /// `Comparable` Boolean algebra when the type additionally has complements.
 extension Algebra.Lattice where Element: Comparable {
     /// The min/max (chain) lattice: join = `Swift.max`, meet = `Swift.min`.
+    ///
     /// `bottom` must be a lower bound and `top` an upper bound for the type's
     /// value range (e.g. `Int.min` / `Int.max` for `Int`).
     @inlinable

Sources/Algebra Lattice Primitives/Algebra.Lattice.swift

@@ -53,11 +53,15 @@ extension Algebra {
     @frozen
     public struct Lattice<Element> {
         /// The join (∨) semilattice — least upper bound; its identity is the
-        /// lattice bottom (⊥). `lattice.join(a, b)` computes a ∨ b.
+        /// lattice bottom (⊥).
+        ///
+        /// `lattice.join(a, b)` computes a ∨ b.
         public var join: Algebra.Semilattice<Element>
 
         /// The meet (∧) semilattice — greatest lower bound; its identity is the
-        /// lattice top (⊤). `lattice.meet(a, b)` computes a ∧ b.
+        /// lattice top (⊤).
+        ///
+        /// `lattice.meet(a, b)` computes a ∧ b.
         public var meet: Algebra.Semilattice<Element>
 
         /// Creates a bounded lattice from its join and meet semilattices.