>>>>> "Lars" == Lars Gullik Bjønnes <[EMAIL PROTECTED]> writes:
Lars> Dekel Tsur <[EMAIL PROTECTED]> writes: | On Mon, Feb 28, 2000
Lars> at 02:21:12PM +0100, Jean-Marc Lasgouttes wrote: | > >>>>>
Lars> "Lars" == Lars Gullik Bjønnes <[EMAIL PROTECTED]> writes: | > | >
Lars> Lars> Or we can just sort it... this will slow things down a
Lars> tiny bit, | > Lars> but you will never be able you measure that.
Lars> (manually) | > | > With an assertion, we are always sure that
Lars> manual sorting will be | > done. This is linear time, and only
Lars> for debug builds. | > | > JMarc | | Why not use hashing? You
Lars> also get faster search time. | In any case, why isn't the STL
Lars> being used? (map/hash_map containers)
Lars> Perhaps because the standard C++ library dioes not have hashed
Lars> containers? (that is an sgi extension (among others))
Lars> As for faster search times, these tables are som small that I
Lars> don't think it would have made a difference anyway.
And the table would have to be constructed at initialisation, whereas
it is static now.
JMarc
