The "algorithm" could be a database that stores the last known files from both sides.
For example, after syncing for the first time, the files look like this: Left Side Right Side FileA FileA FileB FileB FileC FileC FileA gets deleted on the left, FileB gets deleted on the right, and FileC gets changed on the left. After another sync, the files look like this: Left Side Right Side (the sync process deletes FileA from the right side) (the sync process deletes FileB from the left side) The changed FileC gets copied/synced from the left to the right BTW, I would like this type of intelligent syncing as well. I would use it for a Downloads folder that I also store on a flash drive. When I'm working on another computer, I use my flash drive as a toolbox, instead of having to re-download often-used tools. If I add another tool to the toolbox (or delete an old version of a tool), I want to be able to sync it to my laptop. Most of the time, however, I sync from my laptop to the flash drive. But I would like to be able to sync both ways. Tom On Friday, August 31, 2018 at 5:24:09 PM UTC-4, A. Bikadorov wrote: > > Hi, > > at first thought I can't come up with a valid use case for deleting files > on both sides > -source and destination- at the same time. > The problem in short: How can an algorithm know it should delete a file > instead of copying > it to the other side? > > Please give an example. > > Cheers > Alex > > > -- You received this message because you are subscribed to the Google Groups "krusader-users" group. To unsubscribe from this group and stop receiving emails from it, send an email to krusader-users+unsubscr...@googlegroups.com. To post to this group, send email to krusader-users@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/krusader-users/38863c11-f9f4-44a5-ae04-b602b05711ac%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
