]> 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 72741eb90d4d10fd715e6d5994d76b6449101745..09673eb3eb28c22bec8139973d343402f600fdb3 100644 (file)
@@ -2,61 +2,96 @@
  *       | Inspire Internet Relay Chat Daemon |
  *       +------------------------------------+
  *
- *  Inspire is copyright (C) 2002-2004 ChatSpike-Dev.
- *                       E-mail:
- *                <brain@chatspike.net>
- *               <Craig@chatspike.net>
- *     
- * Written by Craig Edwards, Craig McLure, and others.
+ *  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 "inspircd_config.h" 
 #include <time.h>
-#include <map>
-#include <string>
 #include "inspircd.h"
-#include "modules.h"
 
-extern time_t TIME;
+const int bitfields[]           =       {1,2,4,8,16,32,64,128};
+const int inverted_bitfields[]  =       {~1,~2,~4,~8,~16,~32,~64,~128};
 
-bool Extensible::Extend(std::string key, char* p)
+classbase::classbase()
 {
-       // 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;
+       this->age = time(NULL);
 }
 
-bool Extensible::Shrink(std::string key)
+bool Extensible::Shrink(const std::string &key)
 {
-       // only attempt to remove a map item that exists
-       if (this->Extension_Items.find(key) != this->Extension_Items.end())
-       {
-               this->Extension_Items.erase(this->Extension_Items.find(key));
-               log(DEBUG,"Shrinking object with item %s",key.c_str());
-               return true;
-       }
-       return false;
+       /* 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);
 }
 
-char* Extensible::GetExt(std::string key)
+void Extensible::GetExtList(std::deque<std::string> &list)
 {
-       log(DEBUG,"Checking extension items for %s",key.c_str());
-       if (this->Extension_Items.find(key) != this->Extension_Items.end())
+       for (ExtensibleStore::iterator u = Extension_Items.begin(); u != Extension_Items.end(); u++)
        {
-               return (this->Extension_Items.find(key))->second;
+               list.push_back(u->first);
        }
-       log(DEBUG,"Cant find item %s",key.c_str());
-       return NULL;
 }
 
+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;
+}