Go-实现双向队列【附加基础操作】

港控/mmm° 2022-09-09 12:59 199阅读 0赞

代码片段如下：

/*
     *                    .::::.
     *                  .::::::::.
     *                 :::::::::::
     *             ..:::::::::::'
     *           '::::::::::::'
     *             .::::::::::
     *        '::::::::::::::..
     *             ..::::::::::::.		Utils:双向队列
     *           ``::::::::::::::::		Author:崔金朋
     *            ::::``:::::::::'        .:::.
     *           ::::'   ':::::'       .::::::::.
     *         .::::'      ::::     .:::::::'::::.
     *        .:::'       :::::  .:::::::::' ':::::.
     *       .::'        :::::.:::::::::'      ':::::.
     *      .::'         ::::::::::::::'         ``::::.
     *  ...:::           ::::::::::::'              ``::.
     * ```` ':.          ':::::::::'                  ::::..
     *  		           '.:::::'          			':'````..
     */
    
    package main
    
    import (
    	"container/list"
    )
    
    type SecureQueue struct {
    	data *list.List
    	size int
    	lock chan int8
    }
    
    func NewSecureQueue() *SecureQueue {
    	q := new(SecureQueue)
    	q.data = list.New()
    	q.lock = make(chan int8, 1)
    	return q
    }
    
    // 返回队列大小
    func (q *SecureQueue) QueueSize() int {
    	q.lock <- 1
    	defer func(lock chan int8) { <-lock }(q.lock)
    	return q.size
    }
    
    // 返回队列是否为空
    func (q *SecureQueue) QueueEmpty() bool {
    	q.lock <- 1
    	defer func(lock chan int8) { <-lock }(q.lock)
    	return q.size == 0
    }
    
    // 返回队列头部或尾部结点
    func (q *SecureQueue) QueuePeek(right bool) interface{} {
    	q.lock <- 1
    	defer func(lock chan int8) { <-lock }(q.lock)
    	if right {
    		return q.data.Front().Value
    	}
    
    	return q.data.Back().Value
    }
    
    // 头部或末尾插入值为value的元素
    func (q *SecureQueue) QueuePush(value interface{}, right bool) {
    	q.lock <- 1
    	defer func(lock chan int8) { <-lock }(q.lock)
    	if right {
    		q.data.PushFront(value)
    	} else {
    		q.data.PushBack(value)
    	}
    
    	q.size++
    }
    
    // 删除队列头部或尾部节点
    func (q *SecureQueue) QueuePop(right bool) bool {
    	q.lock <- 1
    	defer func(lock chan int8) { <-lock }(q.lock)
    	if q.size <= 0 {
    		return false
    	}
    
    	var item *list.Element
    	if right {
    		item = q.data.Back()
    	} else {
    		item = q.data.Back()
    	}
    
    	q.data.Remove(item)
    	q.size--
    	return true
    }