forked from andersfylling/disgord
/
ticketQueue.go
77 lines (62 loc) · 1.04 KB
/
ticketQueue.go
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
77
package util
import (
"sync"
)
type Ticket int
const (
NoTicket Ticket = -1
)
type TicketQueue struct {
mu sync.Mutex
tickets []Ticket
nextTicket Ticket
}
func (q *TicketQueue) NewTicket() (ticket Ticket) {
q.mu.Lock()
defer q.mu.Unlock()
defer func() {
q.nextTicket++
}()
ticket = q.nextTicket
q.tickets = append(q.tickets, ticket)
return ticket
}
func (q *TicketQueue) Delete(ticket Ticket) {
q.mu.Lock()
defer q.mu.Unlock()
var i int
var ok bool
for i = range q.tickets {
if q.tickets[i] == ticket {
ok = true
break
}
}
if !ok {
return
}
if i == len(q.tickets)-1 {
q.tickets = q.tickets[:i]
} else {
q.tickets = append(q.tickets[i:], q.tickets[i+1:]...)
}
}
func (q *TicketQueue) Next(ticket Ticket, cb func() bool) bool {
q.mu.Lock()
defer q.mu.Unlock()
if len(q.tickets) == 0 {
return false
}
if q.tickets[0] != ticket {
return false
}
if ok := cb(); !ok {
return false
}
if len(q.tickets) > 1 {
q.tickets = q.tickets[1:]
} else {
q.tickets = q.tickets[:0]
}
return true
}