X-Git-Url: https://git.llucax.com/z.facultad/75.52/treemulator.git/blobdiff_plain/f394d7d95de33fea2b476248ac129488643beb77..7fbdb57d39dea2e7545271be5d706c2df5b5b095:/src/btree.cpp?ds=inline

diff --git a/src/btree.cpp b/src/btree.cpp
index 21609bf..5df88a2 100644
--- a/src/btree.cpp
+++ b/src/btree.cpp
@@ -50,30 +50,41 @@ void BTree::WriteBlock (uchar *block, uint num)
 
 void BTree::AddKey (const Clave &k)
 {
-	std::list<Clave *> node_keys;
+	AddKeyR (&k, 0);
+}
+
+Clave* BTree::AddKeyR (const Clave *k, uint node_num)
+{
+	Clave *kout = NULL;
+	std::list<BTreeData> node_keys;
 
 	/* Leo el nodo raiz para empezar a agregar */
-	uchar *root = ReadBlock (0);
-	BTreeNodeHeader root_header;
-	ReadNodoHeader (root, &root_header);
+	uchar *node = ReadBlock (node_num);
+	BTreeNodeHeader node_header;
+	ReadNodoHeader (node, &node_header);
 
-	node_keys = ReadKeys (root, root_header);
-	std::cout << node_keys.size () << std::endl;
+	node_keys = ReadKeys (node, node_header);
 	
-	if (root_header.free_space >= k.Size ()) {
-		std::cout << "Hay lugar para meter la clave" << std::endl;
+	if (node_header.free_space >= k->Size ()) {
 		/* TODO : Insertar ordenado */
-		node_keys.push_back (k.Clone ());
+		/* Siempre se agrega en una hoja */
+		node_keys.push_back (BTreeLeafData (k->Clone ()));
+
+		WriteKeys (node, node_header, node_keys);
+		WriteNodoHeader (node, &node_header);
+		WriteBlock (node, node_num);
+		delete [] node;
 	} else {
-		std::cout << "__NO__ hay lugar para meter la clave" << std::endl;
+		/* Split */
+		/* Lo que debe pasar :
+		 *  1) Separar N/2 claves en "nodo"
+		 *  2) Separar N/2-1 claves en un nuevo nodo
+		 *  3) kout = clave del medio y mandarla al padre
+		 */
+		std::cout << "SPLIT" << std::endl;
 	}
 
-	
-	WriteKeys (root, root_header, node_keys);
-	WriteNodoHeader (root, &root_header);
-	WriteBlock (root, 0);
-
-	delete [] root;
+	return kout;
 }
 
 void BTree::DelKey (const Clave &k) {}
@@ -98,9 +109,9 @@ uchar *BTree::ReadBlock (uint num)
 	return out;
 }
 
-std::list<Clave *> BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_header)
+std::list<BTreeData> BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_header)
 {
-	std::list<Clave *> keys;
+	std::list<BTreeData> keys;
 	node += sizeof (BTreeNodeHeader);
 
 	for (uint i=0; i<node_header.item_count; i++) {
@@ -108,24 +119,30 @@ std::list<Clave *> BTree::ReadKeys (uchar *node, BTreeNodeHeader &node_header)
 		 * dependiendo de algun dato en el header del
 		 * arbol
 		 */
-		ClaveFija *k = new ClaveFija (node);
-		node += k->Size ();
-		keys.push_back (k);
+		/* TODO : Detectar si estoy en una hoja */
+		BTreeData data(node);
+		node += data.Size ();
+		keys.push_back (data);
 	}
 
 	return keys;
 }
 
-void BTree::WriteKeys (uchar *node, BTreeNodeHeader &node_header, std::list<Clave *> &keys)
+void BTree::WriteKeys (uchar *node, BTreeNodeHeader &node_header, std::list<BTreeData> &keys)
 {
-	std::list<Clave *>::iterator it = keys.begin ();
+	std::list<BTreeData>::iterator it = keys.begin ();
 
 	node += sizeof (BTreeNodeHeader);
 
+	node_header.item_count = 0;
+	node_header.free_space = header.block_size - sizeof (BTreeNodeHeader);
+
 	while (it != keys.end ()) {
-		Clave *c = (*it);
-		memcpy (node, c->ToArray(), c->Size ());
-		node += c->Size ();
+		BTreeData d = (*it);
+		memcpy (node, d.ToArray(), d.Size ());
+		node += d.Size ();
+		node_header.free_space -= d.Size ();
+		node_header.item_count++;
 		it++;
 	}