2 * This file is part of DisOrder
3 * Copyright (C) 2006, 2007 Richard Kettlewell
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
20 /** @file lib/selection.c
21 * @brief Select management for Disobedience
29 #include "selection.h"
31 /** @brief Create a new selection manager
32 * @return Pointer to @ref hash used to manage the selection
34 hash *selection_new(void) {
35 return hash_new(sizeof (int));
38 /** @brief Add or remove a key in a selection
39 * @param h Hash representing selection
40 * @param key Key to insert
41 * @param selected non-0 if key is selected, 0 if it is not
43 * @p key is copied so the pointer need not remain valid. Newly selected keys
44 * are not marked as live.
46 void selection_set(hash *h, const char *key, int selected) {
48 int *const liveness = xmalloc_noptr(sizeof (int));
50 hash_add(h, key, liveness, HASH_INSERT_OR_REPLACE);
55 /** @brief Test whether a key is set in a selection
56 * @param h Hash representing selection
57 * @param key Key to check
58 * @return non-0 if key is present, 0 if it is not
60 int selection_selected(hash *h, const char *key) {
61 return hash_find(h, key) != 0;
64 /** @brief Invert a key's selection status
65 * @param h Hash representing selection
66 * @param key Key to flip
68 * If the key is selected as a result it is not marked as live.
70 void selection_flip(hash *h, const char *key) {
71 selection_set(h, key, !selection_selected(h, key));
74 /** @brief Mark a selection key as live
75 * @param h Hash representing selection
76 * @param key Key to mark as live
78 * Live keys will survive a call to selection_cleanup(). @p need not be in the
79 * selection (if it is not then the call will be ignored).
81 void selection_live(hash *h, const char *key) {
82 int *ptr = hash_find(h, key);
88 static int selection_cleanup_callback(const char *key,
94 hash_remove((hash *)v, key);
98 /** @brief Delete all non-live keys from a selection
99 * @param h Hash representing selection
101 * After cleanup, no keys are marked as live.
103 void selection_cleanup(hash *h) {
104 hash_foreach(h, selection_cleanup_callback, h);
107 static int selection_empty_callback(const char *key,
108 void attribute((unused)) *value,
110 hash_remove((hash *)v, key);
114 /** @brief Remove all keys from a selection
115 * @param h Hash representing selection
117 void selection_empty(hash *h) {
118 hash_foreach(h, selection_empty_callback, h);