- Sort Score
- Num 10 results
- Language All
Results 1141 - 1150 of 1,391 for isName (0.12 seconds)
-
CHANGELOG/CHANGELOG-1.22.md
- `oc describe quota` used has the same unit format as hard ([#102177](https://github.com/kubernetes/kubernetes/pull/102177),...
Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Tue Dec 13 12:43:45 GMT 2022 - 454.1K bytes - Click Count (0) -
guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* integrals). * * Note well that if, for this function, we chose a horizontal line, at height of exactly (1/QPS), * then the effect of the function is non-existent: we serve storedPermits at exactly the same * cost as fresh ones (1/QPS is the cost for each). We use this trick later. * * If we pick a function that goes /below/ that horizontal line, it means that we reduce the area
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed May 14 19:40:47 GMT 2025 - 19.3K bytes - Click Count (0) -
docs/config/README.md
MINIO_ETCD_COMMENT (sentence) optionally add a comment to this setting ``` ### API By default, there is no limitation on the number of concurrent requests that a server/cluster processes at the same time. However, it is possible to impose such limitation using the API subsystem. Read more about throttling limitation in MinIO server [here](https://github.com/minio/minio/blob/master/docs/throttle/README.md). ``` KEY:
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 18.1K bytes - Click Count (1) -
internal/grid/types.go
func (j *Array[T]) Value() []T { if j.val == nil { j.val = j.p.newA(10) } return j.val } // Append a value to the underlying array. // The returned Array is always the same as the one called. func (j *Array[T]) Append(v ...T) *Array[T] { if j.val == nil { j.val = j.p.newA(uint32(len(v))) } j.val = append(j.val, v...) return j } // Set the underlying value.
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 15.5K bytes - Click Count (0) -
src/main/java/jcifs/internal/smb1/AndXServerMessageBlock.java
* that chained message. Before doing so we must increment * the batchLevel of the andx message in case it itself is an * andx message and needs to perform the same check as above. */ this.andx.batchLevel = this.batchLevel + 1; dst[start + ANDX_COMMAND_OFFSET] = this.andxCommand; dst[start + ANDX_RESERVED_OFFSET] = (byte) 0x00;Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sun Aug 31 08:00:57 GMT 2025 - 15.8K bytes - Click Count (0) -
src/test/java/jcifs/netbios/LmhostsTest.java
assertNotNull(lmhosts.getByName("HOSTNAME", mockContext)); } @Test void testMultipleEntriesForSameHost() throws Exception { // Create a temporary lmhosts file with multiple entries for same host File lmhostsFile = tempDir.resolve("lmhosts_multiple").toFile(); try (FileWriter writer = new FileWriter(lmhostsFile)) { writer.write("192.168.1.100 TESTHOST\n");
Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 18.2K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/helper/CrawlerStatsHelper.java
.forEach(s -> buf.append(s)); log(buf); } /** * Increments the thread reference count for the specified crawler object. * Used when the same object is being processed on multiple threads. * * @param keyObj the crawler object running on an additional thread */ public void runOnThread(final Object keyObj) {
Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Thu Aug 07 03:06:29 GMT 2025 - 17.4K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/helper/DataIndexHelper.java
} } /** * Deletes old documents from the search index. * This method removes documents that were indexed in previous * crawling sessions for the same data configuration, keeping * only the documents from the current session. * * <p>The deletion process:</p> * <ul> * <li>Checks if old document deletion is enabled</li>Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Fri Nov 28 16:29:12 GMT 2025 - 19K bytes - Click Count (0) -
src/test/java/org/codelibs/fess/suggest/index/writer/SuggestIndexWriterTest.java
@Test public void test_mergeItemsWithMultipleDuplicates() throws Exception { String[][] readings = new String[1][]; readings[0] = new String[] { "test" }; // Create 5 items with the same ID but different frequencies SuggestItem item1 = new SuggestItem(new String[] { "ใในใ" }, readings, new String[] { "content" }, 1, 0, -1, new String[] { "tag1" },Created: Sat Dec 20 13:04:59 GMT 2025 - Last Modified: Mon Nov 24 03:40:05 GMT 2025 - 18.2K bytes - Click Count (0) -
guava-tests/test/com/google/common/cache/PopulatedCachesTest.java
// System.identityHashCode, which means the assignment of keys to segments is nondeterministic, // so more than (maximumSize / #segments) keys could get assigned to the same segment, which // would cause one to be evicted. return new CacheBuilderFactory() .withKeyStrengths(ImmutableSet.of(Strength.STRONG, Strength.WEAK))Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Sep 30 22:03:28 GMT 2025 - 15.7K bytes - Click Count (0)