6/1     Where can I findinfo on good "static hashing?" (Not sure this is
        what it's called).  I have a set of N string keys to pointer
        values.  N is known and is always the same, so I think I should be
        able to have some optimal M buckets to hash to.  I would also
        like only 1 key per bucket.  I'm pretty sure I've seen an
        algorithm like this, but now I can't find it.
        \_ If N is known (and not ungodly gigantic), why bother "hashing" it?
        \_ gperf?
           \_ Hey, thanks.  That's almost perfect.
              \_ *stab*