On Fri, 17 Feb 2012 21:25:05 -0600, bearophile <[email protected]> wrote:
[snip]
Bearophile, when comparing a deque to a classic vector, of course the deque is
going to win. This has nothing to do with D, and everything to do with writing a
good algorithm.<
In this specific case you are wrong: in Python if I replace the deque with a
list (that is a dynamic array), the runtime grows only by less than 0.2
seconds. I know this benchmark is about Phobos not about D.
Whether or not deque vs vector was the primary performance problem, posting an
'apples to oranges' performance benchmark causes people to a) dismiss the
thread and b) lower their opinion of the poster.
