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-1.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
michael@0:    Date:               2 october 1997
michael@0: */
michael@0: var SECTION = "15.5.4.7-1";
michael@0: var VERSION = "ECMA_1";
michael@0: startTest();
michael@0: var TITLE   = "String.protoype.lastIndexOf";
michael@0: 
michael@0: var TEST_STRING = new String( " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~" );
michael@0: 
michael@0: writeHeaderToLog( SECTION + " "+ TITLE);
michael@0: 
michael@0: var j = 0;
michael@0: 
michael@0: for ( k = 0, i = 0x0021; i < 0x007e; i++, j++, k++ ) {
michael@0:   new TestCase( SECTION,
michael@0: 		"String.lastIndexOf(" +String.fromCharCode(i)+ ", 0)",
michael@0: 		-1,
michael@0: 		TEST_STRING.lastIndexOf( String.fromCharCode(i), 0 ) );
michael@0: }
michael@0: 
michael@0: for ( k = 0, i = 0x0020; i < 0x007e; i++, j++, k++ ) {
michael@0:   new TestCase( SECTION,
michael@0: 		"String.lastIndexOf("+String.fromCharCode(i)+ ", "+ k +")",
michael@0: 		k,
michael@0: 		TEST_STRING.lastIndexOf( String.fromCharCode(i), k ) );
michael@0: }
michael@0: 
michael@0: for ( k = 0, i = 0x0020; i < 0x007e; i++, j++, k++ ) {
michael@0:   new TestCase( SECTION,
michael@0: 		"String.lastIndexOf("+String.fromCharCode(i)+ ", "+k+1+")",
michael@0: 		k,
michael@0: 		TEST_STRING.lastIndexOf( String.fromCharCode(i), k+1 ) );
michael@0: }
michael@0: 
michael@0: for ( k = 9, i = 0x0021; i < 0x007d; i++, j++, k++ ) {
michael@0:   new TestCase( SECTION,
michael@0: 
michael@0: 		"String.lastIndexOf("+(String.fromCharCode(i) +
michael@0: 				       String.fromCharCode(i+1)+
michael@0: 				       String.fromCharCode(i+2)) +", "+ 0 + ")",
michael@0: 		LastIndexOf( TEST_STRING, String.fromCharCode(i) +
michael@0: 			     String.fromCharCode(i+1)+String.fromCharCode(i+2), 0),
michael@0: 		TEST_STRING.lastIndexOf( (String.fromCharCode(i)+
michael@0: 					  String.fromCharCode(i+1)+
michael@0: 					  String.fromCharCode(i+2)),
michael@0: 					 0 ) );
michael@0: }
michael@0: 
michael@0: for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
michael@0:   new TestCase( SECTION,
michael@0: 		"String.lastIndexOf("+(String.fromCharCode(i) +
michael@0: 				       String.fromCharCode(i+1)+
michael@0: 				       String.fromCharCode(i+2)) +", "+ k +")",
michael@0: 		k,
michael@0: 		TEST_STRING.lastIndexOf( (String.fromCharCode(i)+
michael@0: 					  String.fromCharCode(i+1)+
michael@0: 					  String.fromCharCode(i+2)),
michael@0: 					 k ) );
michael@0: }
michael@0: for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
michael@0:   new TestCase( SECTION,
michael@0: 		"String.lastIndexOf("+(String.fromCharCode(i) +
michael@0: 				       String.fromCharCode(i+1)+
michael@0: 				       String.fromCharCode(i+2)) +", "+ k+1 +")",
michael@0: 		k,
michael@0: 		TEST_STRING.lastIndexOf( (String.fromCharCode(i)+
michael@0: 					  String.fromCharCode(i+1)+
michael@0: 					  String.fromCharCode(i+2)),
michael@0: 					 k+1 ) );
michael@0: }
michael@0: for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
michael@0:   new TestCase( SECTION,
michael@0: 		"String.lastIndexOf("+
michael@0: 		(String.fromCharCode(i) +
michael@0: 		 String.fromCharCode(i+1)+
michael@0: 		 String.fromCharCode(i+2)) +", "+ (k-1) +")",
michael@0: 		LastIndexOf( TEST_STRING, String.fromCharCode(i) +
michael@0: 			     String.fromCharCode(i+1)+String.fromCharCode(i+2), k-1),
michael@0: 		TEST_STRING.lastIndexOf( (String.fromCharCode(i)+
michael@0: 					  String.fromCharCode(i+1)+
michael@0: 					  String.fromCharCode(i+2)),
michael@0: 					 k-1 ) );
michael@0: }
michael@0: 
michael@0: new TestCase( SECTION,  "String.lastIndexOf(" +TEST_STRING + ", 0 )", 0, TEST_STRING.lastIndexOf( TEST_STRING, 0 ) );
michael@0: 
michael@0: // new TestCase( SECTION,  "String.lastIndexOf(" +TEST_STRING + ", 1 )", 0, TEST_STRING.lastIndexOf( TEST_STRING, 1 ));
michael@0:  
michael@0: new TestCase( SECTION,  "String.lastIndexOf(" +TEST_STRING + ")", 0, TEST_STRING.lastIndexOf( TEST_STRING ));
michael@0: 
michael@0: print( "TEST_STRING = new String(\" !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~\")" );
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: }