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


Then it may be better to change that algorithm into something more
readable and not requiring the list to be sorted?

Something like gperf? Might be overkill, lots of work that I think might need plenty of iterations 
in setting up the makefilery? Much work for little (?) gain. But of course the gain can be known 
only by measurement after actually already doing the work;)

But adding a first-time-use sorting of the array should be easy. While at it, why not change it do 
use some standard binary search, either bsearch() or some C++ thing, instead of the manually 
crafted one? No, I am not volunteering;) This might even be an Easy Hack, as long as we require the 
Easy Hacker to verify that the changes work.

--tml



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.