X-Git-Url: https://git.llucax.com/z.facultad/75.52/treemulator.git/blobdiff_plain/d8a31a526434624c41352800e3b274144d1894c9..b733cd4a9d1fcc19c3652b17fbd3065d0e0a72c7:/src/main.cpp?ds=inline

diff --git a/src/main.cpp b/src/main.cpp
index a16a24e..e4f0326 100644
--- a/src/main.cpp
+++ b/src/main.cpp
@@ -29,7 +29,7 @@ int main  (int argc, char *argv[])
 
 	it = lst.begin ();
 	while (it != lst.end ()) {
-		ClaveFija c(*it);
+		ClaveFija c(*it, 0);
 
 		double l = Random::Double (0.0f, 1.0f);
 		std::cout << l << " >= " << paltas << std::endl;
@@ -45,7 +45,7 @@ int main  (int argc, char *argv[])
 		} else {
 			/* Tengo que borrar una clave entre 0 e "i" de la lista
 			 * porque son las que ya agregue. */
-			ClaveFija c(km.GetRandom ());
+			ClaveFija c(km.GetRandom (), 0);
 
 			try {
 				tree.DelKey (c);
@@ -64,7 +64,7 @@ int main  (int argc, char *argv[])
 	int bien = 0;
 	int mal = 0;
 	while (it != l.end ()) {
-		ClaveFija c(*it);
+		ClaveFija c(*it, 0);
 		BTreeFindResult *r;
 
 		r = tree.FindKey (c);