Message340891
| Author | rhettinger |
|---|---|
| Recipients | Windson Yang, docs@python, rhettinger |
| Date | 2019-04-26.07:43:22 |
| SpamBayes Score | -1.0 |
| Marked as misclassified | Yes |
| Message-id | <1556264602.54.0.143686271458.issue36731@roundup.psfhosted.org> |
| In-reply-to |
| Content | |
|---|---|
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. |
|
| History | |||
|---|---|---|---|
| Date | User | Action | Args |
| 2019-04-26 07:43:22 | rhettinger | set | recipients: + rhettinger, docs@python, Windson Yang |
| 2019-04-26 07:43:22 | rhettinger | set | messageid: <1556264602.54.0.143686271458.issue36731@roundup.psfhosted.org> |
| 2019-04-26 07:43:22 | rhettinger | link | issue36731 messages |
| 2019-04-26 07:43:22 | rhettinger | create | |