TinyTable.h File Reference
This is a template for tiny hash tables that are:
- tiny
- allocated on the stack
- very fast
- not resizable
- bounded in the number of elements they can accept when instantiated
- able to store only void* or uint32_t The trick is to allocate on the stack a int[something] and instantiate TinyTable with this int[.
More...
#include "base/intutils.h"
#include "base/bitstring.h"
Go to the source code of this file.
|
Namespaces |
namespace | hash |
Detailed Description
This is a template for tiny hash tables that are:
- tiny
- allocated on the stack
- very fast
- not resizable
- bounded in the number of elements they can accept when instantiated
- able to store only void* or uint32_t The trick is to allocate on the stack a int[something] and instantiate TinyTable with this int[.
.] The tiny hash table is a uint32_t[] managed by a few simple functions.
Generated on Fri Jun 30 00:03:00 2006 for Module hash by
1.4.2