X-Git-Url: https://git.llucax.com/z.facultad/75.52/treemulator.git/blobdiff_plain/de3b0cb3cb22673c55c267a6cfd0428df0a084f8..354f66865d010a90b1d81c83bcaf55115e5859e1:/viewer/view_btree.cpp?ds=sidebyside

diff --git a/viewer/view_btree.cpp b/viewer/view_btree.cpp
index 6a1fd16..7604293 100644
--- a/viewer/view_btree.cpp
+++ b/viewer/view_btree.cpp
@@ -16,10 +16,56 @@ ViewBTree::ViewBTree (Canvas::Group *parent, std::string filename, uint block_si
 	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)