[html5] r2611 - [e] (0) make negative zero not negative to please philip

[whatwg at whatwg.org]

Author: ianh
Date: 2008-12-29 05:34:20 -0800 (Mon, 29 Dec 2008)
New Revision: 2611

Modified:
   index
   source
Log:
[e] (0) make negative zero not negative to please philip

Modified: index
===================================================================
--- index	2008-12-29 12:58:37 UTC (rev 2610)
+++ index	2008-12-29 13:34:20 UTC (rev 2611)
@@ -2147,9 +2147,9 @@
   <p>A <a href=#valid-integer>valid integer</a> without a U+002D HYPHEN-MINUS ("-")
   prefix represents the number that is represented in base ten by that
   string of digits. A <a href=#valid-integer>valid integer</a> <em>with</em> a
-  U+002D HYPHEN-MINUS ("-") prefix represents the <em>negative</em>
-  number represented in base ten by the string of digits that follows
-  the U+002D HYPHEN-MINUS.</p>
+  U+002D HYPHEN-MINUS ("-") prefix represents the number represented
+  in base ten by the string of digits that follows the U+002D
+  HYPHEN-MINUS, subtracted from zero.</p>
 
   <p>The <dfn id=rules-for-parsing-integers>rules for parsing integers</dfn> are similar to the
   <a href=#rules-for-parsing-non-negative-integers title="rules for parsing non-negative integers">rules for
@@ -2253,10 +2253,11 @@
   interpreted as base ten (including the decimal point and the number
   after the decimal point, if any, and interpreting the significand as
   a negative number if the whole string starts with a U+002D
-  HYPHEN-MINUS ("-") character), and where the exponent is the number
-  after the E, if any (interpreted as a negative number if there is a
-  U+002D HYPHEN-MINUS ("-") character between the E and the
-  number). If there is no E, then the exponent is treated as zero.</p>
+  HYPHEN-MINUS ("-") character and the number is not zero), and where
+  the exponent is the number after the E, if any (interpreted as a
+  negative number if there is a U+002D HYPHEN-MINUS ("-") character
+  between the E and the number and the number is not zero). If there
+  is no E, then the exponent is treated as zero.</p>
 
   <p>The <dfn id=rules-for-parsing-floating-point-number-values>rules for parsing floating point number values</dfn> are
   as given in the following algorithm. As with the previous

Modified: source
===================================================================
--- source	2008-12-29 12:58:37 UTC (rev 2610)
+++ source	2008-12-29 13:34:20 UTC (rev 2611)
@@ -1235,9 +1235,9 @@
   <p>A <span>valid integer</span> without a U+002D HYPHEN-MINUS ("-")
   prefix represents the number that is represented in base ten by that
   string of digits. A <span>valid integer</span> <em>with</em> a
-  U+002D HYPHEN-MINUS ("-") prefix represents the <em>negative</em>
-  number represented in base ten by the string of digits that follows
-  the U+002D HYPHEN-MINUS.</p>
+  U+002D HYPHEN-MINUS ("-") prefix represents the number represented
+  in base ten by the string of digits that follows the U+002D
+  HYPHEN-MINUS, subtracted from zero.</p>
 
   <p>The <dfn>rules for parsing integers</dfn> are similar to the
   <span title="rules for parsing non-negative integers">rules for
@@ -1373,10 +1373,11 @@
   interpreted as base ten (including the decimal point and the number
   after the decimal point, if any, and interpreting the significand as
   a negative number if the whole string starts with a U+002D
-  HYPHEN-MINUS ("-") character), and where the exponent is the number
-  after the E, if any (interpreted as a negative number if there is a
-  U+002D HYPHEN-MINUS ("-") character between the E and the
-  number). If there is no E, then the exponent is treated as zero.</p>
+  HYPHEN-MINUS ("-") character and the number is not zero), and where
+  the exponent is the number after the E, if any (interpreted as a
+  negative number if there is a U+002D HYPHEN-MINUS ("-") character
+  between the E and the number and the number is not zero). If there
+  is no E, then the exponent is treated as zero.</p>
 
   <p>The <dfn>rules for parsing floating point number values</dfn> are
   as given in the following algorithm. As with the previous