]> git.netwichtig.de Git - user/henk/code/inspircd.git/blobdiff - src/base.cpp
Fix total mess of makefile dependency macros (all depending on stuff they dont NEED...
[user/henk/code/inspircd.git] / src / base.cpp
index ef6ff5ccf6f3e601df5199f4ef5b9d74163b0e4e..09673eb3eb28c22bec8139973d343402f600fdb3 100644 (file)
@@ -1 +1,97 @@
-/*       +------------------------------------+\r *       | Inspire Internet Relay Chat Daemon |\r *       +------------------------------------+\r *\r *  InspIRCd: (C) 2002-2007 InspIRCd Development Team\r * See: http://www.inspircd.org/wiki/index.php/Credits\r *\r * This program is free but copyrighted software; see\r *            the file COPYING for details.\r *\r * ---------------------------------------------------\r */\r\r#include "inspircd_config.h"\r#include "base.h"\r#include <time.h>\r#include "inspircd.h"\r\rconst int bitfields[]           =       {1,2,4,8,16,32,64,128};\rconst int inverted_bitfields[]  =       {~1,~2,~4,~8,~16,~32,~64,~128};\r\rclassbase::classbase()\r{\r this->age = time(NULL);\r}\r\rbool Extensible::Shrink(const std::string &key)\r{\r   /* map::size_type map::erase( const key_type& key );\r    * returns the number of elements removed, std::map\r     * is single-associative so this should only be 0 or 1\r  */\r    return this->Extension_Items.erase(key);\r}\r\rvoid Extensible::GetExtList(std::deque<std::string> &list)\r{\r       for (ExtensibleStore::iterator u = Extension_Items.begin(); u != Extension_Items.end(); u++)\r   {\r              list.push_back(u->first);\r      }\r}\r\rvoid BoolSet::Set(int number)\r{\r   this->bits |= bitfields[number];\r}\r\rvoid BoolSet::Unset(int number)\r{\r  this->bits &= inverted_bitfields[number];\r}\r\rvoid BoolSet::Invert(int number)\r{\r        this->bits ^= bitfields[number];\r}\r\rbool BoolSet::Get(int number)\r{\r    return ((this->bits | bitfields[number]) > 0);\r}\r\rbool BoolSet::operator==(BoolSet other)\r{\r    return (this->bits == other.bits);\r}\r\rBoolSet BoolSet::operator|(BoolSet other)\r{\r      BoolSet x(this->bits | other.bits);\r    return x;\r}\r\rBoolSet BoolSet::operator&(BoolSet other)\r{\r       BoolSet x(this->bits & other.bits);\r    return x;\r}\r\rBoolSet::BoolSet()\r{\r      this->bits = 0;\r}\r\rBoolSet::BoolSet(char bitmask)\r{\r    this->bits = bitmask;\r}\r\rbool BoolSet::operator=(BoolSet other)\r{\r      this->bits = other.bits;\r       return true;\r}\r
\ No newline at end of file
+/*       +------------------------------------+
+ *       | Inspire Internet Relay Chat Daemon |
+ *       +------------------------------------+
+ *
+ *  InspIRCd: (C) 2002-2008 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.
+ *
+ * ---------------------------------------------------
+ */
+
+/* $Core: libIRCDbase */
+
+#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;
+}