#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
+void ViewBTree::GoBack ()
+{
+ uint l = back.top ();
+ back.pop ();
- AddNode (0);
+ Clear ();
+ AddNode (l, 1);
}
-void ViewBTree::AddNode (uint num)
+void ViewBTree::AddNode (uint num, uint padre)
{
- 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;
+ /* 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;
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;
+ 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;
+}
+
+void ViewBTree::on_item_activated (BTreeData *data, uint num, ViewNode *vnode)
+{
+ last_selected = NULL;
+
+ uint next = data->GetChild ();
+ delete vnode;
- 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++;
- }
+ std::cout << next << std::endl;
+ AddNode (next, 0);
}
-void ViewBTree::on_item_selected (BTreeData *data, uint num)
+void ViewBTree::on_item_selected (BTreeData *data, uint num, ViewNode *vnode)
{
BTreeNodeHeader node_h;
uchar *node;
ReadNodoHeader (node, &node_h);
delete [] node;
- std::cout << "Emit SignalSelected" << std::endl;
+ if (last_selected)
+ if (vnode != last_selected)
+ last_selected->SetSelected (false);
+ last_selected = vnode;
+
m_signal_selected (data, node_h);
}
return m_signal_selected;
}
+void ViewBTree::Clear ()
+{
+ if (last_selected)
+ delete last_selected;
+}
+
+void ViewBTree::HighliteKey (Clave &k)
+{
+ last_selected->HighliteKey (k);
+}
+