fix (#13)

Author: guonaihong

min_heap_node.go

@@ -29,7 +29,11 @@ type minHeaps []minHeapNode
 
 func (m minHeaps) Len() int           { return len(m) }
 func (m minHeaps) Less(i, j int) bool { return m[i].absExpire.Before(m[j].absExpire) }
-func (m minHeaps) Swap(i, j int)      { m[i], m[j] = m[j], m[i] }
+func (m minHeaps) Swap(i, j int) {
+	m[i], m[j] = m[j], m[i]
+	m[i].index = i
+	m[j].index = j
+}
 
 func (m *minHeaps) Push(x any) {
 	// Push and Pop use pointer receivers because they modify the slice's length,

min_heap_test.go

@@ -196,6 +196,7 @@ func (c *curstomTest) Next(now time.Time) (rv time.Time) {
 	return
 }
 
+// 验证自定义函数的运行间隔时间
 func Test_CustomFunc(t *testing.T) {
 	t.Run("custom", func(t *testing.T) {
 
@@ -233,3 +234,26 @@ func Test_CustomFunc(t *testing.T) {
 		assert.Equal(t, mh.runCount, uint32(3))
 	})
 }
+
+// 验证运行次数是符合预期的
+func Test_RunCount(t *testing.T) {
+	t.Run("runcount-10ms", func(t *testing.T) {
+		tm := NewTimer(WithMinHeap())
+		max := 10
+		go func() {
+			tm.Run()
+		}()
+
+		count := uint32(0)
+		for i := 0; i < max; i++ {
+
+			tm.ScheduleFunc(time.Millisecond*10, func() {
+				atomic.AddUint32(&count, 1)
+			})
+		}
+
+		time.Sleep(time.Millisecond * 15)
+		tm.Stop()
+		assert.Equal(t, count, uint32(max))
+	})
+}