string-indexof-1.js 9.66 KB
Newer Older
1
// Copyright 2008 the V8 project authors. All rights reserved.
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
//       copyright notice, this list of conditions and the following
//       disclaimer in the documentation and/or other materials provided
//       with the distribution.
//     * Neither the name of Google Inc. nor the names of its
//       contributors may be used to endorse or promote products derived
//       from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

28 29
// Flags: --allow-natives-syntax

30 31
var s = "test test test";

32 33 34
assertEquals(0, s.indexOf("t"));
assertEquals(3, s.indexOf("t", 1));
assertEquals(5, s.indexOf("t", 4));
35 36 37 38 39 40
assertEquals(5, s.indexOf("t", 4.1));
assertEquals(0, s.indexOf("t", 0));
assertEquals(0, s.indexOf("t", -1));
assertEquals(0, s.indexOf("t", -1));
assertEquals(0, s.indexOf("t", -1.1));
assertEquals(0, s.indexOf("t", -1073741825));
41 42 43
assertEquals(1, s.indexOf("e"));
assertEquals(2, s.indexOf("s"));

44 45 46
assertEquals(5, s.indexOf("test", 4));
assertEquals(5, s.indexOf("test", 5));
assertEquals(10, s.indexOf("test", 6));
47
assertEquals(10, s.indexOf("test", 6.0));
48
assertEquals(0, s.indexOf("test", 0));
49
assertEquals(0, s.indexOf("test", 0.0));
50
assertEquals(0, s.indexOf("test", -1));
51 52 53
assertEquals(-1, s.indexOf("not found", -1));
assertEquals(0, s.indexOf("test", -1.0));
assertEquals(0, s.indexOf("test", -1073741825));
54 55 56 57 58 59 60 61 62 63 64 65 66 67 68
assertEquals(0, s.indexOf("test"));
assertEquals(-1, s.indexOf("notpresent"));
assertEquals(-1, s.indexOf());

for (var i = 0; i < s.length+10; i++) {
  var expected = i < s.length ? i : s.length;
  assertEquals(expected, s.indexOf("", i));
}

var reString = "asdf[a-z]+(asdf)?";

assertEquals(4, reString.indexOf("[a-z]+"));
assertEquals(10, reString.indexOf("(asdf)?"));

assertEquals(1, String.prototype.indexOf.length);
69 70 71 72 73 74 75 76 77 78

// Random greek letters
var twoByteString = "\u039a\u0391\u03a3\u03a3\u0395";

// Test single char pattern
assertEquals(0, twoByteString.indexOf("\u039a"), "Lamda");
assertEquals(1, twoByteString.indexOf("\u0391"), "Alpha");
assertEquals(2, twoByteString.indexOf("\u03a3"), "First Sigma");
assertEquals(3, twoByteString.indexOf("\u03a3",3), "Second Sigma");
assertEquals(4, twoByteString.indexOf("\u0395"), "Epsilon");
79
assertEquals(-1, twoByteString.indexOf("\u0392"), "Not beta");
80 81 82 83 84 85 86

// Test multi-char pattern
assertEquals(0, twoByteString.indexOf("\u039a\u0391"), "lambda Alpha");
assertEquals(1, twoByteString.indexOf("\u0391\u03a3"), "Alpha Sigma");
assertEquals(2, twoByteString.indexOf("\u03a3\u03a3"), "Sigma Sigma");
assertEquals(3, twoByteString.indexOf("\u03a3\u0395"), "Sigma Epsilon");

87
assertEquals(-1, twoByteString.indexOf("\u0391\u03a3\u0395"),
88 89 90 91 92
    "Not Alpha Sigma Epsilon");

//single char pattern
assertEquals(4, twoByteString.indexOf("\u0395"));

93 94 95 96 97 98 99 100 101 102 103 104 105 106
// test string with alignment traps
var alignmentString = "\u1122\u2211\u2222\uFF00\u00FF\u00FF";
assertEquals(2, alignmentString.indexOf("\u2222"));
assertEquals(4, alignmentString.indexOf("\u00FF\u00FF"));

var longAlignmentString = "\uFF00" + "\u00FF".repeat(10);
assertEquals(1,
    longAlignmentString.indexOf("\u00FF".repeat(10)));

// test string with first character match at the end
var boundsString = "112233";
assertEquals(-1, boundsString.indexOf("334455"));
assertEquals(-1, boundsString.indexOf("334455".repeat(10)));

107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126
// Test complex string indexOf algorithms. Only trigger for long strings.

// Long string that isn't a simple repeat of a shorter string.
var long = "A";
for(var i = 66; i < 76; i++) {  // from 'B' to 'K'
  long =  long + String.fromCharCode(i) + long;
}

// pattern of 15 chars, repeated every 16 chars in long
var pattern = "ABACABADABACABA";
for(var i = 0; i < long.length - pattern.length; i+= 7) {
  var index = long.indexOf(pattern, i);
  assertEquals((i + 15) & ~0xf, index, "Long ABACABA...-string at index " + i);
}
assertEquals(510, long.indexOf("AJABACA"), "Long AJABACA, First J");
assertEquals(1534, long.indexOf("AJABACA", 511), "Long AJABACA, Second J");

pattern = "JABACABADABACABA";
assertEquals(511, long.indexOf(pattern), "Long JABACABA..., First J");
assertEquals(1535, long.indexOf(pattern, 512), "Long JABACABA..., Second J");
127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152


// Search for a non-ASCII string in a pure ASCII string.
var asciiString = "arglebargleglopglyfarglebargleglopglyfarglebargleglopglyf";
assertEquals(-1, asciiString.indexOf("\x2061"));


