-/*
-static int find(BindingTree *parent, BindingTree *node) {
- BindingTree *p, *lastsib, *nextparent, *nextnode = node->first_child;
-
- if (!parent->first_child)
- return -1;
-
- p = parent->first_child;
- while (p) {
- if (node->binding == p->binding) {
- if (node->chain == p->chain) {
- if (!node->chain) {
- return p->id; // found it! (return the actual id, not the search's)
- } else {
- break; // go on to the next child in the chain
- }
- } else {
- return -2; // the chain status' don't match (conflict!)
- }
- }
- p = p->next_sibling;
- }
- if (!p) return -1; // doesn't exist
-
- if (node->chain) {
- assert(node->first_child);
- return find(p, node->first_child);
- } else
- return -1; // it just isnt in here
-}
-*/
-
-bool OBBindings::add(const StringVect &keylist, int id)