- Sort Score
- Result 10 results
- Languages All
Results 181 - 186 of 186 for opacity (0.06 sec)
-
CHANGELOG/CHANGELOG-1.14.md
* $ kubectl get pv --show-labels * NAME CAPACITY ACCESSMODES STATUS CLAIM REASON AGE LABELS
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Mon Jun 14 22:06:39 UTC 2021 - 271.5K bytes - Viewed (0) -
RELEASE.md
* Built out a good suite of tests, things should break less! * Added `MetaGraphDef` which makes it easier to save graphs with metadata * Added assignments for "Deep Learning with TensorFlow" udacity course ## Bug Fixes and Other Changes * Added a versioning framework for `GraphDef`s to ensure compatibility * Enforced Python 3 compatibility
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Aug 18 20:54:38 UTC 2025 - 740K bytes - Viewed (2) -
CHANGELOG/CHANGELOG-1.15.md
In Kubernetes v1.15, SIG Storage continued work to [enable migration of in-tree volume plugins](https://github.com/kubernetes/enhancements/issues/625) to the Container Storage Interface (CSI). SIG Storage worked on bringing CSI to feature parity with in-tree functionality, including functionality like resizing, inline volumes, and more. SIG Storage introduces new alpha functionality in CSI that doesn't exist in the Kubernetes Storage subsystem yet, like volume cloning.
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Thu May 05 13:44:43 UTC 2022 - 278.9K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.31.md
- Promoted `LocalStorageCapacityIsolation` to beta; the behaviour is enabled by default. Within the kubelet, storage capacity isolation is active if the feature gate is enabled and the specific Pod is using a user namespace. ([#126014](https://github.com/kubernetes/kubernetes/pull/126014), [@PannagaRao](https://github.com/PannagaRao)) [SIG Apps, Autoscaling, Node, Storage...
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Aug 13 19:49:57 UTC 2025 - 429.6K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
a slice and a requested number of bytes. It returns a // slice with the contents of the given slice followed by that many bytes and a // second slice that aliases into it and contains only the extra bytes. If the // original slice has sufficient capacity then no allocation is performed. func sliceForAppend(in []byte, n int) (head, tail []byte) { if total := len(in) + n; cap(in) >= total { head = in[:total] } else { head = make([]byte, total) copy(head, in) } tail = head[len(in):] return } golang...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0) -
docs/en/docs/release-notes.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Fri Sep 05 12:48:45 UTC 2025 - 544.1K bytes - Viewed (0)