Lower threshold on Array sort

Author: rhuanjl

lib/Runtime/Base/JnDirectFields.h

@@ -639,17 +639,10 @@ ENTRY(select)
 
 // JsBuiltIns
 ENTRY(__chakraLibrary)
-ENTRY(alias)
-ENTRY(argumentsCount)
-ENTRY(className)
-ENTRY(forceInline)
 ENTRY(GetIteratorPrototype)
-ENTRY(GetLength)
 ENTRY(InitInternalProperties)
-ENTRY(methodName)
 ENTRY(registerChakraLibraryFunction)
 ENTRY(registerFunction)
-ENTRY(staticMethod)
 ENTRY(arraySpeciesCreate)
 ENTRY(arrayCreateDataPropertyOrThrow)
 ENTRY(Array_values)
@@ -766,7 +759,6 @@ ENTRY2(_newTarget, _u("*new.target*"))
 // Note: Do not add fields for conditionally-compiled PropertyIds into this file.
 //       The bytecode for internal javascript libraries is built on chk but re-used in fre builds.
 //       Having a mismatch in the number of PropertyIds will cause a failure loading bytecode.
-//       See BLUE #467459
 
 #undef ENTRY_INTERNAL_SYMBOL
 #undef ENTRY_SYMBOL

lib/Runtime/Library/JsBuiltIn/JsBuiltIn.js

@@ -276,7 +276,7 @@
         }
 
         // for short arrays perform an insertion sort
-        if (length < 2048) {
+        if (length < 1024) {
             let sortedCount = 1, lowerBound = 0, insertPoint = 0, upperBound = 0;
             while (sortedCount < length) {
                 const item = o[sortedCount];

test/Array/array_sort_random.js

@@ -163,9 +163,9 @@ function stressTestSort(iterations, size = 1000)
     }
 }
 
-// test arrays with length < 2048 for insertion sort
-stressTestSort(200, 512);
-// test arrays with length > 2048 for merge sort
-stressTestSort(200, 2050);
+// test arrays with length < 1024 for insertion sort
+stressTestSort(100, 512);
+// test arrays with length > 1024 for merge sort
+stressTestSort(100, 1025);
 
 print("PASS");