go/go-mixed
1
0
Fork 0
mirror of https://github.com/charlienet/go-mixed.git synced 2025-07-18 08:32:40 +08:00
Code Issues Projects Releases Wiki Activity

generics

Browse Source
This commit is contained in:
charlie
2022-05-04 23:46:48 +08:00
parent 5f9203404b
commit 917bad7494
6 changed files with 83 additions and 63 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
collections/circlequeue.go
View File

@ -2,23 +2,23 @@ package collections
import "fmt"
type CircleQueue struct {
type CircleQueue[T any] struct {
data []any
cap int
front int
rear int
}
func NewCircleQueue(cap int) *CircleQueue {
func NewCircleQueue[T any](cap int) *CircleQueue[T] {
cap++
return &CircleQueue{
return &CircleQueue[T]{
data: make([]any, cap),
cap: cap,
}
}
func (q *CircleQueue) Push(data any) bool {
func (q *CircleQueue[T]) Push(data any) bool {
if (q.rear+1)%q.cap == q.front {
return false
}
@ -27,7 +27,7 @@ func (q *CircleQueue) Push(data any) bool {
q.rear = (q.rear + 1) % q.cap
return true
}
func (q *CircleQueue) Pop() any {
func (q *CircleQueue[T]) Pop() any {
if q.rear == q.front {
return nil
}
@ -38,18 +38,18 @@ func (q *CircleQueue) Pop() any {
return data
}
func (q *CircleQueue) Size() int {
func (q *CircleQueue[T]) Size() int {
return (q.rear - q.front + q.cap) % q.cap
}
func (q *CircleQueue) IsFull() bool {
func (q *CircleQueue[T]) IsFull() bool {
return (q.rear+1)%q.cap == q.front
}
func (q *CircleQueue) IsEmpty() bool {
func (q *CircleQueue[T]) IsEmpty() bool {
return q.front == q.rear
}
func (q *CircleQueue) Show() string {
func (q *CircleQueue[T]) Show() string {
return fmt.Sprintf("%v", q.data)
}