X-Git-Url: https://git.llucax.com/z.facultad/75.52/treemulator.git/blobdiff_plain/59b7476481f01388fcfd13492adbba7ef841755c..HEAD:/src/btree.cpp diff --git a/src/btree.cpp b/src/btree.cpp index 81af642..cce0759 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,11 @@ 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; + header.block_data_counter = 0; + strcpy (header.magic, "DILUMA"); + header.magic[6] = '\0'; WriteFileHeader (); /* Creo el primer bloque vacio */ @@ -33,9 +36,76 @@ 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); + } + + del = filename + ".blockdel"; + + fp = fopen (del.c_str (), "wb"); + if (fp != NULL) { + uint i; + + while (fread (&i, 1, sizeof (uint), fp)) { + deleted_block_data.push_back (i); + } + + fclose (fp); + } + + fp = fopen (name.c_str(), "rb+"); + if (!fp) { + /* TODO : mandar una exception ? */ + return; + } + filename = name; + 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++; + } + + del = filename + ".del"; + + fp = fopen (del.c_str (), "wb"); + it = deleted_block_data.begin (); + + while (it != deleted_block_data.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 +124,19 @@ void BTree::WriteBlock (uchar *block, uint num) void BTree::AddKey (const Clave &k) { uint left, right; - Clave *kout; + Clave *kout, *in; + + in = k.Clone (); + in->SetBlockData ( GetNextBlockData () ); 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 +218,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_IDENTIFICACION) { + if (header.tree_type == TYPE_IDENTIFICACION) { /* Verifico que la clave no existea ya en el arbol */ if ((*data) == (*datait)) { throw new AddException (); @@ -184,7 +259,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_IDENTIFICACION) { + if (header.tree_type == TYPE_IDENTIFICACION) { /* Verifico que la clave no existea ya en el arbol */ if ((*data) == (*datait)) { throw new AddException (); @@ -284,7 +359,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_IDENTIFICACION) { + if (header.tree_type == TYPE_IDENTIFICACION) { /* Verifico que la clave no existea ya en el arbol */ if ((*data) == (*(*it))) { throw new AddException (); @@ -320,7 +395,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_IDENTIFICACION) { + if (header.tree_type == TYPE_IDENTIFICACION) { /* Verifico que la clave no existea ya en el arbol */ if ((*data) == (*datait)) { throw new AddException (); @@ -362,7 +437,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_IDENTIFICACION) { + if (header.tree_type == TYPE_IDENTIFICACION) { /* Verifico que la clave no existea ya en el arbol */ if ((*data) == (*datait)) { throw new AddException (); @@ -533,6 +608,7 @@ void BTree::DelKeyFromLeaf (Clave *k, uint node_num, uint padre) if ((*data) == (*(*it))) { BTreeData *aborrar = (*it); node_keys.erase (it); + deleted_block_data.push_back (aborrar->GetKey ()->GetBlockData ()); delete aborrar; break; } @@ -1037,9 +1113,9 @@ std::list BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_heade for (uint i=0; iSize (); keys.push_back (data); @@ -1052,7 +1128,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 (); @@ -1067,7 +1143,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 (); @@ -1138,9 +1214,9 @@ uchar *BTree::NewBlock (uint &num) BTreeNodeHeader nh; std::list::iterator it; - it = deleted_nodes.begin (); - if (it != deleted_nodes.end ()) { + if (deleted_nodes.size ()) { + it = deleted_nodes.begin (); num = *it; deleted_nodes.erase (it); } else { @@ -1247,5 +1323,20 @@ void BTree::DeleteKeys (std::list &keys) int BTree::type () const { - return key_type; + return header.key_type; } + +uint BTree::GetNextBlockData () +{ + uint n; + if (deleted_block_data.size ()) { + std::list::iterator it = deleted_block_data.begin (); + n = *it; + deleted_block_data.erase (it); + } else { + n = header.block_data_counter++; + } + + return n; +} +