Editorial change: improving formatting

content/courses/ada-idioms/chapters/essential_idioms_for_packages.rst

@@ -143,11 +143,12 @@ For example:
        -- ...
     end Linear_Algebra;
 
-In this example, :ada:`Vector` and :ada:`Matrix` are the types under consideration. The type :ada:`Real` might be declared here too, but it might be
-better declared in a :ref:`Named Collection of Declarations
-<Ada_Idioms_Named_Collection_Of_Declarations>` package referenced in a
-with_clause. In any case, this package declares types and subprograms that
-manipulate values of those types.
+In this example, :ada:`Vector` and :ada:`Matrix` are the types under
+consideration. The type :ada:`Real` might be declared here too, but it might be
+better declared in a
+:ref:`Named Collection of Declarations <Ada_Idioms_Named_Collection_Of_Declarations>`
+package referenced in a with_clause. In any case, this package declares types
+and subprograms that manipulate values of those types.
 
 One might also declare variables in the package, but those should not be
 the central purpose of the package. For example, perhaps we want to have a

content/courses/ada-idioms/chapters/introduction.rst

@@ -38,8 +38,8 @@ to be the same as for expressing a Singleton [1]_.
 
 In addition to language-independent situations, we also include
 solutions for situations specific to the Ada language. These idioms are
-*best practices* in situations that arise given the extensive capabilities
-of the language.
+*best practices* in situations that
+arise given the extensive capabilities of the language.
 
 For example, Ada directly supports tasks (threads) via a dedicated
 construct consisting of local objects and a sequence of statements.

content/courses/ada-idioms/index.rst

@@ -42,8 +42,8 @@ Ada Idioms
 .. container:: content-description
 
     This course describes how to implement selected programming idioms in
-    the Ada language. Prior knowledge of Ada is required, although some explanations
-    of the underlying semantics are provided when appropriate.
+    the Ada language. Prior knowledge of Ada is required, although some
+    explanations of the underlying semantics are provided when appropriate.
 
     This document was written by Patrick Rogers.