double ViewBTree::node_width = 0;
double ViewBTree::node_height = 0;
-ViewBTree::ViewBTree (Canvas::Group *parent, std::string filename, uint block_size, int type):Canvas::Group (*parent, 0, 0),
- BTree (filename, block_size, type)
+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 = 5 * block_size;
- node_height = node_width/10;
+ node_width = 4 * block_size;
+ node_height = 50;
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;
delete vnode;
std::cout << next << std::endl;
- AddNode (next, num);
+ AddNode (next, 0);
}
void ViewBTree::on_item_selected (BTreeData *data, uint num, ViewNode *vnode)