js/src/tests/js1_6/Array/regress-386030.js@129ffea94266 (annotated)
js/src/tests/js1_6/Array/regress-386030.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 | /* |
| michael@0 | 3 | * Any copyright is dedicated to the Public Domain. |
| michael@0 | 4 | * http://creativecommons.org/licenses/publicdomain/ |
| michael@0 | 5 | * Contributor: Blake Kaplan |
| michael@0 | 6 | */ |
| michael@0 | 7 | |
| michael@0 | 8 | //----------------------------------------------------------------------------- |
| michael@0 | 9 | var BUGNUMBER = 386030; |
| michael@0 | 10 | var summary = 'Array.reduce should ignore holes'; |
| michael@0 | 11 | var actual = ''; |
| michael@0 | 12 | var expect = ''; |
| michael@0 | 13 | |
| michael@0 | 14 | |
| michael@0 | 15 | //----------------------------------------------------------------------------- |
| michael@0 | 16 | test(); |
| michael@0 | 17 | //----------------------------------------------------------------------------- |
| michael@0 | 18 | |
| michael@0 | 19 | function test() |
| michael@0 | 20 | { |
| michael@0 | 21 | enterFunc ('test'); |
| michael@0 | 22 | printBugNumber(BUGNUMBER); |
| michael@0 | 23 | printStatus (summary); |
| michael@0 | 24 | |
| michael@0 | 25 | function add(a, b) { return a + b; } |
| michael@0 | 26 | function testreduce(v) { return v == 3 ? "PASS" : "FAIL"; } |
| michael@0 | 27 | |
| michael@0 | 28 | expect = 'PASS'; |
| michael@0 | 29 | |
| michael@0 | 30 | try { |
| michael@0 | 31 | a = new Array(2); |
| michael@0 | 32 | a[1] = 3; |
| michael@0 | 33 | actual = testreduce(a.reduce(add)); |
| michael@0 | 34 | } catch (e) { |
| michael@0 | 35 | actual = "FAIL, reduce"; |
| michael@0 | 36 | } |
| michael@0 | 37 | reportCompare(expect, actual, summary + ': 1'); |
| michael@0 | 38 | |
| michael@0 | 39 | try { |
| michael@0 | 40 | a = new Array(2); |
| michael@0 | 41 | a[0] = 3; |
| michael@0 | 42 | actual = testreduce(a.reduceRight(add)); |
| michael@0 | 43 | } catch (e) { |
| michael@0 | 44 | actual = "FAIL, reduceRight"; |
| michael@0 | 45 | } |
| michael@0 | 46 | reportCompare(expect, actual, summary + ': 2'); |
| michael@0 | 47 | |
| michael@0 | 48 | try { |
| michael@0 | 49 | a = new Array(2); |
| michael@0 | 50 | a.reduce(add); |
| michael@0 | 51 | actual = "FAIL, empty reduce"; |
| michael@0 | 52 | } catch (e) { |
| michael@0 | 53 | actual = "PASS"; |
| michael@0 | 54 | } |
| michael@0 | 55 | reportCompare(expect, actual, summary + ': 3'); |
| michael@0 | 56 | |
| michael@0 | 57 | try { |
| michael@0 | 58 | a = new Array(2); |
| michael@0 | 59 | print(a.reduceRight(add)); |
| michael@0 | 60 | actual = "FAIL, empty reduceRight"; |
| michael@0 | 61 | } catch (e) { |
| michael@0 | 62 | actual = "PASS"; |
| michael@0 | 63 | } |
| michael@0 | 64 | reportCompare(expect, actual, summary + ': 4'); |
| michael@0 | 65 | |
| michael@0 | 66 | exitFunc ('test'); |
| michael@0 | 67 | } |
