Description: The data structure using the method of independent chain. With a maxtimes and maxname maximum number of real-time and correspondence with the new name. Using a hash function: hash = hash* 131+ (int) name [j] int serial = hash 10007 (first volume multiplied by 131, then the results will be similar and 10,000 die a prime number, use 10007) (readily available on the network algorithm). Then generates a list, the list of nodes, the node name and emerging into the inside of times if the number is 0, then the new node, or in the original node operation (down node when there is a conflict).
To Search:
File list (Check if you may need any files):
Hotname.cpp
Download