- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for Unreserve (0.61 sec)
-
tensorflow/compiler/mlir/tf2xla/transforms/legalize_tf.cc
// Parameters for constructing each slice. SmallVector<Value, 4> begin_indices, end_indices, strides; begin_indices.reserve(value_rank); end_indices.reserve(value_rank); strides.reserve(value_rank); // final output shape SmallVector<Value, 4> shape_values; shape_values.reserve(value_rank - 1); // slice shape before reshape, should be like{?, 1, ?, ?} if axis = 1
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 20:00:43 UTC 2024 - 291.8K bytes - Viewed (0) -
pkg/apis/core/validation/validation.go
allErrs = append(allErrs, field.Required(namePath, "")) } else { allErrs = append(allErrs, ValidateDNS1123Label(ctr.Name, namePath)...) } // TODO: do not validate leading and trailing whitespace to preserve backward compatibility. // for example: https://github.com/openshift/origin/issues/14659 image = " " is special token in pod template // others may have done similar if len(ctr.Image) == 0 {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 29 22:40:29 UTC 2024 - 349.5K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.29.md
- Upgraded `coredns` to `v1.11.1`. ([#120116](https://github.com/kubernetes/kubernetes/pull/120116), [@tukwila](https://github.com/tukwila)) - `EnqueueExtensions` from plugins other than `PreEnqueue`, `PreFilter`, `Filter`, `Reserve` and `Permit` are now ignored. It reduces the number of kinds of cluster events the scheduler needs to subscribe/handle. ([#121571](https://github.com/kubernetes/kubernetes/pull/121571), [@sanposhiho](https://github.com/sanposhiho))
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 03:42:38 UTC 2024 - 324.5K bytes - Viewed (0) -
docs/en/docs/release-notes.md
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Fri Jun 14 15:07:37 UTC 2024 - 395.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/ssa.go
// unsigned right shift (divide by two), convert, and // double. However, before we do that, we need to be // sure that we do not lose a "1" if that made the // difference in the resulting rounding. Therefore, we // preserve it, and OR (not ADD) it back in. The case // that matters is when the eleven discarded bits are // equal to 10000000001; that rounds up, and the 1 cannot // be lost else it would round down if the LSB of the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 284.9K bytes - Viewed (0)