[ViewVC] Diff of: cvs/deliantra/server/common/arch.C

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.105 by root, Thu Apr 15 00:36:51 2010 UTC vs.
Revision 1.118 by root, Tue Nov 27 18:50:22 2018 UTC

 /*
  * This file is part of Deliantra, the Roguelike Realtime MMORPG.
  *
+ * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
- * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
+ * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
  * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
  * Copyright (©) 1992 Frank Tore Johansen
  *
  * Deliantra is free software: you can redistribute it and/or modify it under
  * the terms of the Affero GNU General Public License as published by the
  * Free Software Foundation, either version 3 of the License, or (at your
  * option) any later version.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  * GNU General Public License for more details.
  *
  * You should have received a copy of the Affero GNU General Public License
  * and the GNU General Public License along with this program. If not, see
  * <http://www.gnu.org/licenses/>.
  *
  * The authors can be reached via e-mail to <support@deliantra.net>
  */
 #include <cassert>
+#include <functional>
+#include <flat_hash_map.hpp>
 #include <global.h>
-#include <tr1/functional>
-#include <tr1/unordered_map>
 archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
 arch_ptr archetype::empty;
 // the hashtable
-typedef std::tr1::unordered_map
+typedef ska::flat_hash_map
   <
     const char *,
     arch_ptr,
     str_hash,
     str_equal,
 static std::vector<archetype *> postponed_arch;
 //+GPL
 /*
- * Creates an object.  This function is called by get_archetype ()
+ * Creates an object.  This function is called by archetype::get ()
  * if it fails to find the appropriate archetype.
- * Thus get_archetype() will be guaranteed to always return
+ * Thus archetype::get() will be guaranteed to always return
  * an object, and never NULL.
  */
 static object *
 create_singularity (const char *name)
 {
           goto fail;
         }
     }
   {
-    auto (at, parts.begin ());
     archetype *new_head = parts.front ();
     archetype *old_head = find (new_head->archname);
     if (old_head && !old_head->is_head ())
       {
              &new_head->archname, &old_head->archname);
         goto fail;
       }
     // check that all archetypes belong to the same old object or are new
-    for (auto (at, parts.begin ()); at != parts.end (); ++at)
+    for (auto &&at : parts)
       {
-        archetype *new_part = *at;
+        archetype *new_part = at;
         archetype *old_part = find (new_part->archname);
         if (old_part && old_part->head_ () != old_head)
           {
             LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
     // assemble new chain
     new_head->max_x = new_head->x;
     archetype *less = new_head;
-    for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
+    for (auto &&p = parts.begin () + 1; p != parts.end (); ++p)
       {
         archetype *at = *p;
         // some flags get inherited from the head (probably a lot more)
         // doing it here doesn't feel too cozy, but it allows code
     return new_head;
   }
 fail:
-  for (auto (p, parts.begin ()); p != parts.end (); ++p)
+  for (auto &&at : parts)
-    (*p)->destroy ();
+    at->destroy ();
   return 0;
 }
 void
 void
 archetype::commit_load ()
 {
   // unlink old archetypes and link in new ones */
-  for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
+  for (auto &&at : postponed_arch)
     {
-      archetype *at = *p;
       if (archetype *old = find (at->archname))
         old->unlink ();
       allarch.push_back (at);
     }
   postponed_arch.clear ();
   // now resolve arch references
-  for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
+  for (auto &&p : postponed_arch_ref) // not yet C++17
     {
-      arch_ptr *ap = p->first;
+      arch_ptr *ap = p.first;
-      archetype *at = find (p->second);
+      archetype *at = find (p.second);
       if (!at)
-        LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
+        LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p.second);
       *ap = at;
     }
   postponed_arch_ref.clear ();
 }
 void
 archetype::gc ()
 {
-  int cnt = max (1, min (allarch.size () / 128, dirtycnt));
+  int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt));
   dirtycnt = max (0, dirtycnt - cnt);
   do
     {
       static int idx;
       if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
         ++idx;
       else
         {
-          LOG (llevDebug, "garbage collect arch %s", &at->archname);
+          //LOG (llevDebug, "garbage collect arch %s", &at->archname);
           assert (at->arch == at); // verify that refcnt == 1 is truly valid
           allarch.erase (idx);
           // break chain
           for (object *op = at->head_ (); op; )
 /*
  * Finds which archetype matches the given name, and returns a new
  * object containing a copy of the archetype.
  */
 object *
-get_archetype (const char *name)
-{
-  return archetype::get (name);
-}
-object *
 archetype::get (const char *name)
 {
   archetype *at = find (name);
   if (!at)

Diff Legend

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines

Comparing deliantra/server/common/arch.C (file contents): Revision 1.105 by root, Thu Apr 15 00:36:51 2010 UTC vs. Revision 1.118 by root, Tue Nov 27 18:50:22 2018 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.105 by root, Thu Apr 15 00:36:51 2010 UTC vs.
Revision 1.118 by root, Tue Nov 27 18:50:22 2018 UTC