Find a good book on data structures, or search the web for information about hash tables. Basically, a hash table is a cheat that (if you have a good hashing algorithm) cuts search time for a list from n to n/hash_size. The hash will have a certain number of buckets that each contain part of the list, sorted based on said algorithm. In ROM, MAX_KEY_HASH is used to define the number of buckets. It is also used to hash vnums to decide which bucket they should go in.
If you have a huge world and raise the number, you could get improved search times when the mud looks up vnums. But it can only get so big before the memory use outweighs the performance increase. Under no circumstances should your hash size be bigger than the maximum number of vnums your mud is using, and probably having it much smaller (like 1/10th the number of vnums you're using) should suffice. --Palrich. Steven Radziul wrote: > > Greetings, > > I got a question concerning MAX_KEY_HAS: > What the heck is it :) and what happens if I increase it
