Agrego funciones para obtener menor y mayor claves del arbol y las asigno a punteros...

[z.facultad/75.06/emufs.git] / emufs_gui / tree_viewer.c

diff --git a/emufs_gui/tree_viewer.c b/emufs_gui/tree_viewer.c
index 34fe6f2d1b34f968a5150ace6d5c8504606c2068..7f83b26a74092bf009a1f386048e379f19a4da4a 100644 (file)
--- a/emufs_gui/tree_viewer.c
+++ b/emufs_gui/tree_viewer.c
@@ -10,7 +10,7 @@ int emufs_indice_b_ver(INDICE *idx, WINDOW *win, int w, int h, int id)
        char *nodo;
        char tmp[100];
        int i;
        char *nodo;
        char tmp[100];
        int i;

-       int posibles_proximos[100];
+       int posibles_proximos[1000];

        int proximo;
 
        if (id == -1) return 0;
        int proximo;
 
        if (id == -1) return 0;


@@ -44,6 +44,7 @@ int emufs_indice_b_ver(INDICE *idx, WINDOW *win, int w, int h, int id)
                wmove(win, y, 0);
                sprintf(tmp, "%d", header.hijo_izquierdo);
                waddstr(win, tmp);
                wmove(win, y, 0);
                sprintf(tmp, "%d", header.hijo_izquierdo);
                waddstr(win, tmp);

+               fprintf(stderr, "CANT DE CLAVES = %d\n", header.cant);

                for(i=0; i<header.cant; i++) {
                        sprintf(tmp, "(%d)%d",
                                        claves[i].clave.i_clave,
                for(i=0; i<header.cant; i++) {
                        sprintf(tmp, "(%d)%d",
                                        claves[i].clave.i_clave,