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 64ea8ab45c50c764c84683e947d679847334a53f..6231d057474e73f99e583ffcd23f2285cff3a55b 100644 (file)
--- a/src/blocksorting/bs.c
+++ b/src/blocksorting/bs.c
@@ -6,7 +6,7 @@
 
 typedef struct _bs_decode_t_ {
        char c;
-       unsigned long int pos;
+       Uint32 pos;
 } t_BlockSortDecode;
 
 char es_menor(char *data, t_BlockSort *bs, int i, int j);
@@ -31,7 +31,7 @@ int __compare(const void *d1, const void *d2) {
 
 char es_menor(char *data, t_BlockSort *bs, int i, int j)
 {
-       unsigned long int pi, pj, k;
+       Uint32 pi, pj, k;
 
        for(k=0; k<bs->len; k++) {
                pi = (i+k)%bs->len;
@@ -61,22 +61,22 @@ void ordenar_array(char *data, t_BlockSort *bs)
        qsort(bs->array, bs->len, sizeof(t_BlockSortData), __compare);
 }
 
-void print_(char *data, unsigned long int pos, unsigned long int len)
+void print_(char *data, Uint32 pos, Uint32 len)
 {
-       unsigned long int i;
+       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)
 {
-       unsigned long int i, k;
+       Uint32 i, k;
        char *out;
 
        /* Dejo lugar para guardar el k y el tamaño de este bloque */
-       out = salida + sizeof(unsigned long int)*2;
+       out = salida + sizeof(Uint32)*2;
 
        k=-1;
        for(i=0; i<bs->len; i++) {
@@ -87,7 +87,7 @@ int generar_salida(char *data, t_BlockSort *bs, char *salida)
        return k;
 }
 
-void bs_solve(char *in, char *out, t_BlockSort *bs, unsigned long int *k, unsigned int leido)
+void bs_solve(char *in, char *out, t_BlockSort *bs, Uint32 *k, Uint32 leido)
 {
        unsigned int l;
        l = bs->len;
@@ -100,15 +100,14 @@ void bs_solve(char *in, char *out, t_BlockSort *bs, unsigned long int *k, unsign
        (*k) = generar_salida(in, bs, out);
 
        /* Guardo el k y el tamaño en el array */
-       memcpy(out, k, sizeof(unsigned long int));
-       memcpy(out+sizeof(unsigned long int), &leido, sizeof(unsigned long int));
-
+       memcpy(out, &leido, sizeof(Uint32));
+       memcpy(out+sizeof(Uint32), k, sizeof(Uint32));
        bs->len = l;
 }
 
-void bs_restore(char *dst, char *c, unsigned long int k, unsigned long int len)
+void bs_restore(char *dst, char *c, Uint32 k, Uint32 len)
 {
-       unsigned long int i, current;
+       Uint32 i, current;
        t_BlockSortDecode *in;
 
        in = malloc(sizeof(t_BlockSortDecode)*len);
@@ -129,7 +128,7 @@ void bs_restore(char *dst, char *c, unsigned long int k, unsigned long int len)
        free(in);
 }
 
-t_BlockSort *bs_create(unsigned long int len)
+t_BlockSort *bs_create(Uint32 len)
 {
        t_BlockSort *tmp;