1 /* -*- indent-tabs-mode: nil; tab-width: 4; c-basic-offset: 4; -*-
3 keytree.c for the Openbox window manager
4 Copyright (c) 2006 Mikael Magnusson
5 Copyright (c) 2003-2007 Dana Jansens
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 See the COPYING file for a copy of the GNU General Public License.
21 #include "translate.h"
24 void tree_destroy(KeyBindingTree *tree)
29 tree_destroy(tree->next_sibling);
30 c = tree->first_child;
34 for (it = tree->keylist; it != NULL; it = it->next)
36 g_list_free(tree->keylist);
37 for (sit = tree->actions; sit != NULL; sit = sit->next)
38 action_unref(sit->data);
39 g_slist_free(tree->actions);
46 KeyBindingTree *tree_build(GList *keylist)
49 KeyBindingTree *ret = NULL, *p;
51 if (g_list_length(keylist) <= 0)
52 return NULL; /* nothing in the list.. */
54 for (it = g_list_last(keylist); it; it = g_list_previous(it)) {
58 ret = g_new0(KeyBindingTree, 1);
60 for (kit = it; kit != NULL; kit = g_list_previous(kit))
61 ret->keylist = g_list_prepend(ret->keylist,
62 g_strdup(kit->data)); /* deep copy */
64 if (p != NULL) p->parent = ret;
65 if (!translate_key(it->data, &ret->state, &ret->key)) {
73 void tree_assimilate(KeyBindingTree *node)
75 KeyBindingTree *a, *b, *tmp, *last;
77 if (keyboard_firstnode == NULL) {
78 /* there are no nodes at this level yet */
79 keyboard_firstnode = node;
81 a = keyboard_firstnode;
86 if (!(a->state == b->state && a->key == b->key)) {
95 if (!(last->state == b->state && last->key == b->key)) {
96 last->next_sibling = b;
97 b->parent = last->parent;
99 last->first_child = b->first_child;
100 last->first_child->parent = last;
106 KeyBindingTree *tree_find(KeyBindingTree *search, gboolean *conflict)
108 KeyBindingTree *a, *b;
112 a = keyboard_firstnode;
115 if (!(a->state == b->state && a->key == b->key)) {
118 if ((a->first_child == NULL) == (b->first_child == NULL)) {
119 if (a->first_child == NULL) {
120 /* found it! (return the actual node, not the search's) */
125 return NULL; /* the chain status' don't match (conflict!) */
131 return NULL; /* it just isn't in here */
134 gboolean tree_chroot(KeyBindingTree *tree, GList *keylist)
137 if (translate_key(keylist->data, &state, &key)) {
138 while (tree != NULL && !(tree->state == state && tree->key == key))
139 tree = tree->next_sibling;
141 if (keylist->next == NULL) {
145 return tree_chroot(tree->first_child, keylist->next);