Corrige y agrega pruebas con clave variable.

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

diff --git a/src/btree.cpp b/src/btree.cpp
index c0e72a380316666212007b446f84f2af3a856887..87471779f5f5ea15c12b7243e6b2842c40a51a54 100644 (file)
--- a/src/btree.cpp
+++ b/src/btree.cpp
@@ -990,11 +990,44 @@ std::list<BTreeData *> BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_heade
                keys.push_back (data);
        }
 
+       DeAbrevKey (keys);
        return keys;
 }
 
+void BTree::AbrevKey (std::list<BTreeData *> &lst)
+{
+       /* Claves Fijas No se abrevian */
+       if (key_type == KEY_FIXED) return;
+
+       BTreeData *primera = NULL;
+       std::list<BTreeData *>::iterator it = lst.begin ();
+
+       while (it != lst.end ()) {
+               if ((*it)->Abrev (primera) == false)
+                       primera = (*it);
+               it++;
+       }
+}
+
+void BTree::DeAbrevKey (std::list<BTreeData *> &lst)
+{
+       /* Claves Fijas No se abrevian */
+       if (key_type == KEY_FIXED) return;
+
+       BTreeData *primera = NULL;
+       std::list<BTreeData *>::iterator it = lst.begin ();
+
+       while (it != lst.end ()) {
+               if ((*it)->DesAbrev (primera) == false)
+                       primera = (*it);
+               it++;
+       }
+}
+
 void BTree::WriteKeys (uchar *node, BTreeNodeHeader &node_header, std::list<BTreeData *> &keys)
 {
+       AbrevKey (keys);
+
        std::list<BTreeData *>::iterator it = keys.begin ();
 
        node += sizeof (BTreeNodeHeader);
@@ -1016,7 +1049,7 @@ void BTree::WriteKeys (uchar *node, BTreeNodeHeader &node_header, std::list<BTre
                it++;
        }
 
-       /* TODO : incrementar node_header.item_count aca o fuera de este metodo? */
+       DeAbrevKey (keys);
 }
                
 void BTree::PrintNode (uint num)