Muestro los datos borrados y que son recuperables.

[z.facultad/75.52/treemulator.git] / viewer / view_btree.cpp

diff --git a/viewer/view_btree.cpp b/viewer/view_btree.cpp
index 3fba848252c01d506c56fcc8a30093cceb366847..760429323e512325ed47b7312c30ebd2f8e23506 100644 (file)
--- a/viewer/view_btree.cpp
+++ b/viewer/view_btree.cpp
@@ -7,19 +7,65 @@ double ViewBTree::byte_to_pixels = 0;
 double ViewBTree::node_width = 0;
 double ViewBTree::node_height = 0;
 
-ViewBTree::ViewBTree (Canvas::Group *parent, std::string filename, uint block_size, int type):Canvas::Group (*parent, 0, 0),
-       BTree (filename, block_size, type)
+ViewBTree::ViewBTree (Canvas::Group *parent, std::string filename, uint block_size, int tree_type, int type):Canvas::Group (*parent, 0, 0),
+       BTree (filename, block_size, tree_type, type)
 {
        /* Cada bytes lo hago de 5 units de ancho */
-       node_width = 5 * block_size;
-       node_height = node_width/10;
+       node_width = 4 * block_size;
+       node_height = 50;
        byte_to_pixels  = node_width/block_size;
 
        last_selected = NULL;
+       last_visited = 0;
+}
+
+ViewBTree::ViewBTree (Canvas::Group *parent, const std::string filename)
+       :Canvas::Group (*parent, 0, 0), BTree (filename)
+{
+       /* Cada bytes lo hago de 5 units de ancho */
+       node_width = 4 * header.block_size;
+       node_height = 50;
+       byte_to_pixels  = node_width/header.block_size;
+
+       last_selected = NULL;
+       last_visited = 0;
+}
+
+ViewBTree* ViewBTree::Open (Canvas::Group *parent, const std::string &filename)
+{
+       ViewBTree *tree = new ViewBTree (parent, filename);
+
+       if (tree->fp == NULL) {
+               delete tree;
+               return NULL;
+       }
+
+       /* El magic no coincide!! */
+       if (strcmp (tree->header.magic, "DILUMA")) {
+               delete tree;
+               return NULL;
+       }
+       return tree;
+}
+
+void ViewBTree::GoBack ()
+{
+       uint l = back.top ();
+       back.pop ();
+
+       Clear ();
+       AddNode (l, 1);
 }
 
 void ViewBTree::AddNode (uint num, uint padre)
 {
+       /* Hack de ultima hora :P */
+       if (padre == 0)
+               /* evito quedar en circulo :D */
+               back.push (last_visited);
+
+       last_visited = num;
+
        uchar *node = ReadBlock (num);
 
        BTreeNodeHeader node_h;
@@ -45,7 +91,7 @@ void ViewBTree::on_item_activated (BTreeData *data, uint num, ViewNode *vnode)
        delete vnode;
 
        std::cout << next << std::endl;
-       AddNode (next, num);
+       AddNode (next, 0);
 }
 
 void ViewBTree::on_item_selected (BTreeData *data, uint num, ViewNode *vnode)
@@ -61,7 +107,6 @@ void ViewBTree::on_item_selected (BTreeData *data, uint num, ViewNode *vnode)
                if (vnode != last_selected)
                        last_selected->SetSelected (false);
        last_selected = vnode;
-       vnode->SetSelected (true);
 
        m_signal_selected (data, node_h);
 }
@@ -71,3 +116,14 @@ ViewBTree::type_signal_selected ViewBTree::signal_selected ()
        return m_signal_selected;
 }
 
+void ViewBTree::Clear ()
+{
+       if (last_selected)
+               delete last_selected;
+}
+
+void ViewBTree::HighliteKey (Clave &k)
+{
+       last_selected->HighliteKey (k);
+}
+