mirror of
https://github.com/charlienet/go-mixed.git
synced 2025-07-18 00:22:41 +08:00
56 lines
867 B
Go
56 lines
867 B
Go
package collections
|
|
|
|
import "fmt"
|
|
|
|
type CircleQueue struct {
|
|
data []any
|
|
cap int
|
|
front int
|
|
rear int
|
|
}
|
|
|
|
func NewCircleQueue(cap int) *CircleQueue {
|
|
cap++
|
|
|
|
return &CircleQueue{
|
|
data: make([]any, cap),
|
|
cap: cap,
|
|
}
|
|
}
|
|
|
|
func (q *CircleQueue) Push(data any) bool {
|
|
if (q.rear+1)%q.cap == q.front {
|
|
return false
|
|
}
|
|
|
|
q.data[q.rear] = data
|
|
q.rear = (q.rear + 1) % q.cap
|
|
return true
|
|
}
|
|
func (q *CircleQueue) Pop() any {
|
|
if q.rear == q.front {
|
|
return nil
|
|
}
|
|
|
|
data := q.data[q.front]
|
|
q.data[q.front] = nil
|
|
q.front = (q.front + 1) % q.cap
|
|
return data
|
|
}
|
|
|
|
func (q *CircleQueue) Size() int {
|
|
return (q.rear - q.front + q.cap) % q.cap
|
|
}
|
|
|
|
func (q *CircleQueue) IsFull() bool {
|
|
return (q.rear+1)%q.cap == q.front
|
|
}
|
|
|
|
func (q *CircleQueue) IsEmpty() bool {
|
|
return q.front == q.rear
|
|
}
|
|
|
|
func (q *CircleQueue) Show() string {
|
|
return fmt.Sprintf("%v", q.data)
|
|
}
|