[python] Queue.Queue vs. collections.deque

https://stackoverflow.com/questions/717148/queue-queue-vs-collections-deque/717199#717199

Queue,Queue 用于多线程之间，无需lock的通信；

collections.deque 用于实现数据结构中的queue， 或两端都可以实现queue的功能。

Queue.Queue and collections.deque serve different purposes. Queue.Queue is intended for allowing different threads to communicate using queued messages/data, whereas collections.deque is simply intended as a datastructure. That's why Queue.Queue has methods like put_nowait(), get_nowait(), and join(), whereas collections.deque doesn't. Queue.Queue isn't intended to be used as a collection, which is why it lacks the likes of the inoperator.

It boils down to this: if you have multiple threads and you want them to be able to communicate without the need for locks, you're looking for Queue.Queue; if you just want a queue or a double-ended queue as a datastructure, use collections.deque.

Finally, accessing and manipulating the internal deque of a Queue.Queue is playing with fire - you really don't want to be doing that.