[html5] r6452 - [e] (0) markup error

[whatwg at whatwg.org]

Author: ianh
Date: 2011-08-14 20:53:19 -0700 (Sun, 14 Aug 2011)
New Revision: 6452

Modified:
   complete.html
   index
   source
Log:
[e] (0) markup error

Modified: complete.html
===================================================================
--- complete.html	2011-08-15 03:51:24 UTC (rev 6451)
+++ complete.html	2011-08-15 03:53:19 UTC (rev 6452)
@@ -4396,8 +4396,6 @@
   <p>The <dfn id=code-point-length>code-point length</dfn> of a string is the number of
   Unicode code points in that string.</p>
 
-  <div class=impl>
-
   <p>When a user agent has to <dfn id=strictly-split-a-string>strictly split a string</dfn> on a
   particular delimiter character <var title="">delimiter</var>, it
   must use the following algorithm:</p>
@@ -102239,4 +102237,4 @@
           hand corner." src="sample-datetime-ui-3"></li>
 -->
 
- </div>
+ 

Modified: index
===================================================================
--- index	2011-08-15 03:51:24 UTC (rev 6451)
+++ index	2011-08-15 03:53:19 UTC (rev 6452)
@@ -4260,8 +4260,6 @@
   <p>The <dfn id=code-point-length>code-point length</dfn> of a string is the number of
   Unicode code points in that string.</p>
 
-  <div class=impl>
-
   <p>When a user agent has to <dfn id=strictly-split-a-string>strictly split a string</dfn> on a
   particular delimiter character <var title="">delimiter</var>, it
   must use the following algorithm:</p>
@@ -97834,4 +97832,4 @@
           hand corner." src="sample-datetime-ui-3"></li>
 -->
 
- </div>
+ 

Modified: source
===================================================================
--- source	2011-08-15 03:51:24 UTC (rev 6451)
+++ source	2011-08-15 03:53:19 UTC (rev 6452)
@@ -3438,8 +3438,6 @@
   <p>The <dfn>code-point length</dfn> of a string is the number of
   Unicode code points in that string.</p>
 
-  <div class="impl">
-
   <p>When a user agent has to <dfn>strictly split a string</dfn> on a
   particular delimiter character <var title="">delimiter</var>, it
   must use the following algorithm:</p>