On Wed, Jan 27, 2010 at 8:30 PM, Steve Howell <showel...@yahoo.com> wrote: > I am not sure why Python lists get all the syntax sugar and promotion over >deque, when in reality, Python lists implement a pretty useless data >structure. Python lists are a glorification of a C array built on top of a >memory-upward-biased memory allocator. As such, they optimize list appends >(good) but fail awfully on list prepops (bad). They are much better as stacks >than queues, even though queues are more useful for the most common >programming known to man--work through a work queue and delete tasks when they >are done. > > It is not surprising that Python lists are starting to show their lack of > versatility in 2010. They're based on 1970's technology. Python lists are > really just a thin encapsulation of C arrays built on top of an asymmetrical > memory manager.
Steve, I think you might as well stop now. I see nothing useful coming out of pursuing this thread further. -- --Guido van Rossum (python.org/~guido) _______________________________________________ Python-Dev mailing list Python-Dev@python.org http://mail.python.org/mailman/listinfo/python-dev Unsubscribe: http://mail.python.org/mailman/options/python-dev/archive%40mail-archive.com
