Re: FreeBSD Most wanted

看板FB_chat作者時間22年前 (2004/03/08 11:54), 編輯推噓0(000)
留言0則, 0人參與, 最新討論串38/43 (看更多)
On Sun, 7 Mar 2004, Colin Percival wrote: > At 19:31 07/03/2004, Narvi wrote: > >The *traditional* hash table is one that uses linear probing, that is, it > >converts a list to a nice cache friendly array and provides you with a > >hint where you should start looking. > > Does anyone actually do that any more? When I absolutely need a hash It is still around. It plays *exteremely* nicely with cache, for example. Sure, it takes some extra care to make sure you don't run into nastiness, but it can give you a very fast and efficent hash. > table, I normally use double hashing and gradual rehashing. But maybe > that's just a personal quirk. > Have you looked at cuckoo hashing? > Colin Percival > > _______________________________________________ freebsd-chat@freebsd.org mailing list http://lists.freebsd.org/mailman/listinfo/freebsd-chat To unsubscribe, send any mail to "freebsd-chat-unsubscribe@freebsd.org"
文章代碼(AID): #10I-vr00 (FB_chat)
討論串 (同標題文章)
文章代碼(AID): #10I-vr00 (FB_chat)