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). -- Matthew Weigel hacker unique@xxxxxxxxxxx --------------------- To unsubscribe go to http://gameprogrammer.com/mailinglist.html