Warp wrote:
>   The difference is that it will use a hash table rather than a binary tree.

	I mistakenly thought the current map already did that...

> In most cases it considerably reduces memory usage and can potentially be
> much faster. (On the downside you have to be able to come up with a
> high-quality hash function for your elements. A poorly designed function
> can make the hash map very slow.)

	So the onus of coming up with a function will be on the user? Will it 
provide some defaults?

-- 
Lisa: Oedipus killed his father and married his mother.
Homer: Who payed for THAT wedding?


                     /\  /\               /\  /
                    /  \/  \ u e e n     /  \/  a w a z
                        >>>>>>mue### [at] nawazorg<<<<<<
                                    anl

Post a reply to this message