- Sort Score
- Result 10 results
- Languages All
Results 331 - 340 of 617 for done (0.02 sec)
-
src/main/java/jcifs/smb1/http/NetworkExplorer.java
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 22.6K bytes - Viewed (0) -
cmd/metacache-stream_test.go
r := loadMetacacheSample(t) defer r.Close() var readErr error objs := make(chan metaCacheEntry, 1) var wg sync.WaitGroup wg.Add(1) go func() { readErr = r.readAll(t.Context(), objs) wg.Done() }() want := loadMetacacheSampleNames i := 0 for entry := range objs { if entry.name != want[i] { t.Errorf("entry %d, want %q, got %q", i, want[i], entry.name) } i++ } wg.Wait()
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Apr 09 14:28:39 UTC 2025 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// fgh[b]c|[a]de -> fgh[a]c|[b]de. Finally we need to swap [c] with [b]: // fgha[c]|[b]de -> fgha[b]|[c]de. Because these two blocks are the same size, we are done. // The Dolphin algorithm is attractive because it does the fewest array reads and writes: each // array slot is read and written exactly once. However, it can have very poor memory locality:
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 31.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
* that behavior is undefined when the backing map is modified through another API. (It even * permits us to throw IllegalStateException. Maybe we should have done that, but we probably * shouldn't change now for fear of breaking people.) */ return (lastKnownIndex == -1) ? unsafeNull() : value(lastKnownIndex); } @OverrideRegistered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 39.6K bytes - Viewed (0) -
tests/generics_test.go
t.Errorf("failed to find user, got error: %v", err) } else if len(users) != 2 { t.Errorf("should find 2 users, but got %d", len(users)) } sg.Done() }() } sg.Wait() } func TestGenericsWithTransaction(t *testing.T) { ctx := context.Background() tx := DB.Begin() if tx.Error != nil {
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Thu Sep 04 13:13:16 UTC 2025 - 28K bytes - Viewed (0) -
cmd/admin-router.go
// `adminAPIHandlers`). // // - sets up call to send AuditLog // // While this is a middleware function (i.e. it takes a handler function and // returns one), due to flags being passed based on required conditions, it is // done per-"handler function registration" in the router. // // The passed in handler function must be a method of `adminAPIHandlers` for the
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Apr 16 07:34:24 UTC 2025 - 26.7K bytes - Viewed (0) -
cmd/server_test.go
c.Assert(response.StatusCode, http.StatusOK) } // TestContentTypePersists - Object upload with different Content-type is first done. // And then a HEAD and GET request on these objects are done to validate if the same Content-Type set during upload persists. func (s *TestSuiteCommon) TestContentTypePersists(c *check) { // generate a random bucket name.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 118.1K bytes - Viewed (0) -
cmd/metacache-entries.go
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Thu Aug 08 15:29:58 UTC 2024 - 24.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
* unequivocally demonstrate that funneling cannot be occurring. This is done bit-by-bit. For each * input bit(i) and output bit(j), two pairs of keys must be found with all bits identical except * bit(i). One pair must differ in output bit(j), and one pair must not. This proves that input * bit(i) can alter output bit(j). */ static void checkNoFunnels(HashFunction function) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 25.6K bytes - Viewed (0) -
guava/src/com/google/common/reflect/TypeResolver.java
} else if (type instanceof WildcardType) { return resolveWildcardType((WildcardType) type); } else { // if Class<?>, no resolution needed, we are done. return type; } } @CanIgnoreReturnValue Type[] resolveTypesInPlace(Type[] types) { for (int i = 0; i < types.length; i++) { types[i] = resolveType(types[i]); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Sep 03 14:03:14 UTC 2025 - 24.2K bytes - Viewed (0)