On 01/05/2010 03:47 PM, Pete Zaitcev wrote:
On Tue, 22 Dec 2009 22:36:16 -0500
Jeff Garzik<j...@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?
Jeff
--
To unsubscribe from this list: send the line "unsubscribe hail-devel" in
the body of a message to majord...@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
