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 (!translate_key(it->data, &ret->state, &ret->key)) {
72 void tree_assimilate(KeyBindingTree *node)
74 KeyBindingTree *a, *b, *tmp, *last;
76 if (keyboard_firstnode == NULL) {
77 /* there are no nodes at this level yet */
78 keyboard_firstnode = node;
80 a = keyboard_firstnode;
85 if (!(a->state == b->state && a->key == b->key)) {
94 if (!(last->state == b->state && last->key == b->key))
95 last->next_sibling = b;
97 last->first_child = b->first_child;
103 KeyBindingTree *tree_find(KeyBindingTree *search, gboolean *conflict)
105 KeyBindingTree *a, *b;
109 a = keyboard_firstnode;
112 if (!(a->state == b->state && a->key == b->key)) {
115 if ((a->first_child == NULL) == (b->first_child == NULL)) {
116 if (a->first_child == NULL) {
117 /* found it! (return the actual node, not the search's) */
122 return NULL; /* the chain status' don't match (conflict!) */
128 return NULL; /* it just isn't in here */