Find specific lines in a txt file, if found delete them.
Basically, I have 2
txtfiles, let’s call them
Keep in mind each string is one line:
Txt1is a file that contains over 100.000 memory processes’ strings, I also have another file called
Txt2that has 400.000 memory processes’ strings.
We can call
Txt2as strings that possible contain infected strings, basically, I’m looking to search any of the 400.000 strings on the 100.000 strings on
Txt1. If any of the
Txt2strings are found in
Txt1that means those ones are clean strings, however, the ones that do no get found on
Txt1are the infected ones, is there any way I can filter them?
clean.txthas 100.000 strings
infected.txthas 400.000 strings
-> Search for any of the
-> If strings that match were found, delete them, these are clean strings.
-> Remaining strings that were non-existent from
How to filter these infected ones?
Hi, @shyvering-barhard, and All,
First of all, many thanks for your clear description of your problem ;-)) However, some questions still remain !
So, here is the way I understand you :
Assuming the two files, below, with some simple strings :
Clean.txt : XYZ ABC DEF 000 HIJ
Infected.txt : 999 KLM XYZ UVW ABC 000 HIJ DEF PQR
I would create a third temporary file, containing the contents of the two files, in any order
Total.txt : XYZ ABC DEF 000 HIJ 999 KLM XYZ UVW ABC 000 HIJ DEF PQR
Then, I would perform a classical sort ( Edit > Line Operations > Sort Lines Lexicographically Ascending )
000 000 999 ABC ABC DEF DEF HIJ HIJ KLM PQR UVW XYZ XYZ
And using the simple regex S/R :
we easily obtain the expected result :
999 KLM PQR UVW
Indeed, any of these
4remaining strings are located in the
Infected.txtfile, only !
Note that I assume some hypotheses :
Clean.txtfile does not contain duplicates
Infected.txtfile does not contain duplicates, too
You don’t mind about the sort process
Some questions :
Is there one memory process per line, in both files ?
Could you show us some lines of each file, to get a general idea of the strings that must be matched, then deleted ?
See you later !
@guy038 Thanks a lot for the detailed answer, this will help me one little more step ahead of what I’m trying to do.
I tried asking somewhere else but I wasn’t lucky enough to get my answer, I still have some missing-links on my equation.
This is the process I’m looking forward to do, basically involves 3
I’m looking for something that allows me to compare two processes strings, the comparison would come from a .txt file, let me elaborate.
I have a .txt file with over 400.000+ strings from a memory’s process.(Those being saved by Process Hacker 2)
My goal is to open two instances of X process; process named X1 will be a clean process (or just call it vanilla) and process named X2 will be the same process but in this instance, it will be infected/hacked/modified.
Process X2 is infected as mentioned before but will try to self-destruct and try to restore as an original X1 process. Of course, it’s not 100% perfect and it will leave strings that never should have existed in an original X1 process.
Basically, I have to test all the 400.000+ strings on each process one by one, if any of the strings show at X1(clean file) it means the process itself starts with that specific string and it’s all good (the string is discarded); on the other hand if the string does not show up in process X1 but does in X2 it automatically means the process is infected.
Why is so complicated to find the non-vanilla strings from X2 process?
- Because the ‘X2’ process self-destructs the infected files and tries to revert it back to the original process, trying to look like the X1 process.
What I’m looking for is to find that short amount of strings that won’t be erased when self-destructed, so whenever you check both processes you find the ones that are not original from the process, and as a result, claim the process was infected.
You can consider this 3
I’ll take a look at it, currently looking forward to remove all the 0x… prefixes, used reged
^.............(14 charcs) and some other variations because it’s not the same lenght. Any tips? Literally just looking to keep the strings which are likely the ones in red (not all were marked)
Forget about that before, I found the solution @scott-summer