blob: 38097f49b7c7d2f933e91eda8b8ed579b752dc10 (
plain)
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
|
// Copyright 2008, 2009 Brady J. Garvin
// This file is part of Covering Arrays by Simulated Annealing (CASA).
// CASA is free software: you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// CASA is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with CASA. If not, see <http://www.gnu.org/licenses/>.
#ifndef EVENT_SOURCE_H
#define EVENT_SOURCE_H
#include <set>
#include "events/Listener.H"
template<class MESSAGE>class EventSource {
public:
typedef Listener<MESSAGE> ListenerT;
private:
std::set<ListenerT*> listeners;
public:
virtual ~EventSource() {}
bool isListener(const ListenerT&listener) const {
return listeners.find(&listener) != listeners.end();
}
void addListener(ListenerT&listener) {
listeners.insert(&listener);
}
void removeListener(ListenerT&listener) {
listeners.erase(&listener);
}
void removeAllListeners() {
listeners.clear();
}
protected:
void dispatch(const MESSAGE&message) {
for(typename std::set<ListenerT*>::iterator iterator =
listeners.begin(),
end = listeners.end();
iterator != end;
++iterator) {
(*iterator)->signal(message);
}
}
};
#endif
|
