namespace ob {
#include <stdio.h>
-static void print_branch(BindingTree *first, std::string str)
+static void print_branch(const BindingTree *first, std::string str)
{
- BindingTree *p = first;
+ const BindingTree *p = first;
while (p) {
if (p->first_child)
printf("Key Tree:\n");
print_branch(_keytree.first_child, "");
}
- if (_mousetree.next_sibling) {
+ if (_mousetree) {
printf("Mouse Tree:\n");
- BindingTree *p = _mousetree.next_sibling;
+ BindingTree *p = _mousetree;
while (p) {
printf("%d %s\n", p->id, p->text.c_str());
p = p->next_sibling;
return true;
}
-bool OBBindings::translate(const std::string &str, Binding &b, bool askey)
+bool OBBindings::translate(const std::string &str, Binding &b,
+ bool askey) const
{
// parse out the base key name
std::string::size_type keybegin = str.find_last_of('-');
}
}
-BindingTree *OBBindings::buildtree(const StringVect &keylist, int id)
+BindingTree *OBBindings::buildtree(const StringVect &keylist, int id) const
{
if (keylist.empty()) return 0; // nothing in the list.. return 0
for (it = keylist.rbegin(); it != end; ++it) {
p = ret;
ret = new BindingTree(id);
- if (!p) ret->chain = false;
+ if (!p) ret->chain = false; // only the first built node
ret->first_child = p;
if (!translate(*it, ret->binding, true)) {
destroytree(ret);
OBBindings::OBBindings()
- : _curpos(&_keytree)
+ : _curpos(&_keytree), _mousetree(0)
{
}
if (!translate(button, n.binding, false))
return false;
- BindingTree *p = _mousetree.next_sibling, *last = &_mousetree;
+ BindingTree *p = _mousetree, **newp = &_mousetree;
while (p) {
if (p->binding == n.binding)
return false; // conflict
- last = p;
p = p->next_sibling;
+ newp = &p->next_sibling;
}
display();
- last->next_sibling = new BindingTree(id);
+ *newp = new BindingTree(id);
display();
- last->next_sibling->chain = false;
- last->next_sibling->binding.key = n.binding.key;
- last->next_sibling->binding.modifiers = n.binding.modifiers;
+ (*newp)->text = button;
+ (*newp)->chain = false;
+ (*newp)->binding.key = n.binding.key;
+ (*newp)->binding.modifiers = n.binding.modifiers;
return true;
}
if (!_keytree.first_child) {
// there are no nodes at this level yet
_keytree.first_child = node;
- return;
} else {
a = _keytree.first_child;
last = a;
}
if (last->binding != b->binding)
last->next_sibling = b;
- else
+ else {
last->first_child = b->first_child;
- delete b;
+ delete b;
+ }
}
}
-int OBBindings::find_key(BindingTree *search) {
+int OBBindings::find_key(BindingTree *search) const {
BindingTree *a, *b;
a = _keytree.first_child;
b = search;
a = a->next_sibling;
} else {
if (a->chain == b->chain) {
- if (!a->chain)
+ if (!a->chain) {
return a->id; // found it! (return the actual id, not the search's)
- } else
- return -2; // the chain status' don't match (conflict!)
+ }
+ } else {
+ return -2; // the chain status' don't match (conflict!)
+ }
b = b->first_child;
a = a->first_child;
}
if (!(tree = buildtree(keylist, id)))
return false; // invalid binding requested
- if (find_key(tree) < -1) {
+ if (find_key(tree) != -1) {
// conflicts with another binding
destroytree(tree);
return false;
// assimilate this built tree into the main tree
assimilate(tree); // assimilation destroys/uses the tree
+
return true;
}
remove_branch(_keytree.first_child);
_keytree.first_child = 0;
}
- BindingTree *p = _mousetree.next_sibling;
+ BindingTree *p = _mousetree;
while (p) {
BindingTree *n = p->next_sibling;
delete p;
p = n;
}
- _mousetree.next_sibling = 0;
+ _mousetree = 0;
}