tasks.configureEach {
            val task = this
            if (isIncompatible(task)) {
                task.notCompatibleWithConfigurationCache("Task is not compatible with the configuration cache")
            }
        }
    }

        }
    }

    @Nested
    @DisplayName("Cache Management Tests")
    class CacheManagementTests {

        private Map<String, DfsReferralDataInternal> cacheMap;

        @BeforeEach
        void setUpCache() {
            cacheMap = new HashMap<>();
        }

        @Test
        @DisplayName("Should set cache map")
        void testSetCacheMap() {

 * by the garbage collector. Entries with reclaimed keys or values may be removed from the cache on
 * each cache modification, on occasional cache accesses, or on calls to {@link Cache#cleanUp}; such
 * entries may be counted in {@link Cache#size}, but will never be visible to read or write
 * operations.
 *

            entry.updateState(newState);

            // Flush any cached data if losing write cache
            if (Smb2LeaseState.hasWriteCaching(oldState) && !Smb2LeaseState.hasWriteCaching(newState)) {
                flushCachedWrites(entry.getPath());
            }

            // Invalidate cached data if losing read cache

public interface ModelCache {

    /**
     * Puts the specified data into the cache.
     *
     * @param groupId The group id of the cache record, must not be {@code null}.
     * @param artifactId The artifact id of the cache record, must not be {@code null}.
     * @param version The version of the cache record, must not be {@code null}.
     * @param tag The tag of the cache record, must not be {@code null}.

         * It's very unlikely that any loaded Futures class will see getChecked called with more
         * than a handful of exceptions. But it seems prudent to set a cap on how many we'll cache.
         * This avoids out-of-control memory consumption, and it keeps the cache from growing so
         * large that doing the lookup is noticeably slower than redoing the work would be.
         *

 * the License.
 */

package com.google.common.cache;

import static com.google.common.cache.CacheTesting.checkEmpty;
import static com.google.common.cache.TestingCacheLoaders.constantLoader;
import static com.google.common.cache.TestingCacheLoaders.exceptionLoader;
import static com.google.common.cache.TestingRemovalListeners.queuingRemovalListener;
import static com.google.common.truth.Truth.assertThat;

 * the License.
 */

package com.google.common.cache;

import static com.google.common.cache.CacheTesting.checkEmpty;
import static com.google.common.cache.TestingCacheLoaders.constantLoader;
import static com.google.common.cache.TestingCacheLoaders.exceptionLoader;
import static com.google.common.cache.TestingRemovalListeners.queuingRemovalListener;
import static com.google.common.truth.Truth.assertThat;

     */
    public static final int DIRECTORY_FULL = Smb2LeaseState.SMB2_LEASE_FULL;

    /**
     * Check if directory can cache enumeration results
     * @param state lease state
     * @return true if directory enumeration can be cached
     */
    public static boolean canCacheEnumeration(int state) {
        return Smb2LeaseState.hasReadCaching(state);
    }

    /**

    if (value != null) {
      return value;
    }

    // Store a local reference to the cache entry. If the backing map is immutable, this,
    // in combination with immutable cache entries, will ensure a thread-safe cache.
    CacheEntry<K, V> entry;

    // Check cache. We use == on purpose because it's cheaper and a cache miss is ok.
    entry = cacheEntry1;
    if (entry != null && entry.key == key) {
      return entry.value;