On Fri, 2011-05-20 at 00:47 -0600, Tor Lillqvist wrote:
Why not let the bleeping computer do the sorting the first time the
list is used? Proper division of labour between programmer and
computer is nice.
Hey ho :-) well, ideally we could do compile-time sorting, so we don't
have to dynamically allocate storage for that - ie. its rodata - no
doubt with some template magic that might be possible but ... ;-)
Also, I guess (just a guess) that the lookup needs to be fast otherwise
it wouldn't be doing this binary search; I can believe we do a lot of
URL work.
ATB,
Michael.
--
michael.meeks@novell.com <><, Pseudo Engineer, itinerant idiot
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.