JSTests/mozilla/js1_2/regexp/string_search.js

/* 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 Mozilla Communicator client code, released March
 * 31, 1998.
 *
 * 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): 
 * 
 */
/**
	Filename:     string_search.js
	Description:  'Tests the search method on Strings using regular expressions'

	Author:       Nick Lerissa
	Date:         March 12, 1998
*/

	var SECTION = 'As described in Netscape doc "Whats new in JavaScript 1.2"';
	var VERSION = 'no version';
    startTest();
	var TITLE   = 'String: search';

	writeHeaderToLog('Executing script: string_search.js');
	writeHeaderToLog( SECTION + " "+ TITLE);

	var count = 0;
	var testcases = new Array();

    // 'abcdefg'.search(/d/)
	testcases[count++] = new TestCase ( SECTION, "'abcdefg'.search(/d/)",
	                                    3, 'abcdefg'.search(/d/));

    // 'abcdefg'.search(/x/)
	testcases[count++] = new TestCase ( SECTION, "'abcdefg'.search(/x/)",
	                                    -1, 'abcdefg'.search(/x/));

    // 'abcdefg123456hijklmn'.search(/\d+/)
	testcases[count++] = new TestCase ( SECTION, "'abcdefg123456hijklmn'.search(/\d+/)",
	                                    7, 'abcdefg123456hijklmn'.search(/\d+/));

    // 'abcdefg123456hijklmn'.search(new RegExp())
	testcases[count++] = new TestCase ( SECTION, "'abcdefg123456hijklmn'.search(new RegExp())",
	                                    0, 'abcdefg123456hijklmn'.search(new RegExp()));

    // 'abc'.search(new RegExp('$'))
	testcases[count++] = new TestCase ( SECTION, "'abc'.search(new RegExp('$'))",
	                                    3, 'abc'.search(new RegExp('$')));

    // 'abc'.search(new RegExp('^'))
	testcases[count++] = new TestCase ( SECTION, "'abc'.search(new RegExp('^'))",
	                                    0, 'abc'.search(new RegExp('^')));

    // 'abc1'.search(/.\d/)
	testcases[count++] = new TestCase ( SECTION, "'abc1'.search(/.\d/)",
	                                    2, 'abc1'.search(/.\d/));

    // 'abc1'.search(/\d{2}/)
	testcases[count++] = new TestCase ( SECTION, "'abc1'.search(/\d{2}/)",
	                                    -1, 'abc1'.search(/\d{2}/));

function test()
	{
	   for ( tc=0; tc < testcases.length; tc++ ) {
	        testcases[tc].passed = writeTestCaseResult(
	        testcases[tc].expect,
	        testcases[tc].actual,
	        testcases[tc].description +" = "+
	        testcases[tc].actual );
	        testcases[tc].reason += ( testcases[tc].passed ) ? "" : "wrong value ";
	   }
	   stopTest();
	   return ( testcases );
	}

	test();