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 b95b74b7612300475790dbe2ac61909b3bbf5769..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;
 }