I am not looking for a solution here - a simple yes/no response will suffice, but I am seeking re-assurance that my general idea is possible.
I need to locate pairs (and only pairs, not triplets) of files on a hard drive.
I can write the traditional brute-force approach (see below) in WordVBA and run it over the next weekend. So I have "a solution"
But with what I know of Everything I can reduce time of execution by making use of Everything's ability to Produce and to Process file lists.
Code: Select all
t: ext:msf
This post in "Compare 2 file lists with each other?" introduces me to the concept of a process/filter/macro/user-function within Everything. New territory to me in Everything, but I suspect that if I scratch my head enough I might be able to make progress here in learning what appears to be a "programming language" within Everything and give me greater processing power down the road.
(1) Am I correct in thinking that I should work at gaining proficiency in this technique as a means to process EFU lists?
(2) Or is there a different part of Everything that might be more suitable?
I have no paid task riding on this; just a desire to see how else Everything excels at file-name processing.
Thanks, Chris
My Brute-Force algorithm:
Code: Select all
For each folder on a drive
For each file in that folder
If extension matches parameter ‘ then we have one candidate for a pair
If there exists exactly one other instance of this <name> in the folder then – we still have a chance
If that instance has no extension ‘ then we have found a pair
Report this pair to the user
Else
Else
Else
Next file
Next folder