[gameprogrammer] Re: faster lookup, lists, vectors, maps?

  • From: Roger D Vargas <luo_hei@xxxxxxxx>
  • To: gameprogrammer@xxxxxxxxxxxxx
  • Date: Fri, 13 Jul 2007 14:29:26 -0400



Matthew Weigel escribió:

Madison McGaffin wrote:

Hash table will be fastest.  It borders on almost O(1) if you set the
hash table to be a proper size to your intended use.

That said, you'll need to look elsewhere or write your own hashtable if
you want one.  The STL doesn't include one.


However, TR1 does - std::tr1::unordered_map, I believe.  If you're
sticking with one compiler, you can probably use stdext::hash_map, but
Dr. Dobb's Journal claims that the versions provided with GCC and Visual
Studio are incompatible (I haven't looked too closely at how).
Havent gone too far, but Im using hash maps with gcc and VC and seems to work the same in both compilers. anyway, Im migrating my projects to gcc under windows too, so I wont have such problems. 


--
http://dsgp.blogspot.com | Linux, programación, juegos
Have no place I can be since I found Serenity
But you can’t take the sky from me
______________________________________________ LLama Gratis a cualquier PC del Mundo. Llamadas a fijos y móviles desde 1 céntimo por minuto. http://es.voice.yahoo.com 

---------------------
To unsubscribe go to http://gameprogrammer.com/mailinglist.html

Other related posts:

  1. Home
  2. gameprogrammer
  3. Archive
  4. 07-2007