|
1 | 1 | /**************************************************************************** |
2 | | - * Copyright 2022, Optimizely, Inc. and contributors * |
| 2 | + * Copyright 2022-2025, Optimizely, Inc. and contributors * |
3 | 3 | * * |
4 | 4 | * Licensed under the Apache License, Version 2.0 (the "License"); * |
5 | 5 | * you may not use this file except in compliance with the License. * |
@@ -204,3 +204,122 @@ func TestTimeout(t *testing.T) { |
204 | 204 | assert.Equal(t, 200, cache2.Lookup("2")) |
205 | 205 | assert.Equal(t, 300, cache2.Lookup("3")) |
206 | 206 | } |
| 207 | + |
| 208 | +func TestRemove(t *testing.T) { |
| 209 | + // Test removing an existing key |
| 210 | + t.Run("Remove existing key", func(t *testing.T) { |
| 211 | + cache := NewLRUCache(3, 1000*time.Second) |
| 212 | + |
| 213 | + // Add items to cache |
| 214 | + cache.Save("1", 100) |
| 215 | + cache.Save("2", 200) |
| 216 | + cache.Save("3", 300) |
| 217 | + |
| 218 | + // Verify items exist |
| 219 | + assert.Equal(t, 100, cache.Lookup("1")) |
| 220 | + assert.Equal(t, 200, cache.Lookup("2")) |
| 221 | + assert.Equal(t, 300, cache.Lookup("3")) |
| 222 | + assert.Equal(t, 3, cache.queue.Len()) |
| 223 | + assert.Equal(t, 3, len(cache.items)) |
| 224 | + |
| 225 | + // Remove an item |
| 226 | + cache.Remove("2") |
| 227 | + |
| 228 | + // Verify item was removed |
| 229 | + assert.Equal(t, 100, cache.Lookup("1")) |
| 230 | + assert.Nil(t, cache.Lookup("2")) |
| 231 | + assert.Equal(t, 300, cache.Lookup("3")) |
| 232 | + assert.Equal(t, 2, cache.queue.Len()) |
| 233 | + assert.Equal(t, 2, len(cache.items)) |
| 234 | + }) |
| 235 | + |
| 236 | + // Test removing a non-existent key |
| 237 | + t.Run("Remove non-existent key", func(t *testing.T) { |
| 238 | + cache := NewLRUCache(3, 1000*time.Second) |
| 239 | + |
| 240 | + // Add items to cache |
| 241 | + cache.Save("1", 100) |
| 242 | + cache.Save("2", 200) |
| 243 | + |
| 244 | + // Remove a non-existent key |
| 245 | + cache.Remove("3") |
| 246 | + |
| 247 | + // Verify state remains unchanged |
| 248 | + assert.Equal(t, 100, cache.Lookup("1")) |
| 249 | + assert.Equal(t, 200, cache.Lookup("2")) |
| 250 | + assert.Equal(t, 2, cache.queue.Len()) |
| 251 | + assert.Equal(t, 2, len(cache.items)) |
| 252 | + }) |
| 253 | + |
| 254 | + // Test removing from a zero-sized cache |
| 255 | + t.Run("Remove from zero-sized cache", func(t *testing.T) { |
| 256 | + cache := NewLRUCache(0, 1000*time.Second) |
| 257 | + |
| 258 | + // Try to add and remove items |
| 259 | + cache.Save("1", 100) |
| 260 | + cache.Remove("1") |
| 261 | + |
| 262 | + // Verify nothing happened |
| 263 | + assert.Nil(t, cache.Lookup("1")) |
| 264 | + assert.Equal(t, 0, cache.queue.Len()) |
| 265 | + assert.Equal(t, 0, len(cache.items)) |
| 266 | + }) |
| 267 | + |
| 268 | + // Test removing and then adding back |
| 269 | + t.Run("Remove and add back", func(t *testing.T) { |
| 270 | + cache := NewLRUCache(3, 1000*time.Second) |
| 271 | + |
| 272 | + // Add items to cache |
| 273 | + cache.Save("1", 100) |
| 274 | + cache.Save("2", 200) |
| 275 | + cache.Save("3", 300) |
| 276 | + |
| 277 | + // Remove an item |
| 278 | + cache.Remove("2") |
| 279 | + |
| 280 | + // Add it back with a different value |
| 281 | + cache.Save("2", 201) |
| 282 | + |
| 283 | + // Verify item was added back |
| 284 | + assert.Equal(t, 100, cache.Lookup("1")) |
| 285 | + assert.Equal(t, 201, cache.Lookup("2")) |
| 286 | + assert.Equal(t, 300, cache.Lookup("3")) |
| 287 | + assert.Equal(t, 3, cache.queue.Len()) |
| 288 | + assert.Equal(t, 3, len(cache.items)) |
| 289 | + }) |
| 290 | + |
| 291 | + // Test thread safety of Remove |
| 292 | + t.Run("Thread safety", func(t *testing.T) { |
| 293 | + maxSize := 100 |
| 294 | + cache := NewLRUCache(maxSize, 1000*time.Second) |
| 295 | + wg := sync.WaitGroup{} |
| 296 | + |
| 297 | + // Add entries |
| 298 | + for i := 1; i <= maxSize; i++ { |
| 299 | + cache.Save(fmt.Sprintf("%d", i), i*100) |
| 300 | + } |
| 301 | + |
| 302 | + // Concurrently remove half the entries |
| 303 | + wg.Add(maxSize / 2) |
| 304 | + for i := 1; i <= maxSize/2; i++ { |
| 305 | + go func(k int) { |
| 306 | + defer wg.Done() |
| 307 | + cache.Remove(fmt.Sprintf("%d", k)) |
| 308 | + }(i) |
| 309 | + } |
| 310 | + wg.Wait() |
| 311 | + |
| 312 | + // Verify first half is removed, second half remains |
| 313 | + for i := 1; i <= maxSize; i++ { |
| 314 | + if i <= maxSize/2 { |
| 315 | + assert.Nil(t, cache.Lookup(fmt.Sprintf("%d", i))) |
| 316 | + } else { |
| 317 | + assert.Equal(t, i*100, cache.Lookup(fmt.Sprintf("%d", i))) |
| 318 | + } |
| 319 | + } |
| 320 | + |
| 321 | + // Verify cache size |
| 322 | + assert.Equal(t, maxSize/2, cache.queue.Len()) |
| 323 | + assert.Equal(t, maxSize/2, len(cache.items)) |
| 324 | + }) |
| 325 | +} |
0 commit comments