- Sort Score
- Result 10 results
- Languages All
Results 671 - 680 of 737 for chosen (0.2 sec)
-
tensorflow/c/eager/c_api.cc
return status.status; } absl::StatusOr<bool> ShallPinToThisDevice( const ImmediateExecutionOperation* op) override { TF_Status status; // Let this custom device choose the device to pin this op on if it // implements the pinning function. if (device_.shall_pin_to_this_device != nullptr) { return device_.shall_pin_to_this_device(tensorflow::wrap(op), &status); }
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Sat Oct 12 05:11:17 UTC 2024 - 43.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.java
if (array[i] > max) { max = array[i]; } } return max; } /** * Returns the value nearest to {@code value} which is within the closed range {@code [min..max]}. * * <p>If {@code value} is within the range {@code [min..max]}, {@code value} is returned * unchanged. If {@code value} is less than {@code min}, {@code min} is returned, and if {@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 18:05:56 UTC 2024 - 29.3K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Longs.java
if (array[i] > max) { max = array[i]; } } return max; } /** * Returns the value nearest to {@code value} which is within the closed range {@code [min..max]}. * * <p>If {@code value} is within the range {@code [min..max]}, {@code value} is returned * unchanged. If {@code value} is less than {@code min}, {@code min} is returned, and if {@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 15:52:18 UTC 2024 - 29K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.17.md
- Fixes regression in logging spurious stack traces when proxied connections are closed by the backend ([#82588](https://github.com/kubernetes/kubernetes/pull/82588), [@liggitt](https://github.com/liggitt))
Registered: Fri Nov 01 09:05:11 UTC 2024 - Last Modified: Thu Jan 28 10:44:33 UTC 2021 - 346.2K bytes - Viewed (1) -
internal/logger/target/http/http.go
func (h *Target) Cancel() { h.status.Store(statusClosed) h.storeCtxCancel() // Wait for messages to be sent... h.wg.Wait() // Set logch to nil and close it. // This will block all Send operations, // and finish the existing ones. // All future ones will be discarded. h.logChMu.Lock() xioutil.SafeClose(h.logCh) h.logCh = nil h.logChMu.Unlock()
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Sep 11 22:20:42 UTC 2024 - 15.6K bytes - Viewed (0) -
api/go1.txt
pkg io, type Closer interface { Close } pkg io, type Closer interface, Close() error pkg io, type LimitedReader struct pkg io, type LimitedReader struct, N int64 pkg io, type LimitedReader struct, R Reader pkg io, type PipeReader struct pkg io, type PipeWriter struct pkg io, type ReadCloser interface { Close, Read } pkg io, type ReadCloser interface, Close() error
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Wed Aug 14 18:58:28 UTC 2013 - 1.7M bytes - Viewed (0) -
cmd/data-usage-cache.go
return true, nil } return false, err } err = d.deserialize(r) r.Close() return err != nil, nil case InsufficientReadQuorum, StorageErr: return true, nil } return false, err } err = d.deserialize(r) r.Close() return err != nil, nil } // Caches are read+written without locks, retries := 0 for retries < 5 {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Oct 22 15:30:50 UTC 2024 - 34.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
/** * Keeps track of metadata like the number of hash table bits and modifications of this data * structure (to make it possible to throw ConcurrentModificationException in the iterator). Note * that we choose not to make this volatile, so we do less of a "best effort" to track such * errors, for better performance. */ private transient int metadata; /** The number of elements contained in the set. */
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 24.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
*/ static void checkNo2BitCharacteristics(HashFunction function) { Random rand = new Random(0); int keyBits = 32; // get every one of (keyBits choose 2) deltas: for (int i = 0; i < keyBits; i++) { for (int j = 0; j < keyBits; j++) { if (j <= i) continue; int count = 0; int maxCount = 20; // the probability of error here is minuscule
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jul 23 14:22:54 UTC 2024 - 25.5K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.6.md
* platforms would be satisfied by manually-created PersistentVolume objects. * Administrators can choose to disable this behavior by deleting the automatically * installed StorageClass API object. Alternatively, administrators may choose to * keep the automatically installed StorageClass and only disable the defaulting
Registered: Fri Nov 01 09:05:11 UTC 2024 - Last Modified: Thu Dec 24 02:28:26 UTC 2020 - 304K bytes - Viewed (0)