js/src/tests/ecma_2/RegExp/octal-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/octal-001.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 var SECTION = "RegExp/octal-001.js";
michael@0 16 var VERSION = "ECMA_2";
michael@0 17 var TITLE = "RegExp patterns that contain OctalEscapeSequences";
michael@0 18 var BUGNUMBER="http://scopus/bugsplat/show_bug.cgi?id=346196";
michael@0 19
michael@0 20 startTest();
michael@0 21
michael@0 22
michael@0 23 // backreference
michael@0 24 AddRegExpCases(
michael@0 25 /(.)\1/,
michael@0 26 "/(.)\\1/",
michael@0 27 "HI!!",
michael@0 28 "HI!",
michael@0 29 2,
michael@0 30 ["!!", "!"] );
michael@0 31
michael@0 32 test();
michael@0 33
michael@0 34 function AddRegExpCases(
michael@0 35 regexp, str_regexp, pattern, str_pattern, index, matches_array ) {
michael@0 36
michael@0 37 // prevent a runtime error
michael@0 38
michael@0 39 if ( regexp.exec(pattern) == null || matches_array == null ) {
michael@0 40 AddTestCase(
michael@0 41 regexp + ".exec(" + str_pattern +")",
michael@0 42 matches_array,
michael@0 43 regexp.exec(pattern) );
michael@0 44
michael@0 45 return;
michael@0 46 }
michael@0 47 AddTestCase(
michael@0 48 str_regexp + ".exec(" + str_pattern +").length",
michael@0 49 matches_array.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 AddTestCase(
michael@0 63 str_regexp + ".exec(" + str_pattern +").toString()",
michael@0 64 matches_array.toString(),
michael@0 65 regexp.exec(pattern).toString() );
michael@0 66 /*
michael@0 67 var limit = matches_array.length > regexp.exec(pattern).length
michael@0 68 ? matches_array.length
michael@0 69 : regexp.exec(pattern).length;
michael@0 70
michael@0 71 for ( var matches = 0; matches < limit; matches++ ) {
michael@0 72 AddTestCase(
michael@0 73 str_regexp + ".exec(" + str_pattern +")[" + matches +"]",
michael@0 74 matches_array[matches],
michael@0 75 regexp.exec(pattern)[matches] );
michael@0 76 }
michael@0 77 */
michael@0 78 }

mercurial