public static function mergeSort(&$array, \Closure $callback)
{
// Arrays of size < 2 require no action.
if (count($array) < 2) {
return;
}
// Split the array in half
$halfway = count($array) / 2;
$array1 = array_slice($array, 0, $halfway);
$array2 = array_slice($array, $halfway);
// Recurse to sort the two halves
self::mergesort($array1, $callback);
self::mergesort($array2, $callback);
// If all of $array1 is <= all of $array2, just append them.
if (call_user_func($callback, end($array1), $array2[0]) < 1) {
$array = array_merge($array1, $array2);
return;
}
// Merge the two sorted arrays into a single sorted array
$array = [];
$ptr1 = $ptr2 = 0;
while ($ptr1 < count($array1) && $ptr2 < count($array2)) {
if ($callback($array1[$ptr1], $array2[$ptr2]) < 1) {
$array[] = $array1[$ptr1++];
} else {
$array[] = $array2[$ptr2++];
}
}
// Merge the remainder
while ($ptr1 < count($array1)) {
$array[] = $array1[$ptr1++];
}
while ($ptr2 < count($array2)) {
$array[] = $array2[$ptr2++];
}
} /**
* Process the sorting, also break sorting.
*
* @param array $table
* @param Config $config
*
* @return array
*/
private function processSort(array $table, Config $config)
{
if ($config['sort']) {
$cols = array_reverse($config['sort']);
foreach ($cols as $colName => $direction) {
Sort::mergeSort($table, function ($elementA, $elementB) use($colName, $direction) {
if ($elementA[$colName] == $elementB[$colName]) {
return 0;
}
if ($direction === 'asc') {
return $elementA[$colName] < $elementB[$colName] ? -1 : 1;
}
return $elementA[$colName] > $elementB[$colName] ? -1 : 1;
});
}
}
if ($config['break']) {
foreach ($config['break'] as $colName) {
Sort::mergeSort($table, function ($elementA, $elementB) use($colName) {
if ($elementA[$colName] == $elementB[$colName]) {
return 0;
}
return $elementA[$colName] < $elementB[$colName] ? -1 : 1;
});
}
}
return $table;
}
