Index: test/webkit/sort-randomly.js |
diff --git a/test/webkit/concat-while-having-a-bad-time.js b/test/webkit/sort-randomly.js |
similarity index 69% |
copy from test/webkit/concat-while-having-a-bad-time.js |
copy to test/webkit/sort-randomly.js |
index dfda1e08a0b36194b787a44ee12a9693acd8aeaf..bd1847262b24aa820b7377a8fd860c95ad32a837 100644 |
--- a/test/webkit/concat-while-having-a-bad-time.js |
+++ b/test/webkit/sort-randomly.js |
@@ -22,10 +22,24 @@ |
// 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 passing an inconsistent compareFn to sort() doesn't cause a crash." |
); |
-Object.defineProperty(Array.prototype, 0, { writable: false }); |
-shouldBe("[42].concat()", "[42]"); |
+for (var attempt = 0; attempt < 100; ++attempt) { |
+ var arr = []; |
+ for (var i = 0; i < 64; ++i) |
+ arr[i] = i; |
+ arr.sort(function() { return 0.5 - Math.random(); }); |
+} |
+// Sorting objects that change each time sort() looks at them is the same as using a random compareFn. |
+function RandomObject() { |
+ this.toString = function() { return (Math.random() * 100).toString(); } |
+} |
+for (var attempt = 0; attempt < 100; ++attempt) { |
+ var arr = []; |
+ for (var i = 0; i < 64; ++i) |
+ arr[i] = new RandomObject; |
+ arr.sort(); |
+} |