Skip to content

Commit

Permalink
[e] (0) no need to mention sort order here, it's sorted later.
Browse files Browse the repository at this point in the history
Fixing http://www.w3.org/Bugs/Public/show_bug.cgi?id=8243

git-svn-id: http://svn.whatwg.org/webapps@4474 340c8d12-0b0e-0410-8428-c7bf67bfef74
  • Loading branch information
Hixie committed Jan 5, 2010
1 parent fde3076 commit 03af8cf
Show file tree
Hide file tree
Showing 3 changed files with 6 additions and 12 deletions.
6 changes: 2 additions & 4 deletions complete.html
Expand Up @@ -45075,10 +45075,8 @@ <h4 id=associating-names-with-items><span class=secno>5.2.5 </span>Associating n
<ol><li><p>Let <var title="">root</var> be the element with the <code title=attr-itemscope><a href=#attr-itemscope>itemscope</a></code> attribute.</li>

<li><p>Let <var title="">pending</var> be a stack of elements
initially containing the child elements of <var title="">root</var>, if any, in <a href=#tree-order>tree order</a> (so that
the first child element of <var title="">root</var> will be the
first one to be popped from the stack). This list will be the one
that holds the elements that still need to be crawled.</li>
initially containing the child elements of <var title="">root</var>, if any. This list will be the one that holds
the elements that still need to be crawled.</li>

<li><p>Let <var title="">properties</var> be an empty list of
elements. This list will be the result of the algorithm: a list of
Expand Down
6 changes: 2 additions & 4 deletions index
Expand Up @@ -44910,10 +44910,8 @@ document.body.appendChild(outer);</pre>
<ol><li><p>Let <var title="">root</var> be the element with the <code title=attr-itemscope><a href=#attr-itemscope>itemscope</a></code> attribute.</li>

<li><p>Let <var title="">pending</var> be a stack of elements
initially containing the child elements of <var title="">root</var>, if any, in <a href=#tree-order>tree order</a> (so that
the first child element of <var title="">root</var> will be the
first one to be popped from the stack). This list will be the one
that holds the elements that still need to be crawled.</li>
initially containing the child elements of <var title="">root</var>, if any. This list will be the one that holds
the elements that still need to be crawled.</li>

<li><p>Let <var title="">properties</var> be an empty list of
elements. This list will be the result of the algorithm: a list of
Expand Down
6 changes: 2 additions & 4 deletions source
Expand Up @@ -50152,10 +50152,8 @@ document.body.appendChild(outer);</pre>

<li><p>Let <var title="">pending</var> be a stack of elements
initially containing the child elements of <var
title="">root</var>, if any, in <span>tree order</span> (so that
the first child element of <var title="">root</var> will be the
first one to be popped from the stack). This list will be the one
that holds the elements that still need to be crawled.</p></li>
title="">root</var>, if any. This list will be the one that holds
the elements that still need to be crawled.</p></li>

<li><p>Let <var title="">properties</var> be an empty list of
elements. This list will be the result of the algorithm: a list of
Expand Down

0 comments on commit 03af8cf

Please sign in to comment.