Chris Tate
2dad3c6064
Reduce cycle traversal overhead
- Bound collector recursion and reuse scanned candidates during cycle cleanup.
- Skip redundant candidate checks and unused array storage.
- Preserve reference counts across deep, shared, and mixed-generation graphs.
2026-10-05 05:58:04 -05:00
..
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-05 04:51:04 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-05 05:58:04 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 21:18:58 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 21:18:58 -05:00
2026-10-04 19:47:17 -05:00
2026-10-04 19:47:17 -05:00