X-Git-Url: https://git.llucax.com/z.facultad/75.52/treemulator.git/blobdiff_plain/b4a23678596cdf0fd5993ec6650422a86d2012be..8e23e15f255365a35ebcf3a5cec7a4c356fc78b5:/viewer/view_btree.cpp diff --git a/viewer/view_btree.cpp b/viewer/view_btree.cpp index 582b776..7604293 100644 --- a/viewer/view_btree.cpp +++ b/viewer/view_btree.cpp @@ -1,47 +1,129 @@ #include "view_btree.h" #include "view_btree_data.h" +#include -ViewBTree::ViewBTree (Canvas::Group *parent, std::string filename):Canvas::Group (*parent, 0, 0), - BTree (filename, 64) +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, 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 = 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) { - /* 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 * header.block_size; + node_height = 50; + byte_to_pixels = node_width/header.block_size; - AddKey (c); + 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; } - /* Muestro la raiz */ - uchar *node = ReadBlock (0); + /* 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; ReadNodoHeader (node, &node_h); + std::list keys = ReadKeys (node, node_h); - Canvas::Rect *rect = new Canvas::Rect (*this, 0, 0, NODE_WIDTH, NODE_HEIGHT); - rect->property_fill_color() = "gray"; + ViewNode *vnode = new ViewNode (this, num, padre, node_h, keys); + vnode->property_y () = 10; + vnode->property_x () = 10; - int byte_to_pixels = NODE_WIDTH/64; // TODO : 64 == BlockSize + vnode->signal_selected().connect ( sigc::mem_fun (*this, &ViewBTree::on_item_selected) ); + vnode->signal_activated().connect ( sigc::mem_fun (*this, &ViewBTree::on_item_activated) ); - /* Ahora pongo el lugar que opcupa el header */ - double header_w = byte_to_pixels * sizeof (BTreeNodeHeader); - double x = 0; + last_selected = vnode; +} + +void ViewBTree::on_item_activated (BTreeData *data, uint num, ViewNode *vnode) +{ + last_selected = NULL; - Canvas::Rect *view_header = new Canvas::Rect (*this, x, 0, x+header_w, NODE_HEIGHT); - x += header_w; + uint next = data->GetChild (); + delete vnode; - std::list::iterator it = keys.begin (); - while (it != keys.end ()) { - BTreeData *data = (*it); - double w = byte_to_pixels * data->Size (); + std::cout << next << std::endl; + AddNode (next, 0); +} - ViewBTreeData::Create (data, this, x, 0, w+x, NODE_HEIGHT); +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; - x += w; - it++; - } + if (last_selected) + if (vnode != last_selected) + last_selected->SetSelected (false); + last_selected = vnode; + m_signal_selected (data, node_h); +} + +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); }