No subject

something I could test (mythes) than something I could not (the
windows installer), so I thought I'd start with an easier option.

It is important to keep in mind that the performance hit is once off
per instance of swriter, and happens the first time you right click on
a word in a specific language.  With this implementation, once this is
done, the whole index is cached in an STL map so performance should be
around the same as before (lookup a word in an STL Rbtree vs a binary
search on a char ** structure).

It would also be possible to generate a dictionary index on first use,
but of course that would mean having to generate an index per user so
I'm not entertaining that idea seriously.

Regards,
Steven Butler