You're always helpful Daved, thanks.
I'll read up on those topics and let everyone know what I eventually come up with.
On a side note, I forgot to post the follow-up to my last thread. I just posted it, the toy program I used is there if you're interested.
hash_maps and hash_set (or are they called unordered_ ) should be added to standard libraries with C++0x. They should be already available with some compilers. May-be you should check your compiler's include paths first?
I might be wrong.
Quoted more than 1000 times (I hope).Thank you, anon. You sure know how to recognize different types of trees from quite a long way away.
I'll do that, but how do they compare with similar utilities provided by Boost? I have boost already, would this be a better way to go?Originally Posted by anon
Boost's TR1 implementation doesn't support unordered_* containers yet, but keep checking. They might have removed their previous hash tables, I don't see any in the latest version. If you have one then it might not be supported going forward (which is part of the reason I suggested using a regular set). Dinkumware has implemented tr1 including the unordered_* containers, but I doubt that's free.
