Agrego WriteKeys

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

diff --git a/src/btree.cpp b/src/btree.cpp
index a2853927f3221f41c149ba4bd56511d5011c1a8a..9591ec890afacc4fb2689910acc3cc84695253a9 100644 (file)
--- a/src/btree.cpp
+++ b/src/btree.cpp
@@ -48,13 +48,18 @@ void BTree::write_block (uchar *block, uint num)
        fwrite (block, 1, header.block_size, fp);
 }
 
        fwrite (block, 1, header.block_size, fp);
 }
 

-void BTree::AddKey (Clave &k)
+void BTree::AddKey (const Clave &k)

 {
 {

+       std::list<Clave *> node_keys;
+

        /* Leo el nodo raiz para empezar a agregar */
        uchar *root = ReadBlock (0);
        BTreeNodeHeader root_header;
        ReadNodoHeader (root, &root_header);
 
        /* Leo el nodo raiz para empezar a agregar */
        uchar *root = ReadBlock (0);
        BTreeNodeHeader root_header;
        ReadNodoHeader (root, &root_header);
 

+       node_keys = ReadKeys (root, root_header);
+       std::cout << node_keys.size () << std::endl;
+       

        if (root_header.free_space >= k.Size ()) {
                std::cout << "Hay lugar para meter la clave" << std::endl;
        } else {
        if (root_header.free_space >= k.Size ()) {
                std::cout << "Hay lugar para meter la clave" << std::endl;
        } else {


@@ -64,7 +69,7 @@ void BTree::AddKey (Clave &k)
        delete [] root;
 }
 
        delete [] root;
 }
 

-void BTree::DelKey (Clave &k) {}
+void BTree::DelKey (const Clave &k) {}

 
 void BTree::ReadNodoHeader (uchar *node, BTreeNodeHeader *header)
 {
 
 void BTree::ReadNodoHeader (uchar *node, BTreeNodeHeader *header)
 {


@@ -86,3 +91,36 @@ uchar *BTree::ReadBlock (uint num)
        return out;
 }
 
        return out;
 }
 

+std::list<Clave *> BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_header)
+{
+       std::list<Clave *> keys;
+       node += sizeof (BTreeNodeHeader);
+
+       for (uint i=0; i<node_header.item_count; i++) {
+               /* TODO : El tipo de clave deberia ser usado 
+                * dependiendo de algun dato en el header del
+                * arbol
+                */
+               ClaveFija *k = new ClaveFija (node);
+               node += k->Size ();
+               keys.push_back (k);
+       }
+
+       return keys;
+}
+
+void BTree::WriteKeys (uchar *node, BTreeNodeHeader &node_header, std::list<Clave *> &keys)
+{
+       std::list<Clave *>::iterator it = keys.begin ();
+
+       node += sizeof (BTreeNodeHeader);
+
+       while (it != keys.end ()) {
+               Clave *c = (*it);
+               memcpy (node, c->ToArray(), c->Size ());
+               node += c->Size ();
+               it++;
+       }
+
+       /* TODO : incrementar node_header.item_count aca o fuera de este metodo? */
+}