erikabele 2003/08/31 11:01:25
Modified: docs/manual/mod mod_include.html.en mod_include.xml
Log:
Typos...
Revision Changes Path
1.30 +2 -2 httpd-2.0/docs/manual/mod/mod_include.html.en
Index: mod_include.html.en
===================================================================
RCS file: /home/cvs/httpd-2.0/docs/manual/mod/mod_include.html.en,v
retrieving revision 1.29
retrieving revision 1.30
diff -u -r1.29 -r1.30
--- mod_include.html.en 29 Aug 2003 00:32:16 -0000 1.29
+++ mod_include.html.en 31 Aug 2003 18:01:25 -0000 1.30
@@ -597,9 +597,9 @@
<ul>
<li>Expressions are evaluated from left to right</li>
<li>Binary boolean operators (<code>&&</code> and
<code>||</code>)
- are short circuited whereever possible. In conclusion with the rule
+ are short circuited wherever possible. In conclusion with the rule
above that means, <code class="module"><a href="../mod/mod_include.html">mod_include</a></code>
evaluates at first
- the left expression. If the left result if sufficient to determine
+ the left expression. If the left result is sufficient to determine
the end result, processing stops here. Otherwise it evaluates the
right side and computes the end result from both left and right
results.</li>
1.26 +2 -2 httpd-2.0/docs/manual/mod/mod_include.xml
Index: mod_include.xml
===================================================================
RCS file: /home/cvs/httpd-2.0/docs/manual/mod/mod_include.xml,v
retrieving revision 1.25
retrieving revision 1.26
diff -u -r1.25 -r1.26
--- mod_include.xml 29 Aug 2003 00:32:16 -0000 1.25
+++ mod_include.xml 31 Aug 2003 18:01:25 -0000 1.26
@@ -572,9 +572,9 @@
<ul>
<li>Expressions are evaluated from left to right</li>
<li>Binary boolean operators (<code>&&</code> and
<code>||</code>)
- are short circuited whereever possible. In conclusion with the rule
+ are short circuited wherever possible. In conclusion with the rule
above that means, <module>mod_include</module> evaluates at first
- the left expression. If the left result if sufficient to determine
+ the left expression. If the left result is sufficient to determine
the end result, processing stops here. Otherwise it evaluates the
right side and computes the end result from both left and right
results.</li>
|