blob: 84ef6bcb83591992136a0b7250e7a426ec215e7f (
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
60
61
62
63
64
65
66
67
|
/* Modular support
*
* (C) 2003-2011 Anope Team
* Contact us at team@anope.org
*
* Please read COPYING and README for further details.
*
* Based on the original code of Epona by Lara.
* Based on the original code of Services by Andy Church.
*/
#include "modules.h"
message_map MessageMap;
std::list<Module *> Modules;
/** Message constructor, adds the message to Anope
* @param n The message name
* @param f A callback function
*/
Message::Message(const Anope::string &n, bool (*f)(const Anope::string &, const std::vector<Anope::string> &)) : name(n), func(f)
{
MessageMap.insert(std::make_pair(this->name, this));
}
/** Message destructor
*/
Message::~Message()
{
message_map::iterator it = MessageMap.find(this->name);
if (it == MessageMap.end())
return;
message_map::iterator upper = MessageMap.upper_bound(this->name);
for (; it != upper; ++it)
{
if (it->second == this)
{
MessageMap.erase(it);
break;
}
}
}
/** Find a message in the message table
* @param name The name of the message were looking for
* @return NULL if we cant find it, or a pointer to the Message if we can
*/
std::vector<Message *> Anope::FindMessage(const Anope::string &name)
{
std::vector<Message *> messages;
message_map::iterator it = MessageMap.find(name);
if (it == MessageMap.end())
return messages;
message_map::iterator upper = MessageMap.upper_bound(name);
for (; it != upper; ++it)
messages.push_back(it->second);
return messages;
}
|
