Raymond Hettinger <raymond.hettin...@gmail.com> added the comment:

This doesn't make any sense.  None of those operations are defined for the 
heapq module, nor is there a maxsize.  The heapq usage notes are about the 
general concept of ways to implement priority queues.  I suspect your 
suggestion is conflated with queue.PriorityQueue() which does have put(), 
get(), and maxsize.

As for the queue docs, I don't think more examples are needed. IMO it would 
just clutter that part of the docs.

----------
nosy: +rhettinger
resolution:  -> rejected
stage:  -> resolved
status: open -> closed

_______________________________________
Python tracker <rep...@bugs.python.org>
<https://bugs.python.org/issue36731>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe: 
https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com

Reply via email to