- Sort Score
- Result 10 results
- Languages All
Results 301 - 310 of 593 for seront (0.05 sec)
-
cmd/admin-server-info.go
// Only proceed for local endpoints network[nodeName] = string(madmin.ItemOnline) continue } _, present := network[nodeName] if !present { if err := isServerResolvable(endpoint, 5*time.Second); err == nil { network[nodeName] = string(madmin.ItemOnline) } else { if xnet.IsNetworkOrHostDown(err, false) { network[nodeName] = string(madmin.ItemOffline)
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 4.9K bytes - Viewed (1) -
guava/src/com/google/common/collect/StandardTable.java
@Override public void clear() { backingMap.clear(); } } /** * {@inheritDoc} * * <p>The set's iterator traverses the mappings for the first row, the mappings for the second * row, and so on. * * <p>Each cell is an immutable snapshot of a row key / column key / value mapping, taken at the * time the cell is returned by a method call to the set or its iterator. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 30.2K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/score/LtrQueryRescorerTest.java
return 50; } }); RescorerBuilder<?> result1 = ltrQueryRescorer.evaluate(params); assertNotNull(result1); // Second call without model name ComponentUtil.setFessConfig(new FessConfig.SimpleImpl() { @Override public String getLtrModelName() { return ""; }
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Tue Aug 19 14:09:36 UTC 2025 - 11.5K bytes - Viewed (0) -
src/test/java/jcifs/pac/kerberos/KerberosRelevantAuthDataTest.java
assertTrue(authorizations.contains(mockAuthData1), "The list should contain the first mocked auth data."); assertTrue(authorizations.contains(mockAuthData2), "The list should contain the second mocked auth data."); }
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 9K bytes - Viewed (0) -
src/test/java/jcifs/context/CIFSContextWrapperTest.java
// First call should create a new Handler URLStreamHandler handler1 = cifsContextWrapper.getUrlHandler(); assertNotNull(handler1); assertTrue(handler1 instanceof Handler); // Second call should return the same instance URLStreamHandler handler2 = cifsContextWrapper.getUrlHandler(); assertEquals(handler1, handler2); } @Test void testGetSIDResolver() {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 10.7K bytes - Viewed (0) -
okhttp-idna-mapping-table/src/main/kotlin/okhttp3/internal/idn/SimpleIdnaMappingTable.kt
* * Regular lines contain fields separated by semicolons. * * The first element on each line is a single hex code point (like 0041) or a hex code point range * (like 0030..0039). * * The second element on each line is a mapping type, like `valid` or `mapped`. * * For lines that contain a mapping target, the next thing is a sequence of hex code points (like * 0031 2044 0034). * * All other data is ignored.
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 6.8K bytes - Viewed (0) -
cmd/peer-rest-server.go
return } durationStr := r.Form.Get(peerRESTDuration) duration, err := time.ParseDuration(durationStr) if err != nil || duration.Seconds() == 0 { duration = time.Second * 10 } result := netperf(r.Context(), duration.Round(time.Second)) peersLogIf(r.Context(), gob.NewEncoder(w).Encode(result)) }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Sun Mar 30 00:56:02 UTC 2025 - 53.4K bytes - Viewed (0) -
cmd/common-main.go
} u, err := url.Parse(updateURL) if err != nil { return } if currentReleaseTime.IsZero() { return } _, lrTime, err := getLatestReleaseTime(u, 2*time.Second, mode) if err != nil { return } var older time.Duration var downloadURL string if lrTime.After(currentReleaseTime) { older = lrTime.Sub(currentReleaseTime)
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 32.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Throwables.java
* </pre> * * @throws IllegalArgumentException if there is a loop in the causal chain */ public static Throwable getRootCause(Throwable throwable) { // Keep a second pointer that slowly walks the causal chain. If the fast pointer ever catches // the slower pointer, then there's a loop. Throwable slowPointer = throwable; boolean advanceSlowPointer = false;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 20.6K bytes - Viewed (0) -
docs/de/docs/tutorial/response-model.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Nov 18 02:25:44 UTC 2024 - 16.9K bytes - Viewed (0)