tagged 1.1

[z.facultad/75.52/treemulator.git] / src / main.cpp

diff --git a/src/main.cpp b/src/main.cpp
index e4f0326247d6bca4a35cd7d90df7c599666bb024..a16a24ea0252bf5b1ea84a8843829d91d1f7313d 100644 (file)
--- 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 ()) {
 
        it = lst.begin ();
        while (it != lst.end ()) {

-               ClaveFija c(*it, 0);
+               ClaveFija c(*it);

 
                double l = Random::Double (0.0f, 1.0f);
                std::cout << l << " >= " << paltas << std::endl;
 
                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. */
                } else {
                        /* Tengo que borrar una clave entre 0 e "i" de la lista
                         * porque son las que ya agregue. */

-                       ClaveFija c(km.GetRandom (), 0);
+                       ClaveFija c(km.GetRandom ());

 
                        try {
                                tree.DelKey (c);
 
                        try {
                                tree.DelKey (c);


@@ -64,7 +64,7 @@ int main  (int argc, char *argv[])
        int bien = 0;
        int mal = 0;
        while (it != l.end ()) {
        int bien = 0;
        int mal = 0;
        while (it != l.end ()) {

-               ClaveFija c(*it, 0);
+               ClaveFija c(*it);

                BTreeFindResult *r;
 
                r = tree.FindKey (c);
                BTreeFindResult *r;
 
                r = tree.FindKey (c);