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
141
142
143
144
|
/* +------------------------------------+
* | Inspire Internet Relay Chat Daemon |
* +------------------------------------+
*
* InspIRCd is copyright (C) 2002-2006 ChatSpike-Dev.
* E-mail:
* <brain@chatspike.net>
* <Craig@chatspike.net>
*
* Written by Craig Edwards, Craig McLure, and others.
* This program is free but copyrighted software; see
* the file COPYING for details.
*
* ---------------------------------------------------
*/
#include "inspircd_config.h"
#include "base.h"
#include <time.h>
#include <map>
#include <deque>
#include <string>
#include "inspircd.h"
#include "modules.h"
#include "helperfuncs.h"
const int bitfields[] = {1,2,4,8,16,32,64,128};
const int inverted_bitfields[] = {~1,~2,~4,~8,~16,~32,~64,~128};
extern time_t TIME;
/* This is now a template in base.h
*
* bool Extensible::Extend(const std::string &key, char* p)
* {
* // only add an item if it doesnt already exist
* if (this->Extension_Items.find(key) == this->Extension_Items.end())
* {
* this->Extension_Items[key] = p;
* log(DEBUG,"Extending object with item %s",key.c_str());
* return true;
* }
* // item already exists, return false
* return false;
* }
*/
bool Extensible::Shrink(const std::string &key)
{
/* map::size_type map::erase( const key_type& key );
* returns the number of elements removed, std::map
* is single-associative so this should only be 0 or 1
*/
if(this->Extension_Items.erase(key))
{
log(DEBUG, "Shrinking object with item %s",key.c_str());
return true;
}
else
{
log(DEBUG, "Tried to shrink object with item %s but no items removed", key.c_str());
return false;
}
}
char* Extensible::GetExt(const std::string &key)
{
/* This was calling ExtensibleStore::find() twice,
* once to see if there was a value, and again to
* get that value if it was there. Now we store
* the iterator so we only have to search for it once.
*/
ExtensibleStore::iterator iter = this->Extension_Items.find(key);
if(iter != this->Extension_Items.end())
{
return iter->second;
}
else
{
return NULL;
}
}
void Extensible::GetExtList(std::deque<std::string> &list)
{
for (ExtensibleStore::iterator u = Extension_Items.begin(); u != Extension_Items.end(); u++)
{
list.push_back(u->first);
}
}
void BoolSet::Set(int number)
{
this->bits |= bitfields[number];
}
void BoolSet::Unset(int number)
{
this->bits &= inverted_bitfields[number];
}
void BoolSet::Invert(int number)
{
this->bits ^= bitfields[number];
}
bool BoolSet::Get(int number)
{
return ((this->bits | bitfields[number]) > 0);
}
bool BoolSet::operator==(BoolSet other)
{
return (this->bits == other.bits);
}
BoolSet BoolSet::operator|(BoolSet other)
{
BoolSet x(this->bits | other.bits);
return x;
}
BoolSet BoolSet::operator&(BoolSet other)
{
BoolSet x(this->bits & other.bits);
return x;
}
BoolSet::BoolSet()
{
this->bits = 0;
}
BoolSet::BoolSet(char bitmask)
{
this->bits = bitmask;
}
bool BoolSet::operator=(BoolSet other)
{
this->bits = other.bits;
return true;
}
|
