Search Options

Results per page
Sort
Preferred Languages
Advance

Results 321 - 330 of 751 for Count (1.99 sec)

  1. 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)
  2. 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)
  3. 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)
  4. src/test/java/jcifs/internal/smb2/io/Smb2ReadRequestTest.java

                assertDoesNotThrow(() -> request.setOffset(1024L));
                assertDoesNotThrow(() -> request.setOffset(Long.MAX_VALUE));
            }
    
            @Test
            @DisplayName("Should set minimum count correctly")
            void testSetMinimumCount() {
                assertDoesNotThrow(() -> request.setMinimumCount(0));
                assertDoesNotThrow(() -> request.setMinimumCount(512));
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 24.8K bytes
    - Viewed (0)
  5. src/main/java/jcifs/internal/smb2/create/Smb2CreateRequest.java

                        }
                        filteredContexts[count++] = ctx;
                    }
                }
    
                if (count > 0) {
                    CreateContextRequest[] newContexts = new CreateContextRequest[count];
                    System.arraycopy(filteredContexts, 0, newContexts, 0, count);
                    this.createContexts = newContexts;
                } else {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 23 02:21:31 UTC 2025
    - 22.9K bytes
    - Viewed (0)
  6. src/cmd/asm/internal/asm/parse.go

    		if p.arch.Family == sys.ARM64 {
    			if x >= 64 {
    				p.errorf("register shift count too large: %s", str)
    			}
    			count = int16((x & 63) << 10)
    		} else {
    			if x >= 32 {
    				p.errorf("register shift count too large: %s", str)
    			}
    			count = int16((x & 31) << 7)
    		}
    	default:
    		p.errorf("unexpected %s in register shift", tok.String())
    	}
    	if p.arch.Family == sys.ARM64 {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Feb 14 15:13:11 UTC 2025
    - 37.3K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/util/concurrent/DirectExecutorService.java

       *
       * @throws RejectedExecutionException if the executor has been previously shutdown
       */
      private void startTask() {
        synchronized (lock) {
          if (shutdown) {
            throw new RejectedExecutionException("Executor already shutdown");
          }
          runningTasks++;
        }
      }
    
      /** Decrements the running task count. */
      private void endTask() {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Apr 12 15:07:59 UTC 2025
    - 3.5K bytes
    - Viewed (0)
  8. src/test/java/jcifs/smb/SmbTransportPoolImplTest.java

            // Then: Should use trans1 (addr2 failed, so tried addr1 next)
            assertSame(trans1, result);
    
            // Verify fail count incremented for addr2 (was 1, now 2)
            assertEquals(2, poolSpy.failCounts.get("10.0.0.2"));
            // addr1's count should remain unchanged since it succeeded
            assertEquals(5, poolSpy.failCounts.get("10.0.0.1"));
        }
    
        @Test
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 19.2K bytes
    - Viewed (0)
  9. 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)
  10. 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)
Back to top