Source code

Revision control

Copy as Markdown

Other Tools

/* -*- tab-width: 2; indent-tabs-mode: nil; js-indent-level: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
/**
* File Name: String/match-002.js
* ECMA Section: 15.6.4.9
* Description: Based on ECMA 2 Draft 7 February 1999
*
* Author: christine@netscape.com
* Date: 19 February 1999
*/
/*
* String.match( regexp )
*
* If regexp is not an object of type RegExp, it is replaced with result
* of the expression new RegExp(regexp). Let string denote the result of
* converting the this value to a string. If regexp.global is false,
* return the result obtained by invoking RegExp.prototype.exec (see
* section 15.7.5.3) on regexp with string as parameter.
*
* Otherwise, set the regexp.lastIndex property to 0 and invoke
* RegExp.prototype.exec repeatedly until there is no match. If there is a
* match with an empty string (in other words, if the value of
* regexp.lastIndex is left unchanged) increment regexp.lastIndex by 1.
* The value returned is an array with the properties 0 through n-1
* corresponding to the first element of the result of each matching
* invocation of RegExp.prototype.exec.
*
* Note that the match function is intentionally generic; it does not
* require that its this value be a string object. Therefore, it can be
* transferred to other kinds of objects for use as a method.
*
* This file tests cases in which regexp.global is false. Therefore,
* results should behave as regexp.exec with string passed as a parameter.
*
*/
var SECTION = "String/match-002.js";
var TITLE = "String.prototype.match( regexp )";
// the regexp argument is not a RegExp object
// this is not a string object
AddRegExpCases( /([\d]{5})([-\ ]?[\d]{4})?$/,
"/([\d]{5})([-\ ]?[\d]{4})?$/",
"Boston, Mass. 02134",
14,
["02134", "02134", undefined]);
AddGlobalRegExpCases( /([\d]{5})([-\ ]?[\d]{4})?$/g,
"/([\d]{5})([-\ ]?[\d]{4})?$/g",
"Boston, Mass. 02134",
["02134"]);
// set the value of lastIndex
re = /([\d]{5})([-\ ]?[\d]{4})?$/;
re.lastIndex = 0;
s = "Boston, MA 02134";
AddRegExpCases( re,
"re = /([\d]{5})([-\ ]?[\d]{4})?$/; re.lastIndex =0",
s,
s.lastIndexOf("0"),
["02134", "02134", undefined]);
re.lastIndex = s.length;
AddRegExpCases( re,
"re = /([\d]{5})([-\ ]?[\d]{4})?$/; re.lastIndex = " +
s.length,
s,
s.lastIndexOf("0"),
["02134", "02134", undefined] );
re.lastIndex = s.lastIndexOf("0");
AddRegExpCases( re,
"re = /([\d]{5})([-\ ]?[\d]{4})?$/; re.lastIndex = " +
s.lastIndexOf("0"),
s,
s.lastIndexOf("0"),
["02134", "02134", undefined]);
re.lastIndex = s.lastIndexOf("0") + 1;
AddRegExpCases( re,
"re = /([\d]{5})([-\ ]?[\d]{4})?$/; re.lastIndex = " +
s.lastIndexOf("0") +1,
s,
s.lastIndexOf("0"),
["02134", "02134", undefined]);
test();
function AddRegExpCases(
regexp, str_regexp, string, index, matches_array ) {
// prevent a runtime error
if ( regexp.exec(string) == null || matches_array == null ) {
AddTestCase(
string + ".match(" + regexp +")",
matches_array,
string.match(regexp) );
return;
}
AddTestCase(
"( " + string + " ).match(" + str_regexp +").length",
matches_array.length,
string.match(regexp).length );
AddTestCase(
"( " + string + " ).match(" + str_regexp +").index",
index,
string.match(regexp).index );
AddTestCase(
"( " + string + " ).match(" + str_regexp +").input",
string,
string.match(regexp).input );
var limit = matches_array.length > string.match(regexp).length ?
matches_array.length :
string.match(regexp).length;
for ( var matches = 0; matches < limit; matches++ ) {
AddTestCase(
"( " + string + " ).match(" + str_regexp +")[" + matches +"]",
matches_array[matches],
string.match(regexp)[matches] );
}
}
function AddGlobalRegExpCases(
regexp, str_regexp, string, matches_array ) {
// prevent a runtime error
if ( regexp.exec(string) == null || matches_array == null ) {
AddTestCase(
regexp + ".exec(" + string +")",
matches_array,
regexp.exec(string) );
return;
}
AddTestCase(
"( " + string + " ).match(" + str_regexp +").length",
matches_array.length,
string.match(regexp).length );
var limit = matches_array.length > string.match(regexp).length ?
matches_array.length :
string.match(regexp).length;
for ( var matches = 0; matches < limit; matches++ ) {
AddTestCase(
"( " + string + " ).match(" + str_regexp +")[" + matches +"]",
matches_array[matches],
string.match(regexp)[matches] );
}
}