----- Original Message ----
From: "joaquin@tid.es"
As for speed, this much depends on your usage patterns: how often you sort the vectors, prune them, etc. In particular, take into account that removing elements from a position in a vector other than the tail is expensive, which might lead you to use (the more space-consuming) std::queues instead. I guess your best option is to prototype both scenarios and profile them.
Thank you for the detailed explanation. To have a sorted data (1 container), I am suing priority_queue (based on vector) and the other container storing the incoming data (which is sorted based on time) is stored in dequeue. I will take your suggestion of having both implementations and profiling them. -dhruva Check out the all-new face of Yahoo! India. Go to http://in.yahoo.com/