Reemplaza <> por [] en la documentación para que no se vuelva loco el HTML.

[z.facultad/75.52/treemulator.git] / src / btree.cpp

diff --git a/src/btree.cpp b/src/btree.cpp
index 5b1c36dcd2ee7b3163805e7567fce8b533f22134..e78a91e406688633f1818fad4464e9776f9b8c03 100644 (file)
--- a/src/btree.cpp
+++ b/src/btree.cpp
@@ -1,9 +1,8 @@
 
 #include "btree.h"
 
-BTree::BTree (const std::string &name, unsigned int block_size, int kt, bool create_new_file)
+BTree::BTree (const std::string &name, unsigned int block_size, int tt, int kt, bool create_new_file)
 {
-       key_type = kt;
        uchar *node;
        BTreeNodeHeader nh;
 
@@ -18,6 +17,8 @@ BTree::BTree (const std::string &name, unsigned int block_size, int kt, bool cre
        
        /* Inicializo el header */
        header.block_size = block_size;
+       header.tree_type = tt;
+       header.key_type = kt;
        WriteFileHeader ();
 
        /* Creo el primer bloque vacio */
@@ -32,9 +33,52 @@ BTree::BTree (const std::string &name, unsigned int block_size, int kt, bool cre
        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<uint>::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 ()
@@ -53,7 +97,13 @@ void BTree::WriteBlock (uchar *block, uint num)
 void BTree::AddKey (const Clave &k)
 {
        uint left, right;
-       Clave *kout = AddKeyR (&k, 0, left, right);
+       Clave *kout;
+
+       try {
+               kout = AddKeyR (k.Clone (), 0, left, right);
+       } catch (Exception *e) {
+               throw e;
+       }
 
        if (kout) {
                unsigned short level;
@@ -102,10 +152,19 @@ Clave* BTree::AddKeyR (const Clave *k, uint node_num, uint &left_child, uint &ri
        ReadNodoHeader (node, &node_header);
        delete [] node;
 
-       if (node_header.level == 0)
-               return AddKeyLeafR (k, node_num, left_child, right_child);
+       if (node_header.level == 0) {
+               try {
+                       return AddKeyLeafR (k, node_num, left_child, right_child);
+               } catch (Exception *e) {
+                       throw e;
+               }
+       }
 
-       return AddKeyOtherR (k, node_num, left_child, right_child);
+       try {
+               return AddKeyOtherR (k, node_num, left_child, right_child);
+       } catch (Exception *e) {
+               throw e;
+       }
 }
 
 Clave* BTree::AddKeyLeafR (const Clave *k, uint node_num, uint &left_child, uint &right_child)
@@ -127,6 +186,14 @@ Clave* BTree::AddKeyLeafR (const Clave *k, uint node_num, uint &left_child, uint
 
                while (it != node_keys.end ()) {
                        datait = (*it);
+                       if (header.tree_type == TYPE_IDENTIFICACION) {
+                               /* Verifico que la clave no existea ya en el arbol */
+                               if ((*data) == (*datait)) {
+                                       throw new AddException ();
+                                       return NULL;
+                               }
+                       }
+       
                        if ((*data) < (*datait))
                                /* Me pase, lo agrego aca! */
                                break;
@@ -160,6 +227,13 @@ Clave* BTree::AddKeyLeafR (const Clave *k, uint node_num, uint &left_child, uint
                while (it != node_keys.end ()) {
                        BTreeData *datait;
                        datait = (*it);
+                       if (header.tree_type == TYPE_IDENTIFICACION) {
+                               /* Verifico que la clave no existea ya en el arbol */
+                               if ((*data) == (*datait)) {
+                                       throw new AddException ();
+                                       return NULL;
+                               }
+                       }
                        if ((*data) < (*datait))
                                /* Me pase, lo agrego aca! */
                                break;
@@ -253,6 +327,13 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin
        posterior = it;
 
        while (it != node_keys.end ()) {
+               if (header.tree_type == TYPE_IDENTIFICACION) {
+                       /* Verifico que la clave no existea ya en el arbol */
+                       if ((*data) == (*(*it))) {
+                               throw new AddException ();
+                               return NULL;
+                       }
+               }
                if ((*data) < (*(*it)))
                        break;
                ultima = it;
@@ -282,6 +363,13 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin
 
                while (it != node_keys.end ()) {
                        datait = (*it);
+                       if (header.tree_type == TYPE_IDENTIFICACION) {
+                               /* Verifico que la clave no existea ya en el arbol */
+                               if ((*data) == (*datait)) {
+                                       throw new AddException ();
+                                       return NULL;
+                               }
+                       }
                        if ((*data) < (*datait))
                                /* Me pase, lo agrego aca! */
                                break;
@@ -317,6 +405,13 @@ Clave* BTree::AddKeyOtherR (const Clave *k, uint node_num, uint &left_child, uin
                while (it != node_keys.end ()) {
                        BTreeData *datait;
                        datait = (*it);
+                       if (header.tree_type == TYPE_IDENTIFICACION) {
+                               /* Verifico que la clave no existea ya en el arbol */
+                               if ((*data) == (*datait)) {
+                                       throw new AddException ();
+                                       return NULL;
+                               }
+                       }
                        if ((*data) < (*datait))
                                /* Me pase, lo agrego aca! */
                                break;
@@ -662,13 +757,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);
        
@@ -983,9 +1080,9 @@ std::list<BTreeData *> BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_heade
        for (uint i=0; i<count; i++) {
                BTreeData *data;
                if (node_header.level == 0) {
-                       data = new BTreeLeafData (node, key_type);
+                       data = new BTreeLeafData (node, header.key_type);
                } else {
-                       data = new BTreeData (node, key_type);
+                       data = new BTreeData (node, header.key_type);
                }
                node += data->Size ();
                keys.push_back (data);
@@ -998,7 +1095,7 @@ std::list<BTreeData *> BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_heade
 void BTree::AbrevKey (std::list<BTreeData *> &lst)
 {
        /* Claves Fijas No se abrevian */
-       if (key_type == KEY_FIXED) return;
+       if (header.key_type == KEY_FIXED) return;
 
        BTreeData *primera = NULL;
        std::list<BTreeData *>::iterator it = lst.begin ();
@@ -1013,7 +1110,7 @@ void BTree::AbrevKey (std::list<BTreeData *> &lst)
 void BTree::DeAbrevKey (std::list<BTreeData *> &lst)
 {
        /* Claves Fijas No se abrevian */
-       if (key_type == KEY_FIXED) return;
+       if (header.key_type == KEY_FIXED) return;
 
        BTreeData *primera = NULL;
        std::list<BTreeData *>::iterator it = lst.begin ();
@@ -1083,11 +1180,18 @@ uchar *BTree::NewBlock (uint &num)
        uchar *node;
        BTreeNodeHeader nh;
 
-       fseek (fp, 0, SEEK_END);
-       filelen = ftell (fp);
+       std::list<uint>::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;
@@ -1183,3 +1287,8 @@ void BTree::DeleteKeys (std::list<BTreeData *> &keys)
                it++;
        }
 }
+
+int BTree::type () const
+{
+       return header.key_type;
+}