Path: utzoo!attcan!uunet!ginosko!gem.mps.ohio-state.edu!rpi!clotho!flynn From: flynn@clotho.acm.rpi.edu (Kevin Lincoln Flynn) Newsgroups: comp.lang.c Subject: Re: Perfect HASH functions..... Keywords: hash 16-bit runtime Message-ID: <1989Sep24.214153.8867@rpi.edu> Date: 24 Sep 89 21:41:53 GMT References: <9900014@bradley> <1989Sep23.192021.26473@paris.ics.uci.edu> Reply-To: flynn@acm.rpi.edu (Kevin Lincoln Flynn) Organization: South American Super Beings Lines: 15 As long as people are talking hashing, can anyone think of a GOOD way to hash 16-bit numbers determined dynamically at runtime into a fast way to look them up? Specifically, I'm talking about the attribute dictionary of an object in an OO system we're working on here -- the tags of attributes are 16-bit handles about which nothing is known at runtime. Someone suggested closed hashing, with the number of buckets growing by roughly doubling primes.... ie start with two buckets, then 3, then 7, then 17, etc..... any ideas out there? (oh yeah, the hash function as well as the strategy'd by nice. [ :) ]) Thanks in advance!! - Flynn Kevin Lincoln Flynn flynn@acm.rpi.edu, userfwvl@mts.rpi.edu 147 1st Street H (518) 273-6914 W (518) 447-8561 Troy, NY 12180 ...Argue for your limitations, and sure enough they're yours.