js/src/tests/ecma_2/RegExp/hex-001.js@129ffea94266 (annotated)
js/src/tests/ecma_2/RegExp/hex-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/hex-001.js |
| michael@0 | 9 | * ECMA Section: 15.7.3.1 |
| michael@0 | 10 | * Description: Based on ECMA 2 Draft 7 February 1999 |
| michael@0 | 11 | * Positive test cases for constructing a RegExp object |
| michael@0 | 12 | * Author: christine@netscape.com |
| michael@0 | 13 | * Date: 19 February 1999 |
| michael@0 | 14 | */ |
| michael@0 | 15 | var SECTION = "RegExp/hex-001"; |
| michael@0 | 16 | var VERSION = "ECMA_2"; |
| michael@0 | 17 | var TITLE = "RegExp patterns that contain HexicdecimalEscapeSequences"; |
| michael@0 | 18 | |
| michael@0 | 19 | startTest(); |
| michael@0 | 20 | |
| michael@0 | 21 | // These examples come from 15.7.1, HexidecimalEscapeSequence |
| michael@0 | 22 | |
| michael@0 | 23 | AddRegExpCases( new RegExp("\x41"), "new RegExp('\\x41')", "A", "A", 1, 0, ["A"] ); |
| michael@0 | 24 | AddRegExpCases( new RegExp("\x412"),"new RegExp('\\x412')", "A2", "A2", 1, 0, ["A2"] ); |
| michael@0 | 25 | |
| michael@0 | 26 | AddRegExpCases( new RegExp("A"), "new RegExp('A')", "\x41", "\\x41", 1, 0, ["A"] ); |
| michael@0 | 27 | AddRegExpCases( new RegExp("A"), "new RegExp('A')", "\x412", "\\x412", 1, 0, ["A"] ); |
| michael@0 | 28 | AddRegExpCases( new RegExp("^x"), "new RegExp('^x')", "x412", "x412", 1, 0, ["x"]); |
| michael@0 | 29 | AddRegExpCases( new RegExp("A"), "new RegExp('A')", "A2", "A2", 1, 0, ["A"] ); |
| michael@0 | 30 | |
| michael@0 | 31 | test(); |
| michael@0 | 32 | |
| michael@0 | 33 | function AddRegExpCases( |
| michael@0 | 34 | regexp, str_regexp, pattern, str_pattern, length, index, matches_array ) { |
| michael@0 | 35 | |
| michael@0 | 36 | // prevent a runtime error |
| michael@0 | 37 | |
| michael@0 | 38 | if ( regexp.exec(pattern) == null || matches_array == null ) { |
| michael@0 | 39 | AddTestCase( |
| michael@0 | 40 | str_regexp + ".exec(" + pattern +")", |
| michael@0 | 41 | matches_array, |
| michael@0 | 42 | regexp.exec(pattern) ); |
| michael@0 | 43 | |
| michael@0 | 44 | return; |
| michael@0 | 45 | } |
| michael@0 | 46 | |
| michael@0 | 47 | AddTestCase( |
| michael@0 | 48 | str_regexp + ".exec(" + str_pattern +").length", |
| michael@0 | 49 | length, |
| michael@0 | 50 | regexp.exec(pattern).length ); |
| michael@0 | 51 | |
| michael@0 | 52 | AddTestCase( |
| michael@0 | 53 | str_regexp + ".exec(" + str_pattern +").index", |
| michael@0 | 54 | index, |
| michael@0 | 55 | regexp.exec(pattern).index ); |
| michael@0 | 56 | |
| michael@0 | 57 | AddTestCase( |
| michael@0 | 58 | str_regexp + ".exec(" + str_pattern +").input", |
| michael@0 | 59 | pattern, |
| michael@0 | 60 | regexp.exec(pattern).input ); |
| michael@0 | 61 | |
| michael@0 | 62 | for ( var matches = 0; matches < matches_array.length; matches++ ) { |
| michael@0 | 63 | AddTestCase( |
| michael@0 | 64 | str_regexp + ".exec(" + str_pattern +")[" + matches +"]", |
| michael@0 | 65 | matches_array[matches], |
| michael@0 | 66 | regexp.exec(pattern)[matches] ); |
| michael@0 | 67 | } |
| michael@0 | 68 | } |
