Hi all, Is anyone here familiar with dbm, ndbm or gdbm? These libraries appear to be basically the same -- they provide functions for external storage of key,data pairs. My question is this: They all seem to use their own hashing functions for ordering the data. Does anyone know what these hashing functions are? I'd like to understand better, so I can use this in my own functions. Are they simply using some kind of CRC, or checksum -- or is there some more intelligent function which will hash arbitrary data more evenly. Thanks, Chris
