| Index: test/webkit/sort-large-array.js
|
| diff --git a/test/webkit/concat-while-having-a-bad-time.js b/test/webkit/sort-large-array.js
|
| similarity index 63%
|
| copy from test/webkit/concat-while-having-a-bad-time.js
|
| copy to test/webkit/sort-large-array.js
|
| index dfda1e08a0b36194b787a44ee12a9693acd8aeaf..43eed3ff16488b50eec815905801bad0cbee8afa 100644
|
| --- a/test/webkit/concat-while-having-a-bad-time.js
|
| +++ b/test/webkit/sort-large-array.js
|
| @@ -21,11 +21,23 @@
|
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
| // 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."
|
| -);
|
| +description("This tests sorting an array with more than 10,000 values.");
|
|
|
| -Object.defineProperty(Array.prototype, 0, { writable: false });
|
| -shouldBe("[42].concat()", "[42]");
|
| +var test = [];
|
| +for (var i = 0; i < 10010; i++)
|
| + test.push(10009 - i);
|
| +test.sort(function(a, b) {return a - b;});
|
|
|
| +shouldBe("test.length", "10010");
|
| +shouldBe("test[9999]", "9999");
|
| +shouldBe("test[10000]", "10000");
|
| +shouldBe("test.slice(0, 20).join(', ')", "'0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19'");
|
| +shouldBe("test.slice(9990, 10010).join(', ')", "'9990, 9991, 9992, 9993, 9994, 9995, 9996, 9997, 9998, 9999, 10000, 10001, 10002, 10003, 10004, 10005, 10006, 10007, 10008, 10009'");
|
|
|
| +var testNoValues = [];
|
| +testNoValues.length = 10110;
|
| +testNoValues.sort(function(a, b) {return a < b;});
|
| +
|
| +shouldBe("testNoValues.length", "10110");
|
| +shouldBe("testNoValues[9999]", "undefined");
|
| +shouldBe("testNoValues[10000]", "undefined");
|
|
|