mirror of
https://github.com/RGBCube/serenity
synced 2025-07-27 02:27:43 +00:00
AK: Make quick_sort() a little more ergonomic
Now it actually defaults to "a < b" comparison, instead of forcing you to provide a trivial less-than comparator. Also you can pass in any collection type that has .begin() and .end() and we'll sort it for you.
This commit is contained in:
parent
058cd1241e
commit
686ade6b5a
14 changed files with 35 additions and 23 deletions
|
@ -326,7 +326,7 @@ int do_file_system_object_long(const char* path)
|
|||
files.append(move(metadata));
|
||||
}
|
||||
|
||||
quick_sort(files.begin(), files.end(), [](auto& a, auto& b) {
|
||||
quick_sort(files, [](auto& a, auto& b) {
|
||||
if (flag_sort_by_timestamp) {
|
||||
if (flag_reverse_sort)
|
||||
return a.stat.st_mtime > b.stat.st_mtime;
|
||||
|
@ -382,7 +382,7 @@ int do_file_system_object_short(const char* path)
|
|||
if (names.last().length() > longest_name)
|
||||
longest_name = name.length();
|
||||
}
|
||||
quick_sort(names.begin(), names.end(), [](auto& a, auto& b) { return a < b; });
|
||||
quick_sort(names);
|
||||
|
||||
size_t printed_on_row = 0;
|
||||
size_t nprinted = 0;
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue