the minimal information which must be stored in the file to reload properly the data base, following this header is the node array then the hash table (when growing we avoid to copy node array) More...
#include <odb.h>
Public Attributes | |
| odb_node_nr_t | size |
| in node nr (power of two) | |
| odb_node_nr_t | current_size |
| nr used node + 1, node 0 unused | |
| int | padding [6] |
| for padding and future use | |
the minimal information which must be stored in the file to reload properly the data base, following this header is the node array then the hash table (when growing we avoid to copy node array)
nr used node + 1, node 0 unused
Referenced by odb_check_hash(), odb_get_iterator(), odb_grow_hashtable(), odb_hash_stat(), and odb_open().
| int odb_descr_t::padding[6] |
for padding and future use
in node nr (power of two)
Referenced by odb_check_hash(), odb_close(), odb_grow_hashtable(), odb_hash_stat(), odb_open(), and odb_sync().
1.6.1