tests/mozilla/js1_2/regexp/string_search.js

   1 /* The contents of this file are subject to the Netscape Public
   2  * License Version 1.1 (the "License"); you may not use this file
   3  * except in compliance with the License. You may obtain a copy of
   4  * the License at http://www.mozilla.org/NPL/
   5  *
   6  * Software distributed under the License is distributed on an "AS
   7  * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
   8  * implied. See the License for the specific language governing
   9  * rights and limitations under the License.
  10  *
  11  * The Original Code is Mozilla Communicator client code, released March
  12  * 31, 1998.
  13  *
  14  * The Initial Developer of the Original Code is Netscape Communications
  15  * Corporation. Portions created by Netscape are
  16  * Copyright (C) 1998 Netscape Communications Corporation. All
  17  * Rights Reserved.
  18  *
  19  * Contributor(s):
  20  *
  21  */
  22 /**
  23         Filename:     string_search.js
  24         Description:  'Tests the search method on Strings using regular expressions'
  25
  26         Author:       Nick Lerissa
  27         Date:         March 12, 1998
  28 */
  29
  30         var SECTION = 'As described in Netscape doc "Whats new in JavaScript 1.2"';
  31         var VERSION = 'no version';
  32     startTest();
  33         var TITLE   = 'String: search';
  34
  35         writeHeaderToLog('Executing script: string_search.js');
  36         writeHeaderToLog( SECTION + " "+ TITLE);
  37
  38         var count = 0;
  39         var testcases = new Array();
  40
  41     // 'abcdefg'.search(/d/)
  42         testcases[count++] = new TestCase ( SECTION, "'abcdefg'.search(/d/)",
  43                                             3, 'abcdefg'.search(/d/));
  44
  45     // 'abcdefg'.search(/x/)
  46         testcases[count++] = new TestCase ( SECTION, "'abcdefg'.search(/x/)",
  47                                             -1, 'abcdefg'.search(/x/));
  48
  49     // 'abcdefg123456hijklmn'.search(/\d+/)
  50         testcases[count++] = new TestCase ( SECTION, "'abcdefg123456hijklmn'.search(/\d+/)",
  51                                             7, 'abcdefg123456hijklmn'.search(/\d+/));
  52
  53     // 'abcdefg123456hijklmn'.search(new RegExp())
  54         testcases[count++] = new TestCase ( SECTION, "'abcdefg123456hijklmn'.search(new RegExp())",
  55                                             0, 'abcdefg123456hijklmn'.search(new RegExp()));
  56
  57     // 'abc'.search(new RegExp('$'))
  58         testcases[count++] = new TestCase ( SECTION, "'abc'.search(new RegExp('$'))",
  59                                             3, 'abc'.search(new RegExp('$')));
  60
  61     // 'abc'.search(new RegExp('^'))
  62         testcases[count++] = new TestCase ( SECTION, "'abc'.search(new RegExp('^'))",
  63                                             0, 'abc'.search(new RegExp('^')));
  64
  65     // 'abc1'.search(/.\d/)
  66         testcases[count++] = new TestCase ( SECTION, "'abc1'.search(/.\d/)",
  67                                             2, 'abc1'.search(/.\d/));
  68
  69     // 'abc1'.search(/\d{2}/)
  70         testcases[count++] = new TestCase ( SECTION, "'abc1'.search(/\d{2}/)",
  71                                             -1, 'abc1'.search(/\d{2}/));
  72
  73 function test()
  74         {
  75            for ( tc=0; tc < testcases.length; tc++ ) {
  76                 testcases[tc].passed = writeTestCaseResult(
  77                 testcases[tc].expect,
  78                 testcases[tc].actual,
  79                 testcases[tc].description +" = "+
  80                 testcases[tc].actual );
  81                 testcases[tc].reason += ( testcases[tc].passed ) ? "" : "wrong value ";
  82            }
  83            stopTest();
  84            return ( testcases );
  85         }
  86
  87         test();