X-Git-Url: https://git.llucax.com/z.facultad/75.52/treemulator.git/blobdiff_plain/5ade66d0aa29a2fed034a93326a49b2edcd2e7ec..2f18bb22e1573898bb70f0a46897fbd032ef2734:/src/btree.cpp?ds=sidebyside diff --git a/src/btree.cpp b/src/btree.cpp index ddcb14c..77967bf 100644 --- a/src/btree.cpp +++ b/src/btree.cpp @@ -3,8 +3,6 @@ BTree::BTree (const std::string &name, unsigned int block_size, int tt, int kt, bool create_new_file) { - key_type = kt; - tree_type = tt; uchar *node; BTreeNodeHeader nh; @@ -19,6 +17,8 @@ BTree::BTree (const std::string &name, unsigned int block_size, int tt, int kt, /* Inicializo el header */ header.block_size = block_size; + header.tree_type = tt; + header.key_type = kt; WriteFileHeader (); /* Creo el primer bloque vacio */ @@ -33,9 +33,52 @@ BTree::BTree (const std::string &name, unsigned int block_size, int tt, int kt, delete [] node; } +BTree::BTree (const std::string &name) +{ + /* Leo los bloques recuperables */ + std::string del = filename + ".del"; + + fp = fopen (del.c_str (), "wb"); + if (fp != NULL) { + uint i; + + while (fread (&i, 1, sizeof (uint), fp)) { + deleted_nodes.push_back (i); + } + + fclose (fp); + } + + fp = fopen (name.c_str(), "rb+"); + if (!fp) { + /* TODO : mandar una exception ? */ + return; + } + ReadFileHeader (); +} + BTree::~BTree () { fclose (fp); + + std::string del = filename + ".del"; + + fp = fopen (del.c_str (), "wb"); + std::list::iterator it = deleted_nodes.begin (); + + while (it != deleted_nodes.end ()) { + uint i = *it; + fwrite (&i, 1, sizeof (uint), fp); + it++; + } + + fclose (fp); +} + +void BTree::ReadFileHeader () +{ + fseek (fp, 0L, SEEK_SET); + fread (&header, 1, sizeof (BTreeFileHeader), fp); } void BTree::WriteFileHeader () @@ -54,14 +97,20 @@ void BTree::WriteBlock (uchar *block, uint num) void BTree::AddKey (const Clave &k) { uint left, right; - Clave *kout; + Clave *kout, *in; + + in = k.Clone (); + /* TODO : Hacer un contador con recuperacion */ + in->SetBlockData (0); try { - kout = AddKeyR (k.Clone (), 0, left, right); + kout = AddKeyR (in->Clone (), 0, left, right); } catch (Exception *e) { throw e; } + delete in; + if (kout) { unsigned short level; /* Debo dejar la raiz en el nodo 0, por lo que paso el nodo @@ -143,7 +192,7 @@ Clave* BTree::AddKeyLeafR (const Clave *k, uint node_num, uint &left_child, uint while (it != node_keys.end ()) { datait = (*it); - if (tree_type == TYPE_UNIQUE) { + if (header.tree_type == TYPE_IDENTIFICACION) { /* Verifico que la clave no existea ya en el arbol */ if ((*data) == (*datait)) { throw new AddException (); @@ -184,7 +233,7 @@ Clave* BTree::AddKeyLeafR (const Clave *k, uint node_num, uint &left_child, uint while (it != node_keys.end ()) { BTreeData *datait; datait = (*it); - if (tree_type == TYPE_UNIQUE) { + if (header.tree_type == TYPE_IDENTIFICACION) { /* Verifico que la clave no existea ya en el arbol */ if ((*data) == (*datait)) { throw new AddException (); @@ -284,7 +333,7 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin posterior = it; while (it != node_keys.end ()) { - if (tree_type == TYPE_UNIQUE) { + if (header.tree_type == TYPE_IDENTIFICACION) { /* Verifico que la clave no existea ya en el arbol */ if ((*data) == (*(*it))) { throw new AddException (); @@ -320,7 +369,7 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin while (it != node_keys.end ()) { datait = (*it); - if (tree_type == TYPE_UNIQUE) { + if (header.tree_type == TYPE_IDENTIFICACION) { /* Verifico que la clave no existea ya en el arbol */ if ((*data) == (*datait)) { throw new AddException (); @@ -362,7 +411,7 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin while (it != node_keys.end ()) { BTreeData *datait; datait = (*it); - if (tree_type == TYPE_UNIQUE) { + if (header.tree_type == TYPE_IDENTIFICACION) { /* Verifico que la clave no existea ya en el arbol */ if ((*data) == (*datait)) { throw new AddException (); @@ -714,13 +763,15 @@ void BTree::JoinNodes (uint node1, uint node2, uint padre, int tipohermano) WriteNodoHeader (npadre, &nhp); WriteBlock (npadre, padre); - /* TODO: Recuperar nodo1 y nodo2 */ + deleted_nodes.push_back (node1); + deleted_nodes.push_back (node2); } else { WriteKeys (n1, nh1, newkeys); WriteNodoHeader (n1, &nh1); WriteBlock (n1, node1); - /* TODO : Recuperar node2 */ + deleted_nodes.push_back (node2); + /* Actualizo punero al padre */ (*anterior)->SetChild (node1); @@ -1035,9 +1086,9 @@ std::list BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_heade for (uint i=0; iSize (); keys.push_back (data); @@ -1050,7 +1101,7 @@ std::list BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_heade void BTree::AbrevKey (std::list &lst) { /* Claves Fijas No se abrevian */ - if (key_type == KEY_FIXED) return; + if (header.key_type == KEY_FIXED) return; BTreeData *primera = NULL; std::list::iterator it = lst.begin (); @@ -1065,7 +1116,7 @@ void BTree::AbrevKey (std::list &lst) void BTree::DeAbrevKey (std::list &lst) { /* Claves Fijas No se abrevian */ - if (key_type == KEY_FIXED) return; + if (header.key_type == KEY_FIXED) return; BTreeData *primera = NULL; std::list::iterator it = lst.begin (); @@ -1135,11 +1186,18 @@ uchar *BTree::NewBlock (uint &num) uchar *node; BTreeNodeHeader nh; - fseek (fp, 0, SEEK_END); - filelen = ftell (fp); + std::list::iterator it; - num = filelen/header.block_size - 1; + if (deleted_nodes.size ()) { + it = deleted_nodes.begin (); + num = *it; + deleted_nodes.erase (it); + } else { + fseek (fp, 0, SEEK_END); + filelen = ftell (fp); + num = filelen/header.block_size - 1; + } node = new uchar[header.block_size]; ReadNodoHeader (node, &nh); nh.level = 0; @@ -1235,3 +1293,8 @@ void BTree::DeleteKeys (std::list &keys) it++; } } + +int BTree::type () const +{ + return header.key_type; +}