- Sort Score
- Num 10 results
- Language All
Results 1 - 9 of 9 for simultaneously (0.09 seconds)
-
android/guava-tests/test/com/google/common/base/PreconditionsTest.java
@GwtIncompatible // NullPointerTester public void testNullPointers() { /* * Don't bother testing: Preconditions defines a bunch of methods that accept a template (or * even entire message) that simultaneously: * * - _shouldn't_ be null, so we don't annotate it with @Nullable * * - _can_ be null without causing a runtime failure (because we don't want the interesting
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 19K bytes - Click Count (0) -
docs/bucket/replication/DESIGN.md
state. This is a slower operation that does not use replication queues and is designed to walk the namespace and replicate objects one at a time so as not to impede server load. Ideally, resync should not be initiated for multiple buckets simultaneously - progress of the syncing can be monitored by looking at `mc replicate resync status alias/bucket --remote-bucket <arn>`. In the event that resync operation failed to replicate some versions, they would be picked up by the healing mechanism in-built...
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 14.7K bytes - Click Count (0) -
cmd/batch-expire.go
delete(deleteMarkerCountMap, lastDel.Name) } } // send down filtered entries to be deleted using // DeleteObjects method if len(toDel) > 10 { // batch up to 10 objects/versions to be expired simultaneously. xfer := make([]expireObjInfo, len(toDel)) copy(xfer, toDel) select { case expireCh <- xfer: toDel = toDel[:0] // resetting toDel case <-ctx.Done(): done = true } }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Apr 22 11:16:32 GMT 2025 - 23K bytes - Click Count (0) -
LICENSE
otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Apr 23 18:58:53 GMT 2021 - 33.7K bytes - Click Count (0) -
doc/go_mem.html
reads of a variable in one goroutine can be guaranteed to observe values produced by writes to the same variable in a different goroutine. </p> <h3 id="advice">Advice</h3> <p> Programs that modify data being simultaneously accessed by multiple goroutines must serialize such access. </p> <p> To serialize access, protect the data with channel operations or other synchronization primitives
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Tue Aug 05 15:41:37 GMT 2025 - 26.6K bytes - Click Count (0) -
cmd/testdata/xl-meta-merge.zip
Guide](https://min.io/docs/minio/linux/reference/minio-mc.html#quickstart) for further instructions. ## Upgrading MinIO Upgrades require zero downtime in MinIO, all upgrades are non-disruptive, all transactions on MinIO are atomic. So upgrading all the servers simultaneously is the recommended way to upgrade MinIO. > NOTE: requires internet access to update directly from <https://dl.min.io>, optionally you can host any mirrors at <https://my-artifactory.example.com/minio/> - For deployments that installed the MinIO...
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Mar 08 17:50:48 GMT 2024 - 30.2K bytes - Click Count (0) -
internal/dsync/drwmutex.go
readLocks []string // Array of array of nodes that granted reader locks rng *rand.Rand m sync.Mutex // Mutex to prevent multiple simultaneous locks from this node clnt *Dsync cancelRefresh context.CancelFunc refreshInterval time.Duration lockRetryMinInterval time.Duration }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 20.3K bytes - Click Count (0) -
guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
// this can be safely acquired after the acquiredLock. // // Note that there is a race condition here which can result in missing // a cyclic edge: it's possible for two threads to simultaneous find // "safe" edges which together form a cycle. Preventing this race // condition efficiently without _introducing_ deadlock is probablyCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Sep 11 17:06:34 GMT 2025 - 35.9K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
// this can be safely acquired after the acquiredLock. // // Note that there is a race condition here which can result in missing // a cyclic edge: it's possible for two threads to simultaneous find // "safe" edges which together form a cycle. Preventing this race // condition efficiently without _introducing_ deadlock is probablyCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Sep 11 17:06:34 GMT 2025 - 35.9K bytes - Click Count (0)