- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 53 for Unbounded (0.13 sec)
-
tensorflow/c/eager/gradients.cc
// TODO(srbs): It seems like this is used only for performance optimization // and not for correctness. The only downside of keeping this 1 seems to be // that the gradient accumulation is unbounded and we will never // aggressively aggregate accumulated gradients to recover memory. // Revisit and fix. return 1; } // Consumes references to the tensors in the gradient_tensors list and returns
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 15 09:49:45 UTC 2024 - 19.3K bytes - Viewed (0) -
src/log/slog/doc.go
details. A LogValue method may return a Value that itself implements [LogValuer]. The [Value.Resolve] method handles these cases carefully, avoiding infinite loops and unbounded recursion. Handler authors and others may wish to use [Value.Resolve] instead of calling LogValue directly. # Wrapping output methods The logger functions use reflection over the call stack to find the file name
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 15 14:35:48 UTC 2024 - 12.3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tile.go
// and https://research.swtch.com/tlog#tiling_a_log. type Tile struct { H int // height of tile (1 ≤ H ≤ 30) L int // level in tiling (-1 ≤ L ≤ 63) N int64 // number within level (0 ≤ N, unbounded) W int // width of tile (1 ≤ W ≤ 2**H; 2**H is complete tile) } // TileForIndex returns the tile of fixed height h ≥ 1 // and least width storing the given hash storage index. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 13K bytes - Viewed (0) -
src/go/token/position.go
} // RemoveFile removes a file from the [FileSet] so that subsequent // queries for its [Pos] interval yield a negative result. // This reduces the memory usage of a long-lived [FileSet] that // encounters an unbounded stream of files. // // Removing a file that does not belong to the set has no effect. func (s *FileSet) RemoveFile(file *File) { s.last.CompareAndSwap(file, nil) // clear last file cache s.mutex.Lock()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 19.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/api/v1/compile_mlir_util.cc
auto result_ty = mlir::cast<mlir::RankedTensorType>(type_and_idx.value()); // If the result type isn't static, then the owner of the result may be a // cast op from a more specific bounded type to an unbounded dynamic type. // Use the bounded type to get the buffer size. mlir::RankedTensorType buffer_ty = result_ty; if (!buffer_ty.hasStaticShape()) { mlir::Value return_val = return_op->getOperand(idx);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 21 17:24:39 UTC 2024 - 45.3K bytes - Viewed (0) -
common-protos/k8s.io/api/storage/v1/generated.proto
// The same rule applies for a unique volume that is shared among multiple pods on the same node. // If this field is not specified, then the supported number of volumes on this node is unbounded. // +optional optional int32 count = 1;
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 24.7K bytes - Viewed (0) -
staging/src/k8s.io/api/storage/v1/generated.proto
// The same rule applies for a unique volume that is shared among multiple pods on the same node. // If this field is not specified, then the supported number of volumes on this node is unbounded. // +optional optional int32 count = 1;
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 28 15:34:11 UTC 2024 - 24.8K bytes - Viewed (0) -
staging/src/k8s.io/api/storage/v1beta1/generated.proto
// The same rule applies for a unique volume that is shared among multiple pods on the same node. // If this field is nil, then the supported number of volumes on this node is unbounded. // +optional optional int32 count = 1;
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 28 15:34:11 UTC 2024 - 25K bytes - Viewed (0) -
guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* its greatest element, as determined by the queue's specified comparator. If no comparator is * given at creation time, the natural order of elements is used. If no maximum size is given at * creation time, the queue is unbounded. * * <p>Usage example: * * <pre>{@code * MinMaxPriorityQueue<User> users = MinMaxPriorityQueue.orderedBy(userComparator) * .maximumSize(1000) * .create(); * }</pre> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* its greatest element, as determined by the queue's specified comparator. If no comparator is * given at creation time, the natural order of elements is used. If no maximum size is given at * creation time, the queue is unbounded. * * <p>Usage example: * * <pre>{@code * MinMaxPriorityQueue<User> users = MinMaxPriorityQueue.orderedBy(userComparator) * .maximumSize(1000) * .create(); * }</pre> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (0)