Skip to content

Commit

Permalink
[e] (0) Make the 'find a number' algorithm interact correctly with th…
Browse files Browse the repository at this point in the history
…e parent algorithm.

Fixing http://www.w3.org/Bugs/Public/show_bug.cgi?id=8043

git-svn-id: http://svn.whatwg.org/webapps@4328 340c8d12-0b0e-0410-8428-c7bf67bfef74
  • Loading branch information
Hixie committed Oct 25, 2009
1 parent 802902c commit 278780a
Show file tree
Hide file tree
Showing 3 changed files with 18 additions and 11 deletions.
10 changes: 6 additions & 4 deletions complete.html
Expand Up @@ -3123,11 +3123,13 @@ <h5 id=ratios><span class=secno>2.4.4.4 </span>Ratios</h5>
<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>

Expand Down
10 changes: 6 additions & 4 deletions index
Expand Up @@ -2933,11 +2933,13 @@ a.setAttribute('href', 'http://example.com/'); // change the content attribute d
<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>

Expand Down
9 changes: 6 additions & 3 deletions source
Expand Up @@ -2108,12 +2108,15 @@ a.setAttribute('href', 'http://example.com/'); // change the content attribute d

</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>
Expand Down

0 comments on commit 278780a

Please sign in to comment.