![]() Here is the description of the points above, in a little bit more details: Reserve enough amount of virtual memory to keep scanned file names.Gather necessary information about the directory size. ![]() The steps it performs may be itemized into the following outline: ![]() And, as you guess, the main engine is concentrated in the worker thread itself. This thread starts when the user starts a new scan, and finishes when the user stops it or no more files remain to scan. The scanning process is done in a separate worker thread so that the user can stop/pause the execution at any point. The user interface is implemented via MFC (VC7.1 was used, sorry I don't have VC9). Here, I will describe the underlying strategy of the implementation. But, isn't that size too much for a single shot scan? How it Works In general, the tool works very fast for example, it takes ~40 minutes to scan a directory of ~70 GB size. button will be enabled when the search process ends up). You also can log the resulting hierarchy in a textual form (the Log. It's a two level hierarchy, that holds duplicated file names in its second level, and general information in its first level. Duplicated files found during scanning are immediately inserted into the tree control ( CTreeCtrl), as you can see. In addition to having a Start button, the tool also provides Stop and Pause buttons as it may be a lengthy operation to find duplicates in a large number of files. You can see its interface in action here: How to UseĪctually, it's very easy to use the tool. However, I'll try to describe the basic mechanisms of the tool's implementation. As the main purpose of this article is to present the tool, there is relatively little to write about. I wrote this tool to find duplicate files in my system, and I wanted to share it with you.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |