Function TestRotatedQueueSearch

worker_loop_queue_test.go:73–155

(t *testing.T)

}

func TestRotatedQueueSearch(t *testing.T) {
	size := 10
	q := newWorkerLoopQueue(size)

	currTime := time.Now().UnixNano()

	// 1
	expiry1 := currTime
	currTime++
	_ = q.insert(&goWorker{lastUsed: currTime})

	require.EqualValues(t, 0, q.binarySearch(currTime), "index should be 0")
	require.EqualValues(t, -1, q.binarySearch(expiry1), "index should be -1")

	// 2
	currTime++
	expiry2 := currTime
	currTime++
	_ = q.insert(&goWorker{lastUsed: currTime})

	require.EqualValues(t, -1, q.binarySearch(expiry1), "index should be -1")

	require.EqualValues(t, 0, q.binarySearch(expiry2), "index should be 0")

	require.EqualValues(t, 1, q.binarySearch(currTime), "index should be 1")

	// more
	for i := 0; i < 5; i++ {
		currTime++
		_ = q.insert(&goWorker{lastUsed: currTime})
	}

	currTime++
	expiry3 := currTime
	_ = q.insert(&goWorker{lastUsed: expiry3})

	var err error
	for err != errQueueIsFull {
		currTime++
		err = q.insert(&goWorker{lastUsed: currTime})
	}

	require.EqualValues(t, 7, q.binarySearch(expiry3), "index should be 7")

	// rotate
	for i := 0; i < 6; i++ {
		_ = q.detach()
	}

	currTime++
	expiry4 := currTime
	_ = q.insert(&goWorker{lastUsed: expiry4})

	for i := 0; i < 4; i++ {
		currTime++
		_ = q.insert(&goWorker{lastUsed: currTime})
	}
	//	head = 6, tail = 5, insert direction ->