aboutsummaryrefslogtreecommitdiffstats
path: root/tests/auto/qml/parserstress/tests/ecma/String/15.5.1.js
diff options
context:
space:
mode:
Diffstat (limited to 'tests/auto/qml/parserstress/tests/ecma/String/15.5.1.js')
-rw-r--r--tests/auto/qml/parserstress/tests/ecma/String/15.5.1.js134
1 files changed, 134 insertions, 0 deletions
diff --git a/tests/auto/qml/parserstress/tests/ecma/String/15.5.1.js b/tests/auto/qml/parserstress/tests/ecma/String/15.5.1.js
new file mode 100644
index 0000000000..cf7ab8b420
--- /dev/null
+++ b/tests/auto/qml/parserstress/tests/ecma/String/15.5.1.js
@@ -0,0 +1,134 @@
+/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
+/* ***** BEGIN LICENSE BLOCK *****
+ * Version: MPL 1.1/GPL 2.0/LGPL 2.1
+ *
+ * The contents of this file are subject to the Mozilla Public License Version
+ * 1.1 (the "License"); you may not use this file except in compliance with
+ * the License. You may obtain a copy of the License at
+ * http://www.mozilla.org/MPL/
+ *
+ * Software distributed under the License is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
+ * for the specific language governing rights and limitations under the
+ * License.
+ *
+ * The Original Code is Mozilla Communicator client code, released
+ * March 31, 1998.
+ *
+ * The Initial Developer of the Original Code is
+ * Netscape Communications Corporation.
+ * Portions created by the Initial Developer are Copyright (C) 1998
+ * the Initial Developer. All Rights Reserved.
+ *
+ * Contributor(s):
+ *
+ * Alternatively, the contents of this file may be used under the terms of
+ * either the GNU General Public License Version 2 or later (the "GPL"), or
+ * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
+ * in which case the provisions of the GPL or the LGPL are applicable instead
+ * of those above. If you wish to allow use of your version of this file only
+ * under the terms of either the GPL or the LGPL, and not to allow others to
+ * use your version of this file under the terms of the MPL, indicate your
+ * decision by deleting the provisions above and replace them with the notice
+ * and other provisions required by the GPL or the LGPL. If you do not delete
+ * the provisions above, a recipient may use your version of this file under
+ * the terms of any one of the MPL, the GPL or the LGPL.
+ *
+ * ***** END LICENSE BLOCK ***** */
+
+gTestfile = '15.5.1.js';
+
+/**
+ File Name: 15.5.1.js
+ ECMA Section: 15.5.1 The String Constructor called as a Function
+ 15.5.1.1 String(value)
+ 15.5.1.2 String()
+
+ Description: When String is called as a function rather than as
+ a constructor, it performs a type conversion.
+ - String(value) returns a string value (not a String
+ object) computed by ToString(value)
+ - String() returns the empty string ""
+
+ Author: christine@netscape.com
+ Date: 1 october 1997
+*/
+
+var SECTION = "15.5.1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE = "The String Constructor Called as a Function";
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+new TestCase( SECTION, "String('string primitive')", "string primitive", String('string primitive') );
+new TestCase( SECTION, "String(void 0)", "undefined", String( void 0) );
+new TestCase( SECTION, "String(null)", "null", String( null ) );
+new TestCase( SECTION, "String(true)", "true", String( true) );
+new TestCase( SECTION, "String(false)", "false", String( false ) );
+new TestCase( SECTION, "String(Boolean(true))", "true", String(Boolean(true)) );
+new TestCase( SECTION, "String(Boolean(false))", "false", String(Boolean(false)) );
+new TestCase( SECTION, "String(Boolean())", "false", String(Boolean(false)) );
+new TestCase( SECTION, "String(new Array())", "", String( new Array()) );
+new TestCase( SECTION, "String(new Array(1,2,3))", "1,2,3", String( new Array(1,2,3)) );
+
+
+new TestCase( SECTION, "String( Number.NaN )", "NaN", String( Number.NaN ) );
+new TestCase( SECTION, "String( 0 )", "0", String( 0 ) );
+new TestCase( SECTION, "String( -0 )", "0", String( -0 ) );
+new TestCase( SECTION, "String( Number.POSITIVE_INFINITY )", "Infinity", String( Number.POSITIVE_INFINITY ) );
+new TestCase( SECTION, "String( Number.NEGATIVE_INFINITY )", "-Infinity", String( Number.NEGATIVE_INFINITY ) );
+new TestCase( SECTION, "String( -1 )", "-1", String( -1 ) );
+
+// cases in step 6: integers 1e21 > x >= 1 or -1 >= x > -1e21
+
+new TestCase( SECTION, "String( 1 )", "1", String( 1 ) );
+new TestCase( SECTION, "String( 10 )", "10", String( 10 ) );
+new TestCase( SECTION, "String( 100 )", "100", String( 100 ) );
+new TestCase( SECTION, "String( 1000 )", "1000", String( 1000 ) );
+new TestCase( SECTION, "String( 10000 )", "10000", String( 10000 ) );
+new TestCase( SECTION, "String( 10000000000 )", "10000000000", String( 10000000000 ) );
+new TestCase( SECTION, "String( 10000000000000000000 )", "10000000000000000000", String( 10000000000000000000 ) );
+new TestCase( SECTION, "String( 100000000000000000000 )","100000000000000000000",String( 100000000000000000000 ) );
+
+new TestCase( SECTION, "String( 12345 )", "12345", String( 12345 ) );
+new TestCase( SECTION, "String( 1234567890 )", "1234567890", String( 1234567890 ) );
+
+new TestCase( SECTION, "String( -1 )", "-1", String( -1 ) );
+new TestCase( SECTION, "String( -10 )", "-10", String( -10 ) );
+new TestCase( SECTION, "String( -100 )", "-100", String( -100 ) );
+new TestCase( SECTION, "String( -1000 )", "-1000", String( -1000 ) );
+new TestCase( SECTION, "String( -1000000000 )", "-1000000000", String( -1000000000 ) );
+new TestCase( SECTION, "String( -1000000000000000 )", "-1000000000000000", String( -1000000000000000 ) );
+new TestCase( SECTION, "String( -100000000000000000000 )", "-100000000000000000000", String( -100000000000000000000 ) );
+new TestCase( SECTION, "String( -1000000000000000000000 )", "-1e+21", String( -1000000000000000000000 ) );
+
+new TestCase( SECTION, "String( -12345 )", "-12345", String( -12345 ) );
+new TestCase( SECTION, "String( -1234567890 )", "-1234567890", String( -1234567890 ) );
+
+// cases in step 7: numbers with a fractional component, 1e21> x >1 or -1 > x > -1e21,
+new TestCase( SECTION, "String( 1.0000001 )", "1.0000001", String( 1.0000001 ) );
+
+
+// cases in step 8: fractions between 1 > x > -1, exclusive of 0 and -0
+
+// cases in step 9: numbers with 1 significant digit >= 1e+21 or <= 1e-6
+
+new TestCase( SECTION, "String( 1000000000000000000000 )", "1e+21", String( 1000000000000000000000 ) );
+new TestCase( SECTION, "String( 10000000000000000000000 )", "1e+22", String( 10000000000000000000000 ) );
+
+// cases in step 10: numbers with more than 1 significant digit >= 1e+21 or <= 1e-6
+new TestCase( SECTION, "String( 1.2345 )", "1.2345", String( 1.2345));
+new TestCase( SECTION, "String( 1.234567890 )", "1.23456789", String( 1.234567890 ));
+
+new TestCase( SECTION, "String( .12345 )", "0.12345", String(.12345 ) );
+new TestCase( SECTION, "String( .012345 )", "0.012345", String(.012345) );
+new TestCase( SECTION, "String( .0012345 )", "0.0012345", String(.0012345) );
+new TestCase( SECTION, "String( .00012345 )", "0.00012345", String(.00012345) );
+new TestCase( SECTION, "String( .000012345 )", "0.000012345", String(.000012345) );
+new TestCase( SECTION, "String( .0000012345 )", "0.0000012345", String(.0000012345) );
+new TestCase( SECTION, "String( .00000012345 )", "1.2345e-7", String(.00000012345));
+
+new TestCase( "15.5.2", "String()", "", String() );
+
+test();
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-01 01:20:18 +0000