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
|
/* -*- tab-width: 2; indent-tabs-mode: nil; js-indent-level: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
/**
* File Name: RegExp/properties-002.js
* ECMA Section: 15.7.6.js
* Description: Based on ECMA 2 Draft 7 February 1999
*
* Author: christine@netscape.com
* Date: 19 February 1999
*/
//-----------------------------------------------------------------------------
var SECTION = "RegExp/properties-002.js";
var TITLE = "Properties of RegExp Instances";
var BUGNUMBER ="124339";
printBugNumber(BUGNUMBER);
re_1 = /\cA?/g;
re_1.lastIndex = Math.pow(2,31);
AddRegExpCases( re_1, "\\cA?", true, false, false, Math.pow(2,31) );
re_2 = /\w*/i;
re_2.lastIndex = Math.pow(2,32) -1;
AddRegExpCases( re_2, "\\w*", false, true, false, Math.pow(2,32)-1 );
re_3 = /\*{0,80}/m;
re_3.lastIndex = Math.pow(2,31) -1;
AddRegExpCases( re_3, "\\*{0,80}", false, false, true, Math.pow(2,31) -1 );
re_4 = /^./gim;
re_4.lastIndex = Math.pow(2,30) -1;
AddRegExpCases( re_4, "^.", true, true, true, Math.pow(2,30) -1 );
re_5 = /\B/;
re_5.lastIndex = Math.pow(2,30);
AddRegExpCases( re_5, "\\B", false, false, false, Math.pow(2,30) );
/*
* Brendan: "need to test cases Math.pow(2,32) and greater to see
* whether they round-trip." Reason: 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_t (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.
*
*/
re_6 = /\B/;
re_6.lastIndex = Math.pow(2,32);
AddRegExpCases( re_6, "\\B", false, false, false, Math.pow(2,32) );
re_7 = /\B/;
re_7.lastIndex = Math.pow(2,32) + 1;
AddRegExpCases( re_7, "\\B", false, false, false, Math.pow(2,32) + 1 );
re_8 = /\B/;
re_8.lastIndex = Math.pow(2,32) * 2;
AddRegExpCases( re_8, "\\B", false, false, false, Math.pow(2,32) * 2 );
re_9 = /\B/;
re_9.lastIndex = Math.pow(2,40);
AddRegExpCases( re_9, "\\B", false, false, false, Math.pow(2,40) );
re_10 = /\B/;
re_10.lastIndex = Number.MAX_VALUE;
AddRegExpCases( re_10, "\\B", false, false, false, Number.MAX_VALUE );
//-----------------------------------------------------------------------------
test();
//-----------------------------------------------------------------------------
function AddRegExpCases( re, s, g, i, m, l ){
AddTestCase( re + ".test == RegExp.prototype.test",
true,
re.test == RegExp.prototype.test );
AddTestCase( re + ".toString == RegExp.prototype.toString",
true,
re.toString == RegExp.prototype.toString );
AddTestCase( re + ".contructor == RegExp.prototype.constructor",
true,
re.constructor == RegExp.prototype.constructor );
AddTestCase( re + ".compile == RegExp.prototype.compile",
true,
re.compile == RegExp.prototype.compile );
AddTestCase( re + ".exec == RegExp.prototype.exec",
true,
re.exec == RegExp.prototype.exec );
// properties
AddTestCase( re + ".source",
s,
re.source );
AddTestCase( re + ".toString()",
"/" + s +"/" + (g?"g":"") + (i?"i":"") +(m?"m":""),
re.toString() );
AddTestCase( re + ".global",
g,
re.global );
AddTestCase( re + ".ignoreCase",
i,
re.ignoreCase );
AddTestCase( re + ".multiline",
m,
re.multiline);
AddTestCase( re + ".lastIndex",
l,
re.lastIndex );
}
|
