I am working on a very fast method for finding words.
It is based of making a data tree of all the words to search. This uses each letter of the word to calculate a pointer to the next character in the word.
It uses lots of memory, but these days we have lots!
It is fast because the work is being done as the file loads. The search time is as fast on 1,000,000 words as it is to look thru 100 words. The search speed is based off the size of the word you are looking up.
This version only uses Spaces as word separators, so 'TEST' is dif from 'TEST?'
This example uses the Data Tree to find words fast in big files. It can load the works of Shakespeare in 1.5 seconds. It can find as fast as you type.
It is based of making a data tree of all the words to search. This uses each letter of the word to calculate a pointer to the next character in the word.
It uses lots of memory, but these days we have lots!
It is fast because the work is being done as the file loads. The search time is as fast on 1,000,000 words as it is to look thru 100 words. The search speed is based off the size of the word you are looking up.
This version only uses Spaces as word separators, so 'TEST' is dif from 'TEST?'
This example uses the Data Tree to find words fast in big files. It can load the works of Shakespeare in 1.5 seconds. It can find as fast as you type.