Experimental: Merge 1395:1441 from bleeding_edge branch to the...

test/mjsunit/sparse-array-reverse.js

 // Copyright 2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 56 matching lines @@
 var poses = [0, 10, 50, 69];
 
 
 // Fuzzing test of reverse on sparse array.
 for (var iterations = 0; iterations < 20; iterations++) {
   for (var size_pos = 0; size_pos < sizes.length; size_pos++) {
     var size = sizes[size_pos];
 
     var to_delete = [];
 
-    var a = new Array(size);
+    var a;
+    // Make sure we test both array-backed and hash-table backed
+    // arrays.
+    if (size < 1000) {
+      a = new Array(size);
+    } else {
+      a = new Array();
+      a.length = size;
+    }
 
     var expected = '';
     var expected_reversed = '';
 
     for (var pos_pos = 0; pos_pos < poses.length; pos_pos++) {
       var pos = poses[pos_pos];
       var letter = String.fromCharCode(97 + pos_pos);
       if (DoOrDont()) {
         a[pos] = letter;
         expected += letter;
@@ skipping 26 matching lines @@
     a.reverse();
 
     while (to_delete.length != 0) {
       var pos = to_delete.pop();
       delete(Array.prototype[pos]);
     }
 
     assertEquals(expected_reversed2 + expected_reversed, a.join(''), 'reverse then join' + size);
   }
 }