Huffman con capacidad de comprimir chunks y presentando nueva API. El descompresor...

[z.facultad/75.06/jacu.git] / src / blocksorting / bs.c

diff --git a/src/blocksorting/bs.c b/src/blocksorting/bs.c
index 0aff024908b0e4d3eddd8c2f88f55d8603fd9feb..6231d057474e73f99e583ffcd23f2285cff3a55b 100644 (file)
--- a/src/blocksorting/bs.c
+++ b/src/blocksorting/bs.c
@@ -66,8 +66,8 @@ void print_(char *data, Uint32 pos, Uint32 len)
        Uint32 i;
 
        for(i=0; i<len; i++)
-               printf("%c", data[(pos+i)%len]);
-       printf("\n");
+               fprintf(stderr, "%c", data[(pos+i)%len]);
+       fprintf(stderr, "\n");
 }
 
 int generar_salida(char *data, t_BlockSort *bs, char *salida)
@@ -102,7 +102,6 @@ void bs_solve(char *in, char *out, t_BlockSort *bs, Uint32 *k, Uint32 leido)
        /* Guardo el k y el tamaño en el array */
        memcpy(out, &leido, sizeof(Uint32));
        memcpy(out+sizeof(Uint32), k, sizeof(Uint32));
-       printf("%ld -> %ld\n", *k, *(Uint32 *)(out+sizeof(Uint32)));
        bs->len = l;
 }
 
@@ -124,11 +123,8 @@ void bs_restore(char *dst, char *c, Uint32 k, Uint32 len)
        i=0;
        do {
                dst[i++] = in[current].c;
-               printf("(%c)", dst[i-1]);
                current = in[current].pos;
-               printf("[%d]", current);
        } while (current != k);
-       printf("\n");
        free(in);
 }