Search Options

Results per page
Sort
Preferred Languages
Advance

Results 411 - 420 of 824 for mount (0.02 sec)

  1. src/main/java/jcifs/internal/witness/WitnessRegistration.java

        }
    
        /**
         * Updates the heartbeat timestamp to current time and resets failure count.
         */
        public void updateHeartbeat() {
            this.lastHeartbeat = System.currentTimeMillis();
            this.heartbeatFailures = 0;
        }
    
        /**
         * Increments the heartbeat failure count.
         */
        public void incrementHeartbeatFailures() {
            this.heartbeatFailures++;
        }
    
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Mon Aug 25 14:34:10 UTC 2025
    - 6.7K bytes
    - Viewed (0)
  2. fess-crawler/src/main/java/org/codelibs/fess/crawler/extractor/impl/EmlExtractor.java

            try {
                final Object content = message.getContent();
                if (content instanceof final Multipart multipart) {
                    final int count = multipart.getCount();
                    for (int i = 0; i < count; i++) {
                        final BodyPart bodyPart = multipart.getBodyPart(i);
                        if (Part.ATTACHMENT.equalsIgnoreCase(bodyPart.getDisposition())) {
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Sun Jul 06 02:13:03 UTC 2025
    - 12.6K bytes
    - Viewed (0)
  3. fess-crawler/src/main/java/org/codelibs/fess/crawler/processor/impl/DefaultResponseProcessor.java

            accessResult.init(responseData, resultData);
            return accessResult;
        }
    
        /**
         * Checks if the access count is within the allowed limit.
         *
         * @param crawlerContext the crawler context
         * @return true if access count is within limit, false otherwise
         */
        protected boolean checkAccessCount(final CrawlerContext crawlerContext) {
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Thu Aug 07 02:55:08 UTC 2025
    - 12.5K bytes
    - Viewed (0)
  4. guava/src/com/google/common/graph/Network.java

       * self-loops incident to {@code node}).
       *
       * <p>If the count is greater than {@code Integer.MAX_VALUE}, returns {@code Integer.MAX_VALUE}.
       *
       * @throws IllegalArgumentException if {@code node} is not an element of this network
       */
      int degree(N node);
    
      /**
       * Returns the count of {@code node}'s {@link #inEdges(Object) incoming edges} in a directed
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 22:03:02 UTC 2025
    - 22.5K bytes
    - Viewed (0)
  5. guava/src/com/google/common/collect/ImmutableSortedMultiset.java

         * desired count.
         *
         * @param element the element to add or remove occurrences of
         * @param count the desired count of the element in this multiset
         * @return this {@code Builder} object
         * @throws NullPointerException if {@code element} is null
         * @throws IllegalArgumentException if {@code count} is negative
         */
        @CanIgnoreReturnValue
        @Override
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 29.5K bytes
    - Viewed (0)
  6. tests/lru_test.go

    		t.Fatalf("value differs from expected")
    	}
    
    	if lc.Resize(0) != 0 {
    		t.Fatalf("evicted count differs from expected")
    	}
    	if lc.Resize(2) != 0 {
    		t.Fatalf("evicted count differs from expected")
    	}
    	lc.Add("key2", "val2")
    	if lc.Resize(1) != 1 {
    		t.Fatalf("evicted count differs from expected")
    	}
    }
    
    func TestLRUEdgeCases(t *testing.T) {
    	lc := lru.NewLRU[string, *string](2, nil, 0)
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Sun May 25 07:40:40 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  7. src/bytes/bytes_test.go

    		buf[n-1] = 'x'
    		for i := 0; i < b.N; i++ {
    			j := Count(buf, buf[n-7:])
    			if j != 1 {
    				b.Fatal("bad count", j)
    			}
    		}
    		buf[n-1] = '\x00'
    	})
    }
    
    func BenchmarkCountEasy(b *testing.B) {
    	benchBytes(b, indexSizes, func(b *testing.B, n int) {
    		buf := bmbuf[0:n]
    		buf[n-1] = 'x'
    		buf[n-7] = 'x'
    		for i := 0; i < b.N; i++ {
    			j := Count(buf, buf[n-7:])
    			if j != 1 {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Jul 28 18:13:58 UTC 2025
    - 62.9K bytes
    - Viewed (0)
  8. cmd/metrics-v2.go

    			}
    
    			if qs.QStats.Avg.Count > 0 || qs.QStats.Curr.Count > 0 {
    				qt := qs.QStats
    				currInQueueBytes.Value = qt.Curr.Bytes
    				currInQueueCount.Value = qt.Curr.Count
    				avgQueueBytes.Value = qt.Avg.Bytes
    				avgQueueCount.Value = qt.Avg.Count
    				maxQueueBytes.Value = qt.Max.Bytes
    				maxQueueCount.Value = qt.Max.Count
    			}
    			activeWorkersCount.Value = float64(qs.ActiveWorkers.Curr)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 133.4K bytes
    - Viewed (0)
  9. src/main/java/org/codelibs/fess/ds/callback/FileListIndexUpdateCallbackImpl.java

         *
         * @param paramMap the data store parameters
         * @param dataMap the data map containing crawling configuration
         * @return the maximum access count (-1 for unlimited, 1 for single access, or specified count)
         */
        protected long getMaxAccessCount(final DataStoreParams paramMap, final Map<String, Object> dataMap) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 28.9K bytes
    - Viewed (0)
  10. src/main/assemblies/files/logging.properties

    java.util.logging.FileHandler.level=INFO
    java.util.logging.FileHandler.pattern=${fess.log.path}/server_%g.log
    java.util.logging.FileHandler.formatter=java.util.logging.SimpleFormatter
    java.util.logging.FileHandler.count=10
    
    # Suppress warning logs
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sun Aug 21 11:31:50 UTC 2016
    - 475 bytes
    - Viewed (0)
Back to top