@galacean/engine-core 0.0.0-experimental-renderSort.0 → 0.0.0-experimental-renderSort.2

package/dist/miniprogram.js

@@ -21867,7 +21867,7 @@ var passNum = 0;
    */ _proto._quickSort = function _quickSort(a, from, to, compareFunc) {
         while(true){
             // Insertion sort is faster for short arrays.
-            if (to - from <= 10) {
+            if (to - from <= 10000000) {
                 this._insertionSort(a, from, to, compareFunc);
                 return;
             }
@@ -21876,45 +21876,38 @@ var passNum = 0;
             var v0 = a[from];
             var v1 = a[to - 1];
             var v2 = a[third_index];
-            var swapFlag = false;
             var c01 = compareFunc(v0, v1);
             if (c01 > 0) {
                 // v1 < v0, so swap them.
                 var tmp = v0;
                 v0 = v1;
                 v1 = tmp;
-                swapFlag = true;
             } // v0 <= v1.
             var c02 = compareFunc(v0, v2);
-            if (c02 > 0) {
-                // v2 < v0.
+            if (c02 >= 0) {
+                // v2 <= v0 <= v1.
                 var tmp1 = v0;
                 v0 = v2;
                 v2 = v1;
                 v1 = tmp1;
-                swapFlag = true;
             } else {
-                // v2 >= v0
+                // v0 <= v1 && v0 < v2
                 var c12 = compareFunc(v1, v2);
                 if (c12 > 0) {
                     // v0 <= v2 < v1
                     var tmp2 = v1;
                     v1 = v2;
                     v2 = tmp2;
-                    swapFlag = true;
                 }
             }
             // v0 <= v1 <= v2
+            a[from] = v0;
+            a[to - 1] = v2;
+            var pivot = v1;
             var low_end = from + 1; // Upper bound of elements lower than pivot.
             var high_start = to - 1; // Lower bound of elements greater than pivot.
-            var pivot = v2;
-            if (swapFlag) {
-                a[from] = v0;
-                a[to - 1] = v2;
-                pivot = v1;
-                a[third_index] = a[low_end];
-                a[low_end] = pivot;
-            }
+            a[third_index] = a[low_end];
+            a[low_end] = pivot;
             // From low_end to i are elements equal to pivot.
             // From i to high_start are elements that haven't been compared yet.
             partition: for(var i = low_end + 1; i < high_start; i++){

package/dist/module.js

@@ -21862,7 +21862,7 @@ var passNum = 0;
    */ _proto._quickSort = function _quickSort(a, from, to, compareFunc) {
         while(true){
             // Insertion sort is faster for short arrays.
-            if (to - from <= 10) {
+            if (to - from <= 10000000) {
                 this._insertionSort(a, from, to, compareFunc);
                 return;
             }
@@ -21871,45 +21871,38 @@ var passNum = 0;
             var v0 = a[from];
             var v1 = a[to - 1];
             var v2 = a[third_index];
-            var swapFlag = false;
             var c01 = compareFunc(v0, v1);
             if (c01 > 0) {
                 // v1 < v0, so swap them.
                 var tmp = v0;
                 v0 = v1;
                 v1 = tmp;
-                swapFlag = true;
             } // v0 <= v1.
             var c02 = compareFunc(v0, v2);
-            if (c02 > 0) {
-                // v2 < v0.
+            if (c02 >= 0) {
+                // v2 <= v0 <= v1.
                 var tmp1 = v0;
                 v0 = v2;
                 v2 = v1;
                 v1 = tmp1;
-                swapFlag = true;
             } else {
-                // v2 >= v0
+                // v0 <= v1 && v0 < v2
                 var c12 = compareFunc(v1, v2);
                 if (c12 > 0) {
                     // v0 <= v2 < v1
                     var tmp2 = v1;
                     v1 = v2;
                     v2 = tmp2;
-                    swapFlag = true;
                 }
             }
             // v0 <= v1 <= v2
+            a[from] = v0;
+            a[to - 1] = v2;
+            var pivot = v1;
             var low_end = from + 1; // Upper bound of elements lower than pivot.
             var high_start = to - 1; // Lower bound of elements greater than pivot.
-            var pivot = v2;
-            if (swapFlag) {
-                a[from] = v0;
-                a[to - 1] = v2;
-                pivot = v1;
-                a[third_index] = a[low_end];
-                a[low_end] = pivot;
-            }
+            a[third_index] = a[low_end];
+            a[low_end] = pivot;
             // From low_end to i are elements equal to pivot.
             // From i to high_start are elements that haven't been compared yet.
             partition: for(var i = low_end + 1; i < high_start; i++){