зеркало из https://github.com/mozilla/pjs.git
137 строки
3.8 KiB
JavaScript
137 строки
3.8 KiB
JavaScript
/*
|
|
* The contents of this file are subject to the Netscape Public
|
|
* License Version 1.1 (the "License"); you may not use this file
|
|
* except in compliance with the License. You may obtain a copy of
|
|
* the License at http://www.mozilla.org/NPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS IS"
|
|
* basis, WITHOUT WARRANTY OF ANY KIND, either expressed
|
|
* or implied. See the License for the specific language governing
|
|
* rights and limitations under the License.
|
|
*
|
|
* The Original Code is mozilla.org code.
|
|
*
|
|
* The Initial Developer of the Original Code is Netscape
|
|
* Communications Corporation. Portions created by Netscape are
|
|
* Copyright (C) 1998 Netscape Communications Corporation.
|
|
* All Rights Reserved.
|
|
*
|
|
* Contributor(s): mozilla@pdavis.cx, pschwartau@netscape.com
|
|
* Date: 22 October 2001
|
|
*
|
|
* SUMMARY: Regression test for Bugzilla bug 105972:
|
|
* "/^.*?$/ will not match anything"
|
|
*
|
|
* See http://bugzilla.mozilla.org/show_bug.cgi?id=105972
|
|
*/
|
|
//-----------------------------------------------------------------------------
|
|
var i = 0;
|
|
var bug = 105972;
|
|
var summary = 'Regression test for Bugzilla bug 105972';
|
|
var cnEmptyString = '';
|
|
var status = '';
|
|
var statusmessages = new Array();
|
|
var pattern = '';
|
|
var patterns = new Array();
|
|
var string = '';
|
|
var strings = new Array();
|
|
var actualmatch = '';
|
|
var actualmatches = new Array();
|
|
var expectedmatch = '';
|
|
var expectedmatches = new Array();
|
|
|
|
|
|
/*
|
|
* The bug: this match was coming up null in Rhino and SpiderMonkey.
|
|
* It should match the whole string. The reason:
|
|
*
|
|
* The * operator is greedy, but *? is non-greedy: it will stop
|
|
* at the simplest match it can find. But the pattern here asks us
|
|
* to match till the end of the string. So the simplest match must
|
|
* go all the way out to the end, and *? has no choice but to do it.
|
|
*/
|
|
status = inSection(1);
|
|
pattern = /^.*?$/;
|
|
string = 'Hello World';
|
|
actualmatch = string.match(pattern);
|
|
expectedmatch = Array(string);
|
|
addThis();
|
|
|
|
|
|
/*
|
|
* Leave off the '$' condition - here we expect the empty string.
|
|
* Unlike the above pattern, we don't have to match till the end of
|
|
* the string, so the non-greedy operator *? doesn't try to...
|
|
*/
|
|
status = inSection(2);
|
|
pattern = /^.*?/;
|
|
string = 'Hello World';
|
|
actualmatch = string.match(pattern);
|
|
expectedmatch = Array(cnEmptyString);
|
|
addThis();
|
|
|
|
|
|
/*
|
|
* Try '$' combined with an 'or' operator.
|
|
*
|
|
* The operator *? will consume the string from left to right,
|
|
* attempting to satisfy the condition (:|$). When it hits ':',
|
|
* the match will stop because the operator *? is non-greedy.
|
|
*
|
|
* The submatch $1 = (:|$) will contain the ':'
|
|
*/
|
|
status = inSection(3);
|
|
pattern = /^.*?(:|$)/;
|
|
string = 'Hello: World';
|
|
actualmatch = string.match(pattern);
|
|
expectedmatch = Array('Hello:', ':');
|
|
addThis();
|
|
|
|
|
|
/*
|
|
* Again, '$' combined with an 'or' operator.
|
|
*
|
|
* The operator * will consume the string from left to right,
|
|
* attempting to satisfy the condition (:|$). When it hits ':',
|
|
* the match will not stop since * is greedy. The match will
|
|
* continue until it hits $, the end-of-string boundary.
|
|
*
|
|
* The submatch $1 = (:|$) will contain the empty string
|
|
* conceived to exist at the end-of-string boundary.
|
|
*/
|
|
status = inSection(4);
|
|
pattern = /^.*(:|$)/;
|
|
string = 'Hello: World';
|
|
actualmatch = string.match(pattern);
|
|
expectedmatch = Array(string, cnEmptyString);
|
|
addThis();
|
|
|
|
|
|
|
|
|
|
//-----------------------------------------------------------------------------
|
|
test();
|
|
//-----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
function addThis()
|
|
{
|
|
statusmessages[i] = status;
|
|
patterns[i] = pattern;
|
|
strings[i] = string;
|
|
actualmatches[i] = actualmatch;
|
|
expectedmatches[i] = expectedmatch;
|
|
i++;
|
|
}
|
|
|
|
|
|
function test()
|
|
{
|
|
enterFunc ('test');
|
|
printBugNumber (bug);
|
|
printStatus (summary);
|
|
testRegExp(statusmessages, patterns, strings, actualmatches, expectedmatches);
|
|
exitFunc ('test');
|
|
}
|