remove[id] = struct{}{}
			continue
		}
	}

	// If above limit, remove the caches with the oldest handout time.
	if len(caches)-len(remove) > metacacheMaxEntries {
		remainCaches := make([]metacache, 0, len(caches)-len(remove))
		for id, cache := range caches {
			if _, ok := remove[id]; ok {
				continue
			}
			remainCaches = append(remainCaches, cache)
		}

        .withKeyStrengths(ImmutableSet.of(STRONG, Strength.WEAK))
        .withValueStrengths(ImmutableSet.of(STRONG, Strength.WEAK, Strength.SOFT));
  }

  private Iterable<LoadingCache<Key, String>> caches() {
    CacheBuilderFactory factory = factoryWithAllKeyStrengths();
    return Iterables.transform(
        factory.buildAllPermutations(),
        new Function<CacheBuilder<Object, Object>, LoadingCache<Key, String>>() {

        run: |
          mkdir -p ~/.mimir
          cp .github/ci-extensions.xml ~/.m2/extensions.xml
          cp .github/ci-mimir-daemon.properties ~/.mimir/daemon.properties

      - name: Handle Mimir caches
        uses: actions/cache@0400d5f644dc74513175e3cd8d07132dd4860809 # v4
        with:
          path: ~/.mimir/local
          key: mimir-${{ runner.os }}-initial-${{ hashFiles('**/pom.xml') }}
          restore-keys: |

      return "Suppliers.compose(" + function + ", " + supplier + ")";
    }

    @GwtIncompatible @J2ktIncompatible private static final long serialVersionUID = 0;
  }

  /**
   * Returns a supplier which caches the instance retrieved during the first call to {@code get()}
   * and returns that value on subsequent calls to {@code get()}. See: <a
   * href="http://en.wikipedia.org/wiki/Memoization">memoization</a>
   *

      return "Suppliers.compose(" + function + ", " + supplier + ")";
    }

    @GwtIncompatible @J2ktIncompatible private static final long serialVersionUID = 0;
  }

  /**
   * Returns a supplier which caches the instance retrieved during the first call to {@code get()}
   * and returns that value on subsequent calls to {@code get()}. See: <a
   * href="http://en.wikipedia.org/wiki/Memoization">memoization</a>
   *

        assertEquals("test_rank_fusion", rankFusionSearcher.getName());
    }

    public void test_getName_cachesBehavior() {
        // Test that getName() caches the result after first call
        String firstName = rankFusionSearcher.getName();
        String secondName = rankFusionSearcher.getName();
        assertSame(firstName, secondName);

        assertFalse(auth.isAnonymous());
        assertFalse(auth.isGuest());
    }

    @ParameterizedTest
    @EnumSource(SubjectVariant.class)
    @DisplayName("getSubject: caches results and refresh resets cache")
    void testGetSubjectLoginFailuresCacheAndRefresh(SubjectVariant variant) throws Exception {
        JAASAuthenticator auth = buildAuthenticator(variant);

        }

        // Stop all change watchers
        for (String path : directoryCache.keySet()) {
            changeNotifier.stopWatching(path);
        }

        // Clear caches
        directoryCache.clear();
        leaseToPath.clear();
    }

    /**
     * Clean up expired cache entries
     */
    private void cleanupExpiredEntries() {

        assertEquals(0x123456, target.getPipeType());
        assertEquals("\\\\pipe\\\\my-pipe", target.getUncPath());
    }

    @Test
    @DisplayName("ensureTreeConnected caches tree and acquires on each call")
    void testEnsureTreeConnectedCaching() throws CIFSException {
        // Arrange: first ensureTreeConnected comes from pipe
        when(pipe.ensureTreeConnected()).thenReturn(tree);

Donc, pendant ce temps, l'ordinateur pourra effectuer d'autres tâches, pendant que "fichier-lent" 📝 se termine.

Ensuite l'ordinateur / le programme 🤖 reviendra à chaque fois qu'il en a la chance que ce soit parce qu'il attend à nouveau, ou car il 🤖 a fini tout le travail qu'il avait à faire. Il 🤖 regardera donc si les tâches qu'il attend ont terminé d'être effectuées.