X-Git-Url: https://git.llucax.com/z.facultad/75.52/treemulator.git/blobdiff_plain/e994ad95d6fcb7372527146482ce55cea669b6c9..354f66865d010a90b1d81c83bcaf55115e5859e1:/viewer/view_btree.cpp

diff --git a/viewer/view_btree.cpp b/viewer/view_btree.cpp
index 1180c93..7604293 100644
--- a/viewer/view_btree.cpp
+++ b/viewer/view_btree.cpp
@@ -5,57 +5,93 @@
 
 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):Canvas::Group (*parent, 0, 0),
-	BTree (filename, block_size)
+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 = 3 * block_size; // 64 == blocksize
-	byte_to_pixels  = node_width/block_size; // TODO : 64 == BlockSize
+	node_width = 4 * block_size;
+	node_height = 50;
+	byte_to_pixels  = node_width/block_size;
 
 	last_selected = NULL;
+	last_visited = 0;
 }
 
-void ViewBTree::AddNode (uint num)
+ViewBTree::ViewBTree (Canvas::Group *parent, const std::string filename)
+	:Canvas::Group (*parent, 0, 0), BTree (filename)
 {
-	if (node_placed[num]) {
-		std::cout << "WARNING : Tratando de agregar de nuevo el nodo " << num << std::endl;
-		return;
+	/* 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;
 
-	node_placed[num] = true;
-	/* Muestro la raiz */
-	double y = 0;
 	uchar *node = ReadBlock (num);
 
 	BTreeNodeHeader node_h;
 	ReadNodoHeader (node, &node_h);
 
-	if (num == 0) {
-		max_level = node_h.level;
-	} else {
-		y = (max_level - node_h.level)*(NODE_HEIGHT+10);
-	}
-
 	std::list<BTreeData *> keys = ReadKeys (node, node_h);
 
-	ViewNode *vnode = new ViewNode (this, num, node_h, keys);
-	vnode->property_y () = y;
-	vnode->property_x () = pos_x[node_h.level];
-	pos_x[node_h.level] += ViewBTree::node_width+10;
+	ViewNode *vnode = new ViewNode (this, num, padre, node_h, keys);
+	vnode->property_y () = 10;
+	vnode->property_x () = 10;
+
 	vnode->signal_selected().connect ( sigc::mem_fun (*this, &ViewBTree::on_item_selected) );
+	vnode->signal_activated().connect ( sigc::mem_fun (*this, &ViewBTree::on_item_activated) );
 
-	std::list<uint> childs = vnode->getChilds ();
-	std::list<uint>::iterator hit = childs.begin ();
-	while (hit != childs.end ()) {
-		if ((*hit) == 0) {
-			std::cout << "WARNING : Referencia a 0 encontrada!!" << std::endl;
-			hit = childs.end ();
-			continue;
-		}
-		AddNode (*hit);
-		hit++;
-	}
+	last_selected = vnode;
+}
+
+void ViewBTree::on_item_activated (BTreeData *data, uint num, ViewNode *vnode)
+{
+	last_selected = NULL;
+
+	uint next = data->GetChild ();
+	delete vnode;
+
+	std::cout << next << std::endl;
+	AddNode (next, 0);
 }
 
 void ViewBTree::on_item_selected (BTreeData *data, uint num, ViewNode *vnode)
@@ -71,7 +107,7 @@ 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);
 }
 
@@ -80,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);
+}
+