umbrello/umbrello
HashTable Struct Reference
#include <lookup.h>
Public Attributes | |
const HashEntry * | entries |
int | hashSize |
int | size |
int | type |
Detailed Description
A hash table Usually the hashtable is generated by the create_hash_table script, from a .table file.
The implementation uses an array of entries, "size" is the total size of that array. The entries between 0 and hashSize-1 are the entry points for each hash value, and the entries between hashSize and size-1 are the overflow entries for the hash values that need one. The "next" pointer of the entry links entry points to overflow entries, and links overflow entries between them.
Member Data Documentation
const HashEntry* HashTable::entries |
int HashTable::hashSize |
int HashTable::size |
int HashTable::type |
The documentation for this struct was generated from the following file:
This file is part of the KDE documentation.
Documentation copyright © 1996-2014 The KDE developers.
Generated on Tue Oct 14 2014 23:06:02 by doxygen 1.8.7 written by Dimitri van Heesch, © 1997-2006
Documentation copyright © 1996-2014 The KDE developers.
Generated on Tue Oct 14 2014 23:06:02 by doxygen 1.8.7 written by Dimitri van Heesch, © 1997-2006
KDE's Doxygen guidelines are available online.