diff options
| -rw-r--r-- | src/base.cpp | 35 |
1 files changed, 0 insertions, 35 deletions
diff --git a/src/base.cpp b/src/base.cpp index a7aa456f2..4612c4a59 100644 --- a/src/base.cpp +++ b/src/base.cpp @@ -29,22 +29,6 @@ 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 ); @@ -63,25 +47,6 @@ bool Extensible::Shrink(const std::string &key) } } -/*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++) |