DoxyDoc.

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

diff --git a/src/btree_data.cpp b/src/btree_data.cpp
index 5e351ce5ecbdd65268beb13caea32742be9badf7..bc0ce93c08882c4dd107b515429fddb497e151a4 100644 (file)
--- a/src/btree_data.cpp
+++ b/src/btree_data.cpp
@@ -1,47 +1,112 @@
 
 #include "btree_data.h"
 
 #include "btree_data.h"

+#include "btree.h"

 
 

-BTreeData::BTreeData (uchar *node)
+BTreeData::BTreeData (uchar *node, int tree_type)

 {
        /* TODO : Aca deberia detectar el tipo de clave (necesito
         * info desde el arbol
         */
 {
        /* TODO : Aca deberia detectar el tipo de clave (necesito
         * info desde el arbol
         */

-       clave = new ClaveFija (node);
+       if (tree_type == BTree::KEY_FIXED)
+               clave = new ClaveFija (node);
+       else
+               clave = new ClaveVariable (node);

        node += clave->Size ();
 
        node += clave->Size ();
 

-       memcpy (&hijo_izquierdo, node, sizeof (uint));
+       memcpy (&hijo, node, sizeof (uint));
+}
+
+BTreeData::BTreeData (Clave *k, uint child)
+{
+       clave = k;
+       hijo = child;

 }
 
 BTreeData::~BTreeData ()
 {
 }
 
 BTreeData::~BTreeData ()
 {

+       if (clave)
+               delete clave;

 }
 
 }
 

-uint BTreeData::Size ()
+uint BTreeData::Size () const

 {
        uint s = sizeof (uint);
        if (clave) s += clave->Size ();
 {
        uint s = sizeof (uint);
        if (clave) s += clave->Size ();

-
+       else std::cout << "No tengo clave\n";

        return s;
 }
 
        return s;
 }
 

-uchar* BTreeData::ToArray ()
+uchar* BTreeData::ToArray () const

 {
        uchar *out = new uchar[Size()];
 {
        uchar *out = new uchar[Size()];

-       memcpy (out, clave->ToArray (), clave->Size ());
-       memcpy (out+clave->Size (), &hijo_izquierdo, sizeof (uint));
+       if (clave) {
+               uchar *n = clave->ToArray ();
+               memcpy (out, n, clave->Size ());
+               memcpy (out+clave->Size (), &hijo, sizeof (uint));
+               delete [] n;
+       } else
+               memcpy (out, &hijo, sizeof (uint));

        return out;
 }
 
        return out;
 }
 

+bool BTreeData::operator < (const BTreeData &data) const
+{
+       if (!data.clave) return false;
+
+       return (*clave) < (*(data.clave));
+}
+
+bool BTreeData::operator == (const BTreeData &data) const
+{
+       if (!data.clave) return false;
+
+       return (*clave) == (*(data.clave));
+}
+
+BTreeLeafData::BTreeLeafData (uchar *node, int key_type)
+{
+       if (key_type == BTree::KEY_FIXED)
+               clave = new ClaveFija (node);
+       else
+               clave = new ClaveVariable (node);
+}
+

 BTreeLeafData::~BTreeLeafData ()
 {
 }
 
 BTreeLeafData::~BTreeLeafData ()
 {
 }
 

-uint BTreeLeafData::Size ()
+uint BTreeLeafData::Size () const

 {
 {

+       if (!clave) {
+               std::cout << "BTreeLeafData::Size : No tengo clave!" << std::endl;
+               return 0;
+       }

        return clave->Size ();
 }
 
        return clave->Size ();
 }
 

-uchar* BTreeLeafData::ToArray ()
+uchar* BTreeLeafData::ToArray () const

 {
        return clave->ToArray ();
 }
 {
        return clave->ToArray ();
 }

+
+BTreeChildData::BTreeChildData (uchar *node)
+{
+       memcpy (&hijo, node, sizeof (uint));
+}
+
+BTreeChildData::~BTreeChildData ()
+{
+}
+
+uint BTreeChildData::Size () const
+{
+       return sizeof (uint);
+}
+
+uchar* BTreeChildData::ToArray () const
+{
+       uchar *out = new uchar[Size()];
+       memcpy (out, &hijo, sizeof (uint));
+       return out;
+}
+