Message388324
> I want to examine the first (oldest) element in queue and
> remove it if it's too old.
Why not just dismiss older queue entries during a normal get() operation? Or just use a plain deque with access guarded by a lock.
FWIW, the standard library queue module doesn't have a straight-forward way to implement a peek() method. The module guarantees that the underlying data structure is only accessed with _init, _qsize, _get, and _put.
That would be difficult to do atomically with a Queue object. |
|
Date |
User |
Action |
Args |
2021-03-09 02:30:54 | rhettinger | set | recipients:
+ rhettinger, docs@python, Windson Yang, Ark-kun |
2021-03-09 02:30:54 | rhettinger | set | messageid: <1615257054.65.0.392549577642.issue35118@roundup.psfhosted.org> |
2021-03-09 02:30:54 | rhettinger | link | issue35118 messages |
2021-03-09 02:30:54 | rhettinger | create | |
|