js/src/tests/ecma_2/RegExp/regress-001.js@129ffea94266 (annotated)
js/src/tests/ecma_2/RegExp/regress-001.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 | /** |
| michael@0 | 8 | * File Name: RegExp/regress-001.js |
| michael@0 | 9 | * ECMA Section: N/A |
| michael@0 | 10 | * Description: Regression test case: |
| michael@0 | 11 | * JS regexp anchoring on empty match bug |
| michael@0 | 12 | * http://bugzilla.mozilla.org/show_bug.cgi?id=2157 |
| michael@0 | 13 | * |
| michael@0 | 14 | * Author: christine@netscape.com |
| michael@0 | 15 | * Date: 19 February 1999 |
| michael@0 | 16 | */ |
| michael@0 | 17 | var SECTION = "RegExp/hex-001.js"; |
| michael@0 | 18 | var VERSION = "ECMA_2"; |
| michael@0 | 19 | var TITLE = "JS regexp anchoring on empty match bug"; |
| michael@0 | 20 | var BUGNUMBER = "2157"; |
| michael@0 | 21 | |
| michael@0 | 22 | startTest(); |
| michael@0 | 23 | |
| michael@0 | 24 | AddRegExpCases( /a||b/.exec(''), |
| michael@0 | 25 | "/a||b/.exec('')", |
| michael@0 | 26 | 1, |
| michael@0 | 27 | [''] ); |
| michael@0 | 28 | |
| michael@0 | 29 | test(); |
| michael@0 | 30 | |
| michael@0 | 31 | function AddRegExpCases( regexp, str_regexp, length, matches_array ) { |
| michael@0 | 32 | |
| michael@0 | 33 | AddTestCase( |
| michael@0 | 34 | "( " + str_regexp + " ).length", |
| michael@0 | 35 | regexp.length, |
| michael@0 | 36 | regexp.length ); |
| michael@0 | 37 | |
| michael@0 | 38 | |
| michael@0 | 39 | for ( var matches = 0; matches < matches_array.length; matches++ ) { |
| michael@0 | 40 | AddTestCase( |
| michael@0 | 41 | "( " + str_regexp + " )[" + matches +"]", |
| michael@0 | 42 | matches_array[matches], |
| michael@0 | 43 | regexp[matches] ); |
| michael@0 | 44 | } |
| michael@0 | 45 | } |
