Un-reflows to put L links in the same line

Author: JJ

doc/Language/iterating.pod6

@@ -115,8 +115,7 @@ side effect of running a loop, but also creating a list that is output.
 This can be done more systematically through the use of the L<C<gather/take>
 blocks|/syntax/gather take>, which are a different kind of iterating construct
 that instead of running in sink context, returns an item every iteration. This
-<Advent Calendar
-tutorial|https://perl6advent.wordpress.com/2009/12/23/day-23-lazy-fruits-from-the-gather-of-eden/>
+L<Advent Calendar tutorial|https://perl6advent.wordpress.com/2009/12/23/day-23-lazy-fruits-from-the-gather-of-eden/>
 explains use cases for this kind of loops; in fact, gather is not so much a
 looping construct, but a statement prefix that collects the items produced by
 C<take> and creates a list out of them.

doc/Language/math.pod6

@@ -7,8 +7,9 @@
 =head1 Sets.
 
 Perl 6 includes the L<Set> data type, as well as support for L<most set
-operations|/language/setbagmix#Set/Bag_Operators>. L<Union and
-intersection|https://en.wikipedia.org/wiki/Algebra_of_sets> are not only native
+operations|/language/setbagmix#Set/Bag_Operators>.
+L<Union and intersection|https://en.wikipedia.org/wiki/Algebra_of_sets>
+are not only native
 operations, they use their I<natural> symbols, ∩ and ∪. For instance, this code
 would check the fundamental laws of the arithmetic of sets for a limited number
 of sets:
@@ -50,13 +51,11 @@ say "Identity with ∅ ", so @id-empty.all;       # OUTPUT: «Identity with ∅
 
 In this code, which uses the L<empty set|/language/setbagmix#term_%E2%88%85>
 which is already defined by Perl 6, not only we check if the equalities in the
-algebra of sets hold, we also use, via L<sigilless
-variables|/language/variables#index-entry-\_(sigilless_variables)> and the
+algebra of sets hold, we also use, via L<sigilless variables|/language/variables#index-entry-\_(sigilless_variables)> and the
 Unicode form of the set operators, expressions that are as close as possible to
 the original form; C<A ∪ U === U>, for example, except for the use of the
 L<value identity operator <===>|/routine/===> is very close to the actual
-mathematical expression in the L<Wikipedia
-entry|https://en.wikipedia.org/wiki/Algebra_of_sets>.
+mathematical expression in the L<Wikipedia entry|https://en.wikipedia.org/wiki/Algebra_of_sets>.
 
 We can even test de Morgan's law, as in the code below:
 
@@ -84,9 +83,7 @@ mathematical notation.
 =head1 Arithmetic.
 
 Perl 6 can do arithmetic using different data types. L<Num>, L<Rat> and
-L<Complex> can all operate as a L<field under the operations addition,
-subtraction, multiplication and
-division|https://en.wikipedia.org/wiki/Field_(mathematics)>. The equivalent
+L<Complex> can all operate as a L<field under the operations addition, subtraction, multiplication and division|https://en.wikipedia.org/wiki/Field_(mathematics)>. The equivalent
 mathematical fields are:
 
 =begin table
@@ -99,8 +96,8 @@ C<Complex>       ℂ
 
 The C<Int>s, although technically corresponding to Z, is not really a
 mathematical field since they are not closed under the four arithmetical
-operations, and integers do not satisfy the L<identity
-axiom|https://math.stackexchange.com/questions/2192317/set-of-integers-not-a-field/2192330>.
+operations, and integers do not satisfy the
+L<identity axiom|https://math.stackexchange.com/questions/2192317/set-of-integers-not-a-field/2192330>.
 However, if the integer division C<div> is used, their operations will always
 yield other integers; if C</> is used, however, in general the result will be a
 L<Rat>.

doc/Language/structures.pod6

@@ -285,8 +285,7 @@ this particular role is mixed in; in this case it will contain the hash it is
 mixed in with; it will contain something else (and possibly work some other way)
 in other case. This role will provide the C<last> method to any variable it's
 mixed with, providing new, attachable, functionalities to I<regular> variables.
-Roles can even be L<added to existing variables using the C<does>
-keyword|/language/objects#Mixins_of_Roles>.
+Roles can even be L<added to existing variables using the C<does> keyword|/language/objects#Mixins_of_Roles>.
 
 L<Subsets|/language/typesystem#subset> can also be used to constrain the
 possible values a variable might hold; they are Perl 6 attempt at
@@ -466,10 +465,9 @@ In this case we are using the I<syntactic sugar> for C<HOW.method>, C<^method>,
 to check if your data structure responds to that method; the output, which shows
 the name of the methods that match, certifies that we can use it.
 
-See also L<this article on class
-introspection|https://perl6advent.wordpress.com/2015/12/19/day-19-introspection/>
+See also L<this article on class introspection|https://perl6advent.wordpress.com/2015/12/19/day-19-introspection/>
 on how to access class properties and methods, and use it to generate test data
-for a class; this L<Advent Calendar article describes the meta-object protocol>
+for a class; this L<Advent Calendar article describes the meta-object protocol|https://perl6advent.wordpress.com/2010/12/22/day-22-the-meta-object-protocol/>
 extensively.
 
 

xt/links-not-links.t

@@ -39,10 +39,6 @@ END
         my @number-of-links = ( $link ~~ m:g{\| https?\: } );
         my $html = pod2html(EVAL($pod~ "\n\$=pod"));
         my @number-of-hrefs = ( $html ~~ m:g{a\s+href\= } );
-        if +@number-of-links > +@number-of-hrefs {
-            say @number-of-links;
-            say @number-of-hrefs;
-        }
         push @links-not-links, $link if +@number-of-links > +@number-of-hrefs;
     }
     if @links-not-links {