X-Git-Url: https://git.llucax.com/z.facultad/75.52/treemulator.git/blobdiff_plain/a356d91d88f7f3399d80e922f70e10a8f422a3ba..a7b40a39a402b6f4cbcf1b1a175c0e357704d43f:/src/main.cpp?ds=inline diff --git a/src/main.cpp b/src/main.cpp index 3c30c4a..58a00ec 100644 --- a/src/main.cpp +++ b/src/main.cpp @@ -2,18 +2,80 @@ #include "btree.h" #include "clave_fija.h" +#include "random.h" +#include "keymanager.h" int main (int argc, char *argv[]) { - BTree tree ("test.idx", 64); + int bloque, altas, bajas; - for (int i=0; i<=13; i++) { - ClaveFija c(i); + if (argc != 4) { + printf ("Uso : %s \n", argv[0]); + return 1; + } + + bloque = atoi (argv[1]); + altas = atoi (argv[2]); + bajas = atoi (argv[3]); + + KeyManager km; + BTree tree ("test.idx", bloque); + + std::list lst; + std::list::iterator it; + Random::Init (); + Random::Ints (lst, altas); + + double paltas = bajas / (double)(altas + bajas); + + it = lst.begin (); + while (it != lst.end ()) { + ClaveFija c(*it); + + double l = Random::Double (0.0f, 1.0f); + std::cout << l << " >= " << paltas << std::endl; + if (l >= paltas) { + tree.AddKey (c); + km.AddValue (*it); + it++; + } else { + /* Tengo que borrar una clave entre 0 e "i" de la lista + * porque son las que ya agregue. */ + ClaveFija c(km.GetRandom ()); - std::cout << "Agregando " << i << std::endl; - tree.AddKey (c); + tree.DelKey (c); + std::string sss = c; + std::cout << "Clave Borrada " << sss << std::endl; + } } + km.PrintInfo (); + + std::list l = km.GetList (); + it = l.begin (); + int bien = 0; + int mal = 0; + while (it != l.end ()) { + ClaveFija c(*it); + BTreeFindResult *r; + + r = tree.FindKey (c); + if (r != NULL) { + std::cout << "** Clave " << (*it) << " encontrada.\n"; + bien++; + delete r; + } else { + std::cout << "** Clave " << (*it) << " NO encontrada.\n"; + mal++; + } + it++; + } + + std::cout << "\n\n === Resultados ===\n"; + std::cout << " Hist : " << bien << "\n"; + std::cout << " Miss : " << mal << "\n"; + std::cout << " Total : " << (bien+mal) << "\n"; + return 0; }