- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 435 for enough (0.18 sec)
-
guava/src/com/google/common/escape/CharEscaper.java
int charsSkipped = index - lastEscape; // This is the size needed to add the replacement, not the full size // needed by the string. We only regrow when we absolutely must, and // when we do grow, grow enough to avoid excessive growing. Grow. int sizeNeeded = destIndex + charsSkipped + rlen; if (destSize < sizeNeeded) { destSize = sizeNeeded + DEST_PAD_MULTIPLIER * (slen - index);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jan 18 20:55:09 UTC 2022 - 6.7K bytes - Viewed (0) -
internal/logger/logonce.go
for uerr != nil { // Save the current `uerr` leafErr = uerr // continue to look for leaf errors underneath uerr = errors.Unwrap(leafErr) depth++ if depth == unwrapErrsDepth { // If we have reached enough depth we // do not further recurse down, this // is done to avoid any unnecessary // latencies this might bring. break } } if uerr == nil { leafErr = err } return leafErr }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Apr 04 12:04:40 UTC 2024 - 3.8K bytes - Viewed (0) -
cni/pkg/ipset/ipset.go
} // TODO this should actually create v6 and v6 subsets of type `hash:ip`, add them both to a // superset of type `list:set` - we can then query the superset directly in iptables (with the same rule), // and iptables will be smart enough to pick the correct underlying set (v4 or v6, based on context), // reducing the # of rules we need. // // BUT netlink lib doesn't support adding things to `list:set` types yet, and current tagged release
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Tue Apr 30 22:24:38 UTC 2024 - 3.9K bytes - Viewed (0) -
.github/ISSUE_TEMPLATE/feature_addition_request.yaml
or even industries — utilities useful for a sizable proportion of all Java programmers everywhere. If you can give enough detail such that any of us can imagine coming across a similar need in our own work, that's extremely helpful in studying how broadly useful the feature will be. - type: textarea attributes:
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Nov 17 18:47:47 UTC 2023 - 5.8K bytes - Viewed (0) -
cmd/metacache-set.go
agree = 1 current = entry topEntries[i] = entry } // Since minDisks is set to quorum, we return if we have enough. if vnf > 0 && vnf >= len(readers)-opts.minDisks { return errVolumeNotFound } // Since minDisks is set to quorum, we return if we have enough. if fnf > 0 && fnf >= len(readers)-opts.minDisks { return errFileNotFound } // Stop if we exceed number of bad disks.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Jul 12 16:23:16 UTC 2024 - 30.7K bytes - Viewed (0) -
tests/test_tutorial/test_security/test_tutorial005_an_py39.py
response = client.get( "/users/me", headers={"Authorization": f"Bearer {access_token}"} ) assert response.status_code == 401, response.text assert response.json() == {"detail": "Not enough permissions"} assert response.headers["WWW-Authenticate"] == 'Bearer scope="me"' @needs_py39 def test_token_nonexistent_user(client: TestClient): response = client.get( "/users/me",
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Wed Mar 13 19:07:10 UTC 2024 - 16.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashCode.java
* {@code long} value in little-endian order. * * @throws IllegalStateException if {@code bits() < 64} */ public abstract long asLong(); /** * If this hashcode has enough bits, returns {@code asLong()}, otherwise returns a {@code long} * value with {@code asBytes()} as the least-significant bytes and {@code 0x00} as the remaining * most-significant bytes. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 19:54:59 UTC 2024 - 12.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
return set; } /** * Creates a {@code CompactHashSet} instance, with a high enough "initial capacity" that it * <i>should</i> hold {@code expectedSize} elements without growth. * * @param expectedSize the number of elements you expect to add to the returned set * @return a new, empty {@code CompactHashSet} with enough capacity to hold {@code expectedSize} * elements without resizing
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 24K bytes - Viewed (0) -
okhttp/src/test/java/okhttp3/FakeRoutePlanner.kt
if (deferredPlans.isNotEmpty()) return deferredPlans.removeFirst() as FakePlan if (nextPlanIndex >= plans.size && autoGeneratePlans) addPlan() require(nextPlanIndex < plans.size) { "not enough plans! call addPlan() or set autoGeneratePlans=true in the test to set this up" } val result = plans[nextPlanIndex++] events += "take plan ${result.id}" if (result.yieldBeforePlanReturns) {
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Wed Apr 24 04:40:49 UTC 2024 - 6.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/WriteReplaceOverridesTest.java
*/ || info.getName().contains("MultimapsTest") /* * Luckily, we don't care about analyzing tests at all. We'd skip them all if we could do so * trivially, but it's enough to skip these ones. */ ) { continue; } Class<?> clazz = info.load(); try { Method unused = clazz.getDeclaredMethod("writeReplace");
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Jul 24 18:53:31 UTC 2024 - 5.2K bytes - Viewed (0)