Re: GUI independence and XTL

[Lars Gullik Bjønnes]

Dekel Tsur <[EMAIL PROTECTED]> writes:

| On Mon, Feb 28, 2000 at 02:21:12PM +0100, Jean-Marc Lasgouttes wrote:
| > >>>>> "Lars" == Lars Gullik Bjønnes <[EMAIL PROTECTED]> writes:
| > 
| > Lars> Or we can just sort it... this will slow things down a tiny bit,
| > Lars> but you will never be able you measure that. (manually)
| > 
| > With an assertion, we are always sure that manual sorting will be
| > done. This is linear time, and only for debug builds.
| > 
| > JMarc
| 
| Why not use hashing? You also get faster search time.
| In any case, why isn't the STL being used? (map/hash_map containers)

Perhaps because  the standard C++ library dioes not have hashed
containers?
(that is an sgi extension (among others))

As for faster search times, these tables are som small that I don't
think it would have made a difference anyway.

        Lgb