Re: Design challenges in chunkd self-checking

[Pete Zaitcev <zaitcev@redhat.com>]

On Tue, 05 Jan 2010 16:02:58 -0500
Jeff Garzik <jeff@garzik.org> wrote:
> On 01/05/2010 03:47 PM, Pete Zaitcev wrote:
> > On Tue, 22 Dec 2009 22:36:16 -0500
> > Jeff Garzik<jeff@garzik.org>  wrote:
> >
> >> Seems like a mutex-wrapped GLib hash table would work...
> >
> > I dunno about this... See, I think it's like kernel timers: there's a
> > lot of premium on having add and remove quick, and the rest is whatever.
> > The important part is not to penalize the latency of normal requests
> > only to make self-checking faster. That process takes hours to loop
> > anyway, maybe days.
> >
> > I went with a list for now.
> 
> How is an O(n) list faster than an O(1) hash table?

Do you know what the constant is in that hash table (which is not
O(1) in case of conflicts)?

Notice that the glib's hash table does NOT include a hash function.
This is something I wanted to discuss too. What would you use?
I researched what's available, and all of them come with rather
weird licenses (well, ok, Google hash is under the new BSD, which
works for us... or does it?).

The code is supposed to be easy to change over to any other
lookup structure, hopefuly anyway.

-- Pete