| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 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 |
| (...skipping 11 matching lines...) Expand all Loading... |
| 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 // Check that modifying an array while sorting it does not segfault. See | 28 // Check that modifying an array while sorting it does not segfault. See |
| 29 // http://code.google.com/p/chromium/issues/detail?id=66099. | 29 // http://code.google.com/p/chromium/issues/detail?id=66099. |
| 30 | 30 |
| 31 function Item(val) { | 31 function Item(val) { |
| 32 this.value = val; | 32 this.value = val; |
| 33 } | 33 } |
| 34 | 34 |
| 35 | 35 |
| 36 var size = 23; | 36 var size = 23; |
| 37 var array1 = new Array(size); | 37 var array1 = new Array(size); |
| 38 | 38 |
| 39 | 39 |
| 40 function myToString() { | 40 function myToString() { |
| 41 array1.splice(0, 1); | 41 array1.splice(0, 1); |
| 42 return this.value.toString(); | 42 return this.value.toString(); |
| 43 } | 43 } |
| 44 | 44 |
| 45 | 45 |
| 46 function test() { | 46 function test() { |
| 47 for (var i = 0; i < size; i++) { | 47 for (var i = 0; i < size; i++) { |
| 48 » array1[i] = new Item(i); | 48 array1[i] = new Item(i); |
| 49 » array1[i].toString = myToString; | 49 array1[i].toString = myToString; |
| 50 } | 50 } |
| 51 array1.sort(); | 51 array1.sort(); |
| 52 } | 52 } |
| 53 | 53 |
| 54 | 54 |
| 55 test(); | 55 test(); |
| OLD | NEW |