Sir Phillip Tubell
c4d6b412ca
perf: fix O(n^2) -> O(n) LSH neighbor lookup in dedup
...
Replaced O(n) linear scan `next((n for n in candidates if n["id"] == neighbor_id))` with O(1) dict lookup via pre-built `candidates_by_id`. Also pre-caches `_norm()` results in `norm_cache` to avoid recomputing per inner iteration.
For a 36k-file codebase (~100k high-entropy candidates) this reduces the pass-2 loop from O(n^2*B) (~30–100B iterations) to O(n*B), eliminating the multi-minute CPU hang after AST extraction completes.
2026-06-12 10:31:01 -04:00
..
2026-06-02 20:48:13 +01:00
2026-06-07 14:26:14 +01:00
2026-04-06 16:06:31 +01:00
2026-06-07 14:39:16 +01:00
2026-06-07 12:40:44 +01:00
2026-06-08 23:49:16 +01:00
2026-05-22 13:22:51 +01:00
2026-06-08 23:22:15 +01:00
2026-06-03 21:03:06 +01:00
2026-05-29 02:28:52 +01:00
2026-06-01 21:54:11 +01:00
2026-06-01 16:05:07 +01:00
2026-06-12 10:31:01 -04:00
2026-06-08 10:35:32 +01:00
2026-05-22 13:22:51 +01:00
2026-06-08 23:22:15 +01:00
2026-06-08 10:35:32 +01:00
2026-05-22 13:22:51 +01:00
2026-05-07 20:07:57 +01:00
2026-06-07 12:40:44 +01:00
2026-05-07 16:32:26 +01:00
2026-06-08 23:49:16 +01:00
2026-04-04 18:56:38 +01:00
2026-05-26 20:16:41 +01:00
2026-05-22 13:22:51 +01:00
2026-06-07 01:20:38 +01:00
2026-05-31 00:06:35 +01:00
2026-06-03 21:04:01 +01:00
2026-05-30 21:37:47 +01:00
2026-05-22 13:22:51 +01:00
2026-05-22 13:22:51 +01:00
2026-05-22 13:22:51 +01:00
2026-06-08 23:22:15 +01:00
2026-06-07 15:49:52 +01:00
2026-06-07 15:49:52 +01:00
2026-06-07 15:49:52 +01:00
2026-06-07 15:49:52 +01:00
2026-06-07 15:49:52 +01:00
2026-06-07 12:40:44 +01:00
2026-06-07 15:49:52 +01:00
2026-06-07 15:49:52 +01:00
2026-06-07 12:40:44 +01:00
2026-06-07 15:49:52 +01:00
2026-06-07 12:40:44 +01:00
2026-06-07 15:49:52 +01:00
2026-06-07 15:49:52 +01:00
2026-06-07 15:49:52 +01:00
2026-06-07 15:49:52 +01:00
2026-05-31 12:23:56 +01:00
2026-05-02 14:32:16 +01:00
2026-05-22 13:22:51 +01:00
2026-04-29 08:51:53 +01:00
2026-06-07 01:20:38 +01:00
2026-05-26 09:06:43 +01:00