mirror of
https://github.com/lukaszraczylo/traefikoidc.git
synced 2026-10-12 04:04:26 +00:00
lukaszraczylo
4d23d618f5
- RESP -ERR no longer closes healthy conn / aborts batch; global cap replacement-aware - global health-check pass serialized (latent data race); MemoryMonitor via ResourceManager - token-exchange retry, open-circuit rejections counted as failures - TLS-posture matching transport reuse (no silent InsecureSkipVerify handoff)
29 lines
977 B
Go
29 lines
977 B
Go
package backends
|
|
|
|
import (
|
|
"testing"
|
|
"time"
|
|
)
|
|
|
|
// TestCacheShard_SetRefreshExistingDoesNotEvictAtCapacity verifies the shard
|
|
// set path does not evict an unrelated LRU entry when replacing an existing
|
|
// key at capacity (count stays flat) (R139 F2). Mirrors the Cache.Set fix.
|
|
func TestCacheShard_SetRefreshExistingDoesNotEvictAtCapacity(t *testing.T) {
|
|
s := newCacheShard(2, 0) // maxSize=2, no memory bound
|
|
exp := time.Now().Add(time.Minute)
|
|
|
|
s.set("a", "va", exp, 1) // becomes LRU
|
|
s.set("b", "vb", exp, 1) // MRU
|
|
|
|
// Refresh the most-recent key while at capacity. On the buggy path the
|
|
// LRU sibling `a` is evicted; on the fixed path the replacement is free.
|
|
s.set("b", "vb2", exp, 1)
|
|
|
|
if _, exists, _ := s.get("a"); !exists {
|
|
t.Fatal("refreshing an existing key must not evict an unrelated live entry `a`")
|
|
}
|
|
if v, exists, _ := s.get("b"); !exists || v != "vb2" {
|
|
t.Fatalf("refreshed key `b` should hold the new value, got %v exists=%v", v, exists)
|
|
}
|
|
}
|