array_queue
array_queue.go 源码
package array_queue
import (
"errors"
"fmt"
)
//队列实现（基于数组）
var (
ErrQueueFull = errors.New("error: queue is full")
ErrQueueEmpty = errors.New("error: queue is empty")
)
type ArrayQueue struct {
data []interface{}
head int
tail int
size int
capacity int
}
func New(capacity int) *ArrayQueue {
return &ArrayQueue{
size: 0, head: 0, tail: 0,
data: make([]interface{}, capacity),
capacity: capacity,
}
}
//入队列
func (queue *ArrayQueue) Enqueue(val interface{}) error {
if queue.tail >= queue.capacity && queue.head == 0 {
return ErrQueueFull
}
if queue.head > 0 {
copy(queue.data[0:], queue.data[queue.head:])
queue.tail -= queue.head
queue.head = 0
}
queue.data[queue.tail] = val
queue.size++
queue.tail++
return nil
}
//出队列
func (queue *ArrayQueue) Dequeue() (interface{}, error) {
if queue.Empty() {
return nil, ErrQueueEmpty
}
res := queue.data[queue.head]
queue.size--
queue.head++
return res, nil
}
//队头元素
func (queue *ArrayQueue) Front() interface{} {
return queue.data[queue.head]
}
//队尾元素
func (queue *ArrayQueue) Back() interface{} {
return queue.data[queue.tail-1]
}
func (queue *ArrayQueue) Empty() bool {
return queue.size <= 0
}
func (queue *ArrayQueue) Size() int {
return queue.size
}
func (queue *ArrayQueue) PrintData() {
for i := queue.head; i < queue.tail; i++ {
fmt.Print(queue.data[i], " ")
}
fmt.Println()
}
你可能感兴趣的文章
0
赞
热门推荐
-
2、 - 优质文章
-
3、 gate.io
-
6、 golang
-
7、 openharmony