• python3 线程队列queue


    # -*- coding: utf-8 -*-
    import queue
    
    
    if __name__ == '__main__':
        '''先进先出'''
        que = queue.Queue(3)
        que.put("first")
        que.put("second")
        que.put(["a", "b", "c"])
    
        print(que.get())
        print(que.get())
        print(que.get())
    
    # first
    # second
    # ['a', 'b', 'c']
    
        '''后进先出'''
        lifo_que = queue.LifoQueue(3)
        lifo_que.put("first")
        lifo_que.put("second")
        lifo_que.put(["a", "b", "c"])
    
        print(lifo_que.get())
        print(lifo_que.get())
        print(lifo_que.get())
    
    # ['a', 'b', 'c']
    # second
    # first
    
    
        '''优先级队列,数字越小优先级越高,越先取出来'''
        priority_que = queue.PriorityQueue(3)
        priority_que.put((3, "first"))
        priority_que.put((8, "second"))
        priority_que.put((2, ["a", "b", "c"]))
    
        print(priority_que.get())
        print(priority_que.get())
        print(priority_que.get())
    
    # (2, ['a', 'b', 'c'])
    # (3, 'first')
    # (8, 'second')
  • 相关阅读:
    acm 总结之大数加法
    hdu 1004
    hdu 1887
    hdu 2007
    hdu 2004
    ACM总结之 A+B problem 总结
    nyoj_42_一笔画问题_201403181935
    最短路径--Floyd算法
    最短路径—Dijkstra算法
    nyoj_114_某种序列_201403161700
  • 原文地址:https://www.cnblogs.com/lilyxiaoyy/p/11032669.html
Copyright © 2020-2023  润新知