I can\'t use boost:hash because I have to stick with C and can\'t use C++.
But, I need to hash a large number (10K to 100k) of tokens strings (5 to 40 bytes length) so t
You can find a good (and fast) hash function, and an interesting read, at http://www.azillionmonkeys.com/qed/hash.html
The only time you should not check for collisions, is if you use a perfect hash -- a good old fashioned lookup table, like gperf.