- Sort Score
- Result 10 results
- Languages All
Results 1721 - 1730 of 1,839 for Target (0.1 sec)
-
docs/features/events.md
Events ====== Events allow you to capture metrics on your application’s HTTP calls. Use events to monitor: * The size and frequency of the HTTP calls your application makes. If you’re making too many calls, or your calls are too large, you should know about it! * The performance of these calls on the underlying network. If the network’s performance isn’t sufficient, you need to either improve the network or use less of it. ### EventListener
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Sun Feb 06 02:19:09 UTC 2022 - 7.7K bytes - Viewed (0) -
docs/select/README.md
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Sep 29 04:28:45 UTC 2022 - 6.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/GeneratedMonitorTest.java
private enum Timeout { MIN(Long.MIN_VALUE, "-oo"), MINUS_SMALL(-SMALL_TIMEOUT_MILLIS, "-" + SMALL_TIMEOUT_MILLIS + "ms"), ZERO(0L, "0ms"), SMALL(SMALL_TIMEOUT_MILLIS, SMALL_TIMEOUT_MILLIS + "ms"), LARGE(UNEXPECTED_HANG_DELAY_MILLIS * 2, (2 * UNEXPECTED_HANG_DELAY_MILLIS) + "ms"), MAX(Long.MAX_VALUE, "+oo"); final long millis; final String label; Timeout(long millis, String label) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:51:36 UTC 2024 - 27.1K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/MultipartReader.kt
* process(part.headers, part.body) * } * } * ``` * * Note that [nextPart] will skip any unprocessed data from the preceding part. If the preceding * part is particularly large or if the underlying source is particularly slow, the [nextPart] call * may be slow! * * Closing a part **does not** close this multipart reader; callers must explicitly close this with * [close]. *
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/ArrayBasedCharEscaper.java
* range. If {@code safeMax < safeMin} then no characters are considered safe. This initializer is * useful when explicit instances of ArrayBasedEscaperMap are used to allow the sharing of large * replacement mappings. * * <p>If a character has no mapped replacement then it is checked against the safe range. If it * lies outside that, then {@link #escapeUnsafe} is called, otherwise no escaping is performed.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jan 18 20:55:09 UTC 2022 - 6.3K bytes - Viewed (0) -
common-protos/k8s.io/api/storage/v1alpha1/generated.proto
// for a GetCapacityRequest with topology and parameters that match the // previous fields. // // This is defined since CSI spec 1.4.0 as the largest size // that may be used in a // CreateVolumeRequest.capacity_range.required_bytes field to // create a volume with the same parameters as those in // GetCapacityRequest. The corresponding value in the Kubernetes
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 9.4K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/http2/Hpack.kt
} else { val dynamicTableIndex = dynamicTableIndex(index - STATIC_HEADER_TABLE.size) if (dynamicTableIndex < 0 || dynamicTableIndex >= dynamicTable.size) { throw IOException("Header index too large ${index + 1}") } headerList += dynamicTable[dynamicTableIndex]!! } } // referencedHeaders is relative to nextHeaderIndex + 1.
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 22.5K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
for (int i = 1; i < numKeys; i++) { nodes.get(i).checkAcquiredLocks(Policies.THROW, nodes.subList(0, i)); } // Pre-populate all disallowedPriorLocks with nodes of larger ordinal. for (int i = 0; i < numKeys - 1; i++) { nodes.get(i).checkAcquiredLocks(Policies.DISABLED, nodes.subList(i + 1, numKeys)); } return Collections.unmodifiableMap(map); } /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 35.9K bytes - Viewed (0) -
docs/distributed/README.md
- **MinIO creates erasure-coding sets of _2_ to _16_ drives per set. The number of drives you provide in total must be a multiple of one of those numbers.** - **MinIO chooses the largest EC set size which divides into the total number of drives or total number of nodes given - making sure to keep the uniform distribution i.e each node participates equal number of drives per set**.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Jan 18 07:03:17 UTC 2024 - 8.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/ContiguousSet.java
* particular example can be written as just: * * <pre>{@code * ContiguousSet.closed(5, 42) * }</pre> * * <p><b>Warning:</b> Be extremely careful what you do with conceptually large instances (such as * {@code ContiguousSet.create(Range.greaterThan(0), DiscreteDomain.integers()}). Certain operations * on such a set can be performed efficiently, but others (such as {@link Set#hashCode} or {@link
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Nov 30 21:54:06 UTC 2023 - 9.9K bytes - Viewed (0)