Remove formatting from titles

frank-at-adacore · frank-at-adacore · commit ac52b97f4241 · 2025-12-15T22:30:53.000-05:00
diff --git a/courses/ada_essentials/030_scalar_types/06-character_types.rst b/courses/ada_essentials/030_scalar_types/06-character_types.rst
@@ -44,7 +44,7 @@ Character Oriented Packages
 * See RM Annex A for details
 
 -----------------------------------------
-`Ada.Characters.Latin_1` Sample Content
+"Ada.Characters.Latin_1" Sample Content
 -----------------------------------------
 
 .. code:: Ada
diff --git a/courses/ada_essentials/060_record_types/04-record_aggregates.rst b/courses/ada_essentials/060_record_types/04-record_aggregates.rst
@@ -162,7 +162,7 @@ Aggregates with Only One Component
    S : Singular := (A => 3 + 1); -- required
 
 --------------------------
-Aggregates with `others`
+Aggregates with "others"
 --------------------------
 
 * Indicates all components not yet specified (like arrays)
diff --git a/courses/ada_essentials/070_subprograms/03-parameters.rst b/courses/ada_essentials/070_subprograms/03-parameters.rst
@@ -88,7 +88,7 @@ Function Return
    function To_String (Value : Integer) return String;
 
 ---------------------------------
-Why Read Mode `out` Parameters?
+Why Read Mode "out" Parameters?
 ---------------------------------
 
 * No need for readable temporary variable
diff --git a/courses/ada_essentials/070_subprograms/09-potential_pitfalls.rst b/courses/ada_essentials/070_subprograms/09-potential_pitfalls.rst
@@ -3,7 +3,7 @@ Potential Pitfalls
 ====================
 
 -----------------------------
-Mode `out` Risk for Scalars
+Mode "out" Risk for Scalars
 -----------------------------
 
 * Always assign value to :ada:`out` parameters
diff --git a/courses/ada_essentials/090_overloading/04-user_defined_equality-in_depth.rst b/courses/ada_essentials/090_overloading/04-user_defined_equality-in_depth.rst
@@ -37,7 +37,7 @@ User-Defined Equality
           return Fuzzy_Result;
 
 ------------------------------------
-User-Defined `=` Returning Boolean
+User-Defined "=" Returning Boolean
 ------------------------------------
 
 * Implicitly declares ``/=``
diff --git a/courses/ada_essentials/090_overloading/05-composition_of_equality.rst b/courses/ada_essentials/090_overloading/05-composition_of_equality.rst
@@ -78,7 +78,7 @@ Enclosing Equality Function Example
    end "=";
 
 ----------------------------------------
-`=` for Predefined Composites Composes
+"=" for Predefined Composites Composes
 ----------------------------------------
 
 * Per RM 4.5.2(32/1)
diff --git a/courses/ada_essentials/100_packages/03-referencing_other_packages.rst b/courses/ada_essentials/100_packages/03-referencing_other_packages.rst
@@ -3,7 +3,7 @@ Referencing Other Packages
 ============================
 
 ----------------
- `with` Clause
+ "with" Clause
 ----------------
 
 * When package :ada:`User` needs access to package :ada:`Designer`, it uses a :ada:`with` clause
@@ -51,7 +51,7 @@ Referencing Exported Items
         ...
 
 ----------------------
-`with` Clause Syntax
+"with" Clause Syntax
 ----------------------
 
 * A library unit is a package or subprogram that is not nested within another unit
diff --git a/courses/ada_essentials/100_packages/88-packages.lab.rst b/courses/ada_essentials/100_packages/88-packages.lab.rst
@@ -32,9 +32,9 @@ Packages Lab
 
   - Remember: :code:`with package_name;` gives access to :code:`package_name`
 
-----------------------------------------------
-Creating Packages in :toolname:`GNAT Studio`
-----------------------------------------------
+------------------------------------
+Creating Packages in "GNAT Studio"
+------------------------------------
 
 * Right-click on the source directory node
 
diff --git a/courses/ada_essentials/130_program_structure/03-circular_dependencies.rst b/courses/ada_essentials/130_program_structure/03-circular_dependencies.rst
@@ -73,7 +73,7 @@ Circular Dependency in Package Declaration
    end Department;
 
 ------------------------
-`limited with` Clauses
+"limited with" Clauses
 ------------------------
 
 * Solve the circular declaration dependency problem
@@ -166,7 +166,7 @@ Legal Package Declaration Dependency
   language_version 2005
 
 ----------------------------------------
-Full `with` Clause on the Package Body
+Full "with" Clause on the Package Body
 ----------------------------------------
 
 * Even though declaration has a :ada:`limited with` clause
diff --git a/courses/ada_essentials/130_program_structure/04-hierarchical_library_units.rst b/courses/ada_essentials/130_program_structure/04-hierarchical_library_units.rst
@@ -246,7 +246,7 @@ Example of Visibility As If Nested
    end Complex;
 
 -------------------------------------------
