1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2 /* ***** BEGIN LICENSE BLOCK *****
3 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
5 * The contents of this file are subject to the Mozilla Public License Version
6 * 1.1 (the "License"); you may not use this file except in compliance with
7 * the License. You may obtain a copy of the License at
8 * http://www.mozilla.org/MPL/
10 * Software distributed under the License is distributed on an "AS IS" basis,
11 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12 * for the specific language governing rights and limitations under the
15 * The Original Code is Mozilla Communicator client code, released
18 * The Initial Developer of the Original Code is
19 * Netscape Communications Corporation.
20 * Portions created by the Initial Developer are Copyright (C) 1998
21 * the Initial Developer. All Rights Reserved.
25 * Alternatively, the contents of this file may be used under the terms of
26 * either the GNU General Public License Version 2 or later (the "GPL"), or
27 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
28 * in which case the provisions of the GPL or the LGPL are applicable instead
29 * of those above. If you wish to allow use of your version of this file only
30 * under the terms of either the GPL or the LGPL, and not to allow others to
31 * use your version of this file under the terms of the MPL, indicate your
32 * decision by deleting the provisions above and replace them with the notice
33 * and other provisions required by the GPL or the LGPL. If you do not delete
34 * the provisions above, a recipient may use your version of this file under
35 * the terms of any one of the MPL, the GPL or the LGPL.
37 * ***** END LICENSE BLOCK ***** */
41 File Name: 15.5.4.7-3.js
42 ECMA Section: 15.5.4.7 String.prototype.lastIndexOf( searchString, pos)
45 If the given searchString appears as a substring of the result of
46 converting this object to a string, at one or more positions that are
47 at or to the left of the specified position, then the index of the
48 rightmost such position is returned; otherwise -1 is returned. If position
49 is undefined or not supplied, the length of this string value is assumed,
50 so as to search all of the string.
52 When the lastIndexOf method is called with two arguments searchString and
53 position, the following steps are taken:
55 1.Call ToString, giving it the this value as its argument.
56 2.Call ToString(searchString).
57 3.Call ToNumber(position). (If position is undefined or not supplied, this step produces the value NaN).
58 4.If Result(3) is NaN, use +; otherwise, call ToInteger(Result(3)).
59 5.Compute the number of characters in Result(1).
60 6.Compute min(max(Result(4), 0), Result(5)).
61 7.Compute the number of characters in the string that is Result(2).
62 8.Compute the largest possible integer k not larger than Result(6) such that k+Result(7) is not greater
63 than Result(5), and for all nonnegative integers j less than Result(7), the character at position k+j of
64 Result(1) is the same as the character at position j of Result(2); but if there is no such integer k, then
69 Note that the lastIndexOf function is intentionally generic; it does not require that its this value be a
70 String object. Therefore it can be transferred to other kinds of objects for use as a method.
72 Author: christine@netscape.com
75 var SECTION = "15.5.4.7-3";
76 var VERSION = "ECMA_2";
78 var TITLE = "String.protoype.lastIndexOf";
80 writeHeaderToLog( SECTION + " "+ TITLE);
82 new TestCase( SECTION,
83 "var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 0 )",
85 eval("var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 0 )") );
87 new TestCase( SECTION,
88 "var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 1 )",
90 eval("var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 1 )") );
92 new TestCase( SECTION,
93 "var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 2 )",
95 eval("var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 2 )") );
97 new TestCase( SECTION,
98 "var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 10 )",
100 eval("var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r', 10 )") );
102 new TestCase( SECTION,
103 "var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r' )",
105 eval("var b = true; b.__proto__.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('r' )") );
109 function LastIndexOf( string, search, position ) {
110 string = String( string );
111 search = String( search );
113 position = Number( position )
115 if ( isNaN( position ) ) {
118 position = ToInteger( position );
121 result5= string.length;
122 result6 = Math.min(Math.max(position, 0), result5);
123 result7 = search.length;
126 return Math.min(position, result5);
131 for ( k = 0; k <= result6; k++ ) {
132 if ( k+ result7 > result5 ) {
135 for ( j = 0; j < result7; j++ ) {
136 if ( string.charAt(k+j) != search.charAt(j) ){
139 if ( j == result7 -1 ) {
148 function ToInteger( n ) {
153 if ( Math.abs(n) == 0 || Math.abs(n) == Infinity ) {
157 var sign = ( n < 0 ) ? -1 : 1;
159 return ( sign * Math.floor(Math.abs(n)) );