diff options
| author | M Stoeckl <code@mstoeckl.com> | 2024-10-31 09:23:26 -0400 |
|---|---|---|
| committer | M Stoeckl <code@mstoeckl.com> | 2024-10-31 09:30:09 -0400 |
| commit | 260eaba88ec8f54fe2bdbe391b18fcd2db70836f (patch) | |
| tree | 252ac7bfe70b464117dc9aba7eb6d6dc98ac2906 /wmenu-run.c | |
| parent | 12b8f83be447379eded03c6109fe944945cd48aa (diff) | |
| download | wmenu-260eaba88ec8f54fe2bdbe391b18fcd2db70836f.tar.gz | |
Optimize menu sorting
Sorting and deduplicating elements after all items have been registered
improves the time complexity of constructing the item list from O(n^2)
to O(n log n). On a system with about 4000 menu items, this reduces
startup time from about 0.21 seconds to 0.13 seconds.
Diffstat (limited to 'wmenu-run.c')
| -rw-r--r-- | wmenu-run.c | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/wmenu-run.c b/wmenu-run.c index dc86b6d..1b7b8c1 100644 --- a/wmenu-run.c +++ b/wmenu-run.c @@ -20,10 +20,11 @@ static void read_items(struct menu *menu) { if (ent->d_name[0] == '.') { continue; } - menu_add_item(menu, strdup(ent->d_name), true); + menu_add_item(menu, strdup(ent->d_name)); } closedir(dir); } + menu_sort_and_deduplicate(menu); free(path); } |