[hcoop/debian/openafs.git] / src / util / afs_lhash.h

/*
 * Copyright 2000, International Business Machines Corporation and others.
 * All Rights Reserved.
 *
 * This software has been released under the terms of the IBM Public
 * License.  For details, see the LICENSE file in the top-level source
 * directory or online at http://www.openafs.org/dl/license10.html
 */

/*
 * An afs_lhash is a linear hash table.  It is intended for use where
 * the number of elements in the hash table is not known in advance.
 * It grows as required in order to keep the average hash chain length
 * within certain bounds, which keeps average lookup times small.
 * Growth is efficient and does not require rehashing of all the
 * elements in the table at once.
 *
 * The caller is responsible for doing any required locking.
 *
 * For more information on the algorithm, see
 *
 *	Dynamic Hash Tables
Commit	Line	Data
805e021f CE	1	/*
	2	* Copyright 2000, International Business Machines Corporation and others.
	3	* All Rights Reserved.
	4	*
	5	* This software has been released under the terms of the IBM Public
	6	* License. For details, see the LICENSE file in the top-level source
	7	* directory or online at http://www.openafs.org/dl/license10.html
	8	*/
	9
	10	/*
	11	* An afs_lhash is a linear hash table. It is intended for use where
	12	* the number of elements in the hash table is not known in advance.
	13	* It grows as required in order to keep the average hash chain length
	14	* within certain bounds, which keeps average lookup times small.
	15	* Growth is efficient and does not require rehashing of all the
	16	* elements in the table at once.
	17	*
	18	* The caller is responsible for doing any required locking.
	19	*
	20	* For more information on the algorithm, see
	21	*
	22	* Dynamic Hash Tables
	23