js/src/tests/js1_7/extensions/regress-363040-02.js@129ffea94266 (annotated)
js/src/tests/js1_7/extensions/regress-363040-02.js
Sat, 03 Jan 2015 20:18:00 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Sat, 03 Jan 2015 20:18:00 +0100
- branch
- TOR_BUG_3246
- changeset 7
- 129ffea94266
- permissions
- -rw-r--r--
Conditionally enable double key logic according to:
private browsing mode or privacy.thirdparty.isolate preference and
implement in GetCookieStringCommon and FindCookie where it counts...
With some reservations of how to convince FindCookie users to test
condition and pass a nullptr when disabling double key logic.
| michael@0 | 1 | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ |
| michael@0 | 2 | /* This Source Code Form is subject to the terms of the Mozilla Public |
| michael@0 | 3 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
| michael@0 | 4 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
| michael@0 | 5 | |
| michael@0 | 6 | //----------------------------------------------------------------------------- |
| michael@0 | 7 | var BUGNUMBER = 363040; |
| michael@0 | 8 | var summary = 'Array.prototype.reduce application in continued fraction'; |
| michael@0 | 9 | var actual = ''; |
| michael@0 | 10 | var expect = ''; |
| michael@0 | 11 | |
| michael@0 | 12 | |
| michael@0 | 13 | //----------------------------------------------------------------------------- |
| michael@0 | 14 | test(); |
| michael@0 | 15 | //----------------------------------------------------------------------------- |
| michael@0 | 16 | |
| michael@0 | 17 | function test() |
| michael@0 | 18 | { |
| michael@0 | 19 | enterFunc ('test'); |
| michael@0 | 20 | printBugNumber(BUGNUMBER); |
| michael@0 | 21 | printStatus (summary); |
| michael@0 | 22 | |
| michael@0 | 23 | |
| michael@0 | 24 | // Print x as a continued fraction in compact abbreviated notation and return |
| michael@0 | 25 | // the convergent [n, d] such that x - (n / d) <= epsilon. |
| michael@0 | 26 | function contfrac(x, epsilon) { |
| michael@0 | 27 | let i = Math.floor(x); |
| michael@0 | 28 | let a = [i]; |
| michael@0 | 29 | x = x - i; |
| michael@0 | 30 | let maxerr = x; |
| michael@0 | 31 | while (maxerr > epsilon) { |
| michael@0 | 32 | x = 1 / x; |
| michael@0 | 33 | i = Math.floor(x); |
| michael@0 | 34 | a.push(i); |
| michael@0 | 35 | x = x - i; |
| michael@0 | 36 | maxerr = x * maxerr / i; |
| michael@0 | 37 | } |
| michael@0 | 38 | print(uneval(a)); |
| michael@0 | 39 | return a.reduceRight(function (x, y) {return [x[0] * y + x[1], x[0]];}, [1, 0]); |
| michael@0 | 40 | } |
| michael@0 | 41 | |
| michael@0 | 42 | if (!Array.prototype.reduceRight) |
| michael@0 | 43 | { |
| michael@0 | 44 | print('Test skipped. Array.prototype.reduceRight not implemented'); |
| michael@0 | 45 | } |
| michael@0 | 46 | else |
| michael@0 | 47 | { |
| michael@0 | 48 | // Show contfrac in action on some interesting numbers. |
| michael@0 | 49 | for each (num in [Math.PI, Math.sqrt(2), 1 / (Math.sqrt(Math.E) - 1)]) { |
| michael@0 | 50 | print('Continued fractions for', num); |
| michael@0 | 51 | for each (eps in [1e-2, 1e-3, 1e-5, 1e-7, 1e-10]) { |
| michael@0 | 52 | let frac = contfrac(num, eps); |
| michael@0 | 53 | let est = frac[0] / frac[1]; |
| michael@0 | 54 | let err = num - est; |
| michael@0 | 55 | print(uneval(frac), est, err); |
| michael@0 | 56 | } |
| michael@0 | 57 | print(); |
| michael@0 | 58 | } |
| michael@0 | 59 | } |
| michael@0 | 60 | |
| michael@0 | 61 | reportCompare(expect, actual, summary); |
| michael@0 | 62 | |
| michael@0 | 63 | exitFunc ('test'); |
| michael@0 | 64 | } |
