mirror of
https://github.com/kubernetes/client-go.git
synced 2025-09-30 08:56:07 +00:00
d67dddfe90
This change adds a generic version of the various workqueue types while retaining compatibility for the existing exported symbols and constructors. The generic variants are prefixed with `Typed` and the existing ones are marked as deprecated to nudge people to transition without breaking them. Kubernetes-commit: 0c7370bb851c15825d30a516722139ccccca0cfc
76 lines
2.4 KiB
Go
76 lines
2.4 KiB
Go
/*
|
|
Copyright 2016 The Kubernetes Authors.
|
|
|
|
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 workqueue
|
|
|
|
import (
|
|
"testing"
|
|
"time"
|
|
|
|
testingclock "k8s.io/utils/clock/testing"
|
|
)
|
|
|
|
func TestRateLimitingQueue(t *testing.T) {
|
|
limiter := NewItemExponentialFailureRateLimiter(1*time.Millisecond, 1*time.Second)
|
|
queue := NewRateLimitingQueue(limiter).(*rateLimitingType[any])
|
|
fakeClock := testingclock.NewFakeClock(time.Now())
|
|
delayingQueue := &delayingType[any]{
|
|
TypedInterface: New(),
|
|
clock: fakeClock,
|
|
heartbeat: fakeClock.NewTicker(maxWait),
|
|
stopCh: make(chan struct{}),
|
|
waitingForAddCh: make(chan *waitFor, 1000),
|
|
metrics: newRetryMetrics("", nil),
|
|
}
|
|
queue.TypedDelayingInterface = delayingQueue
|
|
|
|
queue.AddRateLimited("one")
|
|
waitEntry := <-delayingQueue.waitingForAddCh
|
|
if e, a := 1*time.Millisecond, waitEntry.readyAt.Sub(fakeClock.Now()); e != a {
|
|
t.Errorf("expected %v, got %v", e, a)
|
|
}
|
|
queue.AddRateLimited("one")
|
|
waitEntry = <-delayingQueue.waitingForAddCh
|
|
if e, a := 2*time.Millisecond, waitEntry.readyAt.Sub(fakeClock.Now()); e != a {
|
|
t.Errorf("expected %v, got %v", e, a)
|
|
}
|
|
if e, a := 2, queue.NumRequeues("one"); e != a {
|
|
t.Errorf("expected %v, got %v", e, a)
|
|
}
|
|
|
|
queue.AddRateLimited("two")
|
|
waitEntry = <-delayingQueue.waitingForAddCh
|
|
if e, a := 1*time.Millisecond, waitEntry.readyAt.Sub(fakeClock.Now()); e != a {
|
|
t.Errorf("expected %v, got %v", e, a)
|
|
}
|
|
queue.AddRateLimited("two")
|
|
waitEntry = <-delayingQueue.waitingForAddCh
|
|
if e, a := 2*time.Millisecond, waitEntry.readyAt.Sub(fakeClock.Now()); e != a {
|
|
t.Errorf("expected %v, got %v", e, a)
|
|
}
|
|
|
|
queue.Forget("one")
|
|
if e, a := 0, queue.NumRequeues("one"); e != a {
|
|
t.Errorf("expected %v, got %v", e, a)
|
|
}
|
|
queue.AddRateLimited("one")
|
|
waitEntry = <-delayingQueue.waitingForAddCh
|
|
if e, a := 1*time.Millisecond, waitEntry.readyAt.Sub(fakeClock.Now()); e != a {
|
|
t.Errorf("expected %v, got %v", e, a)
|
|
}
|
|
|
|
}
|