double paltas = bajas / (double)altas;
int type = d.getKeyType ();
- tree = Glib::RefPtr<ViewBTree>(new ViewBTree (real_canvas->root(), "test.idx", d.getBlockSize (), type));
+ int atype = d.getTreeType ();
+ tree = Glib::RefPtr<ViewBTree>(new ViewBTree (real_canvas->root(), "test.idx", d.getBlockSize (), atype, type));
tree->signal_selected ().connect ( sigc::mem_fun (*real_frame, &ViewProperties::ShowItem) );
if (type == BTree::KEY_FIXED) {
std::list<int> lst;
it = lst.begin ();
uint i = 0;
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;
if (l >= paltas) {
- tree->AddKey (c);
+ try {
+ tree->AddKey (c);
+ } catch (Exception *e) {
+ std::cout << "====== " << (std::string)c << e->Message () << std::endl;
+ }
i++;
} else {
/* Tengo que borrar una clave entre 0 e "i" de la lista
otro++;
j++;
}
- ClaveFija c(*otro);
+ ClaveFija c(*otro, 0);
tree->DelKey (c);
std::string sss = c;
it = lst.begin ();
while (it != lst.end ()) {
- ClaveVariable c(*it);
+ ClaveVariable c(*it, 0);
- tree->AddKey (c);
+ try {
+ tree->AddKey (c);
+ } catch (Exception *e) {
+ std::cout << "====== " << (std::string)c << e->Message () << std::endl;
+ }
it++;
}
}
Glib::ustring str_key = d.key();
if (tree->type() == BTree::KEY_FIXED)
{
- ClaveFija c(atoi(str_key.c_str()));
+ ClaveFija c(atoi(str_key.c_str()), 0);
tree->AddKey(c);
}
else
{
- ClaveVariable c(str_key);
+ ClaveVariable c(str_key, 0);
tree->AddKey(c);
}
delete tree->last_selected;
Glib::ustring str_key = d.key();
if (tree->type() == BTree::KEY_FIXED)
{
- ClaveFija c(atoi(str_key.c_str()));
+ ClaveFija c(atoi(str_key.c_str()), 0);
tree->DelKey(c);
}
else
{
- ClaveVariable c(str_key);
+ ClaveVariable c(str_key, 0);
tree->DelKey(c);
}
delete tree->last_selected;
Glib::ustring str_key = d.key();
if (tree->type() == BTree::KEY_FIXED)
{
- c = new ClaveFija (atoi(str_key.c_str()));
+ c = new ClaveFija (atoi(str_key.c_str()), 0);
result = tree->FindKey(*c);
}
else
{
- c = new ClaveVariable (str_key);
+ c = new ClaveVariable (str_key, 0);
result = tree->FindKey(*c);
}
if (result)