The Tor Browser / file comparison

comparison: js/src/tests/ecma/String/15.5.4.7-2.js

js/src/tests/ecma/String/15.5.4.7-2.js

changeset 0
6474c204b198
equal deleted inserted replaced
-1:000000000000 0:cf579a9e6ddd
1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2 /* This Source Code Form is subject to the terms of the Mozilla Public
3 * License, v. 2.0. If a copy of the MPL was not distributed with this
4 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
5
6
7 /**
8 File Name: 15.5.4.7-2.js
9 ECMA Section: 15.5.4.7 String.prototype.lastIndexOf( searchString, pos)
10 Description:
11
12 If the given searchString appears as a substring of the result of
13 converting this object to a string, at one or more positions that are
14 at or to the left of the specified position, then the index of the
15 rightmost such position is returned; otherwise -1 is returned. If position
16 is undefined or not supplied, the length of this string value is assumed,
17 so as to search all of the string.
18
19 When the lastIndexOf method is called with two arguments searchString and
20 position, the following steps are taken:
21
22 1.Call ToString, giving it the this value as its argument.
23 2.Call ToString(searchString).
24 3.Call ToNumber(position). (If position is undefined or not supplied, this step produces the value NaN).
25 4.If Result(3) is NaN, use +; otherwise, call ToInteger(Result(3)).
26 5.Compute the number of characters in Result(1).
27 6.Compute min(max(Result(4), 0), Result(5)).
28 7.Compute the number of characters in the string that is Result(2).
29 8.Compute the largest possible integer k not larger than Result(6) such that k+Result(7) is not greater
30 than Result(5), and for all nonnegative integers j less than Result(7), the character at position k+j of
31 Result(1) is the same as the character at position j of Result(2); but if there is no such integer k, then
32 compute the value -1.
33
34 1.Return Result(8).
35
36 Note that the lastIndexOf function is intentionally generic; it does not require that its this value be a
37 String object. Therefore it can be transferred to other kinds of objects for use as a method.
38
39 Author: christine@netscape.com, pschwartau@netscape.com
40 Date: 02 October 1997
41 Modified: 14 July 2002
42 Reason: See http://bugzilla.mozilla.org/show_bug.cgi?id=155289
43 ECMA-262 Ed.3 Section 15.5.4.8
44 The length property of the lastIndexOf method is 1
45 *
46 */
47 var SECTION = "15.5.4.7-2";
48 var VERSION = "ECMA_1";
49 startTest();
50 var TITLE = "String.protoype.lastIndexOf";
51
52 writeHeaderToLog( SECTION + " "+ TITLE);
53
54
55 new TestCase( SECTION, "String.prototype.lastIndexOf.length", 1, String.prototype.lastIndexOf.length );
56 new TestCase( SECTION, "delete String.prototype.lastIndexOf.length", false, delete String.prototype.lastIndexOf.length );
57 new TestCase( SECTION, "delete String.prototype.lastIndexOf.length; String.prototype.lastIndexOf.length", 1, eval("delete String.prototype.lastIndexOf.length; String.prototype.lastIndexOf.length" ) );
58
59 new TestCase( SECTION, "var s = new String(''); s.lastIndexOf('', 0)", LastIndexOf("","",0), eval("var s = new String(''); s.lastIndexOf('', 0)") );
60 new TestCase( SECTION, "var s = new String(''); s.lastIndexOf('')", LastIndexOf("",""), eval("var s = new String(''); s.lastIndexOf('')") );
61 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('', 0)", LastIndexOf("hello","",0), eval("var s = new String('hello'); s.lastIndexOf('',0)") );
62 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('')", LastIndexOf("hello",""), eval("var s = new String('hello'); s.lastIndexOf('')") );
63
64 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll')", LastIndexOf("hello","ll"), eval("var s = new String('hello'); s.lastIndexOf('ll')") );
65 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 0)", LastIndexOf("hello","ll",0), eval("var s = new String('hello'); s.lastIndexOf('ll', 0)") );
66 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 1)", LastIndexOf("hello","ll",1), eval("var s = new String('hello'); s.lastIndexOf('ll', 1)") );
67 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 2)", LastIndexOf("hello","ll",2), eval("var s = new String('hello'); s.lastIndexOf('ll', 2)") );
68 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 3)", LastIndexOf("hello","ll",3), eval("var s = new String('hello'); s.lastIndexOf('ll', 3)") );
69 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 4)", LastIndexOf("hello","ll",4), eval("var s = new String('hello'); s.lastIndexOf('ll', 4)") );
70 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 5)", LastIndexOf("hello","ll",5), eval("var s = new String('hello'); s.lastIndexOf('ll', 5)") );
71 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 6)", LastIndexOf("hello","ll",6), eval("var s = new String('hello'); s.lastIndexOf('ll', 6)") );
72
73 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 1.5)", LastIndexOf('hello','ll', 1.5), eval("var s = new String('hello'); s.lastIndexOf('ll', 1.5)") );
74 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', 2.5)", LastIndexOf('hello','ll', 2.5), eval("var s = new String('hello'); s.lastIndexOf('ll', 2.5)") );
75 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', -1)", LastIndexOf('hello','ll', -1), eval("var s = new String('hello'); s.lastIndexOf('ll', -1)") );
76 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', -1.5)",LastIndexOf('hello','ll', -1.5), eval("var s = new String('hello'); s.lastIndexOf('ll', -1.5)") );
77
78 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', -Infinity)", LastIndexOf("hello","ll",-Infinity), eval("var s = new String('hello'); s.lastIndexOf('ll', -Infinity)") );
79 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', Infinity)", LastIndexOf("hello","ll",Infinity), eval("var s = new String('hello'); s.lastIndexOf('ll', Infinity)") );
80 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', NaN)", LastIndexOf("hello","ll",NaN), eval("var s = new String('hello'); s.lastIndexOf('ll', NaN)") );
81 new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll', -0)", LastIndexOf("hello","ll",-0), eval("var s = new String('hello'); s.lastIndexOf('ll', -0)") );
82 for ( var i = 0; i < ( "[object Object]" ).length; i++ ) {
83 new TestCase( SECTION,
84 "var o = new Object(); o.lastIndexOf = String.prototype.lastIndexOf; o.lastIndexOf('b', "+ i + ")",
85 ( i < 2 ? -1 : ( i < 9 ? 2 : 9 )) ,
86 eval("var o = new Object(); o.lastIndexOf = String.prototype.lastIndexOf; o.lastIndexOf('b', "+ i + ")") );
87 }
88 for ( var i = 0; i < 5; i ++ ) {
89 new TestCase( SECTION,
90 "var b = new Boolean(); b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('l', "+ i + ")",
91 ( i < 2 ? -1 : 2 ),
92 eval("var b = new Boolean(); b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('l', "+ i + ")") );
93 }
94 for ( var i = 0; i < 5; i ++ ) {
95 new TestCase( SECTION,
96 "var b = new Boolean(); b.toString = Object.prototype.toString; b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('o', "+ i + ")",
97 ( i < 1 ? -1 : ( i < 9 ? 1 : ( i < 10 ? 9 : 10 ) ) ),
98 eval("var b = new Boolean(); b.toString = Object.prototype.toString; b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('o', "+ i + ")") );
99 }
100 for ( var i = 0; i < 9; i++ ) {
101 new TestCase( SECTION,
102 "var n = new Number(Infinity); n.lastIndexOf = String.prototype.lastIndexOf; n.lastIndexOf( 'i', " + i + " )",
103 ( i < 3 ? -1 : ( i < 5 ? 3 : 5 ) ),
104 eval("var n = new Number(Infinity); n.lastIndexOf = String.prototype.lastIndexOf; n.lastIndexOf( 'i', " + i + " )") );
105 }
106 var a = new Array( "abc","def","ghi","jkl","mno","pqr","stu","vwx","yz" );
107
108 for ( var i = 0; i < (a.toString()).length; i++ ) {
109 new TestCase( SECTION,
110 "var a = new Array( 'abc','def','ghi','jkl','mno','pqr','stu','vwx','yz' ); a.lastIndexOf = String.prototype.lastIndexOf; a.lastIndexOf( ',mno,p', "+i+" )",
111 ( i < 15 ? -1 : 15 ),
112 eval("var a = new Array( 'abc','def','ghi','jkl','mno','pqr','stu','vwx','yz' ); a.lastIndexOf = String.prototype.lastIndexOf; a.lastIndexOf( ',mno,p', "+i+" )") );
113 }
114
115 for ( var i = 0; i < 15; i ++ ) {
116 new TestCase( SECTION,
117 "var m = Math; m.lastIndexOf = String.prototype.lastIndexOf; m.lastIndexOf('t', "+ i + ")",
118 ( i < 6 ? -1 : ( i < 10 ? 6 : 10 ) ),
119 eval("var m = Math; m.lastIndexOf = String.prototype.lastIndexOf; m.lastIndexOf('t', "+ i + ")") );
120 }
121 /*
122 for ( var i = 0; i < 15; i++ ) {
123 new TestCase( SECTION,
124 "var d = new Date(); d.lastIndexOf = String.prototype.lastIndexOf; d.lastIndexOf( '0' )",
125 )
126 }
127
128 */
129
130 test();
131
132 function LastIndexOf( string, search, position ) {
133 string = String( string );
134 search = String( search );
135
136 position = Number( position )
137
138 if ( isNaN( position ) ) {
139 position = Infinity;
140 } else {
141 position = ToInteger( position );
142 }
143
144 result5= string.length;
145 result6 = Math.min(Math.max(position, 0), result5);
146 result7 = search.length;
147
148 if (result7 == 0) {
149 return Math.min(position, result5);
150 }
151
152 result8 = -1;
153
154 for ( k = 0; k <= result6; k++ ) {
155 if ( k+ result7 > result5 ) {
156 break;
157 }
158 for ( j = 0; j < result7; j++ ) {
159 if ( string.charAt(k+j) != search.charAt(j) ){
160 break;
161 } else {
162 if ( j == result7 -1 ) {
163 result8 = k;
164 }
165 }
166 }
167 }
168
169 return result8;
170 }
171 function ToInteger( n ) {
172 n = Number( n );
173 if ( isNaN(n) ) {
174 return 0;
175 }
176 if ( Math.abs(n) == 0 || Math.abs(n) == Infinity ) {
177 return n;
178 }
179
180 var sign = ( n < 0 ) ? -1 : 1;
181
182 return ( sign * Math.floor(Math.abs(n)) );
183 }

Mercurial Repository: The Tor Browser

Europalab SCM Repository Server

mercurial