Re: [patch] First stab at text deltas

On Fri, 11 Aug 2000, Greg Hudson wrote:

Disclaimer: I'm not 100% aware of all the requirements here.

> Your hash table appears to use a variant on linear hashing which
> limits insertion time to a constant (using a doubly-linked list of
> free slots). As the table gets close to full, linear hashing is going
> produce a large number of collisions, which will tend to degrade
> search performance.

I don't want to ruin anything or step on anyone's toes, but if there's an
issue about hashing, I'd like to suggest a little implementation I've written
that have lying around. It is basically a hash-table with splay-sorted lists
on all table-entries. This makes it pretty good even at rather large amounts
of hashed data.

It was written as a generic hash library to allow custom table size and
custom hash algorithm. Anyway, it is here:

        http://www.contactor.se/~dast/stuff/dhash-1.0.tar.gz

I'd be willing to adjust it if it suits.

-- 
      Daniel Stenberg - http://daniel.haxx.se - +46-705-44 31 77
   ech`echo xiun|tr nu oc|sed 'sx\([sx]\)\([xoi]\)xo un\2\1 is xg'`ol