js/src/tests/ecma_2/RegExp/octal-003.js@129ffea94266 (annotated)
js/src/tests/ecma_2/RegExp/octal-003.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/octal-003.js |
| michael@0 | 9 | * ECMA Section: 15.7.1 |
| michael@0 | 10 | * Description: Based on ECMA 2 Draft 7 February 1999 |
| michael@0 | 11 | * Simple test cases for matching OctalEscapeSequences. |
| michael@0 | 12 | * Author: christine@netscape.com |
| michael@0 | 13 | * Date: 19 February 1999 |
| michael@0 | 14 | * |
| michael@0 | 15 | * Revised: 02 August 2002 |
| michael@0 | 16 | * Author: pschwartau@netscape.com |
| michael@0 | 17 | * |
| michael@0 | 18 | * WHY: the original test expected the regexp /.\011/ |
| michael@0 | 19 | * to match 'a' + String.fromCharCode(0) + '11' |
| michael@0 | 20 | * |
| michael@0 | 21 | * This is incorrect: the string is a 4-character string consisting of |
| michael@0 | 22 | * the characters <'a'>, <nul>, <'1'>, <'1'>. By contrast, the \011 in the |
| michael@0 | 23 | * regexp should be parsed as a single token: it is the octal escape sequence |
| michael@0 | 24 | * for the horizontal tab character '\t' === '\u0009' === '\x09' === '\011'. |
| michael@0 | 25 | * |
| michael@0 | 26 | * So the regexp consists of 2 characters: <any-character>, <'\t'>. |
| michael@0 | 27 | * There is no match between the regexp and the string. |
| michael@0 | 28 | * |
| michael@0 | 29 | * See the testcase ecma_3/RegExp/octal-002.js for an elaboration. |
| michael@0 | 30 | * |
| michael@0 | 31 | */ |
| michael@0 | 32 | var SECTION = "RegExp/octal-003.js"; |
| michael@0 | 33 | var VERSION = "ECMA_2"; |
| michael@0 | 34 | var TITLE = "RegExp patterns that contain OctalEscapeSequences"; |
| michael@0 | 35 | var BUGNUMBER="http://scopus/bugsplat/show_bug.cgi?id=346132"; |
| michael@0 | 36 | |
| michael@0 | 37 | startTest(); |
| michael@0 | 38 | |
| michael@0 | 39 | AddRegExpCases( /.\011/, "/\\011/", "a" + String.fromCharCode(0) + "11", "a\\011", 0, null ); |
| michael@0 | 40 | |
| michael@0 | 41 | test(); |
| michael@0 | 42 | |
| michael@0 | 43 | function AddRegExpCases( |
| michael@0 | 44 | regexp, str_regexp, pattern, str_pattern, index, matches_array ) { |
| michael@0 | 45 | |
| michael@0 | 46 | // prevent a runtime error |
| michael@0 | 47 | |
| michael@0 | 48 | if ( regexp.exec(pattern) == null || matches_array == null ) { |
| michael@0 | 49 | AddTestCase( |
| michael@0 | 50 | regexp + ".exec(" + str_pattern +")", |
| michael@0 | 51 | matches_array, |
| michael@0 | 52 | regexp.exec(pattern) ); |
| michael@0 | 53 | |
| michael@0 | 54 | return; |
| michael@0 | 55 | } |
| michael@0 | 56 | AddTestCase( |
| michael@0 | 57 | str_regexp + ".exec(" + str_pattern +").length", |
| michael@0 | 58 | matches_array.length, |
| michael@0 | 59 | regexp.exec(pattern).length ); |
| michael@0 | 60 | |
| michael@0 | 61 | AddTestCase( |
| michael@0 | 62 | str_regexp + ".exec(" + str_pattern +").index", |
| michael@0 | 63 | index, |
| michael@0 | 64 | regexp.exec(pattern).index ); |
| michael@0 | 65 | |
| michael@0 | 66 | AddTestCase( |
| michael@0 | 67 | str_regexp + ".exec(" + str_pattern +").input", |
| michael@0 | 68 | escape(pattern), |
| michael@0 | 69 | escape(regexp.exec(pattern).input) ); |
| michael@0 | 70 | |
| michael@0 | 71 | AddTestCase( |
| michael@0 | 72 | str_regexp + ".exec(" + str_pattern +").toString()", |
| michael@0 | 73 | matches_array.toString(), |
| michael@0 | 74 | escape(regexp.exec(pattern).toString()) ); |
| michael@0 | 75 | |
| michael@0 | 76 | var limit = matches_array.length > regexp.exec(pattern).length |
| michael@0 | 77 | ? matches_array.length |
| michael@0 | 78 | : regexp.exec(pattern).length; |
| michael@0 | 79 | |
| michael@0 | 80 | for ( var matches = 0; matches < limit; matches++ ) { |
| michael@0 | 81 | AddTestCase( |
| michael@0 | 82 | str_regexp + ".exec(" + str_pattern +")[" + matches +"]", |
| michael@0 | 83 | matches_array[matches], |
| michael@0 | 84 | escape(regexp.exec(pattern)[matches]) ); |
| michael@0 | 85 | } |
| michael@0 | 86 | |
| michael@0 | 87 | } |
