| OLD | NEW |
| (Empty) |
| 1 // Copyright 2008 the V8 project authors. All rights reserved. | |
| 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 | |
| 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 | |
| 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); | |
| 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"); | |
| 66 assertEquals(-1, twoByteString.indexOf("\u0392"), "Not beta"); | |
| 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 | |
| 74 assertEquals(-1, twoByteString.indexOf("\u0391\u03a3\u0395"), | |
| 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"); | |
| 100 | |
| 101 | |
| 102 var lipsum = "lorem ipsum per se esse fugiendum. itaque aiunt hanc quasi " | |
| 103 + "naturalem atque insitam in animis nostris inesse notionem, ut " | |
| 104 + "alterum esse appetendum, alterum aspernandum sentiamus. Alii autem," | |
| 105 + " quibus ego assentior, cum a philosophis compluribus permulta " | |
| 106 + "dicantur, cur nec voluptas in bonis sit numeranda nec in malis " | |
| 107 + "dolor, non existimant oportere nimium nos causae confidere, sed et" | |
| 108 + " argumentandum et accurate disserendum et rationibus conquisitis de" | |
| 109 + " voluptate et dolore disputandum putant.\n" | |
| 110 + "Sed ut perspiciatis, unde omnis iste natus error sit voluptatem " | |
| 111 + "accusantium doloremque laudantium, totam rem aperiam eaque ipsa," | |
| 112 + "quae ab illo inventore veritatis et quasi architecto beatae vitae " | |
| 113 + "dicta sunt, explicabo. nemo enim ipsam voluptatem, quia voluptas" | |
| 114 + "sit, aspernatur aut odit aut fugit, sed quia consequuntur magni" | |
| 115 + " dolores eos, qui ratione voluptatem sequi nesciunt, neque porro" | |
| 116 + " quisquam est, qui dolorem ipsum, quia dolor sit, amet, " | |
| 117 + "consectetur, adipisci velit, sed quia non numquam eius modi" | |
| 118 + " tempora incidunt, ut labore et dolore magnam aliquam quaerat " | |
| 119 + "voluptatem. ut enim ad minima veniam, quis nostrum exercitationem " | |
| 120 + "ullam corporis suscipit laboriosam, nisi ut aliquid ex ea commodi " | |
| 121 + "consequatur? quis autem vel eum iure reprehenderit, qui in ea " | |
| 122 + "voluptate velit esse, quam nihil molestiae consequatur, vel illum, " | |
| 123 + "qui dolorem eum fugiat, quo voluptas nulla pariatur?\n"; | |
| 124 | |
| 125 assertEquals(893, lipsum.indexOf("lorem ipsum, quia dolor sit, amet"), | |
| 126 "Lipsum"); | |
| 127 // test a lot of substrings of differing length and start-position. | |
| 128 for(var i = 0; i < lipsum.length; i += 3) { | |
| 129 for(var len = 1; i + len < lipsum.length; len += 7) { | |
| 130 var substring = lipsum.substring(i, i + len); | |
| 131 var index = -1; | |
| 132 do { | |
| 133 index = lipsum.indexOf(substring, index + 1); | |
| 134 assertTrue(index != -1, | |
| 135 "Lipsum substring " + i + ".." + (i + len-1) + " not found"); | |
| 136 assertEquals(lipsum.substring(index, index + len), substring, | |
| 137 "Wrong lipsum substring found: " + i + ".." + (i + len - 1) + "/" + | |
| 138 index + ".." + (index + len - 1)); | |
| 139 } while (index >= 0 && index < i); | |
| 140 assertEquals(i, index, "Lipsum match at " + i + ".." + (i + len - 1)); | |
| 141 } | |
| 142 } | |
| OLD | NEW |