#include "view_btree.h"
#include "view_btree_data.h"
+#include <sigc++/slot.h>
-ViewBTree::ViewBTree (Canvas::Group *parent, std::string filename):Canvas::Group (*parent, 0, 0),
- BTree (filename, 64)
-{
- /* 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);
-
- AddKey (c);
- }
-
- Canvas::Rect *rect = new Canvas::Rect (*this, 0, 0, NODE_WIDTH, NODE_HEIGHT);
- rect->property_fill_color() = "gray";
+double ViewBTree::byte_to_pixels = 0;
+double ViewBTree::node_width = 0;
- byte_to_pixels = NODE_WIDTH/64; // TODO : 64 == BlockSize
+ViewBTree::ViewBTree (Canvas::Group *parent, std::string filename, uint block_size):Canvas::Group (*parent, 0, 0),
+ BTree (filename, block_size)
+{
+ /* 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
- AddNode (0);
+ last_selected = NULL;
}
void ViewBTree::AddNode (uint num)
{
+ if (node_placed[num]) {
+ std::cout << "WARNING : Tratando de agregar de nuevo el nodo " << num << std::endl;
+ return;
+ }
+
+ node_placed[num] = true;
/* Muestro la raiz */
double y = 0;
uchar *node = ReadBlock (num);
std::list<BTreeData *> keys = ReadKeys (node, node_h);
- double header_w = byte_to_pixels * sizeof (BTreeNodeHeader);
- double x = 0;
-
- Canvas::Rect *view_header = new Canvas::Rect (*this, x, y, x+header_w, y+NODE_HEIGHT);
- view_header->property_fill_color() = "blue";
-
- /* Numero de nodo */
- std::string node_num;
- std::stringstream ss;
- ss << num;
- ss >> node_num;
- new Canvas::Text (*this, header_w/2, y+NODE_HEIGHT/2, node_num);
-
- x += header_w;
-
- /* Cuento los hijos para saber como centrarlos más adelante */
- std::list<uint> hijos;
-
- std::list<BTreeData *>::iterator it = keys.begin ();
- while (it != keys.end ()) {
- BTreeData *data = (*it);
- double w = byte_to_pixels * data->Size ();
-
- ViewBTreeData *v = ViewBTreeData::Create (data, this, x, y, w+x, y+NODE_HEIGHT);
-
- x += w;
- it++;
-
- if (dynamic_cast<BTreeChildData *>(data)) {
- BTreeChildData *child = dynamic_cast<BTreeChildData *>(data);
- hijos.push_back (child->getChild ());
+ 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;
+ vnode->signal_selected().connect ( sigc::mem_fun (*this, &ViewBTree::on_item_selected) );
+
+ 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;
}
- }
-
-
- std::list<uint>::iterator hit = hijos.begin ();
- while (hit != hijos.end ()) {
AddNode (*hit);
hit++;
}
}
+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;
+
+ if (last_selected)
+ if (vnode != last_selected)
+ last_selected->SetSelected (false);
+ last_selected = vnode;
+ vnode->SetSelected (true);
+ m_signal_selected (data, node_h);
+}
+
+ViewBTree::type_signal_selected ViewBTree::signal_selected ()
+{
+ return m_signal_selected;
+}
+