| 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 lipsum = "lorem ipsum per se esse fugiendum. itaque aiunt hanc quasi " |
| 29 + "naturalem atque insitam in animis nostris inesse notionem, ut " |
| 30 + "alterum esse appetendum, alterum aspernandum sentiamus. Alii autem," |
| 31 + " quibus ego assentior, cum a philosophis compluribus permulta " |
| 32 + "dicantur, cur nec voluptas in bonis sit numeranda nec in malis " |
| 33 + "dolor, non existimant oportere nimium nos causae confidere, sed et" |
| 34 + " argumentandum et accurate disserendum et rationibus conquisitis de" |
| 35 + " voluptate et dolore disputandum putant.\n" |
| 36 + "Sed ut perspiciatis, unde omnis iste natus error sit voluptatem " |
| 37 + "accusantium doloremque laudantium, totam rem aperiam eaque ipsa," |
| 38 + "quae ab illo inventore veritatis et quasi architecto beatae vitae " |
| 39 + "dicta sunt, explicabo. nemo enim ipsam voluptatem, quia voluptas" |
| 40 + "sit, aspernatur aut odit aut fugit, sed quia consequuntur magni" |
| 41 + " dolores eos, qui ratione voluptatem sequi nesciunt, neque porro" |
| 42 + " quisquam est, qui dolorem ipsum, quia dolor sit, amet, " |
| 43 + "consectetur, adipisci velit, sed quia non numquam eius modi" |
| 44 + " tempora incidunt, ut labore et dolore magnam aliquam quaerat " |
| 45 + "voluptatem. ut enim ad minima veniam, quis nostrum exercitationem " |
| 46 + "ullam corporis suscipit laboriosam, nisi ut aliquid ex ea commodi " |
| 47 + "consequatur? quis autem vel eum iure reprehenderit, qui in ea " |
| 48 + "voluptate velit esse, quam nihil molestiae consequatur, vel illum, " |
| 49 + "qui dolorem eum fugiat, quo voluptas nulla pariatur?\n"; |
| 50 |
| 51 assertEquals(893, lipsum.indexOf("lorem ipsum, quia dolor sit, amet"), |
| 52 "Lipsum"); |
| 53 // test a lot of substrings of differing length and start-position. |
| 54 for(var i = 0; i < lipsum.length; i += 3) { |
| 55 for(var len = 1; i + len < lipsum.length; len += 7) { |
| 56 var substring = lipsum.substring(i, i + len); |
| 57 var index = -1; |
| 58 do { |
| 59 index = lipsum.indexOf(substring, index + 1); |
| 60 assertTrue(index != -1, |
| 61 "Lipsum substring " + i + ".." + (i + len-1) + " not found"); |
| 62 assertEquals(lipsum.substring(index, index + len), substring, |
| 63 "Wrong lipsum substring found: " + i + ".." + (i + len - 1) + "/" + |
| 64 index + ".." + (index + len - 1)); |
| 65 } while (index >= 0 && index < i); |
| 66 assertEquals(i, index, "Lipsum match at " + i + ".." + (i + len - 1)); |
| 67 } |
| 68 } |
| OLD | NEW |