#include "view_btree.h"
#include "view_btree_data.h"
-
+#include <sigc++/slot.h>
+
double ViewBTree::byte_to_pixels = 0;
+double ViewBTree::node_width = 0;
+double ViewBTree::node_height = 0;
-ViewBTree::ViewBTree (Canvas::Group *parent, std::string filename):Canvas::Group (*parent, 0, 0),
- BTree (filename, 64)
+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)
{
- /* TODO : hace que el arbol se abra de un archivo ya creado o que se
- * cree afuera
- */
- for (int i=0; i<=64; i++) {
- ClaveFija c(i);
+ /* Cada bytes lo hago de 5 units de ancho */
+ node_width = 4 * block_size;
+ node_height = 50;
+ byte_to_pixels = node_width/block_size;
- AddKey (c);
- }
+ last_selected = NULL;
+ last_visited = 0;
+}
- byte_to_pixels = NODE_WIDTH/64; // TODO : 64 == BlockSize
+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;
- AddNode (0);
+ last_selected = NULL;
+ last_visited = 0;
}
-void ViewBTree::AddNode (uint num)
+ViewBTree* ViewBTree::Open (Canvas::Group *parent, const std::string &filename)
{
- if (node_placed[num]) {
- std::cout << "WARNING : Tratando de agregar de nuevo el nodo " << num << std::endl;
- return;
+ 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] += NODE_WIDTH+10;
-
- 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++;
- }
+ 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) );
+
+ last_selected = vnode;
}
-ViewNode::ViewNode (Canvas::Group *parent, uint num, BTreeNodeHeader &header, std::list<BTreeData *> &keys)
- : Canvas::Group (*parent)
+void ViewBTree::on_item_activated (BTreeData *data, uint num, ViewNode *vnode)
{
- double header_w = ViewBTree::byte_to_pixels * sizeof (BTreeNodeHeader);
+ last_selected = NULL;
- /* Fondo */
- Canvas::Rect *fondo = new Canvas::Rect (*this, 0, 0, NODE_WIDTH, NODE_HEIGHT);
- fondo->property_fill_color() = "gray";
- fondo->property_outline_color() = "black";
+ uint next = data->GetChild ();
+ delete vnode;
- /* Header */
- Canvas::Rect *h = new Canvas::Rect (*this, 0, 0, header_w, NODE_HEIGHT);
- h->property_fill_color() = "blue";
- h->property_outline_color() = "black";
+ std::cout << next << std::endl;
+ AddNode (next, 0);
+}
- /* Numero de nodo */
- std::string node_num;
- std::stringstream ss;
- ss << num;
- ss >> node_num;
- new Canvas::Text (*this, header_w/2, NODE_HEIGHT/2, node_num);
+void ViewBTree::on_item_selected (BTreeData *data, uint num, ViewNode *vnode)
+{
+ BTreeNodeHeader node_h;
+ uchar *node;
+
+ node = ReadBlock (num);
+ ReadNodoHeader (node, &node_h);
+ delete [] node;
- double x = header_w;
+ if (last_selected)
+ if (vnode != last_selected)
+ last_selected->SetSelected (false);
+ last_selected = vnode;
- std::list<BTreeData *>::iterator it = keys.begin ();
- while (it != keys.end ()) {
- BTreeData *data = (*it);
- double w = ViewBTree::byte_to_pixels * data->Size ();
+ m_signal_selected (data, node_h);
+}
- ViewBTreeData *v = ViewBTreeData::Create (data, this, x, 0, w+x, NODE_HEIGHT);
+ViewBTree::type_signal_selected ViewBTree::signal_selected ()
+{
+ return m_signal_selected;
+}
- x += w;
- it++;
+void ViewBTree::Clear ()
+{
+ if (last_selected)
+ delete last_selected;
+}
- if (!dynamic_cast<BTreeLeafData *>(data)) {
- /* Si no es un dato de una hoja, tiene hijos */
- hijos.push_back (data->getChild ());
- }
- }
+void ViewBTree::HighliteKey (Clave &k)
+{
+ last_selected->HighliteKey (k);
}
projects / z.facultad / 75.52 / treemulator.git / blobdiff