1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362
|
/* ***** BEGIN LICENSE BLOCK *****
* Version: NPL 1.1/GPL 2.0/LGPL 2.1
*
* 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 express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is JavaScript Engine testing utilities.
*
* The Initial Developer of the Original Code is Netscape Communications Corp.
* Portions created by the Initial Developer are Copyright (C) 2002
* the Initial Developer. All Rights Reserved.
*
* Contributor(s): pschwartau@netscape.com
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the NPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the NPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK *****
*
*
* Date: 18 Feb 2002
* SUMMARY: Testing re.exec(str) when re.lastIndex is < 0 or > str.length
*
* Case 1: If re has the global flag set, then re(str) should be null
* Case 2: If re doesn't have this set, then re(str) should be unaffected
*
* See http://bugzilla.mozilla.org/show_bug.cgi?id=76717
*
*
* From the ECMA-262 Final spec:
*
* 15.10.6.2 RegExp.prototype.exec(string)
* Performs a regular expression match of string against the regular
* expression and returns an Array object containing the results of
* the match, or null if the string did not match.
*
* The string ToString(string) is searched for an occurrence of the
* regular expression pattern as follows:
*
* 1. Let S be the value of ToString(string).
* 2. Let length be the length of S.
* 3. Let lastIndex be the value of the lastIndex property.
* 4. Let i be the value of ToInteger(lastIndex).
* 5. If the global property is false, let i = 0.
* 6. If i < 0 or i > length then set lastIndex to 0 and return null.
* 7. Call [[Match]], giving it the arguments S and i.
* If [[Match]] returned failure, go to step 8;
* otherwise let r be its State result and go to step 10.
* 8. Let i = i+1.
* 9. Go to step 6.
* 10. Let e be r's endIndex value.
* 11. If the global property is true, set lastIndex to e.
*
* etc.
*
*
* So:
*
* A. If the global flag is not set, |lastIndex| is set to 0
* before the match is attempted; thus the match is unaffected.
*
* B. If the global flag IS set and re.lastIndex is >= 0 and <= str.length,
* |lastIndex| is incremented every time there is a match; not from
* i to i+1, but from i to "endIndex" e:
*
* e = (index of last input character matched so far by the pattern) + 1
*
* The match is then attempted from this position in the string (Step 7).
*
* C. When the global flag IS set and re.lastIndex is < 0 or > str.length,
* |lastIndex| is set to 0 and the match returns null.
*
*
* Note the |lastIndex| property is writeable, and may be set arbitrarily
* by the programmer - and we will do that below.
*
*/
//-----------------------------------------------------------------------------
var i = 0;
var bug = 76717;
var summary = 'Testing re.exec(str) when re.lastIndex is < 0 or > str.length';
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();
/******************************************************************************
*
* Case 1 : when the global flag is set -
*
*****************************************************************************/
pattern = /abc/gi;
string = 'AbcaBcabC';
status = inSection(1);
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc');
addThis();
status = inSection(2);
actualmatch = pattern.exec(string);
expectedmatch = Array('aBc');
addThis();
status = inSection(3);
actualmatch = pattern.exec(string);
expectedmatch = Array('abC');
addThis();
/*
* At this point |lastIndex| is > string.length, so the match should be null -
*/
status = inSection(4);
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
/*
* Now let's set |lastIndex| to -1, so the match should again be null -
*/
status = inSection(5);
pattern.lastIndex = -1;
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
/*
* Now try some edge-case values. Thanks to the work done in
* http://bugzilla.mozilla.org/show_bug.cgi?id=124339, |lastIndex|
* is now stored as a double instead of a uint32 (unsigned integer).
*
* Note 2^32 -1 is the upper bound for uint32's, but doubles can go
* all the way up to Number.MAX_VALUE. So that's why we need cases
* between those two numbers.
*/
status = inSection(6);
pattern.lastIndex = Math.pow(2,32);
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
status = inSection(7);
pattern.lastIndex = -Math.pow(2,32);
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
status = inSection(8);
pattern.lastIndex = Math.pow(2,32) + 1;
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
status = inSection(9);
pattern.lastIndex = -(Math.pow(2,32) + 1);
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
status = inSection(10);
pattern.lastIndex = Math.pow(2,32) * 2;
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
status = inSection(11);
pattern.lastIndex = -Math.pow(2,32) * 2;
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
status = inSection(12);
pattern.lastIndex = Math.pow(2,40);
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
status = inSection(13);
pattern.lastIndex = -Math.pow(2,40);
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
status = inSection(14);
pattern.lastIndex = Number.MAX_VALUE;
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
status = inSection(15);
pattern.lastIndex = -Number.MAX_VALUE;
actualmatch = pattern.exec(string);
expectedmatch = null;
addThis();
/******************************************************************************
*
* Case 2: repeat all the above cases WITHOUT the global flag set.
* According to EMCA. |lastIndex| should get set to 0 before the match.
*
* Therefore re.exec(str) should be unaffected; thus our expected values
* below are now DIFFERENT when |lastIndex| is < 0 or > str.length
*
*****************************************************************************/
pattern = /abc/i;
string = 'AbcaBcabC';
status = inSection(16);
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc');
addThis();
status = inSection(17);
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc'); // NOT Array('aBc') as before -
addThis();
status = inSection(18);
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc'); // NOT Array('abC') as before -
addThis();
/*
* At this point above, |lastIndex| WAS > string.length, but not here -
*/
status = inSection(19);
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -
addThis();
/*
* Now let's set |lastIndex| to -1
*/
status = inSection(20);
pattern.lastIndex = -1;
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -
addThis();
/*
* Now try some edge-case values. Thanks to the work done in
* http://bugzilla.mozilla.org/show_bug.cgi?id=124339, |lastIndex|
* is now stored as a double instead of a uint32 (unsigned integer).
*
* Note 2^32 -1 is the upper bound for uint32's, but doubles can go
* all the way up to Number.MAX_VALUE. So that's why we need cases
* between those two numbers.
*/
status = inSection(21);
pattern.lastIndex = Math.pow(2,32);
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -
addThis();
status = inSection(22);
pattern.lastIndex = -Math.pow(2,32);
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -
addThis();
status = inSection(23);
pattern.lastIndex = Math.pow(2,32) + 1;
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -
addThis();
status = inSection(24);
pattern.lastIndex = -(Math.pow(2,32) + 1);
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -
addThis();
status = inSection(25);
pattern.lastIndex = Math.pow(2,32) * 2;
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -
addThis();
status = inSection(26);
pattern.lastIndex = -Math.pow(2,32) * 2;
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -
addThis();
status = inSection(27);
pattern.lastIndex = Math.pow(2,40);
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -;
addThis();
status = inSection(28);
pattern.lastIndex = -Math.pow(2,40);
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -
addThis();
status = inSection(29);
pattern.lastIndex = Number.MAX_VALUE;
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -
addThis();
status = inSection(30);
pattern.lastIndex = -Number.MAX_VALUE;
actualmatch = pattern.exec(string);
expectedmatch = Array('Abc') // NOT null as before -
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');
}
|