diff options
author | peavey <peavey@e03df62e-2008-0410-955e-edbf42e46eb7> | 2007-07-16 17:14:45 +0000 |
---|---|---|
committer | peavey <peavey@e03df62e-2008-0410-955e-edbf42e46eb7> | 2007-07-16 17:14:45 +0000 |
commit | bab14f0dd2345c9d7dcbc47c918563709e1ac094 (patch) | |
tree | 753a23cfc9fc08c6697e80b3e686f074aa911d85 /src/base.cpp | |
parent | 3abff3a37550cc1d88dd4d1fd7ed526e89309a53 (diff) |
'svn propset -R svn:eol-style CR *' Set to UNIX-style always. Binaries are auto skipped by svn.
git-svn-id: http://svn.inspircd.org/repository/trunk/inspircd@7454 e03df62e-2008-0410-955e-edbf42e46eb7
Diffstat (limited to 'src/base.cpp')
-rw-r--r-- | src/base.cpp | 96 |
1 files changed, 1 insertions, 95 deletions
diff --git a/src/base.cpp b/src/base.cpp index 9c002773b..ef6ff5ccf 100644 --- a/src/base.cpp +++ b/src/base.cpp @@ -1,95 +1 @@ -/* +------------------------------------+ - * | Inspire Internet Relay Chat Daemon | - * +------------------------------------+ - * - * InspIRCd: (C) 2002-2007 InspIRCd Development Team - * See: http://www.inspircd.org/wiki/index.php/Credits - * - * This program is free but copyrighted software; see - * the file COPYING for details. - * - * --------------------------------------------------- - */ - -#include "inspircd_config.h" -#include "base.h" -#include <time.h> -#include "inspircd.h" - -const int bitfields[] = {1,2,4,8,16,32,64,128}; -const int inverted_bitfields[] = {~1,~2,~4,~8,~16,~32,~64,~128}; - -classbase::classbase() -{ - this->age = time(NULL); -} - -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 - */ - return this->Extension_Items.erase(key); -} - -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; -} +/* +------------------------------------+
* | Inspire Internet Relay Chat Daemon |
* +------------------------------------+
*
* InspIRCd: (C) 2002-2007 InspIRCd Development Team
* See: http://www.inspircd.org/wiki/index.php/Credits
*
* This program is free but copyrighted software; see
* the file COPYING for details.
*
* ---------------------------------------------------
*/
#include "inspircd_config.h"
#include "base.h"
#include <time.h>
#include "inspircd.h"
const int bitfields[] = {1,2,4,8,16,32,64,128};
const int inverted_bitfields[] = {~1,~2,~4,~8,~16,~32,~64,~128};
classbase::classbase()
{
this->age = time(NULL);
}
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
*/
return this->Extension_Items.erase(key);
}
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;
}
\ No newline at end of file |