1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
|
// =============================================================== //
// //
// File : adtune.cxx //
// Purpose : //
// //
// Institute of Microbiology (Technical University Munich) //
// http://www.arb-home.de/ //
// //
// =============================================================== //
#include <gb_tune.h>
#define KB 1024
#define MB 1024 * KB
const int GBCM_BUFFER = 8192; // The communication buffer size
const int GB_REMOTE_HASH_SIZE = 0x40000; // The initial hash size in any client to find the database entry in the server
const int GBM_MAX_UNINDEXED_ENTRIES = 64; // The maximum number fields with the same key which are not put together in one memory segment
const int GB_TOTAL_CACHE_SIZE = 50*MB; // Initial cache size in bytes
const int GB_MAX_CACHED_ENTRIES = 16384; // maximum number of cached items (Maximum 32000)
const int GB_MAX_QUICK_SAVE_INDEX = 99; // Maximum extension-index of quick saves (Maximum 99)
const int GB_MAX_QUICK_SAVES = 10; // maximum number of quick saves
const int GB_MAX_LOCAL_SEARCH = 256; // Maximum number of children before doing a search in the database server
const int GBTUM_SHORT_STRING_SIZE = 128; // the maximum strlen which is stored in short string format
const unsigned GB_HUFFMAN_MIN_SIZE = 128; // min length, before huffmann code is used
const unsigned GB_RUNLENGTH_MIN_SIZE = 64; // min length, before runlength code is used
const int GB_MAX_REDO_CNT = 10; // maximum number of redos
const int GB_MAX_UNDO_CNT = 100; // maximum number of undos
const int GB_MAX_UNDO_SIZE = 20*MB; // total bytes used for undo
|
