diff options
author | Matt A. Tobin <mattatobin@localhost.localdomain> | 2018-02-02 04:16:08 -0500 |
---|---|---|
committer | Matt A. Tobin <mattatobin@localhost.localdomain> | 2018-02-02 04:16:08 -0500 |
commit | 5f8de423f190bbb79a62f804151bc24824fa32d8 (patch) | |
tree | 10027f336435511475e392454359edea8e25895d /js/src/tests/js1_1 | |
parent | 49ee0794b5d912db1f95dce6eb52d781dc210db5 (diff) | |
download | UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar.gz UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar.lz UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar.xz UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.zip |
Add m-esr52 at 52.6.0
Diffstat (limited to 'js/src/tests/js1_1')
-rw-r--r-- | js/src/tests/js1_1/README | 1 | ||||
-rw-r--r-- | js/src/tests/js1_1/browser.js | 0 | ||||
-rw-r--r-- | js/src/tests/js1_1/regress/browser.js | 0 | ||||
-rw-r--r-- | js/src/tests/js1_1/regress/function-001.js | 45 | ||||
-rw-r--r-- | js/src/tests/js1_1/regress/perfect.js | 47 | ||||
-rw-r--r-- | js/src/tests/js1_1/regress/shell.js | 0 | ||||
-rw-r--r-- | js/src/tests/js1_1/shell.js | 0 |
7 files changed, 93 insertions, 0 deletions
diff --git a/js/src/tests/js1_1/README b/js/src/tests/js1_1/README new file mode 100644 index 000000000..eb5b5cc93 --- /dev/null +++ b/js/src/tests/js1_1/README @@ -0,0 +1 @@ +JavaScript 1.1 diff --git a/js/src/tests/js1_1/browser.js b/js/src/tests/js1_1/browser.js new file mode 100644 index 000000000..e69de29bb --- /dev/null +++ b/js/src/tests/js1_1/browser.js diff --git a/js/src/tests/js1_1/regress/browser.js b/js/src/tests/js1_1/regress/browser.js new file mode 100644 index 000000000..e69de29bb --- /dev/null +++ b/js/src/tests/js1_1/regress/browser.js diff --git a/js/src/tests/js1_1/regress/function-001.js b/js/src/tests/js1_1/regress/function-001.js new file mode 100644 index 000000000..37d2335d4 --- /dev/null +++ b/js/src/tests/js1_1/regress/function-001.js @@ -0,0 +1,45 @@ +/* -*- indent-tabs-mode: nil; js-indent-level: 2 -*- */ +/* This Source Code Form is subject to the terms of the Mozilla Public + * License, v. 2.0. If a copy of the MPL was not distributed with this + * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ + + +/** + * File Name: boolean-001.js + * Description: + * + * http://scopus.mcom.com/bugsplat/show_bug.cgi?id=99232 + * + * eval("function f(){}function g(){}") at top level is an error for JS1.2 + and above (missing ; between named function expressions), but declares f + and g as functions below 1.2. + * + * Fails to produce error regardless of version: + * js> version(100) + 120 + js> eval("function f(){}function g(){}") + js> version(120); + 100 + js> eval("function f(){}function g(){}") + js> + * Author: christine@netscape.com + * Date: 11 August 1998 + */ +var SECTION = "function-001.js"; +var VERSION = "JS1_1"; +var TITLE = "functions not separated by semicolons are not errors in version 110 "; +var BUGNUMBER="99232"; + +startTest(); +writeHeaderToLog( SECTION + " "+ TITLE); + +result = "passed"; + +new TestCase( + SECTION, + "eval(\"function f(){}function g(){}\")", + void 0, + eval("function f(){}function g(){}") ); + +test(); + diff --git a/js/src/tests/js1_1/regress/perfect.js b/js/src/tests/js1_1/regress/perfect.js new file mode 100644 index 000000000..ceb340d7a --- /dev/null +++ b/js/src/tests/js1_1/regress/perfect.js @@ -0,0 +1,47 @@ +/* + * Any copyright is dedicated to the Public Domain. + * http://creativecommons.org/licenses/publicdomain/ + */ + +// Some simple testing of new, eval and some string stuff. + +// constructor -- expression array initialization +function ExprArray(n,v) +{ + // Initializes n values to v coerced to a string. + for (var i = 0; i < n; i++) { + this[i] = "" + v; + } +} + + +// Print the perfect numbers up to n and the sum expression for n's divisors. +function perfect(n) +{ + print("The perfect numbers up to " + n + " are:"); + var results = []; + + // We build sumOfDivisors[i] to hold a string expression for + // the sum of the divisors of i, excluding i itself. + var sumOfDivisors = new ExprArray(n+1,1); + for (var divisor = 2; divisor <= n; divisor++) { + for (var j = divisor + divisor; j <= n; j += divisor) { + sumOfDivisors[j] += " + " + divisor; + } + // At this point everything up to 'divisor' has its sumOfDivisors + // expression calculated, so we can determine whether it's perfect + // already by evaluating. + if (eval(sumOfDivisors[divisor]) == divisor) { + print("" + divisor + " = " + sumOfDivisors[divisor]); + results.push(divisor); + } + } + print("That's all."); + return results; +} + + +print("\nA number is 'perfect' if it is equal to the sum of its") +print("divisors (excluding itself).\n"); + +reportCompare(perfect(500).join(), "6,28,496"); diff --git a/js/src/tests/js1_1/regress/shell.js b/js/src/tests/js1_1/regress/shell.js new file mode 100644 index 000000000..e69de29bb --- /dev/null +++ b/js/src/tests/js1_1/regress/shell.js diff --git a/js/src/tests/js1_1/shell.js b/js/src/tests/js1_1/shell.js new file mode 100644 index 000000000..e69de29bb --- /dev/null +++ b/js/src/tests/js1_1/shell.js |