Date: prev next · Thread: first prev next last
2011 Archives by date, by thread · List index


On Mon, 2011-01-31 at 15:17 +0000, Michael Meeks wrote:
Hi Steve,
On Sat, 2011-01-29 at 21:45 +1000, Steve Butler wrote:
If the thesaurus is only loaded when the user pops it up, then
couldn't mythes be taught to generate its own in-memory index
from the dictionary and not bother with an index file at all?

      Right. I think we could easily serialize a small skip-list to disk too
- if we simply store ~8 or ~32 or so indexes into the data - we can
parse only a fraction of it, and pop that in our home directory. We
could also drop the MyThes code too as a depedency to manage.

      The code using it is in:

      lingucomponent/source/thesaurus/libnth/nthesimp.cxx

BTW, if I did that I'd probably do some major surgery on mythes and
just use STL because it basically is doing C style memory management
and processing and I think I would screw it up if I started messing
with it.  The only problem with simplifying it with STL constructs is
that I would want to change the interface (string vs char *), maybe
use STL vectors for the list of synonyms, etc.

      Heh; sure.

By this stage it's not looking much like mythes anymore ...

FWIW, I'm sure Nemeth would be interested if you e.g. wanted to create a
reimpl of mythes that was faster than the original and perhaps simply
designate the optimized version the new "mythes" version with an API/ABI
change :-)

C.


Context


Privacy Policy | Impressum (Legal Info) | Copyright information: Unless otherwise specified, all text and images on this website are licensed under the Creative Commons Attribution-Share Alike 3.0 License. This does not include the source code of LibreOffice, which is licensed under the Mozilla Public License (MPLv2). "LibreOffice" and "The Document Foundation" are registered trademarks of their corresponding registered owners or are in actual use as trademarks in one or more countries. Their respective logos and icons are also subject to international copyright laws. Use thereof is explained in our trademark policy.