link from loose operators to traps

Raku · Jul 17, 2016 · a98df89 · a98df89
1 parent 234014f
commit a98df89
Showing 1 changed file with 8 additions and 3 deletions.
diff --git a/doc/Language/operators.pod6 b/doc/Language/operators.pod6
@@ -1737,7 +1737,9 @@ create C<Pair> objects.
     multi sub prefix:<not>(Mu $x) returns Bool:D
 
 Evaluates its argument in boolean context (and thus collapses L<Junction>s),
-and negates the result.
+and negates the result. Please note that C<not> is easy to misuse, see
+L<traps|/language/traps#Loose_boolean_operators>.
+
 
 =head2 prefix C«so»
 
@@ -1974,7 +1976,8 @@ Reduction operators have the same associativity as the operators they are based
 Same as L<#infix &&>, except with looser precedence.
 
 Returns the first operand that evaluates to C<False> in boolean context, or
-otherwise the last operand. Short-circuits.
+otherwise the last operand, it short-circuits. Please note that C<and> is easy
+to misuse, see L<traps|/language/traps#Loose_boolean_operators>.
 
 =head2 infix C«andthen»
 
@@ -1990,7 +1993,9 @@ pointy block.
 Same as C<infix ||>, except with looser precedence.
 
 Returns the first argument that evaluates to C<True> in boolean context,
-or otherwise the last argument. Short-circuits.
+or otherwise the last argument, it short-circuits. Please note that C<or> is easy
+to misuse, see L<traps|/language/traps#Loose_boolean_operators>.
+
 
 =head2 infix C«orelse»