浏览代码

HPCC-16502 Clarify short circuiting in OR expressions

Signed-off-by: Jim DeFabia <jamesdefabia@lexisnexis.com>
Jim DeFabia 8 年之前
父节点
当前提交
9a3b01d4ac
共有 1 个文件被更改,包括 7 次插入5 次删除
  1. 7 5
      docs/ECLLanguageReference/ECLR_mods/Expr-LogicalOperators.xml

+ 7 - 5
docs/ECLLanguageReference/ECLR_mods/Expr-LogicalOperators.xml

@@ -58,11 +58,13 @@
 
 
     <para>When a complex logical expression has multiple OR conditions, you
     <para>When a complex logical expression has multiple OR conditions, you
     should group the OR conditions and order them from least complex to most
     should group the OR conditions and order them from least complex to most
-    complex to result in the most efficient processing. If the probability of
-    occurrence is known, you should order them from the most likely to occur
-    to the least likely to occur, because once any part of a compound OR
-    condition evaluates to TRUE, the remainder of the expression is bypassed.
-    This is also true of the order of MAP function conditions.</para>
+    complex to result in the most efficient processing. </para>
+
+    <para>If the probability of occurrence is known, you should order them
+    from the most likely to occur to the least likely to occur, because once
+    any part of a compound OR condition evaluates to TRUE, the remainder of
+    the expression can be bypassed. However, this is not guaranteed. This is
+    also true of the order of MAP function conditions.</para>
 
 
     <para>Whenever AND and OR logical operations are mixed in the same
     <para>Whenever AND and OR logical operations are mixed in the same
     expression, you should use parentheses to group within the expression to
     expression, you should use parentheses to group within the expression to