Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for segmentSize (0.09 sec)

  1. guava/src/com/google/common/cache/LocalCache.java

        int segmentCapacity = initialCapacity / segmentCount;
        if (segmentCapacity * segmentCount < initialCapacity) {
          ++segmentCapacity;
        }
    
        int segmentSize = 1;
        while (segmentSize < segmentCapacity) {
          segmentSize <<= 1;
        }
    
        if (evictsBySize()) {
          // Ensure sum of segment max weights = overall max weights
          long maxSegmentWeight = maxWeight / segmentCount + 1;
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Sep 11 19:35:11 UTC 2025
    - 148.9K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/cache/LocalCacheTest.java

          int concurrencyLevel, int initialCapacity, int segmentSize) {
        LocalCache<Object, Object> map =
            makeLocalCache(
                createCacheBuilder()
                    .concurrencyLevel(concurrencyLevel)
                    .initialCapacity(initialCapacity));
        for (int i = 0; i < map.segments.length; i++) {
          assertThat(map.segments[i].table.length()).isEqualTo(segmentSize);
        }
      }
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Fri Dec 12 00:25:21 UTC 2025
    - 115.9K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/cache/LocalCacheTest.java

          int concurrencyLevel, int initialCapacity, int segmentSize) {
        LocalCache<Object, Object> map =
            makeLocalCache(
                createCacheBuilder()
                    .concurrencyLevel(concurrencyLevel)
                    .initialCapacity(initialCapacity));
        for (int i = 0; i < map.segments.length; i++) {
          assertThat(map.segments[i].table.length()).isEqualTo(segmentSize);
        }
      }
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Fri Dec 12 00:25:21 UTC 2025
    - 117.5K bytes
    - Viewed (0)
Back to top