- Sort Score
- Result 10 results
- Languages All
Results 181 - 190 of 2,797 for volume (0.1 sec)
-
src/main/java/jcifs/smb/NtStatus.java
"Access is denied.", "The data area passed to a system call is too small.", "The filename, directory name, or volume label syntax is incorrect.", "The system cannot find the file specified.", "Cannot create a file when that file already exists.", "The handle is invalid.", "The specified path is invalid.",
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sat Jun 01 10:09:29 UTC 2019 - 11.9K bytes - Viewed (0) -
cmd/erasure-healing-common_test.go
// have different parities. They occur in equal number of drives, but only // one has read quorum. commonParity should pick the parity corresponding to // the FileInfo which has read quorum. fi1 := FileInfo{ Volume: "mybucket", Name: "myobject", VersionID: "", IsLatest: true, Deleted: false, ExpireRestored: false, DataDir: "4a01d9dd-0c5e-4103-88f8-b307c57d212e",
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Oct 01 15:19:10 UTC 2024 - 23.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 23.1K bytes - Viewed (0) -
src/main/webapp/css/font-awesome.min.css
ent:"\f27d"}.fa-vine:before{content:"\f1ca"}.fa-vk:before{content:"\f189"}.fa-vnv:before{content:"\f40b"}.fa-voicemail:before{content:"\f897"}.fa-volleyball-ball:before{content:"\f45f"}.fa-volume-down:before{content:"\f027"}.fa-volume-mute:before{content:"\f6a9"}.fa-volume-off:before{content:"\f026"}.fa-volume-up:before{content:"\f028"}.fa-vote-yea:before{content:"\f772"}.fa-vr-cardboard:before{content:"\f729"}.fa-vuejs:before{content:"\f41f"}.fa-walking:before{content:"\f554"}.fa-wallet:before{...
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Sat Dec 14 21:22:25 UTC 2019 - 55.8K bytes - Viewed (1) -
cmd/metacache-walk.go
legacyFS := !(s.fsType == xfs || s.fsType == ext4) s.RLock() legacy := s.formatLegacy s.RUnlock() // Verify if volume is valid and it exists. volumeDir, err := s.getVolDir(opts.Bucket) if err != nil { return err } if !skipAccessChecks(opts.Bucket) { // Stat a volume entry. if err = Access(volumeDir); err != nil { return convertAccessError(err, errVolumeAccessDenied) } }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Sat Jun 01 05:17:37 UTC 2024 - 12.4K bytes - Viewed (0) -
docs/erasure/README.md
two drive failure whereas in MinIO erasure code you can lose as many as half of drives and still the data remains safe. Further, MinIO's erasure code is at the object level and can heal one object at a time. For RAID, healing can be done only at the volume level which translates into high downtime. As MinIO encodes each object individually, it can heal objects incrementally. Storage servers once deployed should not require drive replacement or healing for the lifetime of the server. MinIO's erasure...
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Sep 29 04:28:45 UTC 2022 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 22.8K bytes - Viewed (0) -
manifests/addons/dashboards/istio-mesh-dashboard.gen.json
"id": "byName", "options": "Value #requests" }, "properties": [ { "id": "displayName", "value": "Requests" }, { "id": "decimals", "value": 2 }, {
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Fri Jul 26 23:54:32 UTC 2024 - 22.3K bytes - Viewed (0) -
cmd/data-scanner_test.go
uuids := make([]uuid.UUID, 5) for i := range uuids { uuids[i] = uuid.UUID([16]byte{15: uint8(i + 1)}) } fivs := make([]FileInfo, 5) for i := 0; i < 5; i++ { fivs[i] = FileInfo{ Volume: bucket, Name: obj, VersionID: uuids[i].String(), IsLatest: i == 0, ModTime: modTime.Add(-1 * time.Duration(i) * time.Minute), Size: 1 << 10, NumVersions: 5, }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri May 03 11:18:58 UTC 2024 - 6.9K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.23.md
- [Generic Ephemeral Volume feature graduates to GA](#generic-ephemeral-volume-feature-graduates-to-ga) - [Skip Volume Ownership change graduates to GA](#skip-volume-ownership-change-graduates-to-ga) - [Allow CSI drivers to opt-in to volume ownership and permission change graduates to GA](#allow-csi-drivers-to-opt-in-to-volume-ownership-and-permission-change-graduates-to-ga)
Registered: Fri Nov 01 09:05:11 UTC 2024 - Last Modified: Tue Feb 28 21:06:52 UTC 2023 - 424.5K bytes - Viewed (0)