sortOrdered method

L<T> sortOrdered([
  1. int compare(
    1. T a,
    2. T b
    )?
])

Implementation

L<T> sortOrdered([int Function(T a, T b)? compare]) {
  // Explicitly sorts MapEntry (since MapEntry is not Comparable).
  if ((compare == null) && (T == MapEntry))
    compare = (T a, T b) => (a as MapEntry).compareKeyAndValue(b as MapEntry);

  return LFlat<T>.unsafe(unlock..sortOrdered(compare ?? compareObject));
}