Thanks for the info. It would be nice to have the font height as a standard command , not a hidden/commented out one!
Tmap looks good, but I have not used it. So I can not really say which is faster.
My method uses each letter of the words ascii value to calc an offset in a 'branch' which points to the next branch. Looping thru the words characters ends up the position of the data.
A clever aspect of this is that A,AN,AND and ANDREW use the same branches.
I just did a rough test. Looking thru The complete work of shakspeare (142160 different words) for the word SUPER .I asked it to look for it 100,000 times and it took 1.45 seconds.
Tmap looks good, but I have not used it. So I can not really say which is faster.
My method uses each letter of the words ascii value to calc an offset in a 'branch' which points to the next branch. Looping thru the words characters ends up the position of the data.
A clever aspect of this is that A,AN,AND and ANDREW use the same branches.
I just did a rough test. Looking thru The complete work of shakspeare (142160 different words) for the word SUPER .I asked it to look for it 100,000 times and it took 1.45 seconds.