On Aug 27, 2008, at 4:31 PM, Bulat Ziganshin wrote:
Hello Jan-Willem,
Wednesday, August 27, 2008, 4:06:11 PM, you wrote:
One obvious way to make non-modifiable hash tables useful is to eat
your own tail non-strictly--- aggregate a set of hash table entries,
construct a hash table from them,
On 27 Aug 2008, at 10:09, Bulat Ziganshin wrote:
Hello Jason,
Wednesday, August 27, 2008, 11:55:31 AM, you wrote:
given these constraints, it should be just a 10-20 lines of
code, and provide much better efficiency than any tree/trie
implementations
Much better efficiency in what way?
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Thomas Davie
Much better efficiency in what way?
instead of going through many levels of tree/trie,
lookup function will just select array element by hash value
and look through a few elements in assoc list:
On 27 Aug 2008, at 10:39, Bayley, Alistair wrote:
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Thomas Davie
Much better efficiency in what way?
instead of going through many levels of tree/trie,
lookup function will just select array element by hash value
