michael@0: /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
michael@0: /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0:  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: 
michael@0: /**
michael@0:    File Name:          15.5.4.7-2.js
michael@0:    ECMA Section:       15.5.4.7 String.prototype.lastIndexOf( searchString, pos)
michael@0:    Description:
michael@0: 
michael@0:    If the given searchString appears as a substring of the result of
michael@0:    converting this object to a string, at one or more positions that are
michael@0:    at or to the left of the specified position, then the index of the
michael@0:    rightmost such position is returned; otherwise -1 is returned. If position
michael@0:    is undefined or not supplied, the length of this string value is assumed,
michael@0:    so as to search all of the string.
michael@0: 
michael@0:    When the lastIndexOf method is called with two arguments searchString and
michael@0:    position, the following steps are taken:
michael@0: 
michael@0:    1.Call ToString, giving it the this value as its argument.
michael@0:    2.Call ToString(searchString).
michael@0:    3.Call ToNumber(position). (If position is undefined or not supplied, this step produces the value NaN).
michael@0:    4.If Result(3) is NaN, use +; otherwise, call ToInteger(Result(3)).
michael@0:    5.Compute the number of characters in Result(1).
michael@0:    6.Compute min(max(Result(4), 0), Result(5)).
michael@0:    7.Compute the number of characters in the string that is Result(2).
michael@0:    8.Compute the largest possible integer k not larger than Result(6) such that k+Result(7) is not greater
michael@0:    than Result(5), and for all nonnegative integers j less than Result(7), the character at position k+j of
michael@0:    Result(1) is the same as the character at position j of Result(2); but if there is no such integer k, then
michael@0:    compute the value -1.
michael@0: 
michael@0:    1.Return Result(8).
michael@0: 
michael@0:    Note that the lastIndexOf function is intentionally generic; it does not require that its this value be a
michael@0:    String object. Therefore it can be transferred to other kinds of objects for use as a method.
michael@0: 
michael@0:    Author:             christine@netscape.com, pschwartau@netscape.com
michael@0:    Date:               02 October 1997
michael@0:    Modified:           14 July 2002
michael@0:    Reason:             See http://bugzilla.mozilla.org/show_bug.cgi?id=155289
michael@0:    ECMA-262 Ed.3  Section 15.5.4.8
michael@0:    The length property of the lastIndexOf method is 1
michael@0:    *
michael@0:    */
michael@0: var SECTION = "15.5.4.7-2";
michael@0: var VERSION = "ECMA_1";
michael@0: startTest();
michael@0: var TITLE   = "String.protoype.lastIndexOf";
michael@0: 
michael@0: writeHeaderToLog( SECTION + " "+ TITLE);
michael@0: 
michael@0: 
michael@0: new TestCase( SECTION, "String.prototype.lastIndexOf.length",           1,          String.prototype.lastIndexOf.length );
michael@0: new TestCase( SECTION, "delete String.prototype.lastIndexOf.length",    false,      delete String.prototype.lastIndexOf.length );
michael@0: new TestCase( SECTION, "delete String.prototype.lastIndexOf.length; String.prototype.lastIndexOf.length",   1,  eval("delete String.prototype.lastIndexOf.length; String.prototype.lastIndexOf.length" ) );
michael@0: 
michael@0: new TestCase( SECTION, "var s = new String(''); s.lastIndexOf('', 0)",          LastIndexOf("","",0),  eval("var s = new String(''); s.lastIndexOf('', 0)") );
michael@0: new TestCase( SECTION, "var s = new String(''); s.lastIndexOf('')",             LastIndexOf("",""),  eval("var s = new String(''); s.lastIndexOf('')") );
michael@0: new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('', 0)",     LastIndexOf("hello","",0),  eval("var s = new String('hello'); s.lastIndexOf('',0)") );
michael@0: new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('')",        LastIndexOf("hello",""),  eval("var s = new String('hello'); s.lastIndexOf('')") );
michael@0: 
michael@0: new TestCase( SECTION, "var s = new String('hello'); s.lastIndexOf('ll')",     LastIndexOf("hello","ll"),  eval("var s = new String('hello'); s.lastIndexOf('ll')") );
michael@0: 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)") );
michael@0: 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)") );
michael@0: 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)") );
michael@0: 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)") );
michael@0: 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)") );
michael@0: 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)") );
michael@0: 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)") );
michael@0: 
michael@0: 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)") );
michael@0: 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)") );
michael@0: 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)") );
michael@0: 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)") );
michael@0: 
michael@0: 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)") );
michael@0: 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)") );
michael@0: 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)") );
michael@0: 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)") );
michael@0: for ( var i = 0; i < ( "[object Object]" ).length; i++ ) {
michael@0:   new TestCase(   SECTION,
michael@0: 		  "var o = new Object(); o.lastIndexOf = String.prototype.lastIndexOf; o.lastIndexOf('b', "+ i + ")",
michael@0: 		  ( i < 2 ? -1 : ( i < 9  ? 2 : 9 )) ,
michael@0: 		  eval("var o = new Object(); o.lastIndexOf = String.prototype.lastIndexOf; o.lastIndexOf('b', "+ i + ")") );
michael@0: }
michael@0: for ( var i = 0; i < 5; i ++ ) {
michael@0:   new TestCase(   SECTION,
michael@0: 		  "var b = new Boolean(); b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('l', "+ i + ")",
michael@0: 		  ( i < 2 ? -1 : 2 ),
michael@0: 		  eval("var b = new Boolean(); b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('l', "+ i + ")") );
michael@0: }
michael@0: for ( var i = 0; i < 5; i ++ ) {
michael@0:   new TestCase(   SECTION,
michael@0: 		  "var b = new Boolean(); b.toString = Object.prototype.toString; b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('o', "+ i + ")",
michael@0: 		  ( i < 1 ? -1 : ( i < 9 ? 1 : ( i < 10 ? 9 : 10 ) ) ),
michael@0: 		  eval("var b = new Boolean();  b.toString = Object.prototype.toString; b.lastIndexOf = String.prototype.lastIndexOf; b.lastIndexOf('o', "+ i + ")") );
michael@0: }
michael@0: for ( var i = 0; i < 9; i++ ) {
michael@0:   new TestCase(   SECTION,
michael@0: 		  "var n = new Number(Infinity); n.lastIndexOf = String.prototype.lastIndexOf; n.lastIndexOf( 'i', " + i + " )",
michael@0: 		  ( i < 3 ? -1 : ( i < 5 ? 3 : 5 ) ),
michael@0: 		  eval("var n = new Number(Infinity); n.lastIndexOf = String.prototype.lastIndexOf; n.lastIndexOf( 'i', " + i + " )") );
michael@0: }
michael@0: var a = new Array( "abc","def","ghi","jkl","mno","pqr","stu","vwx","yz" );
michael@0: 
michael@0: for ( var i = 0; i < (a.toString()).length; i++ ) {
michael@0:   new TestCase( SECTION,
michael@0: 		"var a = new Array( 'abc','def','ghi','jkl','mno','pqr','stu','vwx','yz' ); a.lastIndexOf = String.prototype.lastIndexOf; a.lastIndexOf( ',mno,p', "+i+" )",
michael@0: 		( i < 15 ? -1 : 15 ),
michael@0: 		eval("var a = new Array( 'abc','def','ghi','jkl','mno','pqr','stu','vwx','yz' ); a.lastIndexOf = String.prototype.lastIndexOf; a.lastIndexOf( ',mno,p', "+i+" )") );
michael@0: }
michael@0: 
michael@0: for ( var i = 0; i < 15; i ++ ) {
michael@0:   new TestCase(   SECTION,
michael@0: 		  "var m = Math; m.lastIndexOf = String.prototype.lastIndexOf; m.lastIndexOf('t', "+ i + ")",
michael@0: 		  ( i < 6 ? -1 : ( i < 10 ? 6 : 10 ) ),
michael@0: 		  eval("var m = Math; m.lastIndexOf = String.prototype.lastIndexOf; m.lastIndexOf('t', "+ i + ")") );
michael@0: }
michael@0: /*
michael@0:   for ( var i = 0; i < 15; i++ ) {
michael@0:   new TestCase(   SECTION,
michael@0:   "var d = new Date(); d.lastIndexOf = String.prototype.lastIndexOf; d.lastIndexOf( '0' )",
michael@0:   )
michael@0:   }
michael@0: 
michael@0: */
michael@0: 
michael@0: test();
michael@0: 
michael@0: function LastIndexOf( string, search, position ) {
michael@0:   string = String( string );
michael@0:   search = String( search );
michael@0: 
michael@0:   position = Number( position )
michael@0: 
michael@0:     if ( isNaN( position ) ) {
michael@0:       position = Infinity;
michael@0:     } else {
michael@0:       position = ToInteger( position );
michael@0:     }
michael@0: 
michael@0:   result5= string.length;
michael@0:   result6 = Math.min(Math.max(position, 0), result5);
michael@0:   result7 = search.length;
michael@0: 
michael@0:   if (result7 == 0) {
michael@0:     return Math.min(position, result5);
michael@0:   }
michael@0: 
michael@0:   result8 = -1;
michael@0: 
michael@0:   for ( k = 0; k <= result6; k++ ) {
michael@0:     if ( k+ result7 > result5 ) {
michael@0:       break;
michael@0:     }
michael@0:     for ( j = 0; j < result7; j++ ) {
michael@0:       if ( string.charAt(k+j) != search.charAt(j) ){
michael@0: 	break;
michael@0:       }   else  {
michael@0: 	if ( j == result7 -1 ) {
michael@0: 	  result8 = k;
michael@0: 	}
michael@0:       }
michael@0:     }
michael@0:   }
michael@0: 
michael@0:   return result8;
michael@0: }
michael@0: function ToInteger( n ) {
michael@0:   n = Number( n );
michael@0:   if ( isNaN(n) ) {
michael@0:     return 0;
michael@0:   }
michael@0:   if ( Math.abs(n) == 0 || Math.abs(n) == Infinity ) {
michael@0:     return n;
michael@0:   }
michael@0: 
michael@0:   var sign = ( n < 0 ) ? -1 : 1;
michael@0: 
michael@0:   return ( sign * Math.floor(Math.abs(n)) );
michael@0: }