1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2 /* ***** BEGIN LICENSE BLOCK *****
3 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
5 * The contents of this file are subject to the Mozilla Public License Version
6 * 1.1 (the "License"); you may not use this file except in compliance with
7 * the License. You may obtain a copy of the License at
8 * http://www.mozilla.org/MPL/
10 * Software distributed under the License is distributed on an "AS IS" basis,
11 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12 * for the specific language governing rights and limitations under the
15 * The Original Code is Mozilla Communicator client code, released
18 * The Initial Developer of the Original Code is
19 * Netscape Communications Corporation.
20 * Portions created by the Initial Developer are Copyright (C) 1998
21 * the Initial Developer. All Rights Reserved.
25 * Alternatively, the contents of this file may be used under the terms of
26 * either the GNU General Public License Version 2 or later (the "GPL"), or
27 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
28 * in which case the provisions of the GPL or the LGPL are applicable instead
29 * of those above. If you wish to allow use of your version of this file only
30 * under the terms of either the GPL or the LGPL, and not to allow others to
31 * use your version of this file under the terms of the MPL, indicate your
32 * decision by deleting the provisions above and replace them with the notice
33 * and other provisions required by the GPL or the LGPL. If you do not delete
34 * the provisions above, a recipient may use your version of this file under
35 * the terms of any one of the MPL, the GPL or the LGPL.
37 * ***** END LICENSE BLOCK ***** */
41 ECMA Section: 9.8.1 ToString Applied to the Number Type
42 Description: The operator ToString convers a number m to string
45 1. if m is NaN, return the string "NaN"
46 2. if m is +0 or -0, return the string "0"
47 3. if m is less than zero, return the string
48 concatenation of the string "-" and ToString(-m).
49 4. If m is Infinity, return the string "Infinity".
50 5. Otherwise, let n, k, and s be integers such that
51 k >= 1, 10k1 <= s < 10k, the number value for s10nk
52 is m, and k is as small as possible. Note that k is
53 the number of digits in the decimal representation
54 of s, that s is not divisible by 10, and that the
55 least significant digit of s is not necessarily
56 uniquely determined by these criteria.
57 6. If k <= n <= 21, return the string consisting of the
58 k digits of the decimal representation of s (in order,
59 with no leading zeroes), followed by n-k occurences
61 7. If 0 < n <= 21, return the string consisting of the
62 most significant n digits of the decimal
63 representation of s, followed by a decimal point
64 '.', followed by the remaining kn digits of the
65 decimal representation of s.
66 8. If 6 < n <= 0, return the string consisting of the
67 character '0', followed by a decimal point '.',
68 followed by n occurences of the character '0',
69 followed by the k digits of the decimal
71 9. Otherwise, if k = 1, return the string consisting
72 of the single digit of s, followed by lowercase
73 character 'e', followed by a plus sign '+' or minus
74 sign '' according to whether n1 is positive or
75 negative, followed by the decimal representation
76 of the integer abs(n1) (with no leading zeros).
77 10. Return the string consisting of the most significant
78 digit of the decimal representation of s, followed
79 by a decimal point '.', followed by the remaining k1
80 digits of the decimal representation of s, followed
81 by the lowercase character 'e', followed by a plus
82 sign '+' or minus sign '' according to whether n1 is
83 positive or negative, followed by the decimal
84 representation of the integer abs(n1) (with no
87 Note that if x is any number value other than 0, then
88 ToNumber(ToString(x)) is exactly the same number value as x.
90 As noted, the least significant digit of s is not always
91 uniquely determined by the requirements listed in step 5.
92 The following specification for step 5 was considered, but
95 Author: christine@netscape.com
99 var SECTION = "9.8.1";
100 var VERSION = "ECMA_1";
103 writeHeaderToLog( SECTION + " ToString applied to the Number type");
105 new TestCase( SECTION, "Number.NaN", "NaN", Number.NaN + "" );
106 new TestCase( SECTION, "0", "0", 0 + "" );
107 new TestCase( SECTION, "-0", "0", -0 + "" );
108 new TestCase( SECTION, "Number.POSITIVE_INFINITY", "Infinity", Number.POSITIVE_INFINITY + "" );
109 new TestCase( SECTION, "Number.NEGATIVE_INFINITY", "-Infinity", Number.NEGATIVE_INFINITY + "" );
110 new TestCase( SECTION, "-1", "-1", -1 + "" );
112 // cases in step 6: integers 1e21 > x >= 1 or -1 >= x > -1e21
114 new TestCase( SECTION, "1", "1", 1 + "" );
115 new TestCase( SECTION, "10", "10", 10 + "" );
116 new TestCase( SECTION, "100", "100", 100 + "" );
117 new TestCase( SECTION, "1000", "1000", 1000 + "" );
118 new TestCase( SECTION, "10000", "10000", 10000 + "" );
119 new TestCase( SECTION, "10000000000", "10000000000", 10000000000 + "" );
120 new TestCase( SECTION, "10000000000000000000", "10000000000000000000", 10000000000000000000 + "" );
121 new TestCase( SECTION, "100000000000000000000","100000000000000000000",100000000000000000000 + "" );
123 new TestCase( SECTION, "12345", "12345", 12345 + "" );
124 new TestCase( SECTION, "1234567890", "1234567890", 1234567890 + "" );
126 new TestCase( SECTION, "-1", "-1", -1 + "" );
127 new TestCase( SECTION, "-10", "-10", -10 + "" );
128 new TestCase( SECTION, "-100", "-100", -100 + "" );
129 new TestCase( SECTION, "-1000", "-1000", -1000 + "" );
130 new TestCase( SECTION, "-1000000000", "-1000000000", -1000000000 + "" );
131 new TestCase( SECTION, "-1000000000000000", "-1000000000000000", -1000000000000000 + "" );
132 new TestCase( SECTION, "-100000000000000000000", "-100000000000000000000", -100000000000000000000 + "" );
133 new TestCase( SECTION, "-1000000000000000000000", "-1e+21", -1000000000000000000000 + "" );
135 new TestCase( SECTION, "-12345", "-12345", -12345 + "" );
136 new TestCase( SECTION, "-1234567890", "-1234567890", -1234567890 + "" );
138 // cases in step 7: numbers with a fractional component, 1e21> x >1 or -1 > x > -1e21,
139 new TestCase( SECTION, "1.0000001", "1.0000001", 1.0000001 + "" );
141 // cases in step 8: fractions between 1 > x > -1, exclusive of 0 and -0
143 // cases in step 9: numbers with 1 significant digit >= 1e+21 or <= 1e-6
145 new TestCase( SECTION, "1000000000000000000000", "1e+21", 1000000000000000000000 + "" );
146 new TestCase( SECTION, "10000000000000000000000", "1e+22", 10000000000000000000000 + "" );
148 // cases in step 10: numbers with more than 1 significant digit >= 1e+21 or <= 1e-6
150 new TestCase( SECTION, "1.2345", "1.2345", String( 1.2345));
151 new TestCase( SECTION, "1.234567890", "1.23456789", String( 1.234567890 ));
154 new TestCase( SECTION, ".12345", "0.12345", String(.12345 ) );
155 new TestCase( SECTION, ".012345", "0.012345", String(.012345) );
156 new TestCase( SECTION, ".0012345", "0.0012345", String(.0012345) );
157 new TestCase( SECTION, ".00012345", "0.00012345", String(.00012345) );
158 new TestCase( SECTION, ".000012345", "0.000012345", String(.000012345) );
159 new TestCase( SECTION, ".0000012345", "0.0000012345", String(.0000012345) );
160 new TestCase( SECTION, ".00000012345", "1.2345e-7", String(.00000012345));
162 new TestCase( SECTION, "-1e21", "-1e+21", String(-1e21) );