Use more unordered_maps to improve performance in c++11 builds

[oweals/minetest.git] / src / clientobject.cpp

diff --git a/src/clientobject.cpp b/src/clientobject.cpp
index 869bd7483b15a2e41dc3f20dd9ac08afc4610f59..ff3f4718765a293b1d378c19c4c75b864ab0a1c8 100644 (file)
--- a/src/clientobject.cpp
+++ b/src/clientobject.cpp
@@ -1,6 +1,6 @@
 /*
-Minetest-c55
-Copyright (C) 2010-2011 celeron55, Perttu Ahola <celeron55@gmail.com>
+Minetest
+Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
 
 This program is free software; you can redistribute it and/or modify
 it under the terms of the GNU Lesser General Public License as published by
@@ -36,35 +36,32 @@ ClientActiveObject::ClientActiveObject(u16 id, IGameDef *gamedef,
 
 ClientActiveObject::~ClientActiveObject()
 {
-       removeFromScene();
+       removeFromScene(true);
 }
 
-ClientActiveObject* ClientActiveObject::create(u8 type, IGameDef *gamedef,
-               ClientEnvironment *env)
+ClientActiveObject* ClientActiveObject::create(ActiveObjectType type,
+               IGameDef *gamedef, ClientEnvironment *env)
 {
        // Find factory function
-       core::map<u16, Factory>::Node *n;
-       n = m_types.find(type);
-       if(n == NULL)
-       {
+       UNORDERED_MAP<u16, Factory>::iterator n = m_types.find(type);
+       if(n == m_types.end()) {
                // If factory is not found, just return.
-               dstream<<"WARNING: ClientActiveObject: No factory for type="
-                               <<(int)type<<std::endl;
+               warningstream << "ClientActiveObject: No factory for type="
+                               << (int)type << std::endl;
                return NULL;
        }
 
-       Factory f = n->getValue();
+       Factory f = n->second;
        ClientActiveObject *object = (*f)(gamedef, env);
        return object;
 }
 
 void ClientActiveObject::registerType(u16 type, Factory f)
 {
-       core::map<u16, Factory>::Node *n;
-       n = m_types.find(type);
-       if(n)
+       UNORDERED_MAP<u16, Factory>::iterator n = m_types.find(type);
+       if(n != m_types.end())
                return;
-       m_types.insert(type, f);
+       m_types[type] = f;
 }