Fixed some indentation problems

doc/Language/operators.pod6

@@ -1592,8 +1592,8 @@ The tolerance is supposed to be modifiable via an adverb:
 
 =comment RT #128210
 =begin code :skip-test
-    my ($x, $y) = 42, 42.1;
-    say $x =~= $y :tolerance(.1);
+my ($x, $y) = 42, 42.1;
+say $x =~= $y :tolerance(.1);
 =end code
 
 however, this is not yet implemented. The same effect can be achieved by
@@ -1688,7 +1688,7 @@ returns the C<$false> branch.
 =head2 infix C«ff»
 
 =begin code :skip-test
-    sub infix:<ff>(Mu $a, Mu $b)
+sub infix:<ff>(Mu $a, Mu $b)
 =end code
 
 X<Flipflop operator>.
@@ -1702,22 +1702,22 @@ is the "stop" condition. This construct is typically used to pick up only a
 certain section of lines. For example:
 
 =begin code :allow<B V>
-    my $excerpt = q:to/END/;
-    Here's some unimportant text.
-    V<=>begin code
-        This code block is what we're after.
-        We'll use 'ff' to get it.
-    V<=>end code
-    More unimportant text.
-    END
-
-    my @codelines = gather for $excerpt.lines {
-        take $_ if B<"=begin code" ff "=end code">
-    }
+my $excerpt = q:to/END/;
+Here's some unimportant text.
+V<=>begin code
+    This code block is what we're after.
+    We'll use 'ff' to get it.
+V<=>end code
+More unimportant text.
+END
+
+my @codelines = gather for $excerpt.lines {
+    take $_ if B<"=begin code" ff "=end code">
+}
 
-    # this will print four lines, starting with "=begin code" and ending with
-    # "=end code"
-    say @codelines.join("\n");
+# this will print four lines, starting with "=begin code" and ending with
+# "=end code"
+say @codelines.join("\n");
 =end code
 
 After matching the start condition, the operator will then match the same C<$_>
@@ -1743,7 +1743,7 @@ This operator cannot be overloaded, as it is handled specially by the compiler.
 =head2 infix C«^ff»
 
 =begin code :skip-test
-    sub infix:<^ff>(Mu $a, Mu $b)
+sub infix:<^ff>(Mu $a, Mu $b)
 =end code
 
 Works like L<C<ff>>, except it does not return C<True> for items matching the
@@ -2149,8 +2149,8 @@ Reduction operators have the same associativity as the operators they are based
 
 =begin code
 
-    say [-] 4, 3, 2;      # 4-3-2 = (4-3)-2 = -1
-    say [**] 4, 3, 2;     # 4**3**2 = 4**(3**2) = 262144
+say [-] 4, 3, 2;      # 4-3-2 = (4-3)-2 = -1
+say [**] 4, 3, 2;     # 4**3**2 = 4**(3**2) = 262144
 
 =end code