ret = new BindingTree(id);
if (!p) ret->chain = false;
ret->first_child = p;
+ printf("adding child %lx\n", (long)p);
if (!translate(*it, ret->binding, true)) {
destroytree(ret);
ret = 0;
OBBindings::OBBindings()
- : _curpos(&_keytree)
+ : _curpos(&_keytree), _mousetree(0)
{
}
BindingTree _keytree; // root node of the tree (this doesn't have siblings!)
BindingTree *_curpos; // position in the keytree
- BindingTree _mousetree; // this tree is a list. it has only siblings
+ BindingTree *_mousetree; // this tree is a list. it has only siblings
int find_key(BindingTree *search);
bool translate(const std::string &str, Binding &b, bool askey);
v.push_back("v");
_bindings->add_key(v, 1);
v.clear();
-// v.push_back("C-x");
-// v.push_back("C-z");
+ v.push_back("C-x");
+ v.push_back("C-z");
v.push_back("a");
_bindings->add_key(v, 2);
+ v.clear();
+ v.push_back("C-a");
+ _bindings->add_key(v, 3);
_bindings->add_mouse("A-1", 1);