Most often, I need to research a drive for duplicates. When I find duplication have to be careful not to remove the duplicate from the most complete folder. because the most complete folder is most likely going to be able to use the content to execute a function. if the other folder equals, then delete one of them. But if they are not equal. I need to evaluate the two folders.
due to the quantity of files. I'm talking about. It would be best to just run it automatically. , and this is the scenario:
Folder A = Folder B
Delete all = files from the same folder.
Simple enough, as it appears, but it's not.
I have to take into consideration the tree the folder resides on. I must keep one tree as complete as possible. I need BeyondCompare to have the capability of looking at a tree, Folder A, finding duplication's that occur in a different tree, Folder B, and delete the duplication's.
Mostly my searches are done by the entire drive. so beyond compare, has to find duplication's in a folder with the ability to locate the most complete tree, folder all way back to the root of that folder.
Did I make myself clear. . If you'll understanding what I'm trying to tell you you're doing better than I am.
Bob
due to the quantity of files. I'm talking about. It would be best to just run it automatically. , and this is the scenario:
Folder A = Folder B
Delete all = files from the same folder.
Simple enough, as it appears, but it's not.
I have to take into consideration the tree the folder resides on. I must keep one tree as complete as possible. I need BeyondCompare to have the capability of looking at a tree, Folder A, finding duplication's that occur in a different tree, Folder B, and delete the duplication's.
Mostly my searches are done by the entire drive. so beyond compare, has to find duplication's in a folder with the ability to locate the most complete tree, folder all way back to the root of that folder.
Did I make myself clear. . If you'll understanding what I'm trying to tell you you're doing better than I am.
Bob
Comment