File size: 1,104 Bytes
7107f0b |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 |
package generic
type Queue[T any] struct {
queue []T
}
func NewQueue[T any]() *Queue[T] {
return &Queue[T]{queue: make([]T, 0)}
}
func (q *Queue[T]) Push(v T) {
q.queue = append(q.queue, v)
}
func (q *Queue[T]) Pop() T {
v := q.queue[0]
q.queue = q.queue[1:]
return v
}
func (q *Queue[T]) Len() int {
return len(q.queue)
}
func (q *Queue[T]) IsEmpty() bool {
return len(q.queue) == 0
}
func (q *Queue[T]) Clear() {
q.queue = nil
}
func (q *Queue[T]) Peek() T {
return q.queue[0]
}
func (q *Queue[T]) PeekN(n int) []T {
return q.queue[:n]
}
func (q *Queue[T]) PopN(n int) []T {
v := q.queue[:n]
q.queue = q.queue[n:]
return v
}
func (q *Queue[T]) PopAll() []T {
v := q.queue
q.queue = nil
return v
}
func (q *Queue[T]) PopWhile(f func(T) bool) []T {
var i int
for i = 0; i < len(q.queue); i++ {
if !f(q.queue[i]) {
break
}
}
v := q.queue[:i]
q.queue = q.queue[i:]
return v
}
func (q *Queue[T]) PopUntil(f func(T) bool) []T {
var i int
for i = 0; i < len(q.queue); i++ {
if f(q.queue[i]) {
break
}
}
v := q.queue[:i]
q.queue = q.queue[i:]
return v
}
|