-
Notifications
You must be signed in to change notification settings - Fork 199
/
connection_heap_test.go
89 lines (75 loc) · 2.77 KB
/
connection_heap_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
80
81
82
83
84
85
86
87
88
89
// Copyright 2014-2022 Aerospike, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package aerospike
import (
gg "github.com/onsi/ginkgo/v2"
gm "github.com/onsi/gomega"
)
// ALL tests are isolated by SetName and Key, which are 50 random characters
var _ = gg.Describe("Connection Heap tests", func() {
conn := new(Connection)
gg.Context("singleConnectionHeap", func() {
gg.It("Must add until full", func() {
h := newSingleConnectionHeap(10)
for i := 0; i < 10; i++ {
gm.Expect(h.Len()).To(gm.Equal(i))
gm.Expect(h.head).To(gm.Equal(uint32(i)))
gm.Expect(h.tail).To(gm.Equal(uint32(0)))
gm.Expect(h.Offer(conn)).To(gm.BeTrue())
gm.Expect(h.Len()).To(gm.Equal(i + 1))
gm.Expect(h.head).To(gm.Equal(uint32(i+1) % 10))
gm.Expect(h.tail).To(gm.Equal(uint32(0)))
}
gm.Expect(h.Offer(conn)).To(gm.BeFalse())
gm.Expect(h.Offer(conn)).To(gm.BeFalse())
gm.Expect(h.Len()).To(gm.Equal(10))
gm.Expect(h.full).To(gm.BeTrue())
gm.Expect(h.head).To(gm.Equal(h.tail))
})
gg.It("Must add until full, then Poll successfully", func() {
h := newSingleConnectionHeap(10)
for i := 0; i < 10; i++ {
gm.Expect(h.Offer(conn)).To(gm.BeTrue())
}
for i := 0; i < 10; i++ {
gm.Expect(h.Len()).To(gm.Equal(10 - i))
gm.Expect(h.head).To(gm.Equal(uint32(10-i) % 10))
gm.Expect(h.tail).To(gm.Equal(uint32(0)))
gm.Expect(h.Poll()).NotTo(gm.BeNil())
gm.Expect(h.full).To(gm.BeFalse())
gm.Expect(h.Len()).To(gm.Equal(10 - i - 1))
gm.Expect(h.head).To(gm.Equal(uint32(10 - i - 1)))
gm.Expect(h.tail).To(gm.Equal(uint32(0)))
}
gm.Expect(h.Poll()).To(gm.BeNil())
gm.Expect(h.Poll()).To(gm.BeNil())
gm.Expect(h.Len()).To(gm.Equal(0))
gm.Expect(h.full).To(gm.BeFalse())
gm.Expect(h.head).To(gm.Equal(h.tail))
})
gg.It("Must add then Poll successfully", func() {
h := newSingleConnectionHeap(10)
gm.Expect(h.Offer(conn)).To(gm.BeTrue())
gm.Expect(h.Len()).To(gm.Equal(1))
gm.Expect(h.head).To(gm.Equal(uint32(1)))
gm.Expect(h.full).To(gm.BeFalse())
gm.Expect(h.Poll()).NotTo(gm.BeNil())
gm.Expect(h.Poll()).To(gm.BeNil())
gm.Expect(h.Len()).To(gm.Equal(0))
gm.Expect(h.full).To(gm.BeFalse())
gm.Expect(h.head).To(gm.Equal(uint32(0)))
gm.Expect(h.head).To(gm.Equal(h.tail))
})
})
})