Posted by Kevin on April 19, 2001 at 12:15:22:
Ok it is my understanding that map<> forms a sorted tree. But when we update the ticks, we have to do them in the ordre that they were created. Is there a way to do that? I am assuming that since I used map, a simple iterator will result in the tree being traversed in order by the search key rather than the order they were entered... Do I have to switch my implementation to either vector<> or list<> to acheive this?
Post a Followup