Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for 20L (0.01 seconds)

  1. src/test/java/org/codelibs/fess/entity/SearchRenderDataTest.java

            searchRenderData.setExistNextPage(true);
            searchRenderData.setExistPrevPage(true);
            searchRenderData.setCurrentStartRecordNumber(11L);
            searchRenderData.setCurrentEndRecordNumber(20L);
    
            List<String> pageNumbers = Arrays.asList("1", "2", "3", "4", "5");
            searchRenderData.setPageNumberList(pageNumbers);
    
            List<Map<String, Object>> documents = new ArrayList<>();
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 23.6K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/cache/LocalCache.java

        // will result in random eviction behavior.
        int segmentShift = 0;
        int segmentCount = 1;
        while (segmentCount < concurrencyLevel
            && (!evictsBySize() || segmentCount * 20L <= maxWeight)) {
          ++segmentShift;
          segmentCount <<= 1;
        }
        this.segmentShift = 32 - segmentShift;
        segmentMask = segmentCount - 1;
    
        this.segments = newSegmentArray(segmentCount);
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 143.5K bytes
    - Click Count (0)
  3. guava/src/com/google/common/cache/LocalCache.java

        // will result in random eviction behavior.
        int segmentShift = 0;
        int segmentCount = 1;
        while (segmentCount < concurrencyLevel
            && (!evictsBySize() || segmentCount * 20L <= maxWeight)) {
          ++segmentShift;
          segmentCount <<= 1;
        }
        this.segmentShift = 32 - segmentShift;
        segmentMask = segmentCount - 1;
    
        this.segments = newSegmentArray(segmentCount);
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 148.9K bytes
    - Click Count (0)
Back to Top