- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 17 for maxCount (0.04 sec)
-
fess-crawler-lasta/src/test/java/org/codelibs/fess/crawler/CrawlerTest.java
crawler.addUrl(url); crawler.crawlerContext.setMaxAccessCount(maxCount); crawler.crawlerContext.setNumOfThread(numOfThread); crawler.urlFilter.addInclude(url + ".*"); final String sessionId = crawler.execute(); assertEquals(maxCount, dataService.getCount(sessionId)); dataService.delete(sessionId); } finally {
Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Sat Sep 06 04:15:37 UTC 2025 - 12.8K bytes - Viewed (0) -
fess-crawler/src/test/java/org/codelibs/fess/crawler/CrawlerTest.java
crawler.addUrl(url); crawler.crawlerContext.setMaxAccessCount(maxCount); crawler.crawlerContext.setNumOfThread(numOfThread); crawler.urlFilter.addInclude(url + ".*"); final String sessionId = crawler.execute(); assertEquals(maxCount, dataService.getCount(sessionId)); dataService.delete(sessionId); } finally {
Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Tue Nov 11 13:40:14 UTC 2025 - 25.8K bytes - Viewed (0) -
fess-crawler/src/main/java/org/codelibs/fess/crawler/extractor/impl/CsvExtractor.java
final char[] candidates = { ',', '\t', ';', '|' }; int maxCount = 0; char bestDelimiter = ','; for (final char candidate : candidates) { final int count = countOccurrences(line, candidate); if (count > maxCount) { maxCount = count; bestDelimiter = candidate; } }
Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Thu Dec 11 08:38:29 UTC 2025 - 12.8K bytes - Viewed (0) -
cmd/format-erasure_test.go
for _, hash := range formatHashes { if hash == "" { continue } formatCountMap[hash]++ } maxHash := "" maxCount := 0 for hash, count := range formatCountMap { if count > maxCount { maxCount = count maxHash = hash } } if maxCount < len(formats)/2 { return nil, errErasureReadQuorum } for i, hash := range formatHashes { if hash == maxHash {Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 12.7K bytes - Viewed (0) -
cmd/erasure-metadata-utils.go
func reduceQuorumErrs(ctx context.Context, errs []error, ignoredErrs []error, quorum int, quorumErr error) error { if contextCanceled(ctx) { return context.Canceled } maxCount, maxErr := reduceErrs(errs, ignoredErrs) if maxCount >= quorum { return maxErr } return quorumErr } // reduceReadQuorumErrs behaves like reduceErrs but only for returning
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 11.7K bytes - Viewed (0) -
src/test/java/jcifs/smb/SmbFileInputStreamTest.java
int res = in.readDirect(new byte[1024], 0, 256); assertEquals(-1, res); } @Test @DisplayName("LargeReadX splits count across maxCount/openTimeout") void largeReadXSetsRequestFields() throws Exception { when(mockTree.isSMB2()).thenReturn(false); when(mockTree.hasCapability(SmbConstants.CAP_LARGE_READX)).thenReturn(true);
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 12.8K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/helper/WebFsIndexHelper.java
crawlerContext.setMaxDepth(depth); // max count final long maxCount = webConfig.getMaxAccessCount() != null ? webConfig.getMaxAccessCount() : maxAccessCount; crawlerContext.setMaxAccessCount(maxCount); webConfig.initializeClientFactory(() -> crawler.getClientFactory());
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Fri Nov 28 16:29:12 UTC 2025 - 25K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
int diff = 0x0; // bitset for output bits with different values int count = 0; // originally was 2 * Math.log(...), making it try more times to avoid flakiness issues int maxCount = (int) (4 * Math.log(2 * keyBits * hashBits) + 1); while (same != 0xffffffff || diff != 0xffffffff) { int key1 = rand.nextInt(); // flip input bit for key2 int key2 = key1 ^ (1 << i);Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Oct 28 18:19:59 UTC 2025 - 25.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/HashTestUtils.java
int diff = 0x0; // bitset for output bits with different values int count = 0; // originally was 2 * Math.log(...), making it try more times to avoid flakiness issues int maxCount = (int) (4 * Math.log(2 * keyBits * hashBits) + 1); while (same != 0xffffffff || diff != 0xffffffff) { int key1 = rand.nextInt(); // flip input bit for key2 int key2 = key1 ^ (1 << i);Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Oct 28 18:19:59 UTC 2025 - 25.6K bytes - Viewed (0) -
cmd/format-erasure.go
continue } formatCountMap[format.Drives()]++ } maxDrives := 0 maxCount := 0 for drives, count := range formatCountMap { if count > maxCount { maxCount = count maxDrives = drives } } if maxDrives == 0 { return nil, errErasureReadQuorum } if maxCount < len(formats)/2 { return nil, errErasureReadQuorum } for i, format := range formats {
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 23.1K bytes - Viewed (0)