2002-12-30 06:31:45 +00:00
|
|
|
// -*- mode: C++; indent-tabs-mode: nil; c-basic-offset: 2; -*-
|
|
|
|
#ifndef __binding_hh
|
|
|
|
#define __binding_hh
|
|
|
|
|
|
|
|
/*! @file binding.hh
|
|
|
|
@brief I dunno.. some binding stuff?
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
namespace ob {
|
|
|
|
|
|
|
|
typedef struct Binding {
|
|
|
|
unsigned int modifiers;
|
|
|
|
unsigned int key;
|
|
|
|
|
|
|
|
bool operator==(struct Binding &b2) { return key == b2.key &&
|
|
|
|
modifiers == b2.modifiers; }
|
|
|
|
bool operator!=(struct Binding &b2) { return key != b2.key ||
|
|
|
|
modifiers != b2.modifiers; }
|
|
|
|
Binding(unsigned int mod, unsigned int k) { modifiers = mod; key = k; }
|
|
|
|
} Binding;
|
|
|
|
|
|
|
|
typedef struct BindingTree {
|
|
|
|
Binding binding;
|
|
|
|
std::string text;
|
|
|
|
int id; // the id given for the binding in add()
|
|
|
|
bool chain; // true if this is a chain to another key (not an action)
|
|
|
|
|
|
|
|
struct BindingTree *next_sibling; // the next binding in the tree at the same
|
|
|
|
// level
|
|
|
|
struct BindingTree *first_child; // the first child of this binding (next
|
|
|
|
// binding in a chained sequence).
|
|
|
|
BindingTree(int id) : binding(0, 0) {
|
|
|
|
this->id = id; chain = true; next_sibling = first_child = 0;
|
|
|
|
}
|
|
|
|
BindingTree() : binding(0, 0) {
|
|
|
|
this->id = -1; chain = true; next_sibling = first_child = 0;
|
|
|
|
}
|
|
|
|
} BindingTree;
|
|
|
|
|
|
|
|
class OBBindings {
|
|
|
|
public:
|
|
|
|
//! A list of strings
|
|
|
|
typedef std::vector<std::string> StringVect;
|
|
|
|
|
|
|
|
private:
|
2002-12-30 06:56:13 +00:00
|
|
|
BindingTree _tree;// root node of the tree (this doesn't have siblings!)
|
2002-12-30 06:31:45 +00:00
|
|
|
|
2002-12-30 06:56:13 +00:00
|
|
|
int find(BindingTree *search);
|
|
|
|
bool translate(const std::string &str, Binding &b);
|
|
|
|
BindingTree *buildtree(const StringVect &keylist, int id);
|
2002-12-30 07:33:13 +00:00
|
|
|
void OBBindings::assimilate(BindingTree *node);
|
2002-12-30 06:56:13 +00:00
|
|
|
|
2002-12-30 06:31:45 +00:00
|
|
|
public:
|
|
|
|
//! Initializes an OBBinding object
|
|
|
|
OBBindings();
|
|
|
|
//! Destroys the OBBinding object
|
|
|
|
virtual ~OBBindings();
|
|
|
|
|
|
|
|
//! Adds a new binding
|
|
|
|
/*!
|
|
|
|
A binding will fail to be added if the binding already exists (as part of
|
|
|
|
a chain or not), or if any of the strings in the keylist are invalid.
|
|
|
|
@return true if the binding could be added; false if it could not.
|
|
|
|
*/
|
|
|
|
bool add(const StringVect &keylist, int id);
|
|
|
|
|
|
|
|
//! Removes a key binding
|
|
|
|
/*!
|
|
|
|
@return The id of the binding that was removed, or '< 0' if none were
|
|
|
|
removed.
|
|
|
|
*/
|
|
|
|
int remove(const StringVect &keylist);
|
|
|
|
|
|
|
|
//! Removes all key bindings
|
|
|
|
void remove_all();
|
|
|
|
|
|
|
|
//! Finds a keybinding and returns its id or '< 0' if it isn't found.
|
|
|
|
/*!
|
|
|
|
@return -1 if the keybinding was not found but does not conflict with
|
|
|
|
any others; -2 if the keybinding conflicts with another.
|
|
|
|
*/
|
|
|
|
int find(const StringVect &keylist);
|
|
|
|
|
|
|
|
// XXX: need an exec() function or something that will be used by openbox
|
|
|
|
// and hold state for which chain we're in etc. (it could have a timer
|
|
|
|
// for reseting too...)
|
|
|
|
|
|
|
|
void display();
|
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif // __binding_hh
|