Doesn't even compile because of the gratuitous use of M$ proprietary functions like fopen_s and _flushall.
If you had been following the conversation you would have read that I was in no way claiming my software was in a state ready for public consumption.
And it can't do proper math:
$ ./a.out -w 9999 ../publish/76/76.rst ~/Documents/76-test.rst Setting a -w parameter larger than 10,000 results in excessive run times $ Not sure what "it can't do proper math" means. This algorithm like all Levenshtein string match is n^2 in the maximum distance of string mismatches you want to handle. If you have less than 10,000 words in a row different between your two documents, then set a smaller maximum mismatch distance, such as 1,000 is very generous for most documents sets. If the routines you are used to run faster than this it is because they crap out when the input files sets aren't closely similar. Of course this also depends on how fast a machine you have and how much memory you have. 4.
What do I do with this mess? There are not even line numbers in this mess.
I'm not sure what you want to do with this software, so I can't guess how to help you. Usually in versioning I run it without the -justdiffs option in which case it tags regions of the output .txt file *in context* that I need to look more closely at with the { ... } I use the -justdiffs option just as a quick visual summary "sanity check" of the edit changes I have made. Suggest take a look at the output *without* the -justdiffs option in order to better understand -justdiffs.