js/src/tests/js1_2/regexp/digit.js@129ffea94266 (annotated)
js/src/tests/js1_2/regexp/digit.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 | Filename: digit.js |
| michael@0 | 9 | Description: 'Tests regular expressions containing \d' |
| michael@0 | 10 | |
| michael@0 | 11 | Author: Nick Lerissa |
| michael@0 | 12 | Date: March 10, 1998 |
| michael@0 | 13 | */ |
| michael@0 | 14 | |
| michael@0 | 15 | var SECTION = 'As described in Netscape doc "Whats new in JavaScript 1.2"'; |
| michael@0 | 16 | var VERSION = 'no version'; |
| michael@0 | 17 | startTest(); |
| michael@0 | 18 | var TITLE = 'RegExp: \\d'; |
| michael@0 | 19 | |
| michael@0 | 20 | writeHeaderToLog('Executing script: digit.js'); |
| michael@0 | 21 | writeHeaderToLog( SECTION + " "+ TITLE); |
| michael@0 | 22 | |
| michael@0 | 23 | var non_digits = "_abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\f\n\r\t\v~`!@#$%^&*()-+={[}]|\\:;'<,>./? " + '"'; |
| michael@0 | 24 | |
| michael@0 | 25 | var digits = "1234567890"; |
| michael@0 | 26 | |
| michael@0 | 27 | // be sure all digits are matched by \d |
| michael@0 | 28 | new TestCase ( SECTION, |
| michael@0 | 29 | "'" + digits + "'.match(new RegExp('\\d+'))", |
| michael@0 | 30 | String([digits]), String(digits.match(new RegExp('\\d+')))); |
| michael@0 | 31 | |
| michael@0 | 32 | // be sure all non-digits are matched by \D |
| michael@0 | 33 | new TestCase ( SECTION, |
| michael@0 | 34 | "'" + non_digits + "'.match(new RegExp('\\D+'))", |
| michael@0 | 35 | String([non_digits]), String(non_digits.match(new RegExp('\\D+')))); |
| michael@0 | 36 | |
| michael@0 | 37 | // be sure all non-digits are not matched by \d |
| michael@0 | 38 | new TestCase ( SECTION, |
| michael@0 | 39 | "'" + non_digits + "'.match(new RegExp('\\d'))", |
| michael@0 | 40 | null, non_digits.match(new RegExp('\\d'))); |
| michael@0 | 41 | |
| michael@0 | 42 | // be sure all digits are not matched by \D |
| michael@0 | 43 | new TestCase ( SECTION, |
| michael@0 | 44 | "'" + digits + "'.match(new RegExp('\\D'))", |
| michael@0 | 45 | null, digits.match(new RegExp('\\D'))); |
| michael@0 | 46 | |
| michael@0 | 47 | var s = non_digits + digits; |
| michael@0 | 48 | |
| michael@0 | 49 | // be sure all digits are matched by \d |
| michael@0 | 50 | new TestCase ( SECTION, |
| michael@0 | 51 | "'" + s + "'.match(new RegExp('\\d+'))", |
| michael@0 | 52 | String([digits]), String(s.match(new RegExp('\\d+')))); |
| michael@0 | 53 | |
| michael@0 | 54 | var s = digits + non_digits; |
| michael@0 | 55 | |
| michael@0 | 56 | // be sure all non-digits are matched by \D |
| michael@0 | 57 | new TestCase ( SECTION, |
| michael@0 | 58 | "'" + s + "'.match(new RegExp('\\D+'))", |
| michael@0 | 59 | String([non_digits]), String(s.match(new RegExp('\\D+')))); |
| michael@0 | 60 | |
| michael@0 | 61 | var i; |
| michael@0 | 62 | |
| michael@0 | 63 | // be sure all digits match individually |
| michael@0 | 64 | for (i = 0; i < digits.length; ++i) |
| michael@0 | 65 | { |
| michael@0 | 66 | s = 'ab' + digits[i] + 'cd'; |
| michael@0 | 67 | new TestCase ( SECTION, |
| michael@0 | 68 | "'" + s + "'.match(new RegExp('\\d'))", |
| michael@0 | 69 | String([digits[i]]), String(s.match(new RegExp('\\d')))); |
| michael@0 | 70 | new TestCase ( SECTION, |
| michael@0 | 71 | "'" + s + "'.match(/\\d/)", |
| michael@0 | 72 | String([digits[i]]), String(s.match(/\d/))); |
| michael@0 | 73 | } |
| michael@0 | 74 | // be sure all non_digits match individually |
| michael@0 | 75 | for (i = 0; i < non_digits.length; ++i) |
| michael@0 | 76 | { |
| michael@0 | 77 | s = '12' + non_digits[i] + '34'; |
| michael@0 | 78 | new TestCase ( SECTION, |
| michael@0 | 79 | "'" + s + "'.match(new RegExp('\\D'))", |
| michael@0 | 80 | String([non_digits[i]]), String(s.match(new RegExp('\\D')))); |
| michael@0 | 81 | new TestCase ( SECTION, |
| michael@0 | 82 | "'" + s + "'.match(/\\D/)", |
| michael@0 | 83 | String([non_digits[i]]), String(s.match(/\D/))); |
| michael@0 | 84 | } |
| michael@0 | 85 | |
| michael@0 | 86 | test(); |
