<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class="">Hi Michael,<div class=""><br class=""></div><div class="">I have been doing some research on fast string matching algorithm that I developed recently and I spent some time testing and benchmarking the algorithm and it seems fine so far. It is slightly similar to the one I proposed to Swift 3 or 4 months ago, it is doing some processing first to analyze a big block of text, files or whatever we give it and then it is ready for matching and referencing the results locations etc … I have written a C++ version here <a href="https://github.com/o-micron/RootsCLI" class="">https://github.com/o-micron/RootsCLI</a></div><div class=""><br class=""></div><div class="">This is mainly reached through some maths approximations to each word so that we can do some sort of hashing to it but not straight hashing … the main idea is to transform the word to a single double, the way this is done is by embedding informations about the order of the letters and the size of the word as a whole</div><div class=""><br class=""></div><div class="">The tests were made with generated file containing permutations of all possible words etc … </div><div class=""><br class=""></div><div class="">Would like to know your opinion about it.</div><div class=""><br class=""></div><div class="">BR,</div><div class="">Omar</div><div class=""><br class=""></div></body></html>