Commit ad6c6853 authored by Kirill Smelkov's avatar Kirill Smelkov

NOTES.restore: Clarify heuristic to limit search

We can do similar to what git does for blobs - searching in a window of
repositories sorted by repo basename.
parent 36da74e6
...@@ -87,4 +87,5 @@ continues. The algorithm is greedy - it can find minimum, but instead of global ...@@ -87,4 +87,5 @@ continues. The algorithm is greedy - it can find minimum, but instead of global
a local one. We have a way to control how far absolute minimum is away a local one. We have a way to control how far absolute minimum is away
(comparing to N(M)) (comparing to N(M))
TODO Comparing N(μi∩μj) is O(n^2) -> heuristics to limit to O(n) Comparing all N(μi∩μj) is O(n^2) -> heuristics to limit to O(n) (e.g. by
looking in a window of repositories sorted by name)
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment