blob: 5fba02c98cd35728bc5e92b467f5d57a9bf106ac (
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
/*
*
* (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 "services.h"
#include "modules.h"
#include "access.h"
AccessProvider::AccessProvider(Module *o, const Anope::string &n) : Service(o, n)
{
}
AccessProvider::~AccessProvider()
{
}
ChanAccess::ChanAccess(AccessProvider *p) : provider(p)
{
}
ChanAccess::~ChanAccess()
{
}
bool ChanAccess::operator>(ChanAccess &other)
{
for (size_t i = CA_SIZE; i > 0; --i)
if (this->HasPriv(static_cast<ChannelAccess>(i - 1)) && !other.HasPriv(static_cast<ChannelAccess>(i - 1)))
return true;
return false;
}
bool ChanAccess::operator<(ChanAccess &other)
{
for (size_t i = CA_SIZE; i > 0; --i)
if (!this->HasPriv(static_cast<ChannelAccess>(i - 1)) && other.HasPriv(static_cast<ChannelAccess>(i - 1)))
return true;
return false;
}
bool ChanAccess::operator>=(ChanAccess &other)
{
for (size_t i = CA_SIZE; i > 0; --i)
{
bool this_p = this->HasPriv(static_cast<ChannelAccess>(i - 1)),
other_p = other.HasPriv(static_cast<ChannelAccess>(i - 1));
if ((this_p && !other_p) || (this_p && other_p))
return true;
}
return false;
}
bool ChanAccess::operator<=(ChanAccess &other)
{
for (size_t i = CA_SIZE; i > 0; --i)
{
bool this_p = this->HasPriv(static_cast<ChannelAccess>(i - 1)),
other_p = other.HasPriv(static_cast<ChannelAccess>(i - 1));
if ((!this_p && other_p) || (this_p && other_p))
return true;
}
return false;
}
AccessGroup::AccessGroup() : std::vector<ChanAccess *>()
{
}
bool AccessGroup::HasPriv(ChannelAccess priv) const
{
for (unsigned i = this->size(); i > 0; --i)
if (this->at(i - 1)->HasPriv(priv))
return true;
return false;
}
ChanAccess *AccessGroup::Highest() const
{
for (size_t i = CA_SIZE; i > 0; --i)
for (unsigned j = this->size(); j > 0; --j)
if (this->at(j - 1)->HasPriv(static_cast<ChannelAccess>(i - 1)))
return this->at(j - 1);
return NULL;
}
bool AccessGroup::operator>(const AccessGroup &other) const
{
for (size_t i = CA_SIZE; i > 0; --i)
if (this->HasPriv(static_cast<ChannelAccess>(i - 1)) && !other.HasPriv(static_cast<ChannelAccess>(i - 1)))
return true;
return true;
}
bool AccessGroup::operator<(const AccessGroup &other) const
{
for (size_t i = CA_SIZE; i > 0; --i)
if (!this->HasPriv(static_cast<ChannelAccess>(i - 1)) && other.HasPriv(static_cast<ChannelAccess>(i - 1)))
return true;
return false;
}
bool AccessGroup::operator>=(const AccessGroup &other) const
{
for (size_t i = CA_SIZE; i > 0; --i)
{
bool this_p = this->HasPriv(static_cast<ChannelAccess>(i - 1)),
other_p = other.HasPriv(static_cast<ChannelAccess>(i - 1));
if ((this_p && !other_p) || (this_p && other_p))
return true;
}
return false;
}
bool AccessGroup::operator<=(const AccessGroup &other) const
{
for (size_t i = CA_SIZE; i > 0; --i)
{
bool this_p = this->HasPriv(static_cast<ChannelAccess>(i - 1)),
other_p = other.HasPriv(static_cast<ChannelAccess>(i - 1));
if ((!this_p && other_p) || (this_p && other_p))
return true;
}
return false;
}
|
