Kevin B. Hendricks wrote: > Hi Alan, > > If you did place the count as the top line (to create a properly sized > hash table) then perhaps the only potential speedup is to change > hunspell to mmap a file that is the previously created hashtable similar > to what ispell uses. > > The problem only real problem is that all binary formats like that have > endian issues across architectures that make things quite difficult. > That is why I decided with myspell to go with building the hash table > on-the-fly so to speak. There are no binary compatibility issues that way. > > Another source of delay when starting up the spell-checker is when the > user has checked "check word in all languages" option but doesn't > realize that that they have a large number of dictionaries that have to > be loaded when the first misspelt word is checked. > > Obviously, for creating hash tables from large .dic files, available > memory is an issue. How much memory do you have available for your > machine? > > Kevin
Kevin, Would it make sense to pre-read the file to determine the number of entries in the case where there was no count a the beginning? I'm not familiar with mmap, but if the file were created on the user's machine at the first invocation, mmapping from that file for subsequent accesses would solve the architecture issues, wouldn't it? Peter -- Peter B. West <http://cv.pbw.id.au/> Folio <http://defoe.sourceforge.net/folio/> --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
