[html5] r4328 - [e] (0) Make the 'find a number' algorithm interact correctly with the parent al [...]

[whatwg at whatwg.org]

Author: ianh
Date: 2009-10-25 00:22:18 -0700 (Sun, 25 Oct 2009)
New Revision: 4328

Modified:
   complete.html
   index
   source
Log:
[e] (0) Make the 'find a number' algorithm interact correctly with the parent algorithm.
Fixing http://www.w3.org/Bugs/Public/show_bug.cgi?id=8043

Modified: complete.html
===================================================================
--- complete.html	2009-10-25 07:03:59 UTC (rev 4327)
+++ complete.html	2009-10-25 07:22:18 UTC (rev 4328)
@@ -3123,11 +3123,13 @@
    <li>Otherwise, return <var title="">number1</var> and
    <var title="">number2</var>.</li>
 
-  </ol><p>The algorithm to <dfn id=find-a-number>find a number</dfn> is as follows. It is
-  given a string and a starting position, and returns either nothing,
-  a number, or an error condition.</p>
+  </ol><p>The algorithm to <dfn id=find-a-number>find a number</dfn> is as follows. It
+  returns either nothing, a number, or an error condition.</p>
 
-  <ol><li><p><a href=#collect-a-sequence-of-characters>Collect a sequence of characters</a> that are not
+  <ol><li><p>Let <var title="">input</var> and <var title="">position</var> be the same variables as those of the same
+   name in the algorithm that invoked these steps.</li>
+
+   <li><p><a href=#collect-a-sequence-of-characters>Collect a sequence of characters</a> that are not
    U+002E FULL STOP characters (.) and are not characters in the range
    U+0030 DIGIT ZERO (0) to U+0039 DIGIT NINE (9).</li>
 

Modified: index
===================================================================
--- index	2009-10-25 07:03:59 UTC (rev 4327)
+++ index	2009-10-25 07:22:18 UTC (rev 4328)
@@ -2933,11 +2933,13 @@
    <li>Otherwise, return <var title="">number1</var> and
    <var title="">number2</var>.</li>
 
-  </ol><p>The algorithm to <dfn id=find-a-number>find a number</dfn> is as follows. It is
-  given a string and a starting position, and returns either nothing,
-  a number, or an error condition.</p>
+  </ol><p>The algorithm to <dfn id=find-a-number>find a number</dfn> is as follows. It
+  returns either nothing, a number, or an error condition.</p>
 
-  <ol><li><p><a href=#collect-a-sequence-of-characters>Collect a sequence of characters</a> that are not
+  <ol><li><p>Let <var title="">input</var> and <var title="">position</var> be the same variables as those of the same
+   name in the algorithm that invoked these steps.</li>
+
+   <li><p><a href=#collect-a-sequence-of-characters>Collect a sequence of characters</a> that are not
    U+002E FULL STOP characters (.) and are not characters in the range
    U+0030 DIGIT ZERO (0) to U+0039 DIGIT NINE (9).</li>
 

Modified: source
===================================================================
--- source	2009-10-25 07:03:59 UTC (rev 4327)
+++ source	2009-10-25 07:22:18 UTC (rev 4328)
@@ -2108,12 +2108,15 @@
 
   </ol>
 
-  <p>The algorithm to <dfn>find a number</dfn> is as follows. It is
-  given a string and a starting position, and returns either nothing,
-  a number, or an error condition.</p>
+  <p>The algorithm to <dfn>find a number</dfn> is as follows. It
+  returns either nothing, a number, or an error condition.</p>
 
   <ol>
 
+   <li><p>Let <var title="">input</var> and <var
+   title="">position</var> be the same variables as those of the same
+   name in the algorithm that invoked these steps.</p></li>
+
    <li><p><span>Collect a sequence of characters</span> that are not
    U+002E FULL STOP characters (.) and are not characters in the range
    U+0030 DIGIT ZERO (0) to U+0039 DIGIT NINE (9).</p></li>