Graham Christensen 09362bc3e8 references-by-popularity: cache computation to avoid memory bloat ... On very large graphs (14k+ paths), we'd end up with a massive in memory tree of mostly duplication. We can safely cache trees and point back to them later, saving memory.		2019-03-05 16:37:52 -05:00
..
closure-graph.py	references-by-popularity: cache computation to avoid memory bloat	2019-03-05 16:37:52 -05:00
default.nix	referencesByPopularity: init to sort packages by a cachability heuristic	2018-09-26 15:50:10 -04:00