Skip site navigation (1)Skip section navigation (2) 
Date:      Thu, 25 Sep 1997 03:26:09 +1000
From:      Bruce Evans <bde@zeta.org.au>
To:        bde@zeta.org.au, nate@mt.sri.com
Cc:        current@freebsd.org, gibbs@plutotech.com
Subject:   Re: new timeout routines
Message-ID:  <199709241726.DAA04836@godzilla.zeta.org.au>
index | next in thread | raw e-mail 

>> Hash lookup is non-deterministic, since searching is required to handlle
>> collisions.
>
>You had stated earlier that it would be easy to build a perfect hash
>generator.

Only for a special case.

>> handlers where we would prefer deterministic behaviour.  Note that hash
>> lookup is not required for timeout() since we don't care about duplicates.
>
>Right, but hash insertion in the case of duplicates is still
>non-deterministic.

No it isn't, at least for STAILQ chained hash tables.  Since we don't care
about duplicates, we can just add to the end of the queue.

Bruce
home | help

Want to link to this message? Use this
URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199709241726.DAA04836>