// 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);
// Search for string long enough to trigger complex search with ASCII pattern
// and UC16 subject.
assertEquals(-1, allCharsString.indexOf("notfound"));

// Find substrings.
var lengths = [1, 4, 15];  // Single char, simple and complex.
var indices = [0x5, 0x65, 0x85, 0x105, 0x205, 0x285, 0x2005, 0x2085, 0xfff0];
for (var lengthIndex = 0; lengthIndex < lengths.length; lengthIndex++) {
  var length = lengths[lengthIndex];
  for (var i = 0; i < indices.length; i++) {
    var index = indices[i];
    var pattern = allCharsString.substring(index, index + length);
    assertEquals(index, allCharsString.indexOf(pattern));
  }
}
153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209

(function nonStringReceivers() {
  let indexOf = String.prototype.indexOf;
  assertThrows(() => indexOf.call(null), TypeError);
  assertThrows(() => indexOf.call(undefined), TypeError);

  assertEquals(-1, indexOf.call(1));
  assertEquals(0, indexOf.call(1, "1"));

  assertEquals(-1, indexOf.call(1.2));
  assertEquals(0, indexOf.call(1.2, "1"));
  assertEquals(1, indexOf.call(1.2, "."));
  assertEquals(2, indexOf.call(1.2, "2"));
  assertEquals(-1, indexOf.call(1.2, "1", 2));

  assertEquals(-1, indexOf.call({}));
  assertEquals(0, indexOf.call({}, "[object Object]"));
  assertEquals(-1, indexOf.call({}, "[object", 1));

  assertEquals(-1, indexOf.call([]));
  assertEquals(0, indexOf.call([1,2], "1,2"));

  assertEquals(-1, indexOf.call(this));
})();

(function nonStringSearchString() {

  assertEquals(-1, "".indexOf(1));
  assertEquals(2, "_0123".indexOf(1));

  assertEquals(-1, "".indexOf(1.2));
  assertEquals(1, "01.2".indexOf(1.2));
  assertEquals(1, "01.2".indexOf(1.2, 1));
  assertEquals(-1, "01.2".indexOf(1.2, 2));

  assertEquals(-1, "".indexOf(null));
  assertEquals(0, "null".indexOf(null));

  assertEquals(-1, "".indexOf(undefined));
  assertEquals(1, "_undefined_".indexOf(undefined));

  assertEquals(0, "".indexOf([]));
  assertEquals(0, "123".indexOf([]));
  assertEquals(2, "1,2,3".indexOf([2,3]));

  assertEquals(-1, "".indexOf({}));
  assertEquals(-1, "".indexOf(this));
})();

(function nonStringPosition() {
  assertEquals(0, "aba".indexOf("a", false));
  assertEquals(2, "aba".indexOf("a", true));
  assertEquals(2, "aba".indexOf("a", "1"));
  assertEquals(2, "aba".indexOf("a", "1.00000"));
  assertEquals(2, "aba".indexOf("a", "2.00000"));
  assertEquals(-1, "aba".indexOf("a", "3.00000"));
})();
210 211 212 213 214 215 216 217

(function optimize() {
  function f() {
    return 'abc'.indexOf('a');
  }
  assertEquals(0, f());
  assertEquals(0, f());
  assertEquals(0, f());
218
  %OptimizeFunctionOnNextCall(f);
219 220 221 222 223 224 225 226
  assertEquals(0, f());

  function f2() {
    return 'abc'.indexOf('a', 1);
  }
  assertEquals(-1, f2());
  assertEquals(-1, f2());
  assertEquals(-1, f2());
227
  %OptimizeFunctionOnNextCall(f2);
228 229 230 231 232 233 234 235
  assertEquals(-1, f2());

  function f3() {
    return 'abc'.indexOf('a');
  }
  assertEquals(0, f3());
  assertEquals(0, f3());
  assertEquals(0, f3());
236
  %OptimizeFunctionOnNextCall(f3);
237 238 239 240 241 242 243 244
  assertEquals(0, f3());

  function f4() {
    return 'abcbc'.indexOf('bc', 2);
  }
  assertEquals(3, f4());
  assertEquals(3, f4());
  assertEquals(3, f4());
245
  %OptimizeFunctionOnNextCall(f4);
246
  assertEquals(3, f4());
247 248 249 250 251 252 253

  function f5() {
    return 'abcbc'.indexOf('b', -1);
  }
  assertEquals(1, f5());
  assertEquals(1, f5());
  assertEquals(1, f5());
254
  %OptimizeFunctionOnNextCall(f5);
255 256 257 258 259 260 261 262
  assertEquals(1, f5());

  function f6() {
    return 'abcbc'.indexOf('b', -10737418);
  }
  assertEquals(1, f6());
  assertEquals(1, f6());
  assertEquals(1, f6());
263
  %OptimizeFunctionOnNextCall(f6);
264
  assertEquals(1, f6());
265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303
})();

(function optimizeOSR() {
  function f() {
    var result;
    for (var i = 0; i < 100000; i++) {
      result = 'abc'.indexOf('a');
    }
    return result;
  }
  assertEquals(0, f());

  function f2() {
    var result;
    for (var i = 0; i < 100000; i++) {
      result = 'abc'.indexOf('a', 1);
    }
    return result;
  }
  assertEquals(-1, f2());

  function f3() {
    var result;
    for (var i = 0; i < 100000; i++) {
      result = 'abc'.indexOf('a');
    }
    return result;
  }
  assertEquals(0, f3());

  function f4() {
    var result;
    for (var i = 0; i < 100000; i++) {
      result = 'abcbc'.indexOf('bc', 2);
    }
    return result;
  }
  assertEquals(3, f4());
})();