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: octal.js 24 Description: 'Tests regular expressions containing \<number> ' 25 26 Author: Nick Lerissa 27 Date: March 10, 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 = 'RegExp: \# (octal) '; 34 35 writeHeaderToLog('Executing script: octal.js'); 36 writeHeaderToLog( SECTION + " "+ TITLE); 37 38 var count = 0; 39 var testcases = new Array(); 40 41 42 var testPattern = '\\101\\102\\103\\104\\105\\106\\107\\110\\111\\112\\113\\114\\115\\116\\117\\120\\121\\122\\123\\124\\125\\126\\127\\130\\131\\132'; 43 44 var testString = "12345ABCDEFGHIJKLMNOPQRSTUVWXYZ67890"; 45 46 testcases[count++] = new TestCase ( SECTION, 47 "'" + testString + "'.match(new RegExp('" + testPattern + "'))", 48 String(["ABCDEFGHIJKLMNOPQRSTUVWXYZ"]), String(testString.match(new RegExp(testPattern)))); 49 50 testPattern = '\\141\\142\\143\\144\\145\\146\\147\\150\\151\\152\\153\\154\\155\\156\\157\\160\\161\\162\\163\\164\\165\\166\\167\\170\\171\\172'; 51 52 testString = "12345AabcdefghijklmnopqrstuvwxyzZ67890"; 53 54 testcases[count++] = new TestCase ( SECTION, 55 "'" + testString + "'.match(new RegExp('" + testPattern + "'))", 56 String(["abcdefghijklmnopqrstuvwxyz"]), String(testString.match(new RegExp(testPattern)))); 57 58 testPattern = '\\40\\41\\42\\43\\44\\45\\46\\47\\50\\51\\52\\53\\54\\55\\56\\57\\60\\61\\62\\63'; 59 60 testString = "abc !\"#$%&'()*+,-./0123ZBC"; 61 62 testcases[count++] = new TestCase ( SECTION, 63 "'" + testString + "'.match(new RegExp('" + testPattern + "'))", 64 String([" !\"#$%&'()*+,-./0123"]), String(testString.match(new RegExp(testPattern)))); 65 66 testPattern = '\\64\\65\\66\\67\\70\\71\\72\\73\\74\\75\\76\\77\\100'; 67 68 testString = "123456789:;<=>?@ABC"; 69 70 testcases[count++] = new TestCase ( SECTION, 71 "'" + testString + "'.match(new RegExp('" + testPattern + "'))", 72 String(["456789:;<=>?@"]), String(testString.match(new RegExp(testPattern)))); 73 74 testPattern = '\\173\\174\\175\\176'; 75 76 testString = "1234{|}~ABC"; 77 78 testcases[count++] = new TestCase ( SECTION, 79 "'" + testString + "'.match(new RegExp('" + testPattern + "'))", 80 String(["{|}~"]), String(testString.match(new RegExp(testPattern)))); 81 82 testcases[count++] = new TestCase ( SECTION, 83 "'canthisbeFOUND'.match(new RegExp('[A-\\132]+'))", 84 String(["FOUND"]), String('canthisbeFOUND'.match(new RegExp('[A-\\132]+')))); 85 86 testcases[count++] = new TestCase ( SECTION, 87 "'canthisbeFOUND'.match(new RegExp('[\\141-\\172]+'))", 88 String(["canthisbe"]), String('canthisbeFOUND'.match(new RegExp('[\\141-\\172]+')))); 89 90 testcases[count++] = new TestCase ( SECTION, 91 "'canthisbeFOUND'.match(/[\\141-\\172]+/)", 92 String(["canthisbe"]), String('canthisbeFOUND'.match(/[\141-\172]+/))); 93 94 function test() 95 { 96 for ( tc=0; tc < testcases.length; tc++ ) { 97 testcases[tc].passed = writeTestCaseResult( 98 testcases[tc].expect, 99 testcases[tc].actual, 100 testcases[tc].description +" = "+ 101 testcases[tc].actual ); 102 testcases[tc].reason += ( testcases[tc].passed ) ? "" : "wrong value "; 103 } 104 stopTest(); 105 return ( testcases ); 106 } 107 108 test(); 109
