Index: test/webkit/array-sort-small-sparse-array-with-large-length-expected.txt |
diff --git a/test/webkit/concat-while-having-a-bad-time-expected.txt b/test/webkit/array-sort-small-sparse-array-with-large-length-expected.txt |
similarity index 90% |
copy from test/webkit/concat-while-having-a-bad-time-expected.txt |
copy to test/webkit/array-sort-small-sparse-array-with-large-length-expected.txt |
index f949db98fd7b911d30b20281c82ee0f801405c77..1de82f5771ef1a90376021cd83a4a01eeaae1821 100644 |
--- a/test/webkit/concat-while-having-a-bad-time-expected.txt |
+++ b/test/webkit/array-sort-small-sparse-array-with-large-length-expected.txt |
@@ -21,12 +21,15 @@ |
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
-Tests the behavior of Array.prototype.concat while the array is having a bad time due to one of the elements we are concatenating. |
+Tests that we can quickly sort a small sparse array that has a large length. |
On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE". |
-PASS [42].concat() is [42] |
+array[0] = 42 |
+PASS result is "42" |
+PASS array.length is 10000001 |
+PASS array[0] is 42 |
PASS successfullyParsed is true |
TEST COMPLETE |