Commit350ba7c

authored

gh-101777: MakePriorityQueue docs slightly clearer (#102026)

Adjust wording slightly, and use min(entries) instead ofsorted(list(entries))[0] as an example.

1 parent0f7a972 commit350ba7cCopy full SHA for 350ba7c

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
@@ -57,8 +57,8 @@ The :mod:`queue` module defines the following classes and exceptions:
`57`	`57`	`maxsize is less than or equal to zero, the queue size is infinite.`
`58`	`58`
`59`	`59`	`The lowest valued entries are retrieved first (the lowest valued entry is the`
`60`		- one returned by ``sorted(list(entries))[0]``).A typical pattern for entries
`61`		- is a tuple in the form: ``(priority_number, data)``.
	`60`	+ onethat would bereturned by ``min(entries)``). A typical pattern for
	`61`	+entriesis a tuple in the form: ``(priority_number, data)``.
`62`	`62`
`63`	`63`	`If the data elements are not comparable, the data can be wrapped in a class`
`64`	`64`	`that ignores the data item and only compares the priority number::`

Comments

(0)