python[data]--queue, heap, priority queue

Queue: from collections import deque; Implementation saves the last few history, List = Deque (maxlen=6), then more than six records will delete the previous record.

Heap: Import HEAPQ; The biggest feature is that the first popup element is always the smallest element in the heap; list=[1,2,3] Heap=heapq.heapify (list), Nlargest (3, data, KEY=LAMBDA) nsmallest ()

Priority queue: The element in the heap (-priority, ordinal, item) so that priority can be achieved, the higher the priority is the first pop out of the heap, the same priority, according to index successively into the heap sequence pop

　　　　

python[data]--queue, heap, priority queue