- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for Dividers (0.04 sec)
-
docs/erasure/README.md
## How are drives used for Erasure Code? MinIO divides the drives you provide into erasure-coding sets of *2 to 16* drives. Therefore, the number of drives you present must be a multiple of one of these numbers. Each object is written to a single erasure-coding set.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 4.2K bytes - Viewed (0) -
src/test/java/jcifs/smb1/smb1/SmbComQueryInformationResponseTest.java
assertEquals(0x0010, response.getAttributes()); // getLastWriteTime returns lastWriteTime (from readUTime) + serverTimeZoneOffset // readUTime multiplies the seconds value by 1000, and writeUTime divides milliseconds by 1000 // So the round-trip should preserve the milliseconds value assertEquals(sampleTimeMillis + serverTimeZoneOffset, response.getLastWriteTime()); assertEquals(1024, response.getSize());
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 5.5K bytes - Viewed (0) -
docs/distributed/README.md
- **MinIO creates erasure-coding sets of _2_ to _16_ drives per set. The number of drives you provide in total must be a multiple of one of those numbers.** - **MinIO chooses the largest EC set size which divides into the total number of drives or total number of nodes given - making sure to keep the uniform distribution i.e each node participates equal number of drives per set**.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 8.9K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
* int. */ checkNonNegative("a", a); checkNonNegative("b", b); if (a == 0) { // 0 % b == 0, so b divides a, but the converse doesn't hold. // BigInteger.gcd is consistent with this decision. return b; } else if (b == 0) { return a; // similar logic } /*
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 29 16:20:07 UTC 2025 - 46.8K bytes - Viewed (0)