--- deliantra/server/include/util.h	2007/06/04 12:19:08	1.48
+++ deliantra/server/include/util.h	2007/06/04 13:04:00	1.49
@@ -55,7 +55,7 @@
 #include <shstr.h>
 #include <traits.h>
 
-// use a gcc extension for auto declarations until ISO C++ sanctifies them
+// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
 #define auto(var,expr) decltype(expr) var = (expr)
 
 // very ugly macro that basicaly declares and initialises a variable
@@ -407,6 +407,10 @@
   }
 };
 
+// Mostly the same as std::vector, but insert/erase can reorder
+// the elements, making insret/remove O(1) instead of O(n).
+//
+// NOTE: only some forms of erase/insert are available
 template<class T>
 struct unordered_vector : std::vector<T, slice_allocator<T> >
 {
@@ -426,6 +430,18 @@
   }
 };
 
+// This container blends advantages of linked lists
+// (efficiency) with vectors (random access) by
+// by using an unordered vector and storing the vector
+// index inside the object.
+//
+// + memory-efficient on most 64 bit archs
+// + O(1) insert/remove
+// + free unique (but varying) id for inserted objects
+// + cache-friendly iteration
+// - only works for pointers to structs
+//
+// NOTE: only some forms of erase/insert are available
 template<class T, int T::* index>
 struct object_vector : std::vector<T *, slice_allocator<T *> >
 {
@@ -445,7 +461,6 @@
 
   void insert (T *obj)
   {
-    assert (!(obj->*index));
     push_back (obj);
     obj->*index = this->size ();
   }
@@ -457,7 +472,6 @@
 
   void erase (T *obj)
   {
-    assert (obj->*index);
     unsigned int pos = obj->*index;
     obj->*index = 0;