[html5] r4474 - [e] (0) no need to mention sort order here, it's sorted later. Fixing http://www [...]

[whatwg at whatwg.org]

Author: ianh
Date: 2010-01-04 22:44:19 -0800 (Mon, 04 Jan 2010)
New Revision: 4474

Modified:
   complete.html
   index
   source
Log:
[e] (0) no need to mention sort order here, it's sorted later.
Fixing http://www.w3.org/Bugs/Public/show_bug.cgi?id=8243

Modified: complete.html
===================================================================
--- complete.html	2010-01-05 06:41:54 UTC (rev 4473)
+++ complete.html	2010-01-05 06:44:19 UTC (rev 4474)
@@ -45075,10 +45075,8 @@
   <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

Modified: index
===================================================================
--- index	2010-01-05 06:41:54 UTC (rev 4473)
+++ index	2010-01-05 06:44:19 UTC (rev 4474)
@@ -44910,10 +44910,8 @@
   <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

Modified: source
===================================================================
--- source	2010-01-05 06:41:54 UTC (rev 4473)
+++ source	2010-01-05 06:44:19 UTC (rev 4474)
@@ -50152,10 +50152,8 @@
 
    <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