Show
Ignore:
Timestamp:
14/08/09 16:29:27 (3 years ago)
Author:
westram
Message:
  • spellchecked all (phew)
Files:
1 modified

Legend:

Unmodified
Added
Removed
  • trunk/ARBDB/adoptimize.c

    r5825 r6141  
    5858/****************************************************/ 
    5959 
    60 #define COMPRESSABLE(type) ((type) >= GB_BYTES && (type)<=GB_STRING) 
     60#define COMPRESSIBLE(type) ((type) >= GB_BYTES && (type)<=GB_STRING) 
    6161#define DICT_MEM_WEIGHT    4 
    6262 
     
    292292 *     if compressed==0: 
    293293 *         unsigned int last:1;         ==1 -> this is the last block 
    294  *         unsigned int len:6;          length of uncompressable bytes 
     294 *         unsigned int len:6;          length of uncompressible bytes 
    295295 *         char[len]; 
    296296 *     if compressed==1: 
     
    609609    u_str  dest; 
    610610    u_str  buffer; 
    611     cu_str unknown          = source; /* start of uncompressable bytes */ 
    612     u_str  lastUncompressed = NULL; /* ptr to start of last block of uncompressable bytes (in dest) */ 
     611    cu_str unknown          = source; /* start of uncompressible bytes */ 
     612    u_str  lastUncompressed = NULL; /* ptr to start of last block of uncompressible bytes (in dest) */ 
    613613 
    614614#if defined(ASSERTION_USED) 
     
    658658            } 
    659659 
    660             while (length) {    /* if there were uncompressable bytes */ 
     660            while (length) {    /* if there were uncompressible bytes */ 
    661661                int take = (int)min(length,63); 
    662662 
     
    799799        int type = GB_TYPE(gbd); 
    800800 
    801         if (COMPRESSABLE(type)) { 
     801        if (COMPRESSIBLE(type)) { 
    802802            long size; 
    803803            cu_str data = get_data_n_size(gbd, &size); 
     
    15111511 
    15121512static int COUNT(GB_DICT_TREE tree) { 
    1513     /* counts sum of # of occurencies of tree */ 
     1513    /* counts sum of # of occurrences of tree */ 
    15141514    int cnt = 0; 
    15151515 
     
    15751575                            GB_DICT_TREE brother = tree.single->brother; 
    15761576 
    1577                             tree.single->brother.exists = NULL; /* elsewise it would be free'ed by free_dtree */ 
     1577                            tree.single->brother.exists = NULL; /* elsewise it would be freed by free_dtree */ 
    15781578                            free_dtree(tree); 
    15791579                            *tree_pntr = tree = brother; 
     
    18111811            int type =  GB_TYPE(gbd); 
    18121812 
    1813             if (COMPRESSABLE(type)) { 
     1813            if (COMPRESSIBLE(type)) { 
    18141814                long   size; 
    18151815                cu_str data = get_data_n_size(gbd, &size); 
     
    22142214    /* 1. sorts the 'dict->offsets' by frequency 
    22152215     *    (frequency of each offset is stored in the 'dict->resort' with the same index) 
    2216      * 2. initializes & sorts 'dict->resort' in alphabethical order 
     2216     * 2. initializes & sorts 'dict->resort' in alphabetic order 
    22172217     */ 
    22182218    int  i; 
     
    23972397        int     type = GB_TYPE(gbd); 
    23982398 
    2399         if (COMPRESSABLE(type)) { 
     2399        if (COMPRESSIBLE(type)) { 
    24002400            long size; 
    24012401            char *data;