Claude 6abe95692e perf(tauri): use HashSet for cascade-delete dedup ... Descendant walking in delete_task called Vec::contains in the inner loop, making the traversal O(n^2) in the number of tasks. Swap the visited set to HashSet so membership tests are O(1); HashSet::insert also folds the contains-check and record-new steps into one call.		2026-04-20 07:34:52 +00:00
..
lib.rs	perf(tauri): use HashSet for cascade-delete dedup	2026-04-20 07:34:52 +00:00
main.rs	refactor: rename onyx-tauri to onyx-tasks, add onyx-standalone binary	2026-04-03 03:48:25 -07:00