-`with` Clauses for Ancestors Are Implicit
+"with" Clauses for Ancestors Are Implicit
 -------------------------------------------
 
 .. container:: columns
@@ -279,7 +279,7 @@ Example of Visibility As If Nested
       end Parent.Child;
 
 -------------------------------------------
- `with` Clauses for Siblings Are Required
+ "with" Clauses for Siblings Are Required
 -------------------------------------------
 
 * If references are intended
diff --git a/courses/ada_essentials/130_program_structure/06-private_children.rst b/courses/ada_essentials/130_program_structure/06-private_children.rst
@@ -142,7 +142,7 @@ Solution 2: Partially Import Private Unit
   language_version 2005
 
 ------------------------
-`private with` Example
+"private with" Example
 ------------------------
 
 .. code:: Ada
diff --git a/courses/ada_essentials/143_general_access_types/02-general_access_types.rst b/courses/ada_essentials/143_general_access_types/02-general_access_types.rst
@@ -52,7 +52,7 @@ Referencing the Stack
      Access_Object : Gen_Access_T := Object'Access;
 
 --------------------------
-`Aliased` Object Example
+"Aliased" Object Example
 --------------------------
 
 .. code:: Ada
@@ -88,7 +88,7 @@ Referencing the Stack
 :command:`After: 123`
 
 ----------------------
-`Aliased` Parameters
+"Aliased" Parameters
 ----------------------
 
 * To ensure a subprogram parameter always has a valid memory address, define it as :ada:`aliased`
diff --git a/courses/ada_essentials/190_exceptions/04-language_defined_exceptions.rst b/courses/ada_essentials/190_exceptions/04-language_defined_exceptions.rst
@@ -3,7 +3,7 @@ Language-Defined Exceptions
 =============================
 
 --------------------
-`Constraint_Error`
+"Constraint_Error"
 --------------------
 
 * Caused by violations of constraints on range, index, etc.
@@ -22,7 +22,7 @@ Language-Defined Exceptions
       L (400) := SomeValue;
 
 -----------------
-`Program_Error`
+"Program_Error"
 -----------------
 
 * When runtime control structure is violated
@@ -43,7 +43,7 @@ Language-Defined Exceptions
    end F;
 
 -----------------
-`Storage_Error`
+"Storage_Error"
 -----------------
 
 * When insufficient storage is available
diff --git a/courses/ada_essentials/190_exceptions/08-exceptions_as_objects-in_depth.rst b/courses/ada_essentials/190_exceptions/08-exceptions_as_objects-in_depth.rst
@@ -100,7 +100,7 @@ Exception Occurrence
          Put (Exception_Name (Caught_Exception));
 
 ----------------------------------------
-`Exception_Occurrence` Query Functions
+"Exception_Occurrence" Query Functions
 ----------------------------------------
 
 * `Exception_Name`
@@ -206,7 +206,7 @@ Re-Raising Exceptions Procedurally
      end;
 
 ----------------------------------------
-Copying `Exception_Occurrence` Objects
+Copying "Exception_Occurrence" Objects
 ----------------------------------------
 
 * Via procedure `Save_Occurrence`
diff --git a/courses/ada_essentials/190_exceptions/08-exceptions_as_objects.rst b/courses/ada_essentials/190_exceptions/08-exceptions_as_objects.rst
@@ -61,7 +61,7 @@ Exception Occurrence
          Put (Exception_Name (Caught_Exception));
 
 ----------------------------------------
-`Exception_Occurrence` Query Functions
+"Exception_Occurrence" Query Functions
 ----------------------------------------
 
 * `Exception_Name`
diff --git a/courses/ada_essentials/230_interfacing_with_c/10-example_refcount_wrap.rst b/courses/ada_essentials/230_interfacing_with_c/10-example_refcount_wrap.rst
@@ -96,9 +96,9 @@ Wrapper Implementation: Full Picture
       Is_Owner        : Boolean;
    end record;
 
-------------------------
-:ada:`Adjust` Completion
-------------------------
+-------------------
+"Adjust" Completion
+-------------------
 
 * :ada:`Adjust` is called every time a new reference is **created**
 * Increments the ref-counter
@@ -112,9 +112,9 @@ Wrapper Implementation: Full Picture
        end if;
     end Adjust;
 
---------------------------
-:ada:`Finalize` Completion
---------------------------
+---------------------
+"Finalize" Completion
+---------------------
 
 .. note::
 
diff --git a/courses/ada_essentials/240_tasking/06-advanced_concepts_in_depth.rst b/courses/ada_essentials/240_tasking/06-advanced_concepts_in_depth.rst
@@ -232,9 +232,9 @@ Setting Task Priority
       Ada.Dynamic_Priorities.Set_Priority (10);
    end Prioritized_Task_T;
 
---------------------------
-:ada:`requeue` Instruction
---------------------------
+---------------------
+"requeue" Instruction
+---------------------
 
 * :ada:`requeue` can be called in any :ada:`entry` (task or protected)
 * Puts the requesting task back into the queue
@@ -255,9 +255,9 @@ Setting Task Priority
 
 * Same parameter values will be used on the queue
 
------------------------
-:ada:`requeue` Tricks
------------------------
+------------------
+"requeue" Tricks
+------------------
 
 * Only an accepted call can be requeued
 * Accepted entries are waiting for :ada:`end`
@@ -298,9 +298,9 @@ Abort Statements
             abort Task_Instance;
          end;
 
------------------------------------
-:ada:`select` ... :ada:`then abort`
------------------------------------
+-------------------------
+"select" ... "then abort"
+-------------------------
 
 * :ada:`select` can call :ada:`abort`
 * Can abort anywhere in the processing
diff --git a/courses/ada_essentials/270_introduction_to_contracts/01-introduction.rst b/courses/ada_essentials/270_introduction_to_contracts/01-introduction.rst
@@ -2,9 +2,9 @@
 Introduction
 ==============
 
---------------------------
-:dfn:`Design-By-Contract`
---------------------------
+----------------------
+"Design-By-Contract"
+----------------------
 
 * Source code acting in roles of **client** and **supplier** under a binding **contract**
 
@@ -45,9 +45,9 @@ Ada Contracts
    - ... or by types (seen later)
    - Can have **arbitrary** conditions, more **versatile**
 
-------------------
-:dfn:`Assertion`
-------------------
+-------------
+"Assertion"
+-------------
 
 * Boolean expression expected to be :ada:`True`
 * Said *to hold* when :ada:`True`
diff --git a/courses/ada_essentials/270_introduction_to_contracts/02-preconditions_and_postconditions.rst b/courses/ada_essentials/270_introduction_to_contracts/02-preconditions_and_postconditions.rst
@@ -118,9 +118,9 @@ Postconditions
    function Top (This : Stack) return Content
      with Pre => not Empty (This);
 
--------------------------------------
-Postcondition :ada:`'Old` Attribute
--------------------------------------
+--------------------------------
+Postcondition "'Old" Attribute
+--------------------------------
 
 * Values as they were just before the call
 * Uses language-defined attribute :ada:`'Old`
@@ -140,9 +140,9 @@ Postcondition :ada:`'Old` Attribute
                  Pre  => This < Integer'Last,
                  Post => This = This'Old + 1;
 
--------------------------------------------------
-Function Postcondition :ada:`'Result` Attribute
--------------------------------------------------
+--------------------------------------------
+Function Postcondition "'Result" Attribute
+--------------------------------------------
 
 Function result can be referenced by :ada:`'Result` on the function name
 
diff --git a/courses/ada_essentials/273_subprogram_contracts/03-special_attributes.rst b/courses/ada_essentials/273_subprogram_contracts/03-special_attributes.rst
@@ -32,9 +32,9 @@ Evaluate an Expression on Subprogram Entry
           Pre  => This < Integer'Last,
           Post => This = This'Old + 1;
 
------------------------------------
-Example for Attribute :ada:`'Old`
------------------------------------
+------------------------------
+Example for Attribute "'Old"
+------------------------------
 
 .. code:: Ada
 
@@ -63,9 +63,9 @@ Example for Attribute :ada:`'Old`
            -- Global and Index after call
            = Global (Index);
 
-------------------------------------------------
-Error on Conditional Evaluation of :ada:`'Old`
-------------------------------------------------
+-------------------------------------------
+Error on Conditional Evaluation of "'Old"
+-------------------------------------------
 
 * This code is **incorrect**
 
diff --git a/courses/ada_essentials/290_advanced_data_hiding/03-private_library_units.rst b/courses/ada_essentials/290_advanced_data_hiding/03-private_library_units.rst
@@ -72,9 +72,9 @@ Importing a Private Child
            Root.Child.X1 := 10; -- illegal
         end Main;
 
-----------------------------------
-Private Children and :ada:`with`
-----------------------------------
+-----------------------------
+Private Children and "with"
+-----------------------------
 
 .. code:: Ada
 
@@ -122,9 +122,9 @@ Private Children and :ada:`with`
             procedure Proc2 is null;
          end Root.Good_Child;
 
----------------------
-:ada:`private with`
----------------------
+----------------
+"private with"
+----------------
 
 * The parent and its children can :ada:`private with` a private package
 
diff --git a/courses/ada_essentials/892_ada_strings/01-introduction.rst b/courses/ada_essentials/892_ada_strings/01-introduction.rst
diff --git a/courses/ada_essentials/894_ada_containers/04-reference.rst b/courses/ada_essentials/894_ada_containers/04-reference.rst
diff --git a/courses/ada_essentials/901_ada_2022_specific.rst b/courses/ada_essentials/901_ada_2022_specific.rst
