forked from adrianbrad/queue
-
Notifications
You must be signed in to change notification settings - Fork 0
/
example_blocking_test.go
79 lines (58 loc) · 1.39 KB
/
example_blocking_test.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
78
79
package queue_test
import (
"fmt"
"time"
"github.com/adrianbrad/queue"
)
func ExampleBlocking() {
elems := []int{1, 2, 3}
blockingQueue := queue.NewBlocking(elems, queue.WithCapacity(4))
containsThree := blockingQueue.Contains(3)
fmt.Println("Contains 3:", containsThree)
size := blockingQueue.Size()
fmt.Println("Size:", size)
empty := blockingQueue.IsEmpty()
fmt.Println("Empty before clear:", empty)
clearElems := blockingQueue.Clear()
fmt.Println("Clear:", clearElems)
empty = blockingQueue.IsEmpty()
fmt.Println("Empty after clear:", empty)
var (
elem int
after time.Duration
)
done := make(chan struct{})
start := time.Now()
// this function waits for a new element to be available in the queue.
go func() {
defer close(done)
elem = blockingQueue.GetWait()
after = time.Since(start)
}()
time.Sleep(time.Millisecond)
// insert a new element into the queue.
if err := blockingQueue.Offer(4); err != nil {
fmt.Println("Offer err:", err)
return
}
nextElem, err := blockingQueue.Peek()
if err != nil {
fmt.Println("Peek err:", err)
return
}
fmt.Println("Peeked elem:", nextElem)
<-done
fmt.Printf(
"Elem %d received after %s",
elem,
after.Round(time.Millisecond),
)
// Output:
// Contains 3: true
// Size: 3
// Empty before clear: false
// Clear: [1 2 3]
// Empty after clear: true
// Peeked elem: 4
// Elem 4 received after 1ms
}