Evito un par de loops infinitos.

diff --git a/src/btree.cpp b/src/btree.cpp
index e6c0cf4cc8666afeb762cfe7d0d1c47455fc633a..093377bec0b00024fd9f6f38d07e991b78369b30 100644 (file)
--- a/src/btree.cpp
+++ b/src/btree.cpp
@@ -131,7 +131,6 @@ Clave* BTree::AddKeyR (const Clave *k, uint node_num, uint &left_child, uint &ri
                        if ((*data) < (*datait))
                                /* Me pase, lo agrego aca! */
                                break;
-                       it++;
                }
                node_keys.insert (it, data);
                WriteKeys (node, node_header, node_keys);
@@ -316,9 +315,8 @@ void BTree::PrintNode (uint num)
        std::cout << "Items : " << node_header.item_count << std::endl;
        std::cout << "Free  : " << node_header.free_space << " (" << (header.block_size - sizeof (BTreeNodeHeader)) << ")" << std::endl;
        while (it != node_keys.end ()) {
-               std::string s = *(*it);
-               std::cout << s << " ";
-               it++;
+               std::string s = (*it);
+               std::cout << "(" << s << ") "; 
        }
        std::cout << std::endl;