I had never really thought of it before, but MHS seems to have a super effective way to perform a pointer search (this probably applies to all the other searches, too). I tried to implement the simplest pointer search ever but using it takes forever. MHS does the same in less than a second.
I need to search through the memory for references to a static string to beat the DMA, but the method I'm using right now is just way too slow. So, how does MHS search through the memory so fast? I'm examining the source code right now but it would help if I got a general explanation of what's the idea behind the code. I can't use L. Spiro script because the search will need to be integrated into a program. Implementing it in C++ is the only option.
Thanks in advance.