michael@0: /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ michael@0: /* This Source Code Form is subject to the terms of the Mozilla Public michael@0: * License, v. 2.0. If a copy of the MPL was not distributed with this michael@0: * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ michael@0: michael@0: michael@0: /** michael@0: * File Name: RegExp/hex-001.js michael@0: * ECMA Section: 15.7.3.1 michael@0: * Description: Based on ECMA 2 Draft 7 February 1999 michael@0: * Positive test cases for constructing a RegExp object michael@0: * Author: christine@netscape.com michael@0: * Date: 19 February 1999 michael@0: */ michael@0: var SECTION = "RegExp/hex-001"; michael@0: var VERSION = "ECMA_2"; michael@0: var TITLE = "RegExp patterns that contain HexicdecimalEscapeSequences"; michael@0: michael@0: startTest(); michael@0: michael@0: // These examples come from 15.7.1, HexidecimalEscapeSequence michael@0: michael@0: AddRegExpCases( new RegExp("\x41"), "new RegExp('\\x41')", "A", "A", 1, 0, ["A"] ); michael@0: AddRegExpCases( new RegExp("\x412"),"new RegExp('\\x412')", "A2", "A2", 1, 0, ["A2"] ); michael@0: michael@0: AddRegExpCases( new RegExp("A"), "new RegExp('A')", "\x41", "\\x41", 1, 0, ["A"] ); michael@0: AddRegExpCases( new RegExp("A"), "new RegExp('A')", "\x412", "\\x412", 1, 0, ["A"] ); michael@0: AddRegExpCases( new RegExp("^x"), "new RegExp('^x')", "x412", "x412", 1, 0, ["x"]); michael@0: AddRegExpCases( new RegExp("A"), "new RegExp('A')", "A2", "A2", 1, 0, ["A"] ); michael@0: michael@0: test(); michael@0: michael@0: function AddRegExpCases( michael@0: regexp, str_regexp, pattern, str_pattern, length, index, matches_array ) { michael@0: michael@0: // prevent a runtime error michael@0: michael@0: if ( regexp.exec(pattern) == null || matches_array == null ) { michael@0: AddTestCase( michael@0: str_regexp + ".exec(" + pattern +")", michael@0: matches_array, michael@0: regexp.exec(pattern) ); michael@0: michael@0: return; michael@0: } michael@0: michael@0: AddTestCase( michael@0: str_regexp + ".exec(" + str_pattern +").length", michael@0: length, michael@0: regexp.exec(pattern).length ); michael@0: michael@0: AddTestCase( michael@0: str_regexp + ".exec(" + str_pattern +").index", michael@0: index, michael@0: regexp.exec(pattern).index ); michael@0: michael@0: AddTestCase( michael@0: str_regexp + ".exec(" + str_pattern +").input", michael@0: pattern, michael@0: regexp.exec(pattern).input ); michael@0: michael@0: for ( var matches = 0; matches < matches_array.length; matches++ ) { michael@0: AddTestCase( michael@0: str_regexp + ".exec(" + str_pattern +")[" + matches +"]", michael@0: matches_array[matches], michael@0: regexp.exec(pattern)[matches] ); michael@0: } michael@0: }