ager@chromium.org | 9258b6b | 2008-09-11 09:11:10 +0000 | [diff] [blame] | 1 | // Copyright 2008 the V8 project authors. All rights reserved. |
mads.s.ager@gmail.com | 9a4089a | 2008-09-01 08:55:01 +0000 | [diff] [blame] | 2 | // Redistribution and use in source and binary forms, with or without |
| 3 | // modification, are permitted provided that the following conditions are |
| 4 | // met: |
| 5 | // |
| 6 | // * Redistributions of source code must retain the above copyright |
| 7 | // notice, this list of conditions and the following disclaimer. |
| 8 | // * Redistributions in binary form must reproduce the above |
| 9 | // copyright notice, this list of conditions and the following |
| 10 | // disclaimer in the documentation and/or other materials provided |
| 11 | // with the distribution. |
| 12 | // * Neither the name of Google Inc. nor the names of its |
| 13 | // contributors may be used to endorse or promote products derived |
| 14 | // from this software without specific prior written permission. |
| 15 | // |
| 16 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | |
| 28 | var s = "test test test"; |
| 29 | |
ager@chromium.org | 7c537e2 | 2008-10-16 08:43:32 +0000 | [diff] [blame] | 30 | assertEquals(0, s.indexOf("t")); |
| 31 | assertEquals(3, s.indexOf("t", 1)); |
| 32 | assertEquals(5, s.indexOf("t", 4)); |
| 33 | assertEquals(1, s.indexOf("e")); |
| 34 | assertEquals(2, s.indexOf("s")); |
| 35 | |
mads.s.ager@gmail.com | 9a4089a | 2008-09-01 08:55:01 +0000 | [diff] [blame] | 36 | assertEquals(5, s.indexOf("test", 4)); |
| 37 | assertEquals(5, s.indexOf("test", 5)); |
| 38 | assertEquals(10, s.indexOf("test", 6)); |
| 39 | assertEquals(0, s.indexOf("test", 0)); |
| 40 | assertEquals(0, s.indexOf("test", -1)); |
| 41 | assertEquals(0, s.indexOf("test")); |
| 42 | assertEquals(-1, s.indexOf("notpresent")); |
| 43 | assertEquals(-1, s.indexOf()); |
| 44 | |
| 45 | for (var i = 0; i < s.length+10; i++) { |
| 46 | var expected = i < s.length ? i : s.length; |
| 47 | assertEquals(expected, s.indexOf("", i)); |
| 48 | } |
| 49 | |
| 50 | var reString = "asdf[a-z]+(asdf)?"; |
| 51 | |
| 52 | assertEquals(4, reString.indexOf("[a-z]+")); |
| 53 | assertEquals(10, reString.indexOf("(asdf)?")); |
| 54 | |
| 55 | assertEquals(1, String.prototype.indexOf.length); |
ager@chromium.org | 7c537e2 | 2008-10-16 08:43:32 +0000 | [diff] [blame] | 56 | |
| 57 | // Random greek letters |
| 58 | var twoByteString = "\u039a\u0391\u03a3\u03a3\u0395"; |
| 59 | |
| 60 | // Test single char pattern |
| 61 | assertEquals(0, twoByteString.indexOf("\u039a"), "Lamda"); |
| 62 | assertEquals(1, twoByteString.indexOf("\u0391"), "Alpha"); |
| 63 | assertEquals(2, twoByteString.indexOf("\u03a3"), "First Sigma"); |
| 64 | assertEquals(3, twoByteString.indexOf("\u03a3",3), "Second Sigma"); |
| 65 | assertEquals(4, twoByteString.indexOf("\u0395"), "Epsilon"); |
fschneider@chromium.org | 1805e21 | 2011-09-05 10:49:12 +0000 | [diff] [blame] | 66 | assertEquals(-1, twoByteString.indexOf("\u0392"), "Not beta"); |
ager@chromium.org | 7c537e2 | 2008-10-16 08:43:32 +0000 | [diff] [blame] | 67 | |
| 68 | // Test multi-char pattern |
| 69 | assertEquals(0, twoByteString.indexOf("\u039a\u0391"), "lambda Alpha"); |
| 70 | assertEquals(1, twoByteString.indexOf("\u0391\u03a3"), "Alpha Sigma"); |
| 71 | assertEquals(2, twoByteString.indexOf("\u03a3\u03a3"), "Sigma Sigma"); |
| 72 | assertEquals(3, twoByteString.indexOf("\u03a3\u0395"), "Sigma Epsilon"); |
| 73 | |
fschneider@chromium.org | 1805e21 | 2011-09-05 10:49:12 +0000 | [diff] [blame] | 74 | assertEquals(-1, twoByteString.indexOf("\u0391\u03a3\u0395"), |
ager@chromium.org | 7c537e2 | 2008-10-16 08:43:32 +0000 | [diff] [blame] | 75 | "Not Alpha Sigma Epsilon"); |
| 76 | |
| 77 | //single char pattern |
| 78 | assertEquals(4, twoByteString.indexOf("\u0395")); |
| 79 | |
| 80 | // Test complex string indexOf algorithms. Only trigger for long strings. |
| 81 | |
| 82 | // Long string that isn't a simple repeat of a shorter string. |
| 83 | var long = "A"; |
| 84 | for(var i = 66; i < 76; i++) { // from 'B' to 'K' |
| 85 | long = long + String.fromCharCode(i) + long; |
| 86 | } |
| 87 | |
| 88 | // pattern of 15 chars, repeated every 16 chars in long |
| 89 | var pattern = "ABACABADABACABA"; |
| 90 | for(var i = 0; i < long.length - pattern.length; i+= 7) { |
| 91 | var index = long.indexOf(pattern, i); |
| 92 | assertEquals((i + 15) & ~0xf, index, "Long ABACABA...-string at index " + i); |
| 93 | } |
| 94 | assertEquals(510, long.indexOf("AJABACA"), "Long AJABACA, First J"); |
| 95 | assertEquals(1534, long.indexOf("AJABACA", 511), "Long AJABACA, Second J"); |
| 96 | |
| 97 | pattern = "JABACABADABACABA"; |
| 98 | assertEquals(511, long.indexOf(pattern), "Long JABACABA..., First J"); |
| 99 | assertEquals(1535, long.indexOf(pattern, 512), "Long JABACABA..., Second J"); |
kmillikin@chromium.org | ec7067e | 2010-10-01 09:22:58 +0000 | [diff] [blame] | 100 | |
| 101 | |
| 102 | // Search for a non-ASCII string in a pure ASCII string. |
| 103 | var asciiString = "arglebargleglopglyfarglebargleglopglyfarglebargleglopglyf"; |
| 104 | assertEquals(-1, asciiString.indexOf("\x2061")); |
| 105 | |
| 106 | |
| 107 | // Search in string containing many non-ASCII chars. |
| 108 | var allCodePoints = []; |
| 109 | for (var i = 0; i < 65536; i++) allCodePoints[i] = i; |
| 110 | var allCharsString = String.fromCharCode.apply(String, allCodePoints); |
| 111 | // Search for string long enough to trigger complex search with ASCII pattern |
| 112 | // and UC16 subject. |
| 113 | assertEquals(-1, allCharsString.indexOf("notfound")); |
| 114 | |
| 115 | // Find substrings. |
| 116 | var lengths = [1, 4, 15]; // Single char, simple and complex. |
| 117 | var indices = [0x5, 0x65, 0x85, 0x105, 0x205, 0x285, 0x2005, 0x2085, 0xfff0]; |
| 118 | for (var lengthIndex = 0; lengthIndex < lengths.length; lengthIndex++) { |
| 119 | var length = lengths[lengthIndex]; |
| 120 | for (var i = 0; i < indices.length; i++) { |
| 121 | var index = indices[i]; |
| 122 | var pattern = allCharsString.substring(index, index + length); |
| 123 | assertEquals(index, allCharsString.indexOf(pattern)); |
| 124 | } |
| 125 | } |