Merge ~cjwatson/launchpad:doctest-narrative-moin-header into launchpad:master

[Colin Watson]

Reformat more doctest headers in reStructuredText style

I missed these in my previous pass because they either were very deeply-nested headers or had unbalanced Moin-style headers.

[Colin Watson (cjwatson)]

Self-approving as trivial, since this is purely formatting and doesn't touch any actual test code.

review: Approve

diff --git a/lib/lp/app/doc/launchpadform.txt b/lib/lp/app/doc/launchpadform.txt
index 7b0f67b..0bc55bd 100644
--- a/lib/lp/app/doc/launchpadform.txt
+++ b/lib/lp/app/doc/launchpadform.txt
@@ -280,7 +280,8 @@ The base template used for LaunchpadFormView classes takes care of
 displaying these errors in the appropriate locations.
 
 
-== Widget Validation ===
+Widget Validation
+-----------------
 
 A form may contain multiple actions, and a widget used for action A
 might not be used for action B. The validate_widgets() method makes it
diff --git a/lib/lp/services/doc/looptuner.txt b/lib/lp/services/doc/looptuner.txt
index 3d6ab2d..88f22c2 100644
--- a/lib/lp/services/doc/looptuner.txt
+++ b/lib/lp/services/doc/looptuner.txt
@@ -270,7 +270,8 @@ The model behind LoopTuner assumes that the cost of an iteration will tend to
 increase as a linear function of chunk size.  Constant cost is a degenerate
 case of that; here we look at more meaningful linear functions.
 
-==== Without Constant ====
+Without Constant
+~~~~~~~~~~~~~~~~
 
 If cost function is purely linear with zero overhead, we approach our time
 goal asymptotically.  In principle we never quite get there.
@@ -293,7 +294,8 @@ goal asymptotically.  In principle we never quite get there.
     True
 
 
-==== With Constant ====
+With Constant
+~~~~~~~~~~~~~
 
 Here's a variant with a relatively flat linear cost function (25 units of work
 per second), plus a large constant overhead of half the time goal.  It does
@@ -325,7 +327,8 @@ What if the relationship between chunk size and iteration time is much more
 radical?
 
 
-==== Low Exponent ====
+Low Exponent
+~~~~~~~~~~~~
 
 Due to the way LoopTuner's approximation function works, an exponential cost
 function will cause some oscillation where iteration time overshoots the goal,
@@ -353,7 +356,8 @@ be a neat alternation of oversized and undersized chunks.
     done
 
 
-==== High Exponent ====
+High Exponent
+~~~~~~~~~~~~~
 
 With more extreme exponential behaviour, the overshoot increases but the
 effect remains the same:
diff --git a/lib/lp/services/fields/doc/uri-field.txt b/lib/lp/services/fields/doc/uri-field.txt
index 0f980d5..55b93e2 100644
--- a/lib/lp/services/fields/doc/uri-field.txt
+++ b/lib/lp/services/fields/doc/uri-field.txt
@@ -119,7 +119,8 @@ The fragment component can also be disallowed:
     lp.app.validators.LaunchpadValidationError: URIs with fragment identifiers are not allowed.
 
 
-== Requiring or Forbidding a Trailing Slash ===
+Requiring or Forbidding a Trailing Slash
+----------------------------------------
 
 For some URIs we want to require or forbid a trailing slash.  This
 might be because a certain URI type only makes sense with (or without)
diff --git a/lib/lp/services/webapp/doc/timeout.txt b/lib/lp/services/webapp/doc/timeout.txt
index f3a55d2..23ac905 100644
--- a/lib/lp/services/webapp/doc/timeout.txt
+++ b/lib/lp/services/webapp/doc/timeout.txt
@@ -141,7 +141,8 @@ Now the request can take 20 seconds to complete.
     >>> abs(adapter._get_request_timeout()-20000) < 0.001
     True
 
-== Clean up ===
+Clean up
+========
 
     >>> ignored = config.pop('timeout')
 
diff --git a/lib/lp/soyuz/stories/ppa/xx-ubuntu-ppas.txt b/lib/lp/soyuz/stories/ppa/xx-ubuntu-ppas.txt
index 65cccda..4af8ba7 100644
--- a/lib/lp/soyuz/stories/ppa/xx-ubuntu-ppas.txt
+++ b/lib/lp/soyuz/stories/ppa/xx-ubuntu-ppas.txt
@@ -223,7 +223,8 @@ In the three sample data PPAs, only one matches the search string "Celso".
     1
 
 
-=== Hand-hacked search URLs ==
+Hand-hacked search URLs
+.......................
 
 If the search term is specified more than once by someone hand-hacking the
 URL, the page copes gracefully with this by searching for all the terms