it = lst.begin ();
while (it != lst.end ()) {
- ClaveVariable c(*it, 0);
+ ClaveVariable c(*it);
double l = Random::Double (0.0f, 1.0f);
std::cout << l << " >= " << paltas << std::endl;
} else {
/* Tengo que borrar una clave entre 0 e "i" de la lista
* porque son las que ya agregue. */
- ClaveVariable c(km.GetRandom (), 0);
+ ClaveVariable c(km.GetRandom ());
try {
tree.DelKey (c);
int bien = 0;
int mal = 0;
while (it != l.end ()) {
- ClaveVariable c(*it, 0);
+ ClaveVariable c(*it);
BTreeFindResult *r;
r = tree.FindKey (c);