- Sort Score
- Result 10 results
- Languages All
Results 791 - 800 of 1,117 for Search (0.05 sec)
-
guava/src/com/google/common/util/concurrent/SequentialExecutor.java
} } /** * Continues executing tasks from {@link #queue} until it is empty. * * <p>The thread's interrupt bit is cleared before execution of each task. * * <p>If the Thread in use is interrupted before or during execution of the tasks in {@link * #queue}, the Executor will complete its tasks, and then restore the interruption. This means
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Feb 01 21:46:34 UTC 2024 - 10.6K bytes - Viewed (0) -
cmd/kms-handlers.go
ctx := newContext(r, w, "KMSListKeys") defer logger.AuditLog(ctx, w, r, mustGetClaimsFromToken(r)) // This only checks if the action (kms:ListKeys) is allowed, it does not check // each key name against the policy's Resources. We check that below, once // we have the list of key names from the KMS. objectAPI, _ := validateAdminReq(ctx, w, r, policy.KMSListKeysAction) if objectAPI == nil { return }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Sun Aug 18 06:43:03 UTC 2024 - 10.1K bytes - Viewed (0) -
docs/debugging/README.md
diagnostics help ensure that the underlying infrastructure that runs MinIO is configured correctly, and is functioning properly. This test is one-shot long running one, that is recommended to be run as soon as the cluster is first provisioned, and each time a failure scenario is encountered. Note that the test incurs majority of the available resources on the system. Care must be taken when using this to debug failure scenario, so as to prevent larger outages. Health tests can be triggered using...
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Feb 25 01:17:53 UTC 2022 - 8.7K bytes - Viewed (0) -
internal/ioutil/hardlimitreader.go
func HardLimitReader(r io.Reader, n int64) io.Reader { return &HardLimitedReader{r, n} } // A HardLimitedReader reads from R but limits the amount of // data returned to just N bytes. Each call to Read // updates N to reflect the new amount remaining. // Read returns EOF when N <= 0 or when the underlying R returns EOF. type HardLimitedReader struct { R io.Reader // underlying reader
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Sat May 06 02:53:12 UTC 2023 - 2K bytes - Viewed (0) -
guava/src/com/google/common/graph/ImmutableGraph.java
* .addNode(ICELAND) * .build(); * }</pre> * * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build * multiple graphs in series. Each new graph contains all the elements of the ones created before * it. * * @since 28.0 */ public static class Builder<N> { private final MutableGraph<N> mutableGraph;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.1K bytes - Viewed (0) -
tensorflow/c/eager/gradients.h
// a map (`tensorflow::eager::TensorTape`) from the wrapped tensor to the id of // the op that produced it (or -1 if this tensor was watched using // `GradientTape::Watch`.) The op_id is simply a unique index assigned to each // op executed under the tape. A separate map (`tensorflow::eager::OpTape`) // maintains the map from `op_id` to a `OpTapeEntry` which stores the `op_type`,
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Sat Oct 12 05:11:17 UTC 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
if (!heapForIndex(i).verifyIndex(i)) { return false; } } return true; } /** * Each instance of MinMaxPriorityQueue encapsulates two instances of Heap: a min-heap and a * max-heap. Conceptually, these might each have their own array for storage, but for efficiency's * sake they are stored interleaved on alternate heap levels in the same array (MMPQ.queue). */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 34.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
*/ Set<E> elementSet(); /** * Returns a view of the contents of this multiset, grouped into {@code Multiset.Entry} instances, * each providing an element of the multiset and the count of that element. This set contains * exactly one entry for each distinct element in the multiset (thus it always has the same size * as the {@link #elementSet}). The order of the elements in the element set is unspecified. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Jun 17 14:40:53 UTC 2023 - 19.7K bytes - Viewed (0) -
build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/source/ClassMetaDataUtil.java
excludedPackages.add(baseName); } else { excludedPackages.add(excludePattern); } } repository.each(new Action<ClassMetaData>() { @Override public void execute(ClassMetaData classMetaData) { if (classMetaData.getOuterClassName() != null) { // Ignore inner classes
Registered: Wed Nov 06 11:36:14 UTC 2024 - Last Modified: Wed Dec 09 08:14:05 UTC 2020 - 2.4K bytes - Viewed (0) -
build-logic/binary-compatibility/src/main/kotlin/gradlebuild/binarycompatibility/BinaryCompatibilityRepositoryLifecycle.kt
class BinaryCompatibilityRepositorySetupRule(private val params: Map<String, Any>) : SetupRule { companion object { const val REPOSITORY_CONTEXT_KEY = "binaryCompatibilityRepository" } /** * Each param is a `Set<String>`. */ object Params { const val sourceRoots = "sourceRoots" const val sourceCompilationClasspath = "sourceCompilationClasspath" } @Suppress("unchecked_cast")
Registered: Wed Nov 06 11:36:14 UTC 2024 - Last Modified: Wed Dec 09 08:14:05 UTC 2020 - 2.2K bytes - Viewed (0)