//     eviction callback, and TTL.
func New(size int, ttl time.Duration) Store {
	if size <= 0 {
		size = defaultMaxSize
	}

	if ttl <= 0 {
		ttl = defaultTTL
	}

	onEvicted := func(k string, v *Stmt) {
		if v != nil {
			go v.Close()
		}
	}
	return &lruStore{lru: lru.NewLRU[string, *Stmt](size, onEvicted, ttl)}
}

type lruStore struct {

    /**
     * Gets the last access time.
     *
     * @return the last access time in milliseconds since epoch
     */
    long lastAccess();

    /**
     * Gets the file size.
     *
     * @return the file size in bytes
     */
    long length();

    /**
     * Gets the file index.
     *
     * @return the file index inside the parent directory
     */
    int getFileIndex();

    assertEquals(underlying.size(), map.size());

    underlying.put("d", 4);
    assertEquals(underlying.size(), map.size());
    assertEquals("4", map.get("d"));

    underlying.remove("c");
    assertEquals(underlying.size(), map.size());
    assertFalse(map.containsKey("c"));

    underlying.clear();
    assertEquals(underlying.size(), map.size());
  }

}

// Resize changes the cache size. Size of 0 means unlimited.
func (c *LRU[K, V]) Resize(size int) (evicted int) {
	c.mu.Lock()
	defer c.mu.Unlock()
	if size <= 0 {
		c.size = 0
		return 0
	}
	diff := c.evictList.Length() - size
	if diff < 0 {
		diff = 0
	}
	for i := 0; i < diff; i++ {
		c.removeOldest()
	}
	c.size = size
	return diff
}

        assertTrue(
                projectBuildList.size() >= 6,
                "Expected size " + projectBuildList.size() + " to be >= 6 for collection: " + projectBuildList);

        final ProjectBuildList byTaskSegment = projectBuildList.getByTaskSegment(taskSegment);
        assertEquals(projectBuildList.size(), byTaskSegment.size()); // TODO Make multiple segments on projectBuildList
    }

        assertEquals(4, depArtifact.getProperties().size());

        assertEquals("compile", dep2.getScope());
        assertFalse(dep2.isOptional(), "Expected " + dep2 + ".isOptional() to return false");
        assertEquals(0, dep2.getExclusions().size());
        depArtifact = dep2.getArtifact();
        assertEquals("ut.simple", depArtifact.getGroupId());

            assertTrue(result.success(), "Orchestrator should succeed");
            assertEquals(2, result.processedPoms().size(), "Should aggregate processed POMs");
            assertEquals(2, result.modifiedPoms().size(), "Should aggregate modified POMs");
            assertEquals(0, result.errorPoms().size(), "Should have no errors");
        }

        @Test
        @DisplayName("should handle strategy failures gracefully")

vQqN3hlDw==","EcAlgo":1,"EcM":2,"EcN":2,"EcBSize":1048576,"EcIndex":4,"EcDist":[4,1,2,3],"CSumAlgo":1,"PartNums":[1],"PartETags":[""],"PartSizes":[101974],"PartASizes":[176837],"Size":101974,"MTime":1634106631319256439,"MetaSys":{"X-Minio-Internal-compression":"a2xhdXNwb3N0L2NvbXByZXNzL3My","X-Minio-Internal-actual-size":"MTc2ODM3","x-minio-internal-objectlock-legalhold-timestamp":"MjAyMS0xMC0xOVQyMjozNTo0Ni4zNTE4MDU3NTda"},"MetaUsr":{"x-amz-object-lock-mode":"COMPLIANCE","x-amz-object-lock-reta...

        assertEquals(8, emptyContext.size()); // Minimum size
        assertFalse(emptyContext.supportsAlgorithm(CompressionNegotiateContext.COMPRESSION_LZ77));
    }

    @Test
    @DisplayName("Test context size calculation")
    public void testContextSize() {
        int expectedSize = 8 + (3 * 2); // Header + 3 algorithms * 2 bytes each
        assertEquals(expectedSize, context.size());
    }

    @Test

      ImmutableSet<C> columnSpace) {
    // use a dense table if more than half of the cells have values
    // TODO(gak): tune this condition based on empirical evidence
    return (cellList.size() > (((long) rowSpace.size() * columnSpace.size()) / 2))
        ? new DenseImmutableTable<R, C, V>(cellList, rowSpace, columnSpace)
        : new SparseImmutableTable<R, C, V>(cellList, rowSpace, columnSpace);
  }

  /**