- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 131 for Less (0.14 sec)
-
docs/en/docs/async.md
This idea of **asynchronous** code described above is also sometimes called **"concurrency"**. It is different from **"parallelism"**. **Concurrency** and **parallelism** both relate to "different things happening more or less at the same time". But the details between *concurrency* and *parallelism* are quite different. To see the difference, imagine the following story about burgers: ### Concurrent Burgers
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 23K bytes - Viewed (0) -
cmd/erasure-healing.go
disks = disks[:expectedDisks] // How to resolve partial results. resolver := metadataResolutionParams{ dirQuorum: 1, objQuorum: 1, bucket: bucket, strict: false, // Allow less strict matching. } path := baseDirFromPrefix(prefix) filterPrefix := strings.Trim(strings.TrimPrefix(prefix, path), slashSeparator) if path == prefix { filterPrefix = "" } lopts := listPathRawOptions{
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 26 06:32:14 GMT 2024 - 33.1K bytes - Viewed (0) -
cmd/erasure-object.go
// writeQuorum is dataBlocks + 1 writeQuorum := dataDrives if dataDrives == parityDrives { writeQuorum++ } // Validate input data size and it can never be less than zero. if data.Size() < -1 { bugLogIf(ctx, errInvalidArgument, logger.ErrorKind) return ObjectInfo{}, toObjectErr(errInvalidArgument) } // Initialize parts metadata
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun May 05 16:56:21 GMT 2024 - 77.2K bytes - Viewed (2) -
cmd/erasure-multipart.go
if !opts.NoAuditLog { auditObjectErasureSet(ctx, object, &er) } data := r.Reader // Validate input data size and it can never be less than zero. if data.Size() < -1 { bugLogIf(ctx, errInvalidArgument, logger.ErrorKind) return pi, toObjectErr(errInvalidArgument) } // Read lock for upload id.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Apr 28 17:53:50 GMT 2024 - 43K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/IterablesTest.java
} }); List<String> actual = newArrayList(result); List<String> expected = asList("1", "2", "null", "3"); assertEquals(expected, actual); } // Far less exhaustive than the tests in IteratorsTest public void testCycle() { Iterable<String> cycle = Iterables.cycle("a", "b"); int howManyChecked = 0; for (String string : cycle) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 47.5K bytes - Viewed (0) -
common-protos/k8s.io/api/core/v1/generated.proto
// Pod Topology Spread treats "global minimum" as 0, and then the calculation of Skew is performed. // And when the number of eligible domains with matching topology keys equals or greater than minDomains, // this value has no effect on scheduling. // As a result, when the number of eligible domains is less than minDomains,
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 255.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/IterablesTest.java
} }); List<String> actual = newArrayList(result); List<String> expected = asList("1", "2", "null", "3"); assertEquals(expected, actual); } // Far less exhaustive than the tests in IteratorsTest public void testCycle() { Iterable<String> cycle = Iterables.cycle("a", "b"); int howManyChecked = 0; for (String string : cycle) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 46K bytes - Viewed (0) -
cmd/storage-rest-server.go
// The returned reader contains the payload and must be closed if no error is returned. func waitForHTTPStream(respBody io.ReadCloser, w io.Writer) error { var tmp [1]byte // 8K copy buffer, reused for less allocs... bufp := poolBuf8k.Get().(*[]byte) buf := *bufp defer poolBuf8k.Put(bufp) for { _, err := io.ReadFull(respBody, tmp[:]) if err != nil { return err }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Apr 28 17:53:50 GMT 2024 - 44.8K bytes - Viewed (0) -
tensorflow/c/eager/tape.h
// there isn't an intervening PushState. This is useful for ordering // ForwardAccumulators, where more deeply nested accumulators should not see // computations from less deeply nested accumulators. bool BusyAccumulating() const { return call_state_.top().accumulating; } // Fetches the current Jacobian-vector product associated with `tensor_id`, or // a nullptr if none is available.
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Tue Apr 02 12:40:29 GMT 2024 - 47.2K bytes - Viewed (1) -
CHANGELOG/CHANGELOG-1.29.md
## Changes by Kind ### Deprecation
Plain Text - Registered: Fri May 03 09:05:14 GMT 2024 - Last Modified: Tue Apr 16 21:41:06 GMT 2024 - 299.9K bytes - Viewed (1)