ROOT  6.07/01
Reference Guide
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
Functions
THashTable.cxx File Reference
#include "THashTable.h"
#include "TObjectTable.h"
#include "TList.h"
#include "TError.h"
Include dependency graph for THashTable.cxx:

Go to the source code of this file.

Functions

 ClassImp (THashTable) THashTable
 Create a THashTable object. More...
 
 ClassImp (THashTableIter) THashTableIter
 Create a hashtable iterator. More...
 

Function Documentation

ClassImp ( THashTable  )

Create a THashTable object.

Capacity is the initial hashtable capacity (i.e. number of slots), by default kInitHashTableCapacity = 17, and rehashlevel is the value at which a rehash will be triggered. I.e. when the average size of the linked lists at a slot becomes longer than rehashlevel then the hashtable will be resized and refilled to reduce the collision rate to about 1. The higher the collision rate, i.e. the longer the linked lists, the longer lookup will take. If rehashlevel=0 the table will NOT automatically be rehashed. Use Rehash() for manual rehashing.

Definition at line 29 of file THashTable.cxx.

ClassImp ( THashTableIter  )

Create a hashtable iterator.

By default the iteration direction is kIterForward. To go backward use kIterBackward.

Definition at line 357 of file THashTable.cxx.