| Index: test/webkit/array-sort-reentrance.js
|
| diff --git a/test/webkit/concat-while-having-a-bad-time.js b/test/webkit/array-sort-reentrance.js
|
| similarity index 81%
|
| copy from test/webkit/concat-while-having-a-bad-time.js
|
| copy to test/webkit/array-sort-reentrance.js
|
| index dfda1e08a0b36194b787a44ee12a9693acd8aeaf..690ab3805b2da014ba2fc2521a525472eddad873 100644
|
| --- a/test/webkit/concat-while-having-a-bad-time.js
|
| +++ b/test/webkit/array-sort-reentrance.js
|
| @@ -22,10 +22,19 @@
|
| // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
| description(
|
| -"Tests the behavior of Array.prototype.concat while the array is having a bad time due to one of the elements we are concatenating."
|
| +"This tests that a call to array.sort(compareFunction) does not crash from within a sort comparison function."
|
| );
|
|
|
| -Object.defineProperty(Array.prototype, 0, { writable: false });
|
| -shouldBe("[42].concat()", "[42]");
|
| +var numbers1 = [1, 2, 3, 4, 5, 6, 7];
|
| +var numbers2 = numbers1.slice();
|
|
|
| +function compareFn1(a, b) {
|
| + return b - a;
|
| +}
|
|
|
| +function compareFn2(a, b) {
|
| + numbers1.sort(compareFn1);
|
| + return b - a;
|
| +}
|
| +
|
| +numbers2.sort(compareFn2);
|
|
|