- Sort Score
- Result 10 results
- Languages All
Results 371 - 380 of 1,025 for Last (1.07 sec)
-
src/test/java/jcifs/internal/smb2/create/Smb2CloseResponseTest.java
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 26.9K bytes - Viewed (0) -
android/guava-testlib/test/com/google/common/collect/testing/IteratorTesterTest.java
* when hasNext() is false, so that next() throws a NoSuchElementException, then subsequent calls * to remove() will incorrectly throw an IllegalStateException, instead of removing the last * element returned. * * <p>See <a href="https://bugs.openjdk.org/browse/JDK-6529795">JDK-6529795</a> */ static class IteratorWithJdkBug6529795<T> implements Iterator<T> { Iterator<T> iterator;
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 18:32:41 UTC 2025 - 10.3K bytes - Viewed (0) -
cmd/metacache-bucket.go
for id, cache := range caches { if _, ok := remove[id]; ok { continue } remainCaches = append(remainCaches, cache) } if len(remainCaches) > metacacheMaxEntries { // Sort oldest last... sort.Slice(remainCaches, func(i, j int) bool { return remainCaches[i].lastHandout.Before(remainCaches[j].lastHandout) }) // Keep first metacacheMaxEntries...Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 6.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/AbstractStreamingHasher.java
this.chunkSize = chunkSize; } /** Processes the available bytes of the buffer (at most {@code chunk} bytes). */ protected abstract void process(ByteBuffer bb); /** * This is invoked for the last bytes of the input, which are not enough to fill a whole chunk. * The passed {@code ByteBuffer} is guaranteed to be non-empty. * * <p>This implementation simply pads with zeros and delegates to {@link #process(ByteBuffer)}.
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 7.1K bytes - Viewed (0) -
guava-testlib/test/com/google/common/collect/testing/IteratorTesterTest.java
* when hasNext() is false, so that next() throws a NoSuchElementException, then subsequent calls * to remove() will incorrectly throw an IllegalStateException, instead of removing the last * element returned. * * <p>See <a href="https://bugs.openjdk.org/browse/JDK-6529795">JDK-6529795</a> */ static class IteratorWithJdkBug6529795<T> implements Iterator<T> { Iterator<T> iterator;
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 18:32:41 UTC 2025 - 10.3K bytes - Viewed (0) -
docs/sts/README.md
- Temporary credentials are short-term, as the name implies. They can be configured to last for anywhere from a few minutes to several hours. After the credentials expire, MinIO no longer recognizes them or allows any kind of access from API requests made with them.
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 7.8K bytes - Viewed (0) -
cmd/object-api-multipart_test.go
}, }, }, // listMultipartResults - 31. // checking listing with marker set to 3. // `NextUploadIDMarker` is expected to be set on last uploadID in the result. // `NextKeyMarker` is expected to be set on the last object key in the list. { MaxUploads: 3, IsTruncated: true, NextUploadIDMarker: uploadIDs[6], NextKeyMarker: objectNames[2],Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 89.4K bytes - Viewed (0) -
cmd/encryption-v1.go
// Compute endEncOffset with one additional DARE package (so // we read the package containing the last desired byte). endEncOffset := encCumulativeSum + (endPkgNum+1)*sseDAREEncPackageBlockSize // Check if the DARE package containing the end offset is a // full sized package (as the last package in the part may be // smaller) lastPartSize, _ := sio.EncryptedSize(uint64(sizes[partEnd]))
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 38K bytes - Viewed (0) -
internal/lru/lru.go
// Next and previous pointers in the doubly-linked list of elements. // To simplify the implementation, internally a list l is implemented // as a ring, such that &l.root is both the next element of the last // list element (l.Back()) and the previous element of the first list // element (l.Front()). next, prev *Entry[K, V] // The list to which this element belongs. list *LruList[K, V]
Registered: Sun Dec 28 09:35:17 UTC 2025 - Last Modified: Fri Apr 25 08:22:26 UTC 2025 - 12.5K bytes - Viewed (0) -
CLAUDE.md
long maxAccessCount = 0 // Max URLs (0 = unlimited) ``` ### CrawlerThread (`CrawlerThread.java`) Worker thread for crawling. **Flow**: Poll URL → Validate → Get client → Delay → Check last-modified → Execute → Process → Extract children → Queue children → Delay ### CrawlerClientFactory Pattern-based client selection using `LinkedHashMap<Pattern, CrawlerClient>`. **Standard Patterns**: ```java
Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Fri Nov 28 17:31:34 UTC 2025 - 10.7K bytes - Viewed (0)