#include "btree.h"
-BTree::BTree (const std::string &name, unsigned int block_size, int kt, bool create_new_file)
+BTree::BTree (const std::string &name, unsigned int block_size, int tt, int kt, bool create_new_file)
{
- key_type = kt;
uchar *node;
BTreeNodeHeader nh;
/* Inicializo el header */
header.block_size = block_size;
+ header.tree_type = tt;
+ header.key_type = kt;
+ header.block_data_counter = 0;
+ strcpy (header.magic, "DILUMA");
+ header.magic[6] = '\0';
WriteFileHeader ();
/* Creo el primer bloque vacio */
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);
+ }
+
+ del = filename + ".blockdel";
+
+ fp = fopen (del.c_str (), "wb");
+ if (fp != NULL) {
+ uint i;
+
+ while (fread (&i, 1, sizeof (uint), fp)) {
+ deleted_block_data.push_back (i);
+ }
+
+ fclose (fp);
+ }
+
+ fp = fopen (name.c_str(), "rb+");
+ if (!fp) {
+ /* TODO : mandar una exception ? */
+ return;
+ }
+ filename = name;
+ 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++;
+ }
+
+ del = filename + ".del";
+
+ fp = fopen (del.c_str (), "wb");
+ it = deleted_block_data.begin ();
+
+ while (it != deleted_block_data.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 ()
void BTree::AddKey (const Clave &k)
{
uint left, right;
- Clave *kout = AddKeyR (k.Clone (), 0, left, right);
+ Clave *kout, *in;
+
+ in = k.Clone ();
+ in->SetBlockData ( GetNextBlockData () );
+
+ try {
+ kout = AddKeyR (in->Clone (), 0, left, right);
+ } catch (Exception *e) {
+ throw e;
+ }
+
+ delete in;
if (kout) {
unsigned short level;
ReadNodoHeader (node, &node_header);
delete [] node;
- if (node_header.level == 0)
- return AddKeyLeafR (k, node_num, left_child, right_child);
+ if (node_header.level == 0) {
+ try {
+ return AddKeyLeafR (k, node_num, left_child, right_child);
+ } catch (Exception *e) {
+ throw e;
+ }
+ }
- return AddKeyOtherR (k, node_num, left_child, right_child);
+ try {
+ return AddKeyOtherR (k, node_num, left_child, right_child);
+ } catch (Exception *e) {
+ throw e;
+ }
}
Clave* BTree::AddKeyLeafR (const Clave *k, uint node_num, uint &left_child, uint &right_child)
while (it != node_keys.end ()) {
datait = (*it);
+ if (header.tree_type == TYPE_IDENTIFICACION) {
+ /* Verifico que la clave no existea ya en el arbol */
+ if ((*data) == (*datait)) {
+ throw new AddException ();
+ return NULL;
+ }
+ }
+
if ((*data) < (*datait))
/* Me pase, lo agrego aca! */
break;
while (it != node_keys.end ()) {
BTreeData *datait;
datait = (*it);
+ if (header.tree_type == TYPE_IDENTIFICACION) {
+ /* Verifico que la clave no existea ya en el arbol */
+ if ((*data) == (*datait)) {
+ throw new AddException ();
+ return NULL;
+ }
+ }
if ((*data) < (*datait))
/* Me pase, lo agrego aca! */
break;
used += d->Size ();
it++;
}
- kout = (*it++)->getClave (); // Esta se retorna al "padre" para que se la agregue
+ kout = (*it++)->GetKey (); // Esta se retorna al "padre" para que se la agregue
while (it != node_keys.end ()) {
BTreeData *d = (*it);
posterior = it;
while (it != node_keys.end ()) {
+ if (header.tree_type == TYPE_IDENTIFICACION) {
+ /* Verifico que la clave no existea ya en el arbol */
+ if ((*data) == (*(*it))) {
+ throw new AddException ();
+ return NULL;
+ }
+ }
if ((*data) < (*(*it)))
break;
ultima = it;
}
if (it == posterior) {
- k = AddKeyR (k, lchild->getChild (), left_child, right_child);
+ k = AddKeyR (k, lchild->GetChild (), left_child, right_child);
} else {
- k = AddKeyR (k, (*ultima)->getChild (), left_child, right_child);
+ k = AddKeyR (k, (*ultima)->GetChild (), left_child, right_child);
}
DeleteKeys (node_keys);
while (it != node_keys.end ()) {
datait = (*it);
+ if (header.tree_type == TYPE_IDENTIFICACION) {
+ /* Verifico que la clave no existea ya en el arbol */
+ if ((*data) == (*datait)) {
+ throw new AddException ();
+ return NULL;
+ }
+ }
if ((*data) < (*datait))
/* Me pase, lo agrego aca! */
break;
while (it != node_keys.end ()) {
BTreeData *datait;
datait = (*it);
+ if (header.tree_type == TYPE_IDENTIFICACION) {
+ /* Verifico que la clave no existea ya en el arbol */
+ if ((*data) == (*datait)) {
+ throw new AddException ();
+ return NULL;
+ }
+ }
if ((*data) < (*datait))
/* Me pase, lo agrego aca! */
break;
used += d->Size ();
it++;
}
- kout = (*it)->getClave (); // Esta se retorna al "padre" para que se la agregue
+ kout = (*it)->GetKey (); // Esta se retorna al "padre" para que se la agregue
- new_node_keys.push_back ( new BTreeChildData ((*it)->getChild ()));
+ new_node_keys.push_back ( new BTreeChildData ((*it)->GetChild ()));
it++;
while (it != node_keys.end ()) {
BTreeData *d = (*it);
if ((*k) == (*(*it))) {
/* La encontre!, retorno */
if (node_header.level == 0) {
- DelKeyFromLeaf (k->getClave (), node_num, padre);
+ DelKeyFromLeaf (k->GetKey (), node_num, padre);
} else {
uint left, right;
if (it == posterior) {
- left = lchild->getChild ();
- right = (*it)->getChild ();
+ left = lchild->GetChild ();
+ right = (*it)->GetChild ();
} else {
- left = (*ultima)->getChild ();
- right = (*it)->getChild ();
+ left = (*ultima)->GetChild ();
+ right = (*it)->GetChild ();
}
std::cout << "Eliminar de Nodo con hijos : " << left << " y " << right << std::endl;
- DelKeyFromNode (k->getClave (), node_num, padre, left, right);
+ DelKeyFromNode (k->GetKey (), node_num, padre, left, right);
}
DeleteKeys (node_keys);
delete [] node;
/* TODO: Aca faltaria liberar memoria */
if (it == posterior) {
- DelKeyR (k, lchild->getChild (), node_num);
+ DelKeyR (k, lchild->GetChild (), node_num);
} else {
- DelKeyR (k, (*ultima)->getChild (), node_num);
+ DelKeyR (k, (*ultima)->GetChild (), node_num);
}
}
it = node_keys.begin ();
while (it != node_keys.end ()) {
if ((*data) == (*(*it))) {
+ BTreeData *aborrar = (*it);
node_keys.erase (it);
+ deleted_block_data.push_back (aborrar->GetKey ()->GetBlockData ());
+ delete aborrar;
break;
}
it++;
delete data;
- /* TODO : que pasa cuando el nodo se queda vacio o con
- * muy pocas claveS??
- */
WriteKeys (node, node_header, node_keys);
WriteNodoHeader (node, &node_header);
WriteBlock (node, node_num);
Clave *cpadre;
BTreeData *lchild = (*it++);
- if (lchild->getChild () == node1) {
- cpadre = (*it)->getClave ();
+ if (lchild->GetChild () == node1) {
+ cpadre = (*it)->GetKey ();
borrar_padre = it;
} else {
while (it != nkpadre.end ()) {
if (tipohermano == 0) {
- if ((*it)->getChild () == node2)
+ if ((*it)->GetChild () == node2)
break;
} else {
- if ((*it)->getChild () == node1)
+ if ((*it)->GetChild () == node1)
break;
}
anterior = it;
it++;
}
- cpadre = (*it)->getClave ();
+ cpadre = (*it)->GetKey ();
borrar_padre = it;
}
if (it == nkpadre.end ()) {
i = nk1.begin ();
while (i != nk1.end ()) {
- newkeys.push_back ( new BTreeLeafData ((*i)->getClave ()->Clone ()));
+ newkeys.push_back ( new BTreeLeafData ((*i)->GetKey ()->Clone ()));
i++;
}
//if (tipohermano == 0)
newkeys.push_back ( new BTreeLeafData (cpadre->Clone ()));
i = nk2.begin ();
while (i != nk2.end ()) {
- newkeys.push_back ( new BTreeLeafData ((*i)->getClave ()->Clone ()));
+ newkeys.push_back ( new BTreeLeafData ((*i)->GetKey ()->Clone ()));
i++;
}
WriteNodoHeader (npadre, &nhp);
WriteBlock (npadre, padre);
- /* TODO: Recuperar nodo1 y nodo2 */
+ deleted_nodes.push_back (node1);
+ deleted_nodes.push_back (node2);
} else {
WriteKeys (n1, nh1, newkeys);
WriteNodoHeader (n1, &nh1);
WriteBlock (n1, node1);
- /* TODO : Recuperar node2 */
+ deleted_nodes.push_back (node2);
+
/* Actualizo punero al padre */
- (*anterior)->setChild (node1);
+ (*anterior)->SetChild (node1);
nkpadre.erase (borrar_padre);
WriteKeys (npadre, nhp, nkpadre);
}
if (maxmin == 0) {
- k = (*it)->getClave ()->Clone ();
+ k = (*it)->GetKey ()->Clone ();
node_keys.erase (it);
} else {
it = node_keys.end ();
it--;
- k = (*it)->getClave ()->Clone ();
+ k = (*it)->GetKey ()->Clone ();
node_keys.erase (it);
}
BTreeData *lchild = (*it++);
- if (lchild->getChild () == node_num) {
+ if (lchild->GetChild () == node_num) {
/* Solo tengo hermano derecho */
std::cout << "Hermano Izquierdo : NO TENGO" << std::endl;
left = 0;
- std::cout << "Hermano Derecho : " << (*it)->getChild () << std::endl;
- right = (*it)->getChild ();
+ std::cout << "Hermano Derecho : " << (*it)->GetChild () << std::endl;
+ right = (*it)->GetChild ();
return;
}
while (it != node_keys.end ()) {
- if ((*it)->getChild () == node_num)
+ if ((*it)->GetChild () == node_num)
break;
anterior = it;
it++;
}
siguiente = it++;
- std::cout << "Hermano Izquierdo : " << (*anterior)->getChild () << std::endl;
- left = (*anterior)->getChild ();
+ std::cout << "Hermano Izquierdo : " << (*anterior)->GetChild () << std::endl;
+ left = (*anterior)->GetChild ();
if (siguiente != node_keys.end ()) {
- right = (*siguiente)->getChild ();
- std::cout << "Hermano Derecho : " << (*siguiente)->getChild () << std::endl;
+ right = (*siguiente)->GetChild ();
+ std::cout << "Hermano Derecho : " << (*siguiente)->GetChild () << std::endl;
} else {
right = 0;
std::cout << "Hermano Derecho : NO TENGO" << std::endl;
BTreeData *lchild = (*it++);
- if (lchild->getChild () == node_num) {
- Clave *ret = (*it)->getClave ();
- (*it)->setClave (k);
+ if (lchild->GetChild () == node_num) {
+ Clave *ret = (*it)->GetKey ();
+ (*it)->SetKey (k);
WriteKeys (node, node_header, node_keys);
WriteNodoHeader (node, &node_header);
}
while (it != node_keys.end ()) {
- if ((*it)->getChild () == node_num)
+ if ((*it)->GetChild () == node_num)
break;
anterior = it;
it++;
}
- Clave *ret = (*it)->getClave ();
- (*it)->setClave (k);
+ Clave *ret = (*it)->GetKey ();
+ (*it)->SetKey (k);
WriteKeys (node, node_header, node_keys);
WriteNodoHeader (node, &node_header);
node_keyr = ReadKeys (node_r, node_hr);
data_r = *(node_keyr.begin ());
padre_hijo = right;
- right = data_r->getChild ();
+ right = data_r->GetChild ();
DeleteKeys (node_keyr);
delete [] node_r;
PrintNode (node_num);
exit (1);
}
- (*it)->setClave (reemplazar->getClave ());
- reemplazar->setClave (k->Clone ());
+ (*it)->SetKey (reemplazar->GetKey ());
+ reemplazar->SetKey (k->Clone ());
std::cout << "Tengo todo reemplazado ...\n";
}
for (uint i=0; i<count; i++) {
- /* TODO : El tipo de clave deberia ser usado
- * dependiendo de algun dato en el header del
- * arbol
- */
- /* TODO : Detectar si estoy en una hoja */
BTreeData *data;
if (node_header.level == 0) {
- data = new BTreeLeafData (node, key_type);
+ data = new BTreeLeafData (node, header.key_type);
} else {
- data = new BTreeData (node, key_type);
+ data = new BTreeData (node, header.key_type);
}
node += data->Size ();
keys.push_back (data);
void BTree::AbrevKey (std::list<BTreeData *> &lst)
{
/* Claves Fijas No se abrevian */
- if (key_type == KEY_FIXED) return;
+ if (header.key_type == KEY_FIXED) return;
BTreeData *primera = NULL;
std::list<BTreeData *>::iterator it = lst.begin ();
void BTree::DeAbrevKey (std::list<BTreeData *> &lst)
{
/* Claves Fijas No se abrevian */
- if (key_type == KEY_FIXED) return;
+ if (header.key_type == KEY_FIXED) return;
BTreeData *primera = NULL;
std::list<BTreeData *>::iterator it = lst.begin ();
uchar *node;
BTreeNodeHeader nh;
- fseek (fp, 0, SEEK_END);
- filelen = ftell (fp);
+ std::list<uint>::iterator it;
- num = filelen/header.block_size - 1;
+ if (deleted_nodes.size ()) {
+ it = deleted_nodes.begin ();
+ num = *it;
+ deleted_nodes.erase (it);
+ } else {
+ fseek (fp, 0, SEEK_END);
+ filelen = ftell (fp);
+ num = filelen/header.block_size - 1;
+ }
node = new uchar[header.block_size];
ReadNodoHeader (node, &nh);
nh.level = 0;
while (it != node_keys.end ()) {
if ((*data) == (*(*it))) {
/* La encontre!, retorno */
+ delete data;
delete [] node;
DeleteKeys (node_keys);
BTreeFindResult *result = new BTreeFindResult ();
result->node = node_num;
result->header = node_header;
+
return result;
}
it++;
}
+ delete data;
+
/* Si llego aca y estoy en nivel 0 (una hoja) quiere
* decir que no lo encontré
*/
if (node_header.level == 0) {
- delete data;
+ DeleteKeys (node_keys);
+ delete [] node;
return NULL;
}
/* TODO: Aca faltaria liberar memoria */
+ BTreeFindResult *ret;
if (it == posterior)
- return FindKeyR (k, lchild->getChild ());
-
- return FindKeyR (k, (*ultima)->getChild ());
+ ret = FindKeyR (k, lchild->GetChild ());
+ else
+ ret = FindKeyR (k, (*ultima)->GetChild ());
+
+ DeleteKeys (node_keys);
+ delete [] node;
+ return ret;
}
void BTree::DeleteKeys (std::list<BTreeData *> &keys)
it++;
}
}
+
+int BTree::type () const
+{
+ return header.key_type;
+}
+
+uint BTree::GetNextBlockData ()
+{
+ uint n;
+ if (deleted_block_data.size ()) {
+ std::list<uint>::iterator it = deleted_block_data.begin ();
+ n = *it;
+ deleted_block_data.erase (it);
+ } else {
+ n = header.block_data_counter++;
+ }
+
+ return n;
+}
+
projects / z.facultad / 75.52 / treemulator.git / blobdiff