On Thu, Feb 15, 2024 at 7:32 PM Sands, Daniel N. via users <users@subversion.apache.org> wrote: ... > On a further note, my real repo has 260 moves due to source tree > restructuring. There were 290 deletions. The current move detection > algorithm is an O(n^2) search to find all moves, where it ends up > querying the SVN server 260*290 times for merge info, per file > conflict. Perhaps it would be a good cost savings to cache the merge > info for each file during the search, so that there are O(n) trips to > the server and everything else is resolved locally?
I don't know the tree conflict resolver code very well, so I'm not sure if it works that way, with O(n^2) calls. But it's definitely a good suggestion / idea to look closer into those calls and trying some strategies to optimize things. Would you have time / be able to dig deeper and try some things in the code yourself, maybe come up with a patch [1], or a proposal / idea in pseudo-code (best sent to d...@subversion.apache.org for discussion)? These days the SVN community is completely volunteer-driven, so any help is more than welcome :-). [1] https://subversion.apache.org/docs/community-guide/general.html#patches -- Johan
