std::deque typically faster then std::list for push_back(), front(), pop_front()?
in [C++]
|
Prev: std::deque typically faster then std::list for push_back(), front(), pop_front()?
Next: std::deque typically faster then std::list for push_back(), front(), pop_front()?
From: Matthias Buelow on 10 Jan 2008 05:03 Victor V. Terber wrote: > Does such a replacement of list by deque seem reasonable? Would you > typically expect real-world performance changes? If properly implemented, ordinary lists and doubly-linked lists have the same performance characteristics for common operations. The only advantage of a doubly-linked list is that you can traverse it backwards. -- [ See http://www.gotw.ca/resources/clcm.htm for info about ] [ comp.lang.c++.moderated. First time posters: Do this! ] |