X-Git-Url: https://git.llucax.com/z.facultad/75.52/treemulator.git/blobdiff_plain/8901847acf5d6c8b4c2865c4b00dc8a1003cecdb..88f6f1c9a8861bed8d1907001a10c4605e268a5e:/src/btree.cpp diff --git a/src/btree.cpp b/src/btree.cpp index e6c0cf4..e28bf9e 100644 --- a/src/btree.cpp +++ b/src/btree.cpp @@ -103,21 +103,43 @@ Clave* BTree::AddKeyR (const Clave *k, uint node_num, uint &left_child, uint &ri ReadNodoHeader (node, &node_header); if (node_header.level != 0) { + std::cout << "Entrando nodo level = " << node_header.level << std::endl; /* No estoy en una hoja, asi que tengo que buscar * para donde moverme para agregar la clave */ - /* TODO :) */ + std::cout << "Leo Claves" << std::endl; node_keys = ReadKeys (node, node_header); + std::list::iterator it = node_keys.begin (); + std::list::iterator posterior; + std::list::iterator ultima; /* Se supone que la primera es un hijo :) */ - //BTreeData *left_child = (*it); - PrintNode (node_num); - std::cout << "TODO!!" << std::endl; - return NULL; + BTreeData *lchild = (*it++); + posterior = it; + + while (it != node_keys.end ()) { + if ((*data) < (*(*it))) + break; + ultima = it; + it++; + } + + if (it == posterior) { + std::cout << "==== Me voy al nodo " << lchild->getChild () << std::endl; + k = AddKeyR (k, lchild->getChild (), left_child, right_child); + } else { + std::cout << "==== Me voy al nodo " << (*ultima)->getChild () << std::endl; + k = AddKeyR (k, (*ultima)->getChild (), left_child, right_child); + } + if (k) + data = new BTreeData (k->Clone (), right_child); } + /* Nada que hacer */ + if (!k) return NULL; + /* Estoy en una hoja, veo si lo puedo agregar */ if (node_header.free_space > data->Size ()) { @@ -317,7 +339,7 @@ void BTree::PrintNode (uint num) std::cout << "Free : " << node_header.free_space << " (" << (header.block_size - sizeof (BTreeNodeHeader)) << ")" << std::endl; while (it != node_keys.end ()) { std::string s = *(*it); - std::cout << s << " "; + std::cout << s << " "; it++; } std::cout << std::endl;