lru := lru.NewLRU[string, int](10, nil, time.Hour)
	lru.Add("key1", 1)

	if value, ok := lru.Get("key1"); !ok || value != 1 {
		t.Errorf("Expected key1 to be added with value 1, got %v", value)
	}
}

func TestLRU_Add_ExceedsSize_RemovesOldest(t *testing.T) {
	lru := lru.NewLRU[string, int](2, nil, time.Hour)
	lru.Add("key1", 1)
	lru.Add("key2", 2)
	lru.Add("key3", 3)

	if _, ok := lru.Get("key1"); ok {

import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.Map;

/**
 * {@link HashMap} with an upper limit on the number of entries. When a new entry is added, the oldest entry is discarded using LRU if the limit is exceeded.
 * <p>
 * <strong>Thread-Safety:</strong> This class is <strong>NOT thread-safe</strong>.
 * It extends {@link LinkedHashMap} without synchronization. If multiple threads access

vt?w!.&66duolc,gro?moc?s&ndnyd,tepym,?ten?ude?vog??a!.&no.&1-&ht&ron-ue.&lru-adbmal,ppabew-refsnart,?uos-&em.&lru-adbmal,ppabew-refsnart,?fa.&lru-adbmal,ppabew-refsnart,?pa.&lru-adbmal,ppabew-refsnart,?ue.&lru-adbmal,ppabew-refsnart,???lartnec-&ac.&lru-adbmal,ppabew-refsnart,?em.ppabew-refsnart,li.ppabew-refsnart,ue.&lru-adbmal,ppabew-refsnart,??ts&ae&-&as.&lru-adbmal,ppabew-refsnart,?pa.&lru-adbmal,ppabew-refsnart,?su.&lru-adbmal,ppabew-refsnart,?vog-su.&ppabew-refsnart,spif-ppabew-refsnart,??h...

            Integer key = entry.getKey();
            cache.invalidate(key);
          }
        });
  }

  public void testEviction_lru() {
    // test lru within a single segment
    IdentityLoader<Integer> loader = identityLoader();
    LoadingCache<Integer, Integer> cache =
        CacheBuilder.newBuilder().concurrencyLevel(1).maximumSize(10).build(loader);

### Создание `Settings` только один раз с помощью `lru_cache` { #creating-the-settings-only-once-with-lru-cache }

Чтение файла с диска обычно затратная (медленная) операция, поэтому, вероятно, вы захотите сделать это один раз и затем переиспользовать один и тот же объект настроек, а не читать файл при каждом запросе.

 */
public class LruHashSet<E> extends AbstractSet<E> implements Set<E>, java.io.Serializable {
    private static final long serialVersionUID = 1L;

    /**
     * The internal LRU hash map used to store elements.
     */
    private final LruHashMap<E, Object> map;

    // Dummy value to associate with an Object in the backing Map
    private static final Object PRESENT = new Object();

    /**

            .ticker(ticker)
            .build(loader);
    runRemovalScheduler(cache, removalListener, loader, ticker, KEY_PREFIX, EXPIRING_TIME);
  }

  public void testExpirationOrder_access() {
    // test lru within a single segment
    FakeTicker ticker = new FakeTicker();
    IdentityLoader<Integer> loader = identityLoader();
    LoadingCache<Integer, Integer> cache =
        CacheBuilder.newBuilder()

### Die `Settings` nur einmal laden mittels `lru_cache` { #creating-the-settings-only-once-with-lru-cache }

- **Collections** (`org.codelibs.core.collection`) - Enhanced collection utilities, array operations, and specialized map/set implementations including LRU caches and case-insensitive collections
- **I/O Operations** (`org.codelibs.core.io`) - File handling, resource management, stream utilities, and traversal utilities for efficient resource processing

### Creating the `Settings` only once with `lru_cache` { #creating-the-settings-only-once-with-lru-cache }

Reading a file from disk is normally a costly (slow) operation, so you probably want to do it only once and then reuse the same settings object, instead of reading it for each request.

But every time we do: