Add m-esr52 at 52.6.0

1 files changed, 121 insertions, 0 deletions

diff --git a/js/src/tests/ecma/String/15.5.4.6-1.js b/js/src/tests/ecma/String/15.5.4.6-1.js
new file mode 100644
index 000000000..2e616df4a
--- /dev/null
+++ b/js/src/tests/ecma/String/15.5.4.6-1.js
@@ -0,0 +1,121 @@
+/* -*- 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:          15.5.4.6-1.js
+   ECMA Section:       15.5.4.6 String.prototype.indexOf( searchString, pos)
+   Description:        If the given searchString appears as a substring of the
+   result of converting this object to a string, at one or
+   more positions that are at or to the right of the
+   specified position, then the index of the leftmost such
+   position is returned; otherwise -1 is returned.  If
+   positionis undefined or not supplied, 0 is assumed, so
+   as to search all of the string.
+
+   When the indexOf method is called with two arguments,
+   searchString and pos, the following steps are taken:
+
+   1. Call ToString, giving it the this value as its
+   argument.
+   2. Call ToString(searchString).
+   3. Call ToInteger(position). (If position is undefined
+   or not supplied, this step produces the value 0).
+   4. Compute the number of characters in Result(1).
+   5. Compute min(max(Result(3), 0), Result(4)).
+   6. Compute the number of characters in the string that
+   is Result(2).
+   7. Compute the smallest possible integer k not smaller
+   than Result(5) such that k+Result(6) is not greater
+   than Result(4), and for all nonnegative integers j
+   less than Result(6), the character at position k+j
+   of Result(1) is the same as the character at position
+   j of Result(2); but if there is no such integer k,
+   then compute the value -1.
+   8. Return Result(7).
+
+   Note that the indexOf function is intentionally generic;
+   it does not require that its this value be a String object.
+   Therefore it can be transferred to other kinds of objects
+   for use as a method.
+
+   Author:             christine@netscape.com
+   Date:               2 october 1997
+*/
+var SECTION = "15.5.4.6-1";
+var VERSION = "ECMA_1";
+startTest();
+var TITLE   = "String.protoype.indexOf";
+
+var TEST_STRING = new String( " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~" );
+
+writeHeaderToLog( SECTION + " "+ TITLE);
+
+var j = 0;
+
+for ( k = 0, i = 0x0020; i < 0x007e; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf(" +String.fromCharCode(i)+ ", 0)",
+		k,
+		TEST_STRING.indexOf( String.fromCharCode(i), 0 ) );
+}
+
+for ( k = 0, i = 0x0020; i < 0x007e; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf("+String.fromCharCode(i)+ ", "+ k +")",
+		k,
+		TEST_STRING.indexOf( String.fromCharCode(i), k ) );
+}
+
+for ( k = 0, i = 0x0020; i < 0x007e; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf("+String.fromCharCode(i)+ ", "+k+1+")",
+		-1,
+		TEST_STRING.indexOf( String.fromCharCode(i), k+1 ) );
+}
+
+for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf("+(String.fromCharCode(i) +
+				   String.fromCharCode(i+1)+
+				   String.fromCharCode(i+2)) +", "+0+")",
+		k,
+		TEST_STRING.indexOf( (String.fromCharCode(i)+
+				      String.fromCharCode(i+1)+
+				      String.fromCharCode(i+2)),
+				     0 ) );
+}
+
+for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf("+(String.fromCharCode(i) +
+				   String.fromCharCode(i+1)+
+				   String.fromCharCode(i+2)) +", "+ k +")",
+		k,
+		TEST_STRING.indexOf( (String.fromCharCode(i)+
+				      String.fromCharCode(i+1)+
+				      String.fromCharCode(i+2)),
+				     k ) );
+}
+for ( k = 0, i = 0x0020; i < 0x007d; i++, j++, k++ ) {
+  new TestCase( SECTION,
+		"String.indexOf("+(String.fromCharCode(i) +
+				   String.fromCharCode(i+1)+
+				   String.fromCharCode(i+2)) +", "+ k+1 +")",
+		-1,
+		TEST_STRING.indexOf( (String.fromCharCode(i)+
+				      String.fromCharCode(i+1)+
+				      String.fromCharCode(i+2)),
+				     k+1 ) );
+}
+
+new TestCase( SECTION,  "String.indexOf(" +TEST_STRING + ", 0 )", 0, TEST_STRING.indexOf( TEST_STRING, 0 ) );
+
+new TestCase( SECTION,  "String.indexOf(" +TEST_STRING + ", 1 )", -1, TEST_STRING.indexOf( TEST_STRING, 1 ));
+
+print( "TEST_STRING = new String(\" !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~\")" );
+
+
+test();