assert.equal(b.indexOf(0x61, Infinity), -1);
assert.equal(b.indexOf(0x0), -1);
+// test offsets
+assert.equal(b.indexOf('d', 2), 3);
+assert.equal(b.indexOf('f', 5), 5);
+assert.equal(b.indexOf('f', -1), 5);
+assert.equal(b.indexOf('f', 6), -1);
+
+assert.equal(b.indexOf(Buffer('d'), 2), 3);
+assert.equal(b.indexOf(Buffer('f'), 5), 5);
+assert.equal(b.indexOf(Buffer('f'), -1), 5);
+assert.equal(b.indexOf(Buffer('f'), 6), -1);
+
+assert.equal(Buffer('ff').indexOf(Buffer('f'), 1, 'ucs2'), -1);
+
+// test hex encoding
+assert.equal(
+ Buffer(b.toString('hex'), 'hex')
+ .indexOf('64', 0, 'hex'), 3);
+assert.equal(
+ Buffer(b.toString('hex'), 'hex')
+ .indexOf(Buffer('64', 'hex'), 0, 'hex'), 3);
+
+// test base64 encoding
+assert.equal(
+ Buffer(b.toString('base64'), 'base64')
+ .indexOf('ZA==', 0, 'base64'), 3);
+assert.equal(
+ Buffer(b.toString('base64'), 'base64')
+ .indexOf(Buffer('ZA==', 'base64'), 0, 'base64'), 3);
+
+// test ascii encoding
+assert.equal(
+ Buffer(b.toString('ascii'), 'ascii')
+ .indexOf('d', 0, 'ascii'), 3);
+assert.equal(
+ Buffer(b.toString('ascii'), 'ascii')
+ .indexOf(Buffer('d', 'ascii'), 0, 'ascii'), 3);
+
+// test binary encoding
+assert.equal(
+ Buffer(b.toString('binary'), 'binary')
+ .indexOf('d', 0, 'binary'), 3);
+assert.equal(
+ Buffer(b.toString('binary'), 'binary')
+ .indexOf(Buffer('d', 'binary'), 0, 'binary'), 3);
+
+
+// test usc2 encoding
+var twoByteString = new Buffer('\u039a\u0391\u03a3\u03a3\u0395', 'ucs2');
+
+assert.equal(8, twoByteString.indexOf('\u0395', 4, 'ucs2'));
+assert.equal(6, twoByteString.indexOf('\u03a3', -4, 'ucs2'));
+assert.equal(4, twoByteString.indexOf('\u03a3', -6, 'ucs2'));
+assert.equal(4, twoByteString.indexOf(
+ new Buffer('\u03a3', 'ucs2'), -6, 'ucs2'));
+assert.equal(-1, twoByteString.indexOf('\u03a3', -2, 'ucs2'));
+
+var mixedByteStringUcs2 =
+ new Buffer('\u039a\u0391abc\u03a3\u03a3\u0395', 'ucs2');
+assert.equal(6, mixedByteStringUcs2.indexOf('bc', 0, 'ucs2'));
+assert.equal(10, mixedByteStringUcs2.indexOf('\u03a3', 0, 'ucs2'));
+assert.equal(-1, mixedByteStringUcs2.indexOf('\u0396', 0, 'ucs2'));
+
+assert.equal(
+ 6, mixedByteStringUcs2.indexOf(new Buffer('bc', 'ucs2'), 0, 'ucs2'));
+assert.equal(
+ 10, mixedByteStringUcs2.indexOf(new Buffer('\u03a3', 'ucs2'), 0, 'ucs2'));
+assert.equal(
+ -1, mixedByteStringUcs2.indexOf(new Buffer('\u0396', 'ucs2'), 0, 'ucs2'));
+
+var twoByteString = new Buffer('\u039a\u0391\u03a3\u03a3\u0395', 'ucs2');
+
+// Test single char pattern
+assert.equal(0, twoByteString.indexOf('\u039a', 0, 'ucs2'));
+assert.equal(2, twoByteString.indexOf('\u0391', 0, 'ucs2'), 'Alpha');
+assert.equal(4, twoByteString.indexOf('\u03a3', 0, 'ucs2'), 'First Sigma');
+assert.equal(6, twoByteString.indexOf('\u03a3', 6, 'ucs2'), 'Second Sigma');
+assert.equal(8, twoByteString.indexOf('\u0395', 0, 'ucs2'), 'Epsilon');
+assert.equal(-1, twoByteString.indexOf('\u0392', 0, 'ucs2'), 'Not beta');
+
+// Test multi-char pattern
+assert.equal(
+ 0, twoByteString.indexOf('\u039a\u0391', 0, 'ucs2'), 'Lambda Alpha');
+assert.equal(
+ 2, twoByteString.indexOf('\u0391\u03a3', 0, 'ucs2'), 'Alpha Sigma');
+assert.equal(
+ 4, twoByteString.indexOf('\u03a3\u03a3', 0, 'ucs2'), 'Sigma Sigma');
+assert.equal(
+ 6, twoByteString.indexOf('\u03a3\u0395', 0, 'ucs2'), 'Sigma Epsilon');
+
+var mixedByteStringUtf8 = new Buffer('\u039a\u0391abc\u03a3\u03a3\u0395');
+assert.equal(5, mixedByteStringUtf8.indexOf('bc'));
+assert.equal(5, mixedByteStringUtf8.indexOf('bc', 5));
+assert.equal(5, mixedByteStringUtf8.indexOf('bc', -8));
+assert.equal(7, mixedByteStringUtf8.indexOf('\u03a3'));
+assert.equal(-1, mixedByteStringUtf8.indexOf('\u0396'));
+
+
+// Test complex string indexOf algorithms. Only trigger for long strings.
+// Long string that isn't a simple repeat of a shorter string.
+var longString = 'A';
+for (var i = 66; i < 76; i++) { // from 'B' to 'K'
+ longString = longString + String.fromCharCode(i) + longString;
+}
+
+var longBufferString = new Buffer(longString);
+
+// pattern of 15 chars, repeated every 16 chars in long
+var pattern = 'ABACABADABACABA';
+for (var i = 0; i < longBufferString.length - pattern.length; i += 7) {
+ var index = longBufferString.indexOf(pattern, i);
+ assert.equal((i + 15) & ~0xf, index, 'Long ABACABA...-string at index ' + i);
+}
+assert.equal(510, longBufferString.indexOf('AJABACA'), 'Long AJABACA, First J');
+assert.equal(
+ 1534, longBufferString.indexOf('AJABACA', 511), 'Long AJABACA, Second J');
+
+pattern = 'JABACABADABACABA';
+assert.equal(
+ 511, longBufferString.indexOf(pattern), 'Long JABACABA..., First J');
+assert.equal(
+ 1535, longBufferString.indexOf(pattern, 512), 'Long JABACABA..., Second J');
+
+// Search for a non-ASCII string in a pure ASCII string.
+var asciiString = new Buffer(
+ 'arglebargleglopglyfarglebargleglopglyfarglebargleglopglyf');
+assert.equal(-1, asciiString.indexOf('\x2061'));
+assert.equal(3, asciiString.indexOf('leb', 0));
+
+// Search in string containing many non-ASCII chars.
+var allCodePoints = [];
+for (var i = 0; i < 65536; i++) allCodePoints[i] = i;
+var allCharsString = String.fromCharCode.apply(String, allCodePoints);
+var allCharsBufferUtf8 = new Buffer(allCharsString);
+var allCharsBufferUcs2 = new Buffer(allCharsString, 'ucs2');
+
+// Search for string long enough to trigger complex search with ASCII pattern
+// and UC16 subject.
+assert.equal(-1, allCharsBufferUtf8.indexOf('notfound'));
+assert.equal(-1, allCharsBufferUcs2.indexOf('notfound'));
+
+// Find substrings in Utf8.
+var lengths = [1, 3, 15]; // Single char, simple and complex.
+var indices = [0x5, 0x60, 0x400, 0x680, 0x7ee, 0xFF02, 0x16610, 0x2f77b];
+for (var lengthIndex = 0; lengthIndex < lengths.length; lengthIndex++) {
+ for (var i = 0; i < indices.length; i++) {
+ var index = indices[i];
+ var length = lengths[lengthIndex];
+
+ if (index + length > 0x7F) {
+ length = 2 * length;
+ }
+
+ if (index + length > 0x7FF) {
+ length = 3 * length;
+ }
+
+ if (index + length > 0xFFFF) {
+ length = 4 * length;
+ }
+
+ var patternBufferUtf8 = allCharsBufferUtf8.slice(index, index + length);
+ assert.equal(index, allCharsBufferUtf8.indexOf(patternBufferUtf8));
+
+ var patternStringUtf8 = patternBufferUtf8.toString();
+ assert.equal(index, allCharsBufferUtf8.indexOf(patternStringUtf8));
+ }
+}
+
+// Find substrings in Usc2.
+var lengths = [2, 4, 16]; // Single char, simple and complex.
+var indices = [0x5, 0x65, 0x105, 0x205, 0x285, 0x2005, 0x2085, 0xfff0];
+for (var lengthIndex = 0; lengthIndex < lengths.length; lengthIndex++) {
+ for (var i = 0; i < indices.length; i++) {
+ var index = indices[i] * 2;
+ var length = lengths[lengthIndex];
+
+ var patternBufferUcs2 =
+ allCharsBufferUcs2.slice(index, index + length);
+ assert.equal(
+ index, allCharsBufferUcs2.indexOf(patternBufferUcs2, 0, 'ucs2'));
+
+ var patternStringUcs2 = patternBufferUcs2.toString('ucs2');
+ assert.equal(
+ index, allCharsBufferUcs2.indexOf(patternStringUcs2, 0, 'ucs2'));
+ }
+}
+
assert.throws(function() {
b.indexOf(function() { });
});