1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
/*
** Copyright 2002, Double Precision Inc.
**
** See COPYING for distribution information.
*/
#include "curses_config.h"
#include "curseskeyhandler.H"
#include <functional>
#include <algorithm>
using namespace std;
list<CursesKeyHandler *> CursesKeyHandler::handlers;
bool CursesKeyHandler::handlerListModified=true;
CursesKeyHandler::CursesKeyHandler(int priorityArg)
: priority(priorityArg)
{
list<CursesKeyHandler *>::iterator b=handlers.begin(),
e=handlers.end();
while (b != e)
{
if ( (*b)->priority > priorityArg)
break;
b++;
}
handlers.insert(b, 1, this);
handlerListModified=true;
}
CursesKeyHandler::~CursesKeyHandler()
{
list<CursesKeyHandler *>::iterator me=
find_if(handlers.begin(), handlers.end(),
bind2nd(equal_to<CursesKeyHandler *>(), this));
handlers.erase(me);
handlerListModified=true;
}
bool CursesKeyHandler::listKeys( vector< pair<string, string> > &list)
{
return false;
}
bool CursesKeyHandler::handle(const Curses::Key &key, Curses *focus)
{
list<CursesKeyHandler *>::iterator b=handlers.begin(),
e=handlers.end();
while (b != e)
{
CursesKeyHandler *p= *b++;
if (p->priority >= 0 && focus)
{
if (focus->processKeyInFocus(key))
return true;
focus=NULL;
}
if ( p->processKey(key))
return true;
}
if (focus)
if (focus->processKeyInFocus(key))
return true;
return false;
}
|
