X-Git-Url: https://git.llucax.com/z.facultad/75.52/treemulator.git/blobdiff_plain/46f8786311d03a7d9869d814a3d6f020a3498ed4..555cf8e7b36faa768e40d09665781c468424a91c:/src/btree.cpp?ds=sidebyside

diff --git a/src/btree.cpp b/src/btree.cpp
index 6771746..e78a91e 100644
--- a/src/btree.cpp
+++ b/src/btree.cpp
@@ -33,9 +33,52 @@ BTree::BTree (const std::string &name, unsigned int block_size, int tt, int kt,
 	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 ()
@@ -1138,9 +1181,9 @@ uchar *BTree::NewBlock (uint &num)
 	BTreeNodeHeader nh;
 
 	std::list<uint>::iterator it;
-	it = deleted_nodes.begin ();
 
-	if (it != deleted_nodes.end ()) {
+	if (deleted_nodes.size ()) {
+		it = deleted_nodes.begin ();
 		num = *it;
 		deleted_nodes.erase (it);
 	} else {