René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Weird PriorityQueue description","articleBody":"# Documentation\r\n\r\nSomeone asked [Does PriorityQueue call sorted every time get is called?](https://stackoverflow.com/questions/75407200/does-priorityqueue-call-sorted-every-time-get-is-called). First I laughed, how did they come up with that silly idea, but then I saw they got it from [the doc](https://docs.python.org/3/library/queue.html#queue.PriorityQueue) and it really does make it sound like that:\r\n\r\n\u003e The lowest valued entries are retrieved first (the lowest valued entry is the one returned by `sorted(list(entries))[0]`).\r\n\r\nNot only `sorted` but also `list` first, and of course even if the queue didn't use a heap, it should be the straightforward `min(entries)` instead. This is so over-the-top inefficient and complicated that it looks like a weird joke.\r\n\r\nUnless there's good reason for it, I suggest to add \"as if\" and use `min`:\r\n\r\n\u003e The lowest valued entries are retrieved first (the lowest valued entry is the one as if returned by `min(entries)`).\n\n\u003c!-- gh-linked-prs --\u003e\n### Linked PRs\n* gh-102026\n* gh-102106\n* gh-102107\n* gh-102143\n* gh-102154\n* gh-102155\n\u003c!-- /gh-linked-prs --\u003e\n","author":{"url":"https://github.com/pochmann","@type":"Person","name":"pochmann"},"datePublished":"2023-02-10T07:27:59.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":3},"url":"https://github.com/101777/cpython/issues/101777"}