![]() ![]() Another way was to run a DoubleKiller comparison, and export its results. That method would be most useful where duplicate files were known to have the same filenames. One way, detailed in a prior post, was to run a Windows DIR command, and capture its output. This section is mostly focused on the technicalities of the spreadsheet I used. The method I used was to produce a list of files, and then use a spreadsheet to examine the contents of that list. Evidently I would have to come up with my own way of doing that. My searches didn’t lead to an easy technique. It appeared that neither dupeGuru nor DoubleKiller had any built-in intersection capability, nor had I noticed it elsewhere. ![]() It seemed easier to obtain the union than the intersection of multiple filesets. Some of the techniques discussed below could be useful in deciding which duplicates to keep and which to delete, so as to preserve a union of files that had informative names without duplicates. As detailed below, one set could have names that did not accurately summarize file contents, or that would provide little information, while the duplicates in another set could have more accurate or informative names or extensions, or could be arranged in folders that the user would be unwilling or unable to reconstruct afterwards. Where the files had the same contents but not the same names, it would be advisable to examine the list of duplicates before deleting anything. As with file operations generally, it would be a good idea to make backups at the beginning and also intermittently along the way, so as to be able to check back and see how things used to be, prior to one’s intervention. For some purposes, I might have to remember that I had thus distorted fileset 2: it might now contain fewer files than it previously contained, but that would not necessarily mean that it was originally inferior to fileset 1. If my duplication detection program found file X in fileset 1 and also in fileset 2, I could use that program to delete the copy of X that existed in fileset 2. ![]() I believed but wasn’t certain that the options described here were present in the free version. I had been using DoubleKiller Pro for some years, and was familiar with its options, so that’s what I used in this case. A search led to various lists of recommended duplicate detectors. To find the union of multiple filesets, I could use a duplicate file detection program. A later post provides an updated and more thorough look at some such tools. In the case of filesets, the union would be the complete set of all files existing in at least one fileset, after eliminating duplicates, while the intersection would be the list of files that existed in all filesets.Īmong other things, this post explores tools for calculating hash values for files. The Math Lab defined the union of two sets as “the set of elements which are in either set,” and the intersection of two sets as “the set of elements which are in both sets.” So if set 1 consisted of A and B, and set 2 consisted of B and C, then the union of sets 1 and 2 would be A, B, and C (typically written without duplication - that is, not A, B, B, C), and the intersection of sets 1 and 2 would be B. I wanted to find their union and their intersection. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |