| OLD | NEW |
| 1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| 11 // with the distribution. | 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
| 15 // | 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 var s = "test test test"; | 28 var s = "test test test"; |
| 29 | 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 |
| 30 assertEquals(5, s.indexOf("test", 4)); | 36 assertEquals(5, s.indexOf("test", 4)); |
| 31 assertEquals(5, s.indexOf("test", 5)); | 37 assertEquals(5, s.indexOf("test", 5)); |
| 32 assertEquals(10, s.indexOf("test", 6)); | 38 assertEquals(10, s.indexOf("test", 6)); |
| 33 assertEquals(0, s.indexOf("test", 0)); | 39 assertEquals(0, s.indexOf("test", 0)); |
| 34 assertEquals(0, s.indexOf("test", -1)); | 40 assertEquals(0, s.indexOf("test", -1)); |
| 35 assertEquals(0, s.indexOf("test")); | 41 assertEquals(0, s.indexOf("test")); |
| 36 assertEquals(-1, s.indexOf("notpresent")); | 42 assertEquals(-1, s.indexOf("notpresent")); |
| 37 assertEquals(-1, s.indexOf()); | 43 assertEquals(-1, s.indexOf()); |
| 38 | 44 |
| 39 for (var i = 0; i < s.length+10; i++) { | 45 for (var i = 0; i < s.length+10; i++) { |
| 40 var expected = i < s.length ? i : s.length; | 46 var expected = i < s.length ? i : s.length; |
| 41 assertEquals(expected, s.indexOf("", i)); | 47 assertEquals(expected, s.indexOf("", i)); |
| 42 } | 48 } |
| 43 | 49 |
| 44 var reString = "asdf[a-z]+(asdf)?"; | 50 var reString = "asdf[a-z]+(asdf)?"; |
| 45 | 51 |
| 46 assertEquals(4, reString.indexOf("[a-z]+")); | 52 assertEquals(4, reString.indexOf("[a-z]+")); |
| 47 assertEquals(10, reString.indexOf("(asdf)?")); | 53 assertEquals(10, reString.indexOf("(asdf)?")); |
| 48 | 54 |
| 49 assertEquals(1, String.prototype.indexOf.length); | 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 + "At vero eos et accusamus et iusto odio dignissimos ducimus, qui " |
| 125 + "blanditiis praesentium voluptatum deleniti atque corrupti, quos " |
| 126 + "dolores et quas molestias excepturi sint, obcaecati cupiditate " |
| 127 + "non provident, similique sunt in culpa, qui officia deserunt " |
| 128 + "mollitia animi, id est laborum et dolorum fuga. et harum quidem " |
| 129 + "rerum facilis est et expedita distinctio. nam libero tempore, " |
| 130 + "cum soluta nobis est eligendi optio, cumque nihil impedit, quo " |
| 131 + "minus id, quod maxime placeat, facere possimus, omnis voluptas " |
| 132 + "assumenda est, omnis dolor repellendus. temporibus autem " |
| 133 + "quibusdam et aut officiis debitis aut rerum necessitatibus " |
| 134 + "saepe eveniet, ut et voluptates repudiandae sint et molestiae " |
| 135 + "non recusandae. itaque earum rerum hic tenetur a sapiente " |
| 136 + "delectus, ut aut reiciendis voluptatibus maiores alias consequatur " |
| 137 + "aut perferendis doloribus asperiores repellat."; |
| 138 |
| 139 assertEquals(893, lipsum.indexOf("lorem ipsum, quia dolor sit, amet"), |
| 140 "Lipsum"); |
| 141 // test a lot of substrings of differing length and start-position. |
| 142 for(var i = 255; i < lipsum.length; i += 3) { |
| 143 for(var len = 661; i + len < lipsum.length; len += 4) { |
| 144 var substring = lipsum.substring(i, i + len); |
| 145 var index = -1; |
| 146 do { |
| 147 index = lipsum.indexOf(substring, index + 1); |
| 148 assertTrue(index != -1, |
| 149 "Lipsum substring " + i + ".." + (i + len-1) + " not found"); |
| 150 assertEquals(lipsum.substring(index, index + len), substring, |
| 151 "Wrong lipsum substring found: " + i + ".." + (i + len - 1) + "/" + |
| 152 index + ".." + (index + len - 1)); |
| 153 } while (index >= 0 && index < i); |
| 154 assertEquals(i, index, "Lipsum match at " + i + ".." + (i + len - 1)); |
| 155 } |
| 156 } |
| OLD | NEW |