From: Erik Abele <erikabele@apache.org>
Date: Sun, 31 Aug 2003 18:01:25 +0000 (+0000)
Subject: Typos...
X-Git-Tag: pre_ajp_proxy~1188
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=375e492a0b7f6ca8952ac3c1cf619a92203dcfa6;p=apache

Typos...


git-svn-id: https://svn.apache.org/repos/asf/httpd/httpd/trunk@101143 13f79535-47bb-0310-9956-ffa450edef68
---

diff --git a/docs/manual/mod/mod_include.html.en b/docs/manual/mod/mod_include.html.en
index cd9822addd..8ab308e595 100644
--- a/docs/manual/mod/mod_include.html.en
+++ b/docs/manual/mod/mod_include.html.en
@@ -597,9 +597,9 @@
       <ul>
       <li>Expressions are evaluated from left to right</li>
       <li>Binary boolean operators (<code>&amp;&amp;</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>
diff --git a/docs/manual/mod/mod_include.xml b/docs/manual/mod/mod_include.xml
index 39023a67b0..690b5c6d14 100644
--- a/docs/manual/mod/mod_include.xml
+++ b/docs/manual/mod/mod_include.xml
@@ -572,9 +572,9 @@
       <ul>
       <li>Expressions are evaluated from left to right</li>
       <li>Binary boolean operators (<code>&amp;&amp;</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>