X-Git-Url: https://git.llucax.com/z.facultad/75.52/treemulator.git/blobdiff_plain/b4a23678596cdf0fd5993ec6650422a86d2012be..3d105729f2a5cd73307e6431a17c21a2c37de459:/viewer/view_btree.cpp diff --git a/viewer/view_btree.cpp b/viewer/view_btree.cpp index 582b776..a73f396 100644 --- a/viewer/view_btree.cpp +++ b/viewer/view_btree.cpp @@ -14,34 +14,70 @@ ViewBTree::ViewBTree (Canvas::Group *parent, std::string filename):Canvas::Group AddKey (c); } + Canvas::Rect *rect = new Canvas::Rect (*this, 0, 0, NODE_WIDTH, NODE_HEIGHT); + rect->property_fill_color() = "gray"; + + byte_to_pixels = NODE_WIDTH/64; // TODO : 64 == BlockSize + + AddNode (0); +} + +void ViewBTree::AddNode (uint num) +{ /* Muestro la raiz */ - uchar *node = ReadBlock (0); + double y = 0; + 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"; + if (num == 0) { + max_level = node_h.level; + } else { + y = (max_level - node_h.level)*(NODE_HEIGHT+10); + } - int byte_to_pixels = NODE_WIDTH/64; // TODO : 64 == BlockSize + std::list keys = ReadKeys (node, node_h); - /* Ahora pongo el lugar que opcupa el header */ double header_w = byte_to_pixels * sizeof (BTreeNodeHeader); double x = 0; - Canvas::Rect *view_header = new Canvas::Rect (*this, x, 0, x+header_w, NODE_HEIGHT); + 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 hijos; + std::list::iterator it = keys.begin (); while (it != keys.end ()) { BTreeData *data = (*it); double w = byte_to_pixels * data->Size (); - ViewBTreeData::Create (data, this, x, 0, w+x, NODE_HEIGHT); + ViewBTreeData *v = ViewBTreeData::Create (data, this, x, y, w+x, y+NODE_HEIGHT); x += w; it++; + + if (dynamic_cast(data)) { + BTreeChildData *child = dynamic_cast(data); + hijos.push_back (child->getChild ()); + } } + + std::list::iterator hit = hijos.begin (); + while (hit != hijos.end ()) { + AddNode (*hit); + hit++; + } }