How does rclone avoid O(n^2) complexity?

Dev Discussions
#1

This is just out of curiosity, but how does rclone avoid an O(n^2) complexity when comparing remotes? Or does it?

When I built my two sync tools (PyFiSync and syncrclone), I developed my own data structure (DictTable) to do this.

I am sure there are better ways (such as comparing two sorted lists or one sorted list and binary search). Just wondering what, if anything, rclone does?

Thanks!

#2

This topic was automatically closed 60 days after the last reply. New replies are no longer allowed.