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/exec-002.js
michael@0:  *  ECMA Section:       15.7.5.3
michael@0:  *  Description:        Based on ECMA 2 Draft 7 February 1999
michael@0:  *
michael@0:  *  Test cases provided by rogerl@netscape.com
michael@0:  *
michael@0:  *  Author:             christine@netscape.com
michael@0:  *  Date:               19 February 1999
michael@0:  */
michael@0: var SECTION = "RegExp/exec-002";
michael@0: var VERSION = "ECMA_2";
michael@0: var TITLE   = "RegExp.prototype.exec(string)";
michael@0: 
michael@0: startTest();
michael@0: 
michael@0: /*
michael@0:  * for each test case, verify:
michael@0:  * - type of object returned
michael@0:  * - length of the returned array
michael@0:  * - value of lastIndex
michael@0:  * - value of index
michael@0:  * - value of input
michael@0:  * - value of the array indices
michael@0:  */
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /(a|d|q|)x/i,
michael@0:   "bcaDxqy",
michael@0:   3,
michael@0:   ["Dx", "D"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /(a|(e|q))(x|y)/,
michael@0:   "bcaddxqy",
michael@0:   6,
michael@0:   ["qy","q","q","y"] );
michael@0: 
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /a+b+d/,
michael@0:   "aabbeeaabbs",
michael@0:   0,
michael@0:   null );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /a*b/,
michael@0:   "aaadaabaaa",
michael@0:   4,
michael@0:   ["aab"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /a*b/,
michael@0:   "dddb",
michael@0:   3,
michael@0:   ["b"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /a*b/,
michael@0:   "xxx",
michael@0:   0,
michael@0:   null );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /x\d\dy/,
michael@0:   "abcx45ysss235",
michael@0:   3,
michael@0:   ["x45y"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /[^abc]def[abc]+/,
michael@0:   "abxdefbb",
michael@0:   2,
michael@0:   ["xdefbb"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /(a*)baa/,
michael@0:   "ccdaaabaxaabaa",
michael@0:   9,
michael@0:   ["aabaa", "aa"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /(a*)baa/,
michael@0:   "aabaa",
michael@0:   0,
michael@0:   ["aabaa", "aa"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /q(a|b)*q/,
michael@0:   "xxqababqyy",
michael@0:   2,
michael@0:   ["qababq", "b"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /(a(.|[^d])c)*/,
michael@0:   "adcaxc",
michael@0:   0,
michael@0:   ["adcaxc", "axc", "x"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /(a*)b\1/,
michael@0:   "abaaaxaabaayy",
michael@0:   0,
michael@0:   ["aba", "a"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /(a*)b\1/,
michael@0:   "abaaaxaabaayy",
michael@0:   0,
michael@0:   ["aba", "a"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /(a*)b\1/,
michael@0:   "cccdaaabaxaabaayy",
michael@0:   6,
michael@0:   ["aba", "a"] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /(a*)b\1/,
michael@0:   "cccdaaabqxaabaayy",
michael@0:   7,
michael@0:   ["b", ""] );
michael@0: 
michael@0: AddRegExpCases(
michael@0:   /"(.|[^"\\\\])*"/,
michael@0:         'xx\"makudonarudo\"yy',
michael@0:         2,
michael@0:         ["\"makudonarudo\"", "o"] );
michael@0: 
michael@0:     AddRegExpCases(
michael@0:         /"(.|[^"\\\\])*"/,
michael@0: 	      "xx\"ma\"yy",
michael@0: 	      2,
michael@0: 	      ["\"ma\"", "a"] );
michael@0: 
michael@0: 	   test();
michael@0: 
michael@0: 	   function AddRegExpCases(
michael@0: 	     regexp, pattern, 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: 		 regexp + ".exec(" + pattern +")",
michael@0: 		 matches_array,
michael@0: 		 regexp.exec(pattern) );
michael@0: 
michael@0: 	       return;
michael@0: 	     }
michael@0: 	     AddTestCase(
michael@0: 	       regexp + ".exec(" + pattern +").length",
michael@0: 	       matches_array.length,
michael@0: 	       regexp.exec(pattern).length );
michael@0: 
michael@0: 	     AddTestCase(
michael@0: 	       regexp + ".exec(" + pattern +").index",
michael@0: 	       index,
michael@0: 	       regexp.exec(pattern).index );
michael@0: 
michael@0: 	     AddTestCase(
michael@0: 	       regexp + ".exec(" + pattern +").input",
michael@0: 	       pattern,
michael@0: 	       regexp.exec(pattern).input );
michael@0: 
michael@0: 	     AddTestCase(
michael@0: 	       regexp + ".exec(" + pattern +").toString()",
michael@0: 	       matches_array.toString(),
michael@0: 	       regexp.exec(pattern).toString() );
michael@0: /*
michael@0:   var limit = matches_array.length > regexp.exec(pattern).length
michael@0:   ? matches_array.length
michael@0:   : regexp.exec(pattern).length;
michael@0: 
michael@0:   for ( var matches = 0; matches < limit; matches++ ) {
michael@0:   AddTestCase(
michael@0:   regexp + ".exec(" + pattern +")[" + matches +"]",
michael@0:   matches_array[matches],
michael@0:   regexp.exec(pattern)[matches] );
michael@0:   }
michael@0: */
michael@0: 	   }