Clean way to get near-LIFO behavior from multiprocessing.Queue? (or even just *not* near-FIFO)

Question

Does anyone know a clean way to get near-LIFO or even not near-FIFO (e.g. random) behavior from multiprocessing.Queue?

Alternative Question: Cou

Answer 1

There is a LIFO queue in the Queue package (queue in Python 3). This isn't exposed in the multiprocessing or multiprocessing.queues modules.

Replacing your line q = mp.Queue() with q = Queue.LifoQueue() and running prints: min, max and average as exactly -1.

(Also I think you should always get exactly FIFO/LIFO order when getting items from only one thread